./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b9ebacab53db4f4e6d9f51b7145688401913e247 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:07,853 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:07,856 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:07,875 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:07,875 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:07,878 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:07,880 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:07,892 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:07,894 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:07,895 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:07,896 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:07,897 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:07,897 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:07,898 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:07,899 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:07,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:07,903 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:07,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:07,906 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:07,912 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:07,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:07,917 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:07,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:07,923 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:07,927 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:07,928 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:07,928 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:07,930 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:07,930 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:07,933 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:07,933 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:07,934 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:07,935 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:07,936 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:07,938 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:07,938 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:07,940 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:07,940 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:07,940 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:07,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:07,946 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:07,947 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-28 15:40:07,973 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:07,973 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:07,978 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:07,978 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:07,978 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:07,979 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:07,979 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:07,979 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:07,979 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:07,979 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:07,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:07,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:07,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:07,982 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:07,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:07,982 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:07,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:07,983 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:07,983 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:07,983 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:07,983 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:07,984 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:07,984 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:07,984 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:07,984 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:07,985 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:07,985 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:07,985 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:07,985 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:07,985 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b9ebacab53db4f4e6d9f51b7145688401913e247 [2019-11-28 15:40:08,340 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:08,353 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:08,357 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:08,359 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:08,359 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:08,360 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-28 15:40:08,422 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f025e3dd1/623a7a9cb7fe4ce78524d5ebfe788ec3/FLAG0f3705553 [2019-11-28 15:40:08,965 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:08,966 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_12.cil.c [2019-11-28 15:40:08,979 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f025e3dd1/623a7a9cb7fe4ce78524d5ebfe788ec3/FLAG0f3705553 [2019-11-28 15:40:09,292 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f025e3dd1/623a7a9cb7fe4ce78524d5ebfe788ec3 [2019-11-28 15:40:09,296 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:09,298 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:09,300 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:09,300 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:09,304 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:09,305 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,308 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63a6e3ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09, skipping insertion in model container [2019-11-28 15:40:09,308 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:09,383 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:09,698 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:09,703 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:09,877 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:09,892 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:09,893 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09 WrapperNode [2019-11-28 15:40:09,893 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:09,894 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:09,894 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:09,894 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:09,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,915 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,961 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:09,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:09,962 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:09,962 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:09,970 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,971 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,983 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,994 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:09,998 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... [2019-11-28 15:40:10,004 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:10,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:10,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:10,005 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:10,006 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:10,076 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:10,076 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:10,214 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:10,916 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:40:10,917 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:40:10,918 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:10,919 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:10,920 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:10 BoogieIcfgContainer [2019-11-28 15:40:10,920 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:10,922 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:10,922 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:10,925 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:10,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:09" (1/3) ... [2019-11-28 15:40:10,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b79d822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:10, skipping insertion in model container [2019-11-28 15:40:10,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:09" (2/3) ... [2019-11-28 15:40:10,927 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b79d822 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:10, skipping insertion in model container [2019-11-28 15:40:10,927 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:10" (3/3) ... [2019-11-28 15:40:10,929 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_12.cil.c [2019-11-28 15:40:10,940 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:10,948 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:10,961 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:10,990 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:10,990 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:10,990 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:10,990 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:10,991 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:10,991 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:10,991 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:10,991 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:11,010 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states. [2019-11-28 15:40:11,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:11,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,019 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,020 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,027 INFO L82 PathProgramCache]: Analyzing trace with hash 837253908, now seen corresponding path program 1 times [2019-11-28 15:40:11,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483785691] [2019-11-28 15:40:11,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:11,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483785691] [2019-11-28 15:40:11,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:11,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:11,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374123091] [2019-11-28 15:40:11,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:11,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:11,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:11,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,282 INFO L87 Difference]: Start difference. First operand 166 states. Second operand 3 states. [2019-11-28 15:40:11,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:11,551 INFO L93 Difference]: Finished difference Result 352 states and 612 transitions. [2019-11-28 15:40:11,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:11,553 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-11-28 15:40:11,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:11,569 INFO L225 Difference]: With dead ends: 352 [2019-11-28 15:40:11,569 INFO L226 Difference]: Without dead ends: 173 [2019-11-28 15:40:11,574 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2019-11-28 15:40:11,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2019-11-28 15:40:11,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2019-11-28 15:40:11,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 276 transitions. [2019-11-28 15:40:11,639 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 276 transitions. Word has length 27 [2019-11-28 15:40:11,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:11,640 INFO L462 AbstractCegarLoop]: Abstraction has 171 states and 276 transitions. [2019-11-28 15:40:11,640 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:11,640 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 276 transitions. [2019-11-28 15:40:11,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:11,642 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,642 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,643 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,643 INFO L82 PathProgramCache]: Analyzing trace with hash 1153856875, now seen corresponding path program 1 times [2019-11-28 15:40:11,644 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,644 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038058331] [2019-11-28 15:40:11,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:11,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:11,731 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038058331] [2019-11-28 15:40:11,732 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:11,732 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:11,732 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46374370] [2019-11-28 15:40:11,735 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:11,736 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:11,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:11,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,737 INFO L87 Difference]: Start difference. First operand 171 states and 276 transitions. Second operand 3 states. [2019-11-28 15:40:11,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:11,929 INFO L93 Difference]: Finished difference Result 357 states and 574 transitions. [2019-11-28 15:40:11,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:11,930 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:11,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:11,933 INFO L225 Difference]: With dead ends: 357 [2019-11-28 15:40:11,933 INFO L226 Difference]: Without dead ends: 193 [2019-11-28 15:40:11,935 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:11,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2019-11-28 15:40:11,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2019-11-28 15:40:11,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-11-28 15:40:11,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 306 transitions. [2019-11-28 15:40:11,963 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 306 transitions. Word has length 28 [2019-11-28 15:40:11,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:11,964 INFO L462 AbstractCegarLoop]: Abstraction has 193 states and 306 transitions. [2019-11-28 15:40:11,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:11,964 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 306 transitions. [2019-11-28 15:40:11,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:11,967 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,967 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,968 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1283716064, now seen corresponding path program 1 times [2019-11-28 15:40:11,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145565939] [2019-11-28 15:40:11,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:12,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:12,073 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145565939] [2019-11-28 15:40:12,074 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,074 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,074 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425023964] [2019-11-28 15:40:12,075 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,075 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,079 INFO L87 Difference]: Start difference. First operand 193 states and 306 transitions. Second operand 3 states. [2019-11-28 15:40:12,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,256 INFO L93 Difference]: Finished difference Result 387 states and 615 transitions. [2019-11-28 15:40:12,257 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,257 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:12,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,259 INFO L225 Difference]: With dead ends: 387 [2019-11-28 15:40:12,259 INFO L226 Difference]: Without dead ends: 201 [2019-11-28 15:40:12,261 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2019-11-28 15:40:12,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 199. [2019-11-28 15:40:12,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2019-11-28 15:40:12,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 317 transitions. [2019-11-28 15:40:12,287 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 317 transitions. Word has length 28 [2019-11-28 15:40:12,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:12,287 INFO L462 AbstractCegarLoop]: Abstraction has 199 states and 317 transitions. [2019-11-28 15:40:12,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 317 transitions. [2019-11-28 15:40:12,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-28 15:40:12,294 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:12,294 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:12,295 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:12,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1700322528, now seen corresponding path program 1 times [2019-11-28 15:40:12,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:12,296 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063533758] [2019-11-28 15:40:12,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:12,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:12,366 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063533758] [2019-11-28 15:40:12,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754667724] [2019-11-28 15:40:12,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,368 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,370 INFO L87 Difference]: Start difference. First operand 199 states and 317 transitions. Second operand 3 states. [2019-11-28 15:40:12,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,541 INFO L93 Difference]: Finished difference Result 392 states and 625 transitions. [2019-11-28 15:40:12,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 28 [2019-11-28 15:40:12,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,544 INFO L225 Difference]: With dead ends: 392 [2019-11-28 15:40:12,544 INFO L226 Difference]: Without dead ends: 200 [2019-11-28 15:40:12,545 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2019-11-28 15:40:12,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2019-11-28 15:40:12,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 15:40:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 318 transitions. [2019-11-28 15:40:12,575 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 318 transitions. Word has length 28 [2019-11-28 15:40:12,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:12,576 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 318 transitions. [2019-11-28 15:40:12,576 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:12,576 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 318 transitions. [2019-11-28 15:40:12,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-11-28 15:40:12,579 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:12,580 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:12,580 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:12,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:12,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1839049416, now seen corresponding path program 1 times [2019-11-28 15:40:12,581 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:12,582 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226617012] [2019-11-28 15:40:12,582 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:12,653 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226617012] [2019-11-28 15:40:12,653 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,653 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,654 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155130495] [2019-11-28 15:40:12,654 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,655 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,655 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,655 INFO L87 Difference]: Start difference. First operand 200 states and 318 transitions. Second operand 3 states. [2019-11-28 15:40:12,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,808 INFO L93 Difference]: Finished difference Result 403 states and 637 transitions. [2019-11-28 15:40:12,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-11-28 15:40:12,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,811 INFO L225 Difference]: With dead ends: 403 [2019-11-28 15:40:12,811 INFO L226 Difference]: Without dead ends: 210 [2019-11-28 15:40:12,813 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-28 15:40:12,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-28 15:40:12,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 15:40:12,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 316 transitions. [2019-11-28 15:40:12,823 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 316 transitions. Word has length 29 [2019-11-28 15:40:12,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:12,823 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 316 transitions. [2019-11-28 15:40:12,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:12,824 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 316 transitions. [2019-11-28 15:40:12,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-11-28 15:40:12,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:12,825 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:12,826 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:12,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:12,826 INFO L82 PathProgramCache]: Analyzing trace with hash 208599556, now seen corresponding path program 1 times [2019-11-28 15:40:12,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:12,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129322334] [2019-11-28 15:40:12,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,856 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:12,856 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129322334] [2019-11-28 15:40:12,857 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:12,857 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:12,858 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443080985] [2019-11-28 15:40:12,858 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:12,858 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:12,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,859 INFO L87 Difference]: Start difference. First operand 200 states and 316 transitions. Second operand 3 states. [2019-11-28 15:40:12,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,991 INFO L93 Difference]: Finished difference Result 403 states and 633 transitions. [2019-11-28 15:40:12,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:12,991 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-11-28 15:40:12,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:12,993 INFO L225 Difference]: With dead ends: 403 [2019-11-28 15:40:12,993 INFO L226 Difference]: Without dead ends: 210 [2019-11-28 15:40:12,994 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:12,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-28 15:40:13,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-28 15:40:13,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 15:40:13,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 314 transitions. [2019-11-28 15:40:13,003 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 314 transitions. Word has length 30 [2019-11-28 15:40:13,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,004 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 314 transitions. [2019-11-28 15:40:13,004 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,004 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 314 transitions. [2019-11-28 15:40:13,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:40:13,005 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,006 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,006 INFO L82 PathProgramCache]: Analyzing trace with hash 317962813, now seen corresponding path program 1 times [2019-11-28 15:40:13,006 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,007 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743557231] [2019-11-28 15:40:13,007 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:13,046 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743557231] [2019-11-28 15:40:13,046 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,046 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621376959] [2019-11-28 15:40:13,050 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,050 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,051 INFO L87 Difference]: Start difference. First operand 200 states and 314 transitions. Second operand 3 states. [2019-11-28 15:40:13,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,187 INFO L93 Difference]: Finished difference Result 403 states and 629 transitions. [2019-11-28 15:40:13,188 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,188 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-11-28 15:40:13,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,189 INFO L225 Difference]: With dead ends: 403 [2019-11-28 15:40:13,190 INFO L226 Difference]: Without dead ends: 210 [2019-11-28 15:40:13,191 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2019-11-28 15:40:13,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 200. [2019-11-28 15:40:13,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2019-11-28 15:40:13,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 312 transitions. [2019-11-28 15:40:13,201 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 312 transitions. Word has length 31 [2019-11-28 15:40:13,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,201 INFO L462 AbstractCegarLoop]: Abstraction has 200 states and 312 transitions. [2019-11-28 15:40:13,202 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,202 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 312 transitions. [2019-11-28 15:40:13,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-11-28 15:40:13,203 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,203 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,203 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1377718110, now seen corresponding path program 1 times [2019-11-28 15:40:13,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638387981] [2019-11-28 15:40:13,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:13,259 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638387981] [2019-11-28 15:40:13,259 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,260 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:13,260 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845668067] [2019-11-28 15:40:13,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:13,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:13,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:13,262 INFO L87 Difference]: Start difference. First operand 200 states and 312 transitions. Second operand 4 states. [2019-11-28 15:40:13,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,519 INFO L93 Difference]: Finished difference Result 599 states and 929 transitions. [2019-11-28 15:40:13,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:13,519 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-11-28 15:40:13,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,522 INFO L225 Difference]: With dead ends: 599 [2019-11-28 15:40:13,522 INFO L226 Difference]: Without dead ends: 406 [2019-11-28 15:40:13,523 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:13,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 406 states. [2019-11-28 15:40:13,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 406 to 382. [2019-11-28 15:40:13,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 382 states. [2019-11-28 15:40:13,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 594 transitions. [2019-11-28 15:40:13,541 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 594 transitions. Word has length 31 [2019-11-28 15:40:13,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,541 INFO L462 AbstractCegarLoop]: Abstraction has 382 states and 594 transitions. [2019-11-28 15:40:13,541 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:13,542 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 594 transitions. [2019-11-28 15:40:13,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:40:13,543 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,543 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,543 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,544 INFO L82 PathProgramCache]: Analyzing trace with hash 2127610357, now seen corresponding path program 1 times [2019-11-28 15:40:13,544 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600047935] [2019-11-28 15:40:13,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:13,575 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600047935] [2019-11-28 15:40:13,575 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,576 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614023971] [2019-11-28 15:40:13,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,577 INFO L87 Difference]: Start difference. First operand 382 states and 594 transitions. Second operand 3 states. [2019-11-28 15:40:13,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,745 INFO L93 Difference]: Finished difference Result 841 states and 1323 transitions. [2019-11-28 15:40:13,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,746 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 15:40:13,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,750 INFO L225 Difference]: With dead ends: 841 [2019-11-28 15:40:13,750 INFO L226 Difference]: Without dead ends: 466 [2019-11-28 15:40:13,751 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2019-11-28 15:40:13,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 448. [2019-11-28 15:40:13,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2019-11-28 15:40:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 709 transitions. [2019-11-28 15:40:13,773 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 709 transitions. Word has length 43 [2019-11-28 15:40:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,774 INFO L462 AbstractCegarLoop]: Abstraction has 448 states and 709 transitions. [2019-11-28 15:40:13,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 709 transitions. [2019-11-28 15:40:13,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:40:13,775 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,775 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,776 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,776 INFO L82 PathProgramCache]: Analyzing trace with hash -918181316, now seen corresponding path program 1 times [2019-11-28 15:40:13,777 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,777 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526798022] [2019-11-28 15:40:13,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,818 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:13,819 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526798022] [2019-11-28 15:40:13,819 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,819 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,820 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1685157262] [2019-11-28 15:40:13,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,823 INFO L87 Difference]: Start difference. First operand 448 states and 709 transitions. Second operand 3 states. [2019-11-28 15:40:13,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,995 INFO L93 Difference]: Finished difference Result 930 states and 1481 transitions. [2019-11-28 15:40:13,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:40:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,000 INFO L225 Difference]: With dead ends: 930 [2019-11-28 15:40:14,001 INFO L226 Difference]: Without dead ends: 489 [2019-11-28 15:40:14,002 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2019-11-28 15:40:14,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 471. [2019-11-28 15:40:14,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2019-11-28 15:40:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 752 transitions. [2019-11-28 15:40:14,034 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 752 transitions. Word has length 44 [2019-11-28 15:40:14,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,034 INFO L462 AbstractCegarLoop]: Abstraction has 471 states and 752 transitions. [2019-11-28 15:40:14,034 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,034 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 752 transitions. [2019-11-28 15:40:14,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 15:40:14,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,037 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,037 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,037 INFO L82 PathProgramCache]: Analyzing trace with hash -1360549312, now seen corresponding path program 1 times [2019-11-28 15:40:14,037 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,038 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012860366] [2019-11-28 15:40:14,038 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,080 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 15:40:14,081 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012860366] [2019-11-28 15:40:14,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,082 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948836711] [2019-11-28 15:40:14,082 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,082 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,083 INFO L87 Difference]: Start difference. First operand 471 states and 752 transitions. Second operand 3 states. [2019-11-28 15:40:14,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,237 INFO L93 Difference]: Finished difference Result 987 states and 1577 transitions. [2019-11-28 15:40:14,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-28 15:40:14,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,241 INFO L225 Difference]: With dead ends: 987 [2019-11-28 15:40:14,241 INFO L226 Difference]: Without dead ends: 523 [2019-11-28 15:40:14,242 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-28 15:40:14,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-28 15:40:14,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-28 15:40:14,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 803 transitions. [2019-11-28 15:40:14,261 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 803 transitions. Word has length 55 [2019-11-28 15:40:14,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,261 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 803 transitions. [2019-11-28 15:40:14,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,261 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 803 transitions. [2019-11-28 15:40:14,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 15:40:14,262 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,263 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,263 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,263 INFO L82 PathProgramCache]: Analyzing trace with hash -938767092, now seen corresponding path program 1 times [2019-11-28 15:40:14,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302058037] [2019-11-28 15:40:14,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 15:40:14,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302058037] [2019-11-28 15:40:14,316 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,316 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410740105] [2019-11-28 15:40:14,316 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,317 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,318 INFO L87 Difference]: Start difference. First operand 505 states and 803 transitions. Second operand 3 states. [2019-11-28 15:40:14,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,464 INFO L93 Difference]: Finished difference Result 1021 states and 1625 transitions. [2019-11-28 15:40:14,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-28 15:40:14,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,467 INFO L225 Difference]: With dead ends: 1021 [2019-11-28 15:40:14,467 INFO L226 Difference]: Without dead ends: 523 [2019-11-28 15:40:14,469 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2019-11-28 15:40:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 505. [2019-11-28 15:40:14,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 505 states. [2019-11-28 15:40:14,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 505 states to 505 states and 800 transitions. [2019-11-28 15:40:14,487 INFO L78 Accepts]: Start accepts. Automaton has 505 states and 800 transitions. Word has length 56 [2019-11-28 15:40:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,487 INFO L462 AbstractCegarLoop]: Abstraction has 505 states and 800 transitions. [2019-11-28 15:40:14,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,488 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 800 transitions. [2019-11-28 15:40:14,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 15:40:14,489 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,489 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,489 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,490 INFO L82 PathProgramCache]: Analyzing trace with hash -1817934782, now seen corresponding path program 1 times [2019-11-28 15:40:14,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,490 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964600477] [2019-11-28 15:40:14,490 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,524 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-28 15:40:14,525 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964600477] [2019-11-28 15:40:14,525 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,525 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960119911] [2019-11-28 15:40:14,526 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,527 INFO L87 Difference]: Start difference. First operand 505 states and 800 transitions. Second operand 3 states. [2019-11-28 15:40:14,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,674 INFO L93 Difference]: Finished difference Result 1068 states and 1696 transitions. [2019-11-28 15:40:14,674 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,675 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-11-28 15:40:14,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,678 INFO L225 Difference]: With dead ends: 1068 [2019-11-28 15:40:14,679 INFO L226 Difference]: Without dead ends: 570 [2019-11-28 15:40:14,680 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2019-11-28 15:40:14,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 568. [2019-11-28 15:40:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 568 states. [2019-11-28 15:40:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 568 states to 568 states and 897 transitions. [2019-11-28 15:40:14,699 INFO L78 Accepts]: Start accepts. Automaton has 568 states and 897 transitions. Word has length 56 [2019-11-28 15:40:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,700 INFO L462 AbstractCegarLoop]: Abstraction has 568 states and 897 transitions. [2019-11-28 15:40:14,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 568 states and 897 transitions. [2019-11-28 15:40:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2019-11-28 15:40:14,701 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,701 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,702 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,702 INFO L82 PathProgramCache]: Analyzing trace with hash -1041214451, now seen corresponding path program 1 times [2019-11-28 15:40:14,702 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,703 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841196558] [2019-11-28 15:40:14,703 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,741 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:14,741 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841196558] [2019-11-28 15:40:14,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,742 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034850471] [2019-11-28 15:40:14,742 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,743 INFO L87 Difference]: Start difference. First operand 568 states and 897 transitions. Second operand 3 states. [2019-11-28 15:40:14,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,914 INFO L93 Difference]: Finished difference Result 1178 states and 1858 transitions. [2019-11-28 15:40:14,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,914 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 78 [2019-11-28 15:40:14,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,918 INFO L225 Difference]: With dead ends: 1178 [2019-11-28 15:40:14,919 INFO L226 Difference]: Without dead ends: 617 [2019-11-28 15:40:14,920 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-28 15:40:14,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-28 15:40:14,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-28 15:40:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 961 transitions. [2019-11-28 15:40:14,948 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 961 transitions. Word has length 78 [2019-11-28 15:40:14,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,948 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 961 transitions. [2019-11-28 15:40:14,948 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,949 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 961 transitions. [2019-11-28 15:40:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-11-28 15:40:14,951 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,951 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:14,951 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,952 INFO L82 PathProgramCache]: Analyzing trace with hash 45471174, now seen corresponding path program 1 times [2019-11-28 15:40:14,952 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,952 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869500823] [2019-11-28 15:40:14,953 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:14,999 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869500823] [2019-11-28 15:40:14,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864038087] [2019-11-28 15:40:15,000 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,000 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,001 INFO L87 Difference]: Start difference. First operand 611 states and 961 transitions. Second operand 3 states. [2019-11-28 15:40:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,199 INFO L93 Difference]: Finished difference Result 1221 states and 1919 transitions. [2019-11-28 15:40:15,200 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,200 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-11-28 15:40:15,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,204 INFO L225 Difference]: With dead ends: 1221 [2019-11-28 15:40:15,204 INFO L226 Difference]: Without dead ends: 617 [2019-11-28 15:40:15,205 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-11-28 15:40:15,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 611. [2019-11-28 15:40:15,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-28 15:40:15,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 958 transitions. [2019-11-28 15:40:15,250 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 958 transitions. Word has length 79 [2019-11-28 15:40:15,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,250 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 958 transitions. [2019-11-28 15:40:15,250 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,251 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 958 transitions. [2019-11-28 15:40:15,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:15,256 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,256 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,257 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,257 INFO L82 PathProgramCache]: Analyzing trace with hash -998330754, now seen corresponding path program 1 times [2019-11-28 15:40:15,257 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,258 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119424038] [2019-11-28 15:40:15,258 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,294 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:40:15,295 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119424038] [2019-11-28 15:40:15,297 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697358544] [2019-11-28 15:40:15,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,299 INFO L87 Difference]: Start difference. First operand 611 states and 958 transitions. Second operand 3 states. [2019-11-28 15:40:15,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,474 INFO L93 Difference]: Finished difference Result 1217 states and 1907 transitions. [2019-11-28 15:40:15,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:15,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,479 INFO L225 Difference]: With dead ends: 1217 [2019-11-28 15:40:15,479 INFO L226 Difference]: Without dead ends: 613 [2019-11-28 15:40:15,481 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 613 states. [2019-11-28 15:40:15,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 613 to 611. [2019-11-28 15:40:15,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 611 states. [2019-11-28 15:40:15,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 953 transitions. [2019-11-28 15:40:15,513 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 953 transitions. Word has length 84 [2019-11-28 15:40:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,514 INFO L462 AbstractCegarLoop]: Abstraction has 611 states and 953 transitions. [2019-11-28 15:40:15,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,515 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 953 transitions. [2019-11-28 15:40:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-28 15:40:15,517 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,518 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,518 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,519 INFO L82 PathProgramCache]: Analyzing trace with hash -92645170, now seen corresponding path program 1 times [2019-11-28 15:40:15,519 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,519 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169760572] [2019-11-28 15:40:15,520 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,598 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 15:40:15,598 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169760572] [2019-11-28 15:40:15,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,599 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,599 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291485941] [2019-11-28 15:40:15,600 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,600 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,600 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,601 INFO L87 Difference]: Start difference. First operand 611 states and 953 transitions. Second operand 3 states. [2019-11-28 15:40:15,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,747 INFO L93 Difference]: Finished difference Result 1275 states and 1990 transitions. [2019-11-28 15:40:15,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,747 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-28 15:40:15,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,751 INFO L225 Difference]: With dead ends: 1275 [2019-11-28 15:40:15,751 INFO L226 Difference]: Without dead ends: 671 [2019-11-28 15:40:15,753 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-28 15:40:15,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-28 15:40:15,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-28 15:40:15,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 996 transitions. [2019-11-28 15:40:15,781 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 996 transitions. Word has length 92 [2019-11-28 15:40:15,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,781 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 996 transitions. [2019-11-28 15:40:15,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,781 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 996 transitions. [2019-11-28 15:40:15,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-11-28 15:40:15,783 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,784 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,784 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,785 INFO L82 PathProgramCache]: Analyzing trace with hash -1567438302, now seen corresponding path program 1 times [2019-11-28 15:40:15,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489304744] [2019-11-28 15:40:15,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,820 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-11-28 15:40:15,821 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489304744] [2019-11-28 15:40:15,821 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,821 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,821 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856565653] [2019-11-28 15:40:15,822 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,822 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,828 INFO L87 Difference]: Start difference. First operand 643 states and 996 transitions. Second operand 3 states. [2019-11-28 15:40:16,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,008 INFO L93 Difference]: Finished difference Result 1307 states and 2027 transitions. [2019-11-28 15:40:16,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 93 [2019-11-28 15:40:16,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,013 INFO L225 Difference]: With dead ends: 1307 [2019-11-28 15:40:16,013 INFO L226 Difference]: Without dead ends: 671 [2019-11-28 15:40:16,015 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2019-11-28 15:40:16,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 643. [2019-11-28 15:40:16,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2019-11-28 15:40:16,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 990 transitions. [2019-11-28 15:40:16,045 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 990 transitions. Word has length 93 [2019-11-28 15:40:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,046 INFO L462 AbstractCegarLoop]: Abstraction has 643 states and 990 transitions. [2019-11-28 15:40:16,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 990 transitions. [2019-11-28 15:40:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-11-28 15:40:16,049 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,050 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,050 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1415900119, now seen corresponding path program 1 times [2019-11-28 15:40:16,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936448234] [2019-11-28 15:40:16,053 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,091 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:40:16,092 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936448234] [2019-11-28 15:40:16,093 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,093 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,093 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050314186] [2019-11-28 15:40:16,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,094 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,095 INFO L87 Difference]: Start difference. First operand 643 states and 990 transitions. Second operand 3 states. [2019-11-28 15:40:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,274 INFO L93 Difference]: Finished difference Result 1343 states and 2067 transitions. [2019-11-28 15:40:16,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,275 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-11-28 15:40:16,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,280 INFO L225 Difference]: With dead ends: 1343 [2019-11-28 15:40:16,280 INFO L226 Difference]: Without dead ends: 707 [2019-11-28 15:40:16,282 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 707 states. [2019-11-28 15:40:16,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 707 to 695. [2019-11-28 15:40:16,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 695 states. [2019-11-28 15:40:16,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 695 states and 1066 transitions. [2019-11-28 15:40:16,318 INFO L78 Accepts]: Start accepts. Automaton has 695 states and 1066 transitions. Word has length 99 [2019-11-28 15:40:16,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,319 INFO L462 AbstractCegarLoop]: Abstraction has 695 states and 1066 transitions. [2019-11-28 15:40:16,319 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,319 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1066 transitions. [2019-11-28 15:40:16,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-11-28 15:40:16,321 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,321 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,322 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,322 INFO L82 PathProgramCache]: Analyzing trace with hash 128670256, now seen corresponding path program 1 times [2019-11-28 15:40:16,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619955990] [2019-11-28 15:40:16,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,368 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-11-28 15:40:16,369 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619955990] [2019-11-28 15:40:16,369 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,370 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,370 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240199292] [2019-11-28 15:40:16,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,371 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,372 INFO L87 Difference]: Start difference. First operand 695 states and 1066 transitions. Second operand 3 states. [2019-11-28 15:40:16,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,544 INFO L93 Difference]: Finished difference Result 1400 states and 2149 transitions. [2019-11-28 15:40:16,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 100 [2019-11-28 15:40:16,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,549 INFO L225 Difference]: With dead ends: 1400 [2019-11-28 15:40:16,549 INFO L226 Difference]: Without dead ends: 708 [2019-11-28 15:40:16,551 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2019-11-28 15:40:16,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 696. [2019-11-28 15:40:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 696 states. [2019-11-28 15:40:16,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 696 states to 696 states and 1067 transitions. [2019-11-28 15:40:16,578 INFO L78 Accepts]: Start accepts. Automaton has 696 states and 1067 transitions. Word has length 100 [2019-11-28 15:40:16,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,579 INFO L462 AbstractCegarLoop]: Abstraction has 696 states and 1067 transitions. [2019-11-28 15:40:16,579 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,579 INFO L276 IsEmpty]: Start isEmpty. Operand 696 states and 1067 transitions. [2019-11-28 15:40:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-11-28 15:40:16,581 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,581 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,582 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,582 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1243086285, now seen corresponding path program 1 times [2019-11-28 15:40:16,583 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,583 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277629914] [2019-11-28 15:40:16,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,624 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 15:40:16,625 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277629914] [2019-11-28 15:40:16,625 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,626 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,626 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734881033] [2019-11-28 15:40:16,627 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,627 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,628 INFO L87 Difference]: Start difference. First operand 696 states and 1067 transitions. Second operand 3 states. [2019-11-28 15:40:16,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,785 INFO L93 Difference]: Finished difference Result 1432 states and 2191 transitions. [2019-11-28 15:40:16,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2019-11-28 15:40:16,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,790 INFO L225 Difference]: With dead ends: 1432 [2019-11-28 15:40:16,790 INFO L226 Difference]: Without dead ends: 743 [2019-11-28 15:40:16,793 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-28 15:40:16,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-28 15:40:16,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-28 15:40:16,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1122 transitions. [2019-11-28 15:40:16,820 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1122 transitions. Word has length 111 [2019-11-28 15:40:16,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,820 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1122 transitions. [2019-11-28 15:40:16,820 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,820 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1122 transitions. [2019-11-28 15:40:16,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-11-28 15:40:16,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,823 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,823 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,823 INFO L82 PathProgramCache]: Analyzing trace with hash -2098703404, now seen corresponding path program 1 times [2019-11-28 15:40:16,824 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,824 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639995792] [2019-11-28 15:40:16,824 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-11-28 15:40:16,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639995792] [2019-11-28 15:40:16,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,866 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093296210] [2019-11-28 15:40:16,867 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,867 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,868 INFO L87 Difference]: Start difference. First operand 737 states and 1122 transitions. Second operand 3 states. [2019-11-28 15:40:17,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,043 INFO L93 Difference]: Finished difference Result 1473 states and 2241 transitions. [2019-11-28 15:40:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,045 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 112 [2019-11-28 15:40:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,049 INFO L225 Difference]: With dead ends: 1473 [2019-11-28 15:40:17,049 INFO L226 Difference]: Without dead ends: 743 [2019-11-28 15:40:17,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2019-11-28 15:40:17,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 737. [2019-11-28 15:40:17,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 737 states. [2019-11-28 15:40:17,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 737 states to 737 states and 1117 transitions. [2019-11-28 15:40:17,084 INFO L78 Accepts]: Start accepts. Automaton has 737 states and 1117 transitions. Word has length 112 [2019-11-28 15:40:17,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,084 INFO L462 AbstractCegarLoop]: Abstraction has 737 states and 1117 transitions. [2019-11-28 15:40:17,084 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,084 INFO L276 IsEmpty]: Start isEmpty. Operand 737 states and 1117 transitions. [2019-11-28 15:40:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-11-28 15:40:17,087 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,087 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,087 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,088 INFO L82 PathProgramCache]: Analyzing trace with hash -742521014, now seen corresponding path program 1 times [2019-11-28 15:40:17,088 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,088 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002227439] [2019-11-28 15:40:17,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-28 15:40:17,159 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002227439] [2019-11-28 15:40:17,159 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,159 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,159 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641788534] [2019-11-28 15:40:17,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,160 INFO L87 Difference]: Start difference. First operand 737 states and 1117 transitions. Second operand 3 states. [2019-11-28 15:40:17,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,339 INFO L93 Difference]: Finished difference Result 1509 states and 2284 transitions. [2019-11-28 15:40:17,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,339 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 114 [2019-11-28 15:40:17,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,344 INFO L225 Difference]: With dead ends: 1509 [2019-11-28 15:40:17,344 INFO L226 Difference]: Without dead ends: 779 [2019-11-28 15:40:17,346 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-28 15:40:17,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-28 15:40:17,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-28 15:40:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1155 transitions. [2019-11-28 15:40:17,376 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1155 transitions. Word has length 114 [2019-11-28 15:40:17,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,376 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1155 transitions. [2019-11-28 15:40:17,376 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,376 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1155 transitions. [2019-11-28 15:40:17,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-11-28 15:40:17,378 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,378 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,379 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,379 INFO L82 PathProgramCache]: Analyzing trace with hash -1633130946, now seen corresponding path program 1 times [2019-11-28 15:40:17,379 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,379 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606362726] [2019-11-28 15:40:17,380 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,422 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2019-11-28 15:40:17,423 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606362726] [2019-11-28 15:40:17,423 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024005702] [2019-11-28 15:40:17,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,424 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,424 INFO L87 Difference]: Start difference. First operand 769 states and 1155 transitions. Second operand 3 states. [2019-11-28 15:40:17,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,574 INFO L93 Difference]: Finished difference Result 1541 states and 2313 transitions. [2019-11-28 15:40:17,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,575 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 115 [2019-11-28 15:40:17,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,578 INFO L225 Difference]: With dead ends: 1541 [2019-11-28 15:40:17,579 INFO L226 Difference]: Without dead ends: 779 [2019-11-28 15:40:17,580 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-28 15:40:17,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 769. [2019-11-28 15:40:17,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2019-11-28 15:40:17,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1146 transitions. [2019-11-28 15:40:17,606 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1146 transitions. Word has length 115 [2019-11-28 15:40:17,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,606 INFO L462 AbstractCegarLoop]: Abstraction has 769 states and 1146 transitions. [2019-11-28 15:40:17,606 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,606 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1146 transitions. [2019-11-28 15:40:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-11-28 15:40:17,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,609 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,609 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1432440334, now seen corresponding path program 1 times [2019-11-28 15:40:17,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908764499] [2019-11-28 15:40:17,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,647 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-28 15:40:17,648 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908764499] [2019-11-28 15:40:17,648 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,648 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,648 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188751387] [2019-11-28 15:40:17,649 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,649 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,650 INFO L87 Difference]: Start difference. First operand 769 states and 1146 transitions. Second operand 3 states. [2019-11-28 15:40:17,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,798 INFO L93 Difference]: Finished difference Result 1567 states and 2334 transitions. [2019-11-28 15:40:17,798 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-11-28 15:40:17,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,802 INFO L225 Difference]: With dead ends: 1567 [2019-11-28 15:40:17,803 INFO L226 Difference]: Without dead ends: 805 [2019-11-28 15:40:17,804 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-28 15:40:17,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-28 15:40:17,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-28 15:40:17,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1177 transitions. [2019-11-28 15:40:17,830 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1177 transitions. Word has length 136 [2019-11-28 15:40:17,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,831 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1177 transitions. [2019-11-28 15:40:17,831 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,831 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1177 transitions. [2019-11-28 15:40:17,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-11-28 15:40:17,834 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,834 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:17,834 INFO L410 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,835 INFO L82 PathProgramCache]: Analyzing trace with hash 700393094, now seen corresponding path program 1 times [2019-11-28 15:40:17,835 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,835 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253430232] [2019-11-28 15:40:17,835 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,874 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-11-28 15:40:17,875 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253430232] [2019-11-28 15:40:17,875 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,875 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:17,876 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233601890] [2019-11-28 15:40:17,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,877 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,878 INFO L87 Difference]: Start difference. First operand 797 states and 1177 transitions. Second operand 3 states. [2019-11-28 15:40:18,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,023 INFO L93 Difference]: Finished difference Result 1595 states and 2355 transitions. [2019-11-28 15:40:18,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,024 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-11-28 15:40:18,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,031 INFO L225 Difference]: With dead ends: 1595 [2019-11-28 15:40:18,032 INFO L226 Difference]: Without dead ends: 805 [2019-11-28 15:40:18,033 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-11-28 15:40:18,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 797. [2019-11-28 15:40:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2019-11-28 15:40:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 1167 transitions. [2019-11-28 15:40:18,068 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 1167 transitions. Word has length 137 [2019-11-28 15:40:18,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,068 INFO L462 AbstractCegarLoop]: Abstraction has 797 states and 1167 transitions. [2019-11-28 15:40:18,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,069 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 1167 transitions. [2019-11-28 15:40:18,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-11-28 15:40:18,071 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,071 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,074 INFO L410 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,075 INFO L82 PathProgramCache]: Analyzing trace with hash 26936470, now seen corresponding path program 1 times [2019-11-28 15:40:18,075 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,076 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803811930] [2019-11-28 15:40:18,076 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,112 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-28 15:40:18,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803811930] [2019-11-28 15:40:18,113 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,113 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,113 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740050516] [2019-11-28 15:40:18,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,115 INFO L87 Difference]: Start difference. First operand 797 states and 1167 transitions. Second operand 3 states. [2019-11-28 15:40:18,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,292 INFO L93 Difference]: Finished difference Result 1650 states and 2409 transitions. [2019-11-28 15:40:18,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-11-28 15:40:18,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,300 INFO L225 Difference]: With dead ends: 1650 [2019-11-28 15:40:18,300 INFO L226 Difference]: Without dead ends: 860 [2019-11-28 15:40:18,301 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2019-11-28 15:40:18,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 846. [2019-11-28 15:40:18,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 846 states. [2019-11-28 15:40:18,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 846 states to 846 states and 1228 transitions. [2019-11-28 15:40:18,330 INFO L78 Accepts]: Start accepts. Automaton has 846 states and 1228 transitions. Word has length 140 [2019-11-28 15:40:18,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,331 INFO L462 AbstractCegarLoop]: Abstraction has 846 states and 1228 transitions. [2019-11-28 15:40:18,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 846 states and 1228 transitions. [2019-11-28 15:40:18,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-11-28 15:40:18,333 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,334 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,334 INFO L410 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,335 INFO L82 PathProgramCache]: Analyzing trace with hash -1329151537, now seen corresponding path program 1 times [2019-11-28 15:40:18,335 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,335 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749097074] [2019-11-28 15:40:18,335 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,401 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2019-11-28 15:40:18,401 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749097074] [2019-11-28 15:40:18,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,402 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,402 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308063498] [2019-11-28 15:40:18,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,403 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,404 INFO L87 Difference]: Start difference. First operand 846 states and 1228 transitions. Second operand 3 states. [2019-11-28 15:40:18,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,577 INFO L93 Difference]: Finished difference Result 1699 states and 2467 transitions. [2019-11-28 15:40:18,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-11-28 15:40:18,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,582 INFO L225 Difference]: With dead ends: 1699 [2019-11-28 15:40:18,582 INFO L226 Difference]: Without dead ends: 844 [2019-11-28 15:40:18,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 844 states. [2019-11-28 15:40:18,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 844 to 830. [2019-11-28 15:40:18,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-28 15:40:18,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1205 transitions. [2019-11-28 15:40:18,612 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1205 transitions. Word has length 141 [2019-11-28 15:40:18,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,613 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1205 transitions. [2019-11-28 15:40:18,613 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,613 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1205 transitions. [2019-11-28 15:40:18,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-11-28 15:40:18,615 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,616 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,616 INFO L410 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1387042847, now seen corresponding path program 1 times [2019-11-28 15:40:18,617 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,617 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036937191] [2019-11-28 15:40:18,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:18,671 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 75 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-28 15:40:18,672 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036937191] [2019-11-28 15:40:18,672 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:18,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:18,673 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618219391] [2019-11-28 15:40:18,673 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:18,673 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:18,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:18,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,674 INFO L87 Difference]: Start difference. First operand 830 states and 1205 transitions. Second operand 3 states. [2019-11-28 15:40:18,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:18,873 INFO L93 Difference]: Finished difference Result 1665 states and 2417 transitions. [2019-11-28 15:40:18,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:18,874 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 145 [2019-11-28 15:40:18,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:18,880 INFO L225 Difference]: With dead ends: 1665 [2019-11-28 15:40:18,880 INFO L226 Difference]: Without dead ends: 842 [2019-11-28 15:40:18,885 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:18,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2019-11-28 15:40:18,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 830. [2019-11-28 15:40:18,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2019-11-28 15:40:18,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1198 transitions. [2019-11-28 15:40:18,926 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1198 transitions. Word has length 145 [2019-11-28 15:40:18,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:18,926 INFO L462 AbstractCegarLoop]: Abstraction has 830 states and 1198 transitions. [2019-11-28 15:40:18,927 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1198 transitions. [2019-11-28 15:40:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-11-28 15:40:18,931 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:18,931 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:18,932 INFO L410 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:18,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:18,932 INFO L82 PathProgramCache]: Analyzing trace with hash 146712776, now seen corresponding path program 1 times [2019-11-28 15:40:18,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:18,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622609389] [2019-11-28 15:40:18,934 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:18,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,023 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 78 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2019-11-28 15:40:19,024 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622609389] [2019-11-28 15:40:19,025 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,025 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:19,029 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850093794] [2019-11-28 15:40:19,029 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,030 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,031 INFO L87 Difference]: Start difference. First operand 830 states and 1198 transitions. Second operand 3 states. [2019-11-28 15:40:19,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,260 INFO L93 Difference]: Finished difference Result 1665 states and 2403 transitions. [2019-11-28 15:40:19,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,261 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 146 [2019-11-28 15:40:19,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,267 INFO L225 Difference]: With dead ends: 1665 [2019-11-28 15:40:19,267 INFO L226 Difference]: Without dead ends: 825 [2019-11-28 15:40:19,274 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2019-11-28 15:40:19,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 813. [2019-11-28 15:40:19,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 813 states. [2019-11-28 15:40:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 813 states to 813 states and 1169 transitions. [2019-11-28 15:40:19,326 INFO L78 Accepts]: Start accepts. Automaton has 813 states and 1169 transitions. Word has length 146 [2019-11-28 15:40:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,326 INFO L462 AbstractCegarLoop]: Abstraction has 813 states and 1169 transitions. [2019-11-28 15:40:19,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,326 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1169 transitions. [2019-11-28 15:40:19,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-28 15:40:19,329 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,330 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:19,330 INFO L410 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1643771369, now seen corresponding path program 1 times [2019-11-28 15:40:19,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,332 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354021381] [2019-11-28 15:40:19,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,404 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-28 15:40:19,405 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354021381] [2019-11-28 15:40:19,405 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,405 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:19,406 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12002462] [2019-11-28 15:40:19,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,408 INFO L87 Difference]: Start difference. First operand 813 states and 1169 transitions. Second operand 3 states. [2019-11-28 15:40:19,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,493 INFO L93 Difference]: Finished difference Result 2411 states and 3459 transitions. [2019-11-28 15:40:19,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,494 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-28 15:40:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,505 INFO L225 Difference]: With dead ends: 2411 [2019-11-28 15:40:19,505 INFO L226 Difference]: Without dead ends: 1605 [2019-11-28 15:40:19,508 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1605 states. [2019-11-28 15:40:19,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1605 to 815. [2019-11-28 15:40:19,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 815 states. [2019-11-28 15:40:19,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 815 states to 815 states and 1171 transitions. [2019-11-28 15:40:19,568 INFO L78 Accepts]: Start accepts. Automaton has 815 states and 1171 transitions. Word has length 153 [2019-11-28 15:40:19,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,568 INFO L462 AbstractCegarLoop]: Abstraction has 815 states and 1171 transitions. [2019-11-28 15:40:19,568 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,569 INFO L276 IsEmpty]: Start isEmpty. Operand 815 states and 1171 transitions. [2019-11-28 15:40:19,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-11-28 15:40:19,571 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,571 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:19,572 INFO L410 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1697255769, now seen corresponding path program 1 times [2019-11-28 15:40:19,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,573 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996156226] [2019-11-28 15:40:19,573 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,656 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-11-28 15:40:19,657 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996156226] [2019-11-28 15:40:19,657 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,657 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:19,658 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574056561] [2019-11-28 15:40:19,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,660 INFO L87 Difference]: Start difference. First operand 815 states and 1171 transitions. Second operand 3 states. [2019-11-28 15:40:19,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:19,736 INFO L93 Difference]: Finished difference Result 2410 states and 3455 transitions. [2019-11-28 15:40:19,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:19,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-11-28 15:40:19,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:19,745 INFO L225 Difference]: With dead ends: 2410 [2019-11-28 15:40:19,745 INFO L226 Difference]: Without dead ends: 1602 [2019-11-28 15:40:19,748 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1602 states. [2019-11-28 15:40:19,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1602 to 1600. [2019-11-28 15:40:19,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-28 15:40:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2291 transitions. [2019-11-28 15:40:19,825 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2291 transitions. Word has length 153 [2019-11-28 15:40:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:19,826 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2291 transitions. [2019-11-28 15:40:19,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:19,826 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2291 transitions. [2019-11-28 15:40:19,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-11-28 15:40:19,828 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:19,829 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:19,829 INFO L410 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:19,829 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:19,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1707419253, now seen corresponding path program 1 times [2019-11-28 15:40:19,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:19,830 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629489908] [2019-11-28 15:40:19,830 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:19,969 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 142 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2019-11-28 15:40:19,969 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629489908] [2019-11-28 15:40:19,970 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:19,970 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:19,970 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628527044] [2019-11-28 15:40:19,971 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:19,971 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:19,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:19,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:19,971 INFO L87 Difference]: Start difference. First operand 1600 states and 2291 transitions. Second operand 3 states. [2019-11-28 15:40:20,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:20,178 INFO L93 Difference]: Finished difference Result 4746 states and 6779 transitions. [2019-11-28 15:40:20,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:20,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 155 [2019-11-28 15:40:20,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:20,197 INFO L225 Difference]: With dead ends: 4746 [2019-11-28 15:40:20,197 INFO L226 Difference]: Without dead ends: 3153 [2019-11-28 15:40:20,202 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:20,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3153 states. [2019-11-28 15:40:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3153 to 1600. [2019-11-28 15:40:20,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1600 states. [2019-11-28 15:40:20,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2287 transitions. [2019-11-28 15:40:20,342 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2287 transitions. Word has length 155 [2019-11-28 15:40:20,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:20,343 INFO L462 AbstractCegarLoop]: Abstraction has 1600 states and 2287 transitions. [2019-11-28 15:40:20,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2287 transitions. [2019-11-28 15:40:20,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 15:40:20,347 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:20,348 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:20,348 INFO L410 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:20,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:20,349 INFO L82 PathProgramCache]: Analyzing trace with hash 306587411, now seen corresponding path program 1 times [2019-11-28 15:40:20,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:20,349 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607278528] [2019-11-28 15:40:20,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:20,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:20,424 INFO L134 CoverageAnalysis]: Checked inductivity of 255 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2019-11-28 15:40:20,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607278528] [2019-11-28 15:40:20,425 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:20,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:20,425 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745046959] [2019-11-28 15:40:20,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:20,426 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:20,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:20,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:20,427 INFO L87 Difference]: Start difference. First operand 1600 states and 2287 transitions. Second operand 3 states. [2019-11-28 15:40:20,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:20,736 INFO L93 Difference]: Finished difference Result 4786 states and 6839 transitions. [2019-11-28 15:40:20,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:20,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 156 [2019-11-28 15:40:20,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:20,767 INFO L225 Difference]: With dead ends: 4786 [2019-11-28 15:40:20,770 INFO L226 Difference]: Without dead ends: 3193 [2019-11-28 15:40:20,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:20,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3193 states. [2019-11-28 15:40:21,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3193 to 3191. [2019-11-28 15:40:21,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3191 states. [2019-11-28 15:40:21,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3191 states to 3191 states and 4487 transitions. [2019-11-28 15:40:21,008 INFO L78 Accepts]: Start accepts. Automaton has 3191 states and 4487 transitions. Word has length 156 [2019-11-28 15:40:21,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:21,009 INFO L462 AbstractCegarLoop]: Abstraction has 3191 states and 4487 transitions. [2019-11-28 15:40:21,009 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:21,009 INFO L276 IsEmpty]: Start isEmpty. Operand 3191 states and 4487 transitions. [2019-11-28 15:40:21,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-11-28 15:40:21,013 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:21,013 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:21,013 INFO L410 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:21,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:21,014 INFO L82 PathProgramCache]: Analyzing trace with hash 1260527569, now seen corresponding path program 1 times [2019-11-28 15:40:21,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:21,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523880444] [2019-11-28 15:40:21,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:21,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:21,198 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:40:21,198 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:40:21,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:21 BoogieIcfgContainer [2019-11-28 15:40:21,348 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:21,348 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:21,349 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:21,349 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:21,350 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:10" (3/4) ... [2019-11-28 15:40:21,352 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:40:21,529 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:21,530 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:21,533 INFO L168 Benchmark]: Toolchain (without parser) took 12233.56 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 400.0 MB). Free memory was 952.3 MB in the beginning and 1.3 GB in the end (delta: -336.7 MB). Peak memory consumption was 63.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:21,533 INFO L168 Benchmark]: CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:21,534 INFO L168 Benchmark]: CACSL2BoogieTranslator took 593.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:21,534 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:21,535 INFO L168 Benchmark]: Boogie Preprocessor took 42.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:21,535 INFO L168 Benchmark]: RCFGBuilder took 915.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:21,536 INFO L168 Benchmark]: TraceAbstraction took 10426.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -262.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:21,536 INFO L168 Benchmark]: Witness Printer took 181.33 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:21,538 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 593.69 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.6 MB). Free memory was 952.3 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 26.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 67.69 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.68 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 915.74 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 58.1 MB). Peak memory consumption was 58.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10426.56 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 279.4 MB). Free memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: -262.6 MB). Peak memory consumption was 16.9 MB. Max. memory is 11.5 GB. * Witness Printer took 181.33 ms. Allocated memory is still 1.4 GB. Free memory was 1.3 GB in the beginning and 1.3 GB in the end (delta: 11.9 MB). Peak memory consumption was 11.9 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 697]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L702] int s ; [L703] int tmp ; [L707] s = 8464 [L12] int s__info_callback = __VERIFIER_nondet_int() ; [L13] int s__in_handshake = __VERIFIER_nondet_int() ; [L14] int s__state ; [L15] int s__new_session ; [L16] int s__server ; [L17] int s__version = __VERIFIER_nondet_int() ; [L18] int s__type ; [L19] int s__init_num ; [L20] int s__hit = __VERIFIER_nondet_int() ; [L21] int s__rwstate ; [L22] int s__init_buf___0 = 1; [L23] int s__debug = __VERIFIER_nondet_int() ; [L24] int s__shutdown ; [L25] int s__cert = __VERIFIER_nondet_int() ; [L26] int s__options = __VERIFIER_nondet_int() ; [L27] int s__verify_mode = __VERIFIER_nondet_int() ; [L28] int s__session__peer = __VERIFIER_nondet_int() ; [L29] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L30] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L33] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L34] int s__s3__tmp__cert_request ; [L35] int s__s3__tmp__reuse_message ; [L36] int s__s3__tmp__use_rsa_tmp ; [L37] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__new_cipher__algorithms ; [L39] int s__s3__tmp__next_state___0 ; [L40] int s__s3__tmp__new_cipher__algo_strength ; [L41] int s__session__cipher ; [L42] int buf ; [L43] unsigned long l ; [L44] unsigned long Time ; [L45] unsigned long tmp ; [L46] int cb ; [L47] long num1 = __VERIFIER_nondet_long() ; [L48] int ret ; [L49] int new_state ; [L50] int state ; [L51] int skip ; [L52] int got_new_session ; [L53] int tmp___1 = __VERIFIER_nondet_int() ; [L54] int tmp___2 = __VERIFIER_nondet_int() ; [L55] int tmp___3 = __VERIFIER_nondet_int() ; [L56] int tmp___4 = __VERIFIER_nondet_int() ; [L57] int tmp___5 = __VERIFIER_nondet_int() ; [L58] int tmp___6 = __VERIFIER_nondet_int() ; [L59] int tmp___7 ; [L60] long tmp___8 = __VERIFIER_nondet_long() ; [L61] int tmp___9 = __VERIFIER_nondet_int() ; [L62] int tmp___10 = __VERIFIER_nondet_int() ; [L63] int blastFlag ; [L64] int __cil_tmp55 ; [L65] unsigned long __cil_tmp56 ; [L66] unsigned long __cil_tmp57 ; [L67] unsigned long __cil_tmp58 ; [L68] unsigned long __cil_tmp59 ; [L69] int __cil_tmp60 ; [L70] unsigned long __cil_tmp61 = __VERIFIER_nondet_ulong() ; [L74] s__state = initial_state [L75] blastFlag = 0 [L76] tmp = __VERIFIER_nondet_int() [L77] Time = tmp [L78] cb = 0 [L79] ret = -1 [L80] skip = 0 [L81] got_new_session = 0 [L82] COND TRUE s__info_callback != 0 [L83] cb = s__info_callback [L89] s__in_handshake ++ [L90] COND FALSE !(tmp___1 + 12288) [L95] COND FALSE !(s__cert == 0) [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND TRUE s__state == 8464 [L272] s__shutdown = 0 [L273] ret = __VERIFIER_nondet_int() [L274] COND TRUE blastFlag == 0 [L275] blastFlag = 1 [L277] COND FALSE !(ret <= 0) [L280] got_new_session = 1 [L281] s__state = 8496 [L282] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND TRUE s__state == 8496 [L286] ret = __VERIFIER_nondet_int() [L287] COND TRUE blastFlag == 1 [L288] blastFlag = 2 [L290] COND FALSE !(ret <= 0) [L293] COND FALSE !(\read(s__hit)) [L296] s__state = 8512 [L298] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND TRUE s__state == 8512 [L303] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L304] __cil_tmp56 = (unsigned long )s__s3__tmp__new_cipher__algorithms [L305] COND TRUE __cil_tmp56 + 256UL [L306] __cil_tmp56 = 256345 [L307] skip = 1 [L318] s__state = 8528 [L319] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND TRUE s__state == 8528 [L323] s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() [L324] l = (unsigned long )s__s3__tmp__new_cipher__algorithms [L326] __cil_tmp57 = (unsigned long )s__options [L327] COND TRUE __cil_tmp57 + 2097152UL [L328] s__s3__tmp__use_rsa_tmp = 1 [L333] COND TRUE \read(s__s3__tmp__use_rsa_tmp) [L361] ret = __VERIFIER_nondet_int() [L362] COND FALSE !(blastFlag == 3) [L365] COND FALSE !(ret <= 0) [L382] s__state = 8544 [L383] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND TRUE s__state == 8544 [L387] COND TRUE s__verify_mode + 1 [L388] COND TRUE s__session__peer != 0 [L389] COND TRUE s__verify_mode + 4 [L390] s__verify_mode = 123 [L391] skip = 1 [L392] s__s3__tmp__cert_request = 0 [L393] s__state = 8560 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND FALSE !(! s__s3__tmp__reuse_message) [L686] skip = 0 [L99] COND TRUE 1 [L101] state = s__state [L102] COND FALSE !(s__state == 12292) [L105] COND FALSE !(s__state == 16384) [L108] COND FALSE !(s__state == 8192) [L111] COND FALSE !(s__state == 24576) [L114] COND FALSE !(s__state == 8195) [L117] COND FALSE !(s__state == 8480) [L120] COND FALSE !(s__state == 8481) [L123] COND FALSE !(s__state == 8482) [L126] COND FALSE !(s__state == 8464) [L129] COND FALSE !(s__state == 8465) [L132] COND FALSE !(s__state == 8466) [L135] COND FALSE !(s__state == 8496) [L138] COND FALSE !(s__state == 8497) [L141] COND FALSE !(s__state == 8512) [L144] COND FALSE !(s__state == 8513) [L147] COND FALSE !(s__state == 8528) [L150] COND FALSE !(s__state == 8529) [L153] COND FALSE !(s__state == 8544) [L156] COND FALSE !(s__state == 8545) [L159] COND TRUE s__state == 8560 [L437] ret = __VERIFIER_nondet_int() [L438] COND FALSE !(ret <= 0) [L441] s__s3__tmp__next_state___0 = 8576 [L442] s__state = 8448 [L443] s__init_num = 0 [L651] s__s3__tmp__reuse_message = __VERIFIER_nondet_int() [L652] COND TRUE ! s__s3__tmp__reuse_message [L653] COND TRUE ! skip [L654] COND TRUE state == 8560 [L655] COND TRUE s__state == 8448 [L656] COND TRUE s__verify_mode != -1 [L657] COND TRUE s__verify_mode != -2 [L658] COND TRUE __cil_tmp61 != 9021 [L659] COND TRUE __cil_tmp58 != 4294967294 [L660] COND TRUE blastFlag != 4 [L661] COND TRUE tmp___7 != 1024 [L697] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 166 locations, 1 error locations. Result: UNSAFE, OverallTime: 10.2s, OverallIterations: 35, TraceHistogramMax: 6, AutomataDifference: 6.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7083 SDtfs, 6887 SDslu, 1778 SDs, 0 SdLazy, 2873 SolverSat, 1350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 74 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=3191occurred in iteration=34, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.3s AutomataMinimizationTime, 34 MinimizatonAttempts, 2673 StatesRemovedByMinimization, 32 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 3181 NumberOfCodeBlocks, 3181 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 2991 ConstructedInterpolants, 0 QuantifiedInterpolants, 567746 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 34 InterpolantComputations, 34 PerfectInterpolantSequences, 2752/2752 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...