./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_srvr_14.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_14.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 f0194e72737fa00e9def2494335d4249cbea0bcd ..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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:10,401 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:10,404 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:10,422 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:10,423 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:10,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:10,427 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:10,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:10,435 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:10,436 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:10,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:10,438 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:10,438 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:10,442 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:10,443 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:10,445 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:10,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:10,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:10,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:10,458 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:10,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:10,464 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:10,467 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:10,468 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:10,472 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:10,474 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:10,474 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:10,475 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:10,476 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:10,477 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:10,478 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:10,479 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:10,480 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:10,481 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:10,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:10,483 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:10,484 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:10,484 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:10,484 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:10,487 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:10,488 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:10,489 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:10,512 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:10,513 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:10,515 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:10,515 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:10,515 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:10,516 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:10,516 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:10,517 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:10,517 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:10,517 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:10,518 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:10,519 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:10,519 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:10,520 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:10,520 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:10,520 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:10,520 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:10,521 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:10,521 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:10,521 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:10,522 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:10,522 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:10,522 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:10,523 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:10,523 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:10,523 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:10,523 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:10,524 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:10,524 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:10,524 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 -> f0194e72737fa00e9def2494335d4249cbea0bcd [2019-11-28 15:40:10,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:10,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:10,846 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:10,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:10,848 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:10,849 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-28 15:40:10,915 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788cf7677/1aa6aa464d7746abbf170c8ca65339e0/FLAGf78102a9d [2019-11-28 15:40:11,397 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:11,398 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_srvr_14.cil.c [2019-11-28 15:40:11,409 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788cf7677/1aa6aa464d7746abbf170c8ca65339e0/FLAGf78102a9d [2019-11-28 15:40:11,744 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/788cf7677/1aa6aa464d7746abbf170c8ca65339e0 [2019-11-28 15:40:11,747 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:11,749 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:11,750 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:11,750 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:11,753 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:11,754 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:11" (1/1) ... [2019-11-28 15:40:11,756 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10712095 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:11, skipping insertion in model container [2019-11-28 15:40:11,757 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:11" (1/1) ... [2019-11-28 15:40:11,763 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:11,805 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:12,074 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:12,145 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:12,248 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:12,262 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:12,262 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12 WrapperNode [2019-11-28 15:40:12,263 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:12,264 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:12,264 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:12,264 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:12,273 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:12" (1/1) ... [2019-11-28 15:40:12,285 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:12" (1/1) ... [2019-11-28 15:40:12,324 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:12,325 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:12,325 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:12,325 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:12,335 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:12" (1/1) ... [2019-11-28 15:40:12,335 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:12" (1/1) ... [2019-11-28 15:40:12,339 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:12" (1/1) ... [2019-11-28 15:40:12,339 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:12" (1/1) ... [2019-11-28 15:40:12,347 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:12" (1/1) ... [2019-11-28 15:40:12,357 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:12" (1/1) ... [2019-11-28 15:40:12,360 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:12" (1/1) ... [2019-11-28 15:40:12,365 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:12,366 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:12,366 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:12,366 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:12,367 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (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:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:12,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:12,580 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:13,218 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume false; [2019-11-28 15:40:13,219 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !false; [2019-11-28 15:40:13,220 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:13,221 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:13,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:13 BoogieIcfgContainer [2019-11-28 15:40:13,222 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:13,224 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:13,224 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:13,227 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:13,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:11" (1/3) ... [2019-11-28 15:40:13,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8ca66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:13, skipping insertion in model container [2019-11-28 15:40:13,229 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:12" (2/3) ... [2019-11-28 15:40:13,229 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f8ca66c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:13, skipping insertion in model container [2019-11-28 15:40:13,230 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:13" (3/3) ... [2019-11-28 15:40:13,231 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_srvr_14.cil.c [2019-11-28 15:40:13,241 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:13,249 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:13,261 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:13,287 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:13,287 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:13,288 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:13,288 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:13,288 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:13,288 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:13,289 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:13,289 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:13,308 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states. [2019-11-28 15:40:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-28 15:40:13,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,315 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] [2019-11-28 15:40:13,315 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1734880928, now seen corresponding path program 1 times [2019-11-28 15:40:13,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,329 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951473464] [2019-11-28 15:40:13,329 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,532 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,533 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951473464] [2019-11-28 15:40:13,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,535 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819347218] [2019-11-28 15:40:13,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,543 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,556 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,558 INFO L87 Difference]: Start difference. First operand 150 states. Second operand 3 states. [2019-11-28 15:40:13,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,816 INFO L93 Difference]: Finished difference Result 323 states and 555 transitions. [2019-11-28 15:40:13,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 22 [2019-11-28 15:40:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,832 INFO L225 Difference]: With dead ends: 323 [2019-11-28 15:40:13,833 INFO L226 Difference]: Without dead ends: 160 [2019-11-28 15:40:13,837 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,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2019-11-28 15:40:13,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 156. [2019-11-28 15:40:13,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2019-11-28 15:40:13,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 248 transitions. [2019-11-28 15:40:13,890 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 248 transitions. Word has length 22 [2019-11-28 15:40:13,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,890 INFO L462 AbstractCegarLoop]: Abstraction has 156 states and 248 transitions. [2019-11-28 15:40:13,891 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 248 transitions. [2019-11-28 15:40:13,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:13,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,892 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] [2019-11-28 15:40:13,893 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,893 INFO L82 PathProgramCache]: Analyzing trace with hash -923936279, now seen corresponding path program 1 times [2019-11-28 15:40:13,894 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,894 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751963792] [2019-11-28 15:40:13,894 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,956 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,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751963792] [2019-11-28 15:40:13,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,958 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:13,958 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580041071] [2019-11-28 15:40:13,960 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,960 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,961 INFO L87 Difference]: Start difference. First operand 156 states and 248 transitions. Second operand 3 states. [2019-11-28 15:40:14,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,153 INFO L93 Difference]: Finished difference Result 330 states and 522 transitions. [2019-11-28 15:40:14,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:14,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,156 INFO L225 Difference]: With dead ends: 330 [2019-11-28 15:40:14,156 INFO L226 Difference]: Without dead ends: 181 [2019-11-28 15:40:14,164 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,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2019-11-28 15:40:14,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2019-11-28 15:40:14,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-28 15:40:14,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 281 transitions. [2019-11-28 15:40:14,198 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 281 transitions. Word has length 23 [2019-11-28 15:40:14,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,198 INFO L462 AbstractCegarLoop]: Abstraction has 179 states and 281 transitions. [2019-11-28 15:40:14,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,199 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 281 transitions. [2019-11-28 15:40:14,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:14,201 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,202 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] [2019-11-28 15:40:14,202 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,204 INFO L82 PathProgramCache]: Analyzing trace with hash -936892908, now seen corresponding path program 1 times [2019-11-28 15:40:14,204 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,205 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133633773] [2019-11-28 15:40:14,205 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,283 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:14,283 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133633773] [2019-11-28 15:40:14,283 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,284 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101775080] [2019-11-28 15:40:14,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,285 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,285 INFO L87 Difference]: Start difference. First operand 179 states and 281 transitions. Second operand 3 states. [2019-11-28 15:40:14,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,439 INFO L93 Difference]: Finished difference Result 361 states and 566 transitions. [2019-11-28 15:40:14,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,440 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:14,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,442 INFO L225 Difference]: With dead ends: 361 [2019-11-28 15:40:14,442 INFO L226 Difference]: Without dead ends: 189 [2019-11-28 15:40:14,443 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,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2019-11-28 15:40:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 185. [2019-11-28 15:40:14,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2019-11-28 15:40:14,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 292 transitions. [2019-11-28 15:40:14,459 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 292 transitions. Word has length 23 [2019-11-28 15:40:14,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,459 INFO L462 AbstractCegarLoop]: Abstraction has 185 states and 292 transitions. [2019-11-28 15:40:14,459 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,460 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 292 transitions. [2019-11-28 15:40:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:14,461 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,461 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] [2019-11-28 15:40:14,461 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,462 INFO L82 PathProgramCache]: Analyzing trace with hash -1640243884, now seen corresponding path program 1 times [2019-11-28 15:40:14,462 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,462 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987014940] [2019-11-28 15:40:14,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,521 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:14,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987014940] [2019-11-28 15:40:14,523 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676812562] [2019-11-28 15:40:14,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,526 INFO L87 Difference]: Start difference. First operand 185 states and 292 transitions. Second operand 3 states. [2019-11-28 15:40:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,684 INFO L93 Difference]: Finished difference Result 366 states and 576 transitions. [2019-11-28 15:40:14,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,685 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:14,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,686 INFO L225 Difference]: With dead ends: 366 [2019-11-28 15:40:14,686 INFO L226 Difference]: Without dead ends: 188 [2019-11-28 15:40:14,687 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,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-28 15:40:14,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-11-28 15:40:14,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:14,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 293 transitions. [2019-11-28 15:40:14,710 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 293 transitions. Word has length 23 [2019-11-28 15:40:14,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,711 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 293 transitions. [2019-11-28 15:40:14,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,711 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 293 transitions. [2019-11-28 15:40:14,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-28 15:40:14,713 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,713 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] [2019-11-28 15:40:14,713 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,714 INFO L82 PathProgramCache]: Analyzing trace with hash 940477948, now seen corresponding path program 1 times [2019-11-28 15:40:14,715 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,716 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709594435] [2019-11-28 15:40:14,717 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,784 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:14,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709594435] [2019-11-28 15:40:14,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,785 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882555770] [2019-11-28 15:40:14,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,788 INFO L87 Difference]: Start difference. First operand 186 states and 293 transitions. Second operand 3 states. [2019-11-28 15:40:14,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:14,928 INFO L93 Difference]: Finished difference Result 377 states and 588 transitions. [2019-11-28 15:40:14,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:14,929 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2019-11-28 15:40:14,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:14,930 INFO L225 Difference]: With dead ends: 377 [2019-11-28 15:40:14,931 INFO L226 Difference]: Without dead ends: 198 [2019-11-28 15:40:14,931 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,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-28 15:40:14,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-28 15:40:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:14,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 291 transitions. [2019-11-28 15:40:14,942 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 291 transitions. Word has length 24 [2019-11-28 15:40:14,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:14,942 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 291 transitions. [2019-11-28 15:40:14,942 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:14,943 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 291 transitions. [2019-11-28 15:40:14,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-11-28 15:40:14,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:14,944 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] [2019-11-28 15:40:14,944 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:14,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:14,945 INFO L82 PathProgramCache]: Analyzing trace with hash 1862867376, now seen corresponding path program 1 times [2019-11-28 15:40:14,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:14,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525747408] [2019-11-28 15:40:14,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:14,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,993 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:14,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525747408] [2019-11-28 15:40:14,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:14,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:14,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137593892] [2019-11-28 15:40:14,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:14,997 INFO L87 Difference]: Start difference. First operand 186 states and 291 transitions. Second operand 3 states. [2019-11-28 15:40:15,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,136 INFO L93 Difference]: Finished difference Result 377 states and 584 transitions. [2019-11-28 15:40:15,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,137 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2019-11-28 15:40:15,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,139 INFO L225 Difference]: With dead ends: 377 [2019-11-28 15:40:15,139 INFO L226 Difference]: Without dead ends: 198 [2019-11-28 15:40:15,140 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,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-28 15:40:15,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-28 15:40:15,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:15,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 289 transitions. [2019-11-28 15:40:15,149 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 289 transitions. Word has length 25 [2019-11-28 15:40:15,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,150 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 289 transitions. [2019-11-28 15:40:15,150 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,150 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 289 transitions. [2019-11-28 15:40:15,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:15,151 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,151 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] [2019-11-28 15:40:15,152 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,152 INFO L82 PathProgramCache]: Analyzing trace with hash 2134464983, now seen corresponding path program 1 times [2019-11-28 15:40:15,152 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,153 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125920820] [2019-11-28 15:40:15,153 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,187 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:15,187 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125920820] [2019-11-28 15:40:15,187 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,188 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,188 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135893753] [2019-11-28 15:40:15,189 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,189 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,189 INFO L87 Difference]: Start difference. First operand 186 states and 289 transitions. Second operand 3 states. [2019-11-28 15:40:15,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,319 INFO L93 Difference]: Finished difference Result 377 states and 580 transitions. [2019-11-28 15:40:15,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,320 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:15,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,321 INFO L225 Difference]: With dead ends: 377 [2019-11-28 15:40:15,322 INFO L226 Difference]: Without dead ends: 198 [2019-11-28 15:40:15,323 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,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2019-11-28 15:40:15,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 186. [2019-11-28 15:40:15,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-11-28 15:40:15,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 287 transitions. [2019-11-28 15:40:15,334 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 287 transitions. Word has length 26 [2019-11-28 15:40:15,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,335 INFO L462 AbstractCegarLoop]: Abstraction has 186 states and 287 transitions. [2019-11-28 15:40:15,335 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,336 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 287 transitions. [2019-11-28 15:40:15,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-28 15:40:15,343 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,343 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] [2019-11-28 15:40:15,343 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,344 INFO L82 PathProgramCache]: Analyzing trace with hash 744248342, now seen corresponding path program 1 times [2019-11-28 15:40:15,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062851389] [2019-11-28 15:40:15,346 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,416 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:15,416 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062851389] [2019-11-28 15:40:15,416 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,418 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:15,418 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854343706] [2019-11-28 15:40:15,418 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,419 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,420 INFO L87 Difference]: Start difference. First operand 186 states and 287 transitions. Second operand 3 states. [2019-11-28 15:40:15,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,452 INFO L93 Difference]: Finished difference Result 536 states and 822 transitions. [2019-11-28 15:40:15,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,453 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 26 [2019-11-28 15:40:15,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,457 INFO L225 Difference]: With dead ends: 536 [2019-11-28 15:40:15,458 INFO L226 Difference]: Without dead ends: 357 [2019-11-28 15:40:15,458 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:15,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2019-11-28 15:40:15,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 355. [2019-11-28 15:40:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2019-11-28 15:40:15,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 542 transitions. [2019-11-28 15:40:15,485 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 542 transitions. Word has length 26 [2019-11-28 15:40:15,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,485 INFO L462 AbstractCegarLoop]: Abstraction has 355 states and 542 transitions. [2019-11-28 15:40:15,486 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 542 transitions. [2019-11-28 15:40:15,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-11-28 15:40:15,487 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,488 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:15,488 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1232648243, now seen corresponding path program 1 times [2019-11-28 15:40:15,490 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,491 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [146633902] [2019-11-28 15:40:15,491 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,565 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:15,566 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [146633902] [2019-11-28 15:40:15,566 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,566 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:15,567 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375274270] [2019-11-28 15:40:15,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:15,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:15,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:15,568 INFO L87 Difference]: Start difference. First operand 355 states and 542 transitions. Second operand 4 states. [2019-11-28 15:40:15,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,817 INFO L93 Difference]: Finished difference Result 1099 states and 1679 transitions. [2019-11-28 15:40:15,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:15,818 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 27 [2019-11-28 15:40:15,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,822 INFO L225 Difference]: With dead ends: 1099 [2019-11-28 15:40:15,823 INFO L226 Difference]: Without dead ends: 752 [2019-11-28 15:40:15,824 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:15,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 752 states. [2019-11-28 15:40:15,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 752 to 598. [2019-11-28 15:40:15,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-11-28 15:40:15,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 927 transitions. [2019-11-28 15:40:15,850 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 927 transitions. Word has length 27 [2019-11-28 15:40:15,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,850 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 927 transitions. [2019-11-28 15:40:15,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:15,850 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 927 transitions. [2019-11-28 15:40:15,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-11-28 15:40:15,851 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,852 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] [2019-11-28 15:40:15,852 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1405707043, now seen corresponding path program 1 times [2019-11-28 15:40:15,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192433180] [2019-11-28 15:40:15,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,888 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:15,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192433180] [2019-11-28 15:40:15,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:15,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:15,889 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002647234] [2019-11-28 15:40:15,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:15,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:15,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:15,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:15,894 INFO L87 Difference]: Start difference. First operand 598 states and 927 transitions. Second operand 3 states. [2019-11-28 15:40:16,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,082 INFO L93 Difference]: Finished difference Result 1330 states and 2091 transitions. [2019-11-28 15:40:16,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,083 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-11-28 15:40:16,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,088 INFO L225 Difference]: With dead ends: 1330 [2019-11-28 15:40:16,088 INFO L226 Difference]: Without dead ends: 740 [2019-11-28 15:40:16,089 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,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2019-11-28 15:40:16,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 720. [2019-11-28 15:40:16,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 720 states. [2019-11-28 15:40:16,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 1142 transitions. [2019-11-28 15:40:16,119 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 1142 transitions. Word has length 41 [2019-11-28 15:40:16,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,120 INFO L462 AbstractCegarLoop]: Abstraction has 720 states and 1142 transitions. [2019-11-28 15:40:16,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,120 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 1142 transitions. [2019-11-28 15:40:16,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-11-28 15:40:16,121 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,122 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] [2019-11-28 15:40:16,122 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1323716310, now seen corresponding path program 1 times [2019-11-28 15:40:16,123 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,123 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408871774] [2019-11-28 15:40:16,123 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,171 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:16,171 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408871774] [2019-11-28 15:40:16,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,172 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410980795] [2019-11-28 15:40:16,172 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,172 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,173 INFO L87 Difference]: Start difference. First operand 720 states and 1142 transitions. Second operand 3 states. [2019-11-28 15:40:16,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,341 INFO L93 Difference]: Finished difference Result 1497 states and 2391 transitions. [2019-11-28 15:40:16,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,342 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 42 [2019-11-28 15:40:16,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,346 INFO L225 Difference]: With dead ends: 1497 [2019-11-28 15:40:16,346 INFO L226 Difference]: Without dead ends: 785 [2019-11-28 15:40:16,348 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,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 785 states. [2019-11-28 15:40:16,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 785 to 765. [2019-11-28 15:40:16,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-28 15:40:16,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1227 transitions. [2019-11-28 15:40:16,377 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1227 transitions. Word has length 42 [2019-11-28 15:40:16,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,377 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1227 transitions. [2019-11-28 15:40:16,377 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,378 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1227 transitions. [2019-11-28 15:40:16,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-11-28 15:40:16,379 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,379 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:16,380 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,380 INFO L82 PathProgramCache]: Analyzing trace with hash 477806323, now seen corresponding path program 1 times [2019-11-28 15:40:16,380 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,381 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171867242] [2019-11-28 15:40:16,381 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,411 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:16,411 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171867242] [2019-11-28 15:40:16,411 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,411 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,412 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077313002] [2019-11-28 15:40:16,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,413 INFO L87 Difference]: Start difference. First operand 765 states and 1227 transitions. Second operand 3 states. [2019-11-28 15:40:16,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,438 INFO L93 Difference]: Finished difference Result 1522 states and 2442 transitions. [2019-11-28 15:40:16,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,439 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 43 [2019-11-28 15:40:16,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,444 INFO L225 Difference]: With dead ends: 1522 [2019-11-28 15:40:16,444 INFO L226 Difference]: Without dead ends: 765 [2019-11-28 15:40:16,446 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,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2019-11-28 15:40:16,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 765. [2019-11-28 15:40:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 765 states. [2019-11-28 15:40:16,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 765 states and 1210 transitions. [2019-11-28 15:40:16,477 INFO L78 Accepts]: Start accepts. Automaton has 765 states and 1210 transitions. Word has length 43 [2019-11-28 15:40:16,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,477 INFO L462 AbstractCegarLoop]: Abstraction has 765 states and 1210 transitions. [2019-11-28 15:40:16,477 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,477 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 1210 transitions. [2019-11-28 15:40:16,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-11-28 15:40:16,479 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,479 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:16,480 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,480 INFO L82 PathProgramCache]: Analyzing trace with hash -701855575, now seen corresponding path program 1 times [2019-11-28 15:40:16,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,481 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612902336] [2019-11-28 15:40:16,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,524 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:16,524 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612902336] [2019-11-28 15:40:16,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:16,525 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339456298] [2019-11-28 15:40:16,525 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,526 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,526 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,526 INFO L87 Difference]: Start difference. First operand 765 states and 1210 transitions. Second operand 3 states. [2019-11-28 15:40:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,577 INFO L93 Difference]: Finished difference Result 1536 states and 2425 transitions. [2019-11-28 15:40:16,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,578 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-11-28 15:40:16,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,584 INFO L225 Difference]: With dead ends: 1536 [2019-11-28 15:40:16,584 INFO L226 Difference]: Without dead ends: 779 [2019-11-28 15:40:16,586 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,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2019-11-28 15:40:16,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 777. [2019-11-28 15:40:16,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 777 states. [2019-11-28 15:40:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 777 states to 777 states and 1208 transitions. [2019-11-28 15:40:16,625 INFO L78 Accepts]: Start accepts. Automaton has 777 states and 1208 transitions. Word has length 44 [2019-11-28 15:40:16,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,626 INFO L462 AbstractCegarLoop]: Abstraction has 777 states and 1208 transitions. [2019-11-28 15:40:16,626 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,626 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states and 1208 transitions. [2019-11-28 15:40:16,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 15:40:16,628 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,629 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:16,629 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,630 INFO L82 PathProgramCache]: Analyzing trace with hash 616075766, now seen corresponding path program 1 times [2019-11-28 15:40:16,630 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,634 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386453087] [2019-11-28 15:40:16,635 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,668 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:16,669 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386453087] [2019-11-28 15:40:16,670 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,670 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:16,670 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221791633] [2019-11-28 15:40:16,671 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,671 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,672 INFO L87 Difference]: Start difference. First operand 777 states and 1208 transitions. Second operand 3 states. [2019-11-28 15:40:16,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,729 INFO L93 Difference]: Finished difference Result 2298 states and 3572 transitions. [2019-11-28 15:40:16,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-28 15:40:16,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,738 INFO L225 Difference]: With dead ends: 2298 [2019-11-28 15:40:16,739 INFO L226 Difference]: Without dead ends: 1529 [2019-11-28 15:40:16,741 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:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2019-11-28 15:40:16,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1217. [2019-11-28 15:40:16,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-28 15:40:16,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1884 transitions. [2019-11-28 15:40:16,798 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1884 transitions. Word has length 49 [2019-11-28 15:40:16,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,799 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1884 transitions. [2019-11-28 15:40:16,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1884 transitions. [2019-11-28 15:40:16,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-28 15:40:16,801 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,802 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:16,802 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1509562104, now seen corresponding path program 1 times [2019-11-28 15:40:16,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712064128] [2019-11-28 15:40:16,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:16,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:16,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712064128] [2019-11-28 15:40:16,839 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:16,839 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:16,839 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057176372] [2019-11-28 15:40:16,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,839 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:16,840 INFO L87 Difference]: Start difference. First operand 1217 states and 1884 transitions. Second operand 3 states. [2019-11-28 15:40:17,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,103 INFO L93 Difference]: Finished difference Result 2638 states and 4072 transitions. [2019-11-28 15:40:17,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-28 15:40:17,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,114 INFO L225 Difference]: With dead ends: 2638 [2019-11-28 15:40:17,114 INFO L226 Difference]: Without dead ends: 1430 [2019-11-28 15:40:17,119 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:17,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1430 states. [2019-11-28 15:40:17,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1430 to 1324. [2019-11-28 15:40:17,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1324 states. [2019-11-28 15:40:17,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1999 transitions. [2019-11-28 15:40:17,188 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1999 transitions. Word has length 49 [2019-11-28 15:40:17,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,189 INFO L462 AbstractCegarLoop]: Abstraction has 1324 states and 1999 transitions. [2019-11-28 15:40:17,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,189 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1999 transitions. [2019-11-28 15:40:17,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-11-28 15:40:17,193 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,193 INFO L410 BasicCegarLoop]: trace histogram [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:17,193 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,194 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,194 INFO L82 PathProgramCache]: Analyzing trace with hash 531471331, now seen corresponding path program 1 times [2019-11-28 15:40:17,194 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,195 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749662172] [2019-11-28 15:40:17,195 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:40:17,243 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749662172] [2019-11-28 15:40:17,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:17,245 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908831723] [2019-11-28 15:40:17,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,246 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,247 INFO L87 Difference]: Start difference. First operand 1324 states and 1999 transitions. Second operand 3 states. [2019-11-28 15:40:17,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,317 INFO L93 Difference]: Finished difference Result 2486 states and 3735 transitions. [2019-11-28 15:40:17,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,318 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-11-28 15:40:17,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,327 INFO L225 Difference]: With dead ends: 2486 [2019-11-28 15:40:17,327 INFO L226 Difference]: Without dead ends: 1659 [2019-11-28 15:40:17,330 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:17,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2019-11-28 15:40:17,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1185. [2019-11-28 15:40:17,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1185 states. [2019-11-28 15:40:17,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1185 states to 1185 states and 1780 transitions. [2019-11-28 15:40:17,409 INFO L78 Accepts]: Start accepts. Automaton has 1185 states and 1780 transitions. Word has length 54 [2019-11-28 15:40:17,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,409 INFO L462 AbstractCegarLoop]: Abstraction has 1185 states and 1780 transitions. [2019-11-28 15:40:17,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1185 states and 1780 transitions. [2019-11-28 15:40:17,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-11-28 15:40:17,412 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,413 INFO L410 BasicCegarLoop]: trace histogram [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] [2019-11-28 15:40:17,413 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,413 INFO L82 PathProgramCache]: Analyzing trace with hash -1599732210, now seen corresponding path program 1 times [2019-11-28 15:40:17,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441950600] [2019-11-28 15:40:17,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,455 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:17,455 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441950600] [2019-11-28 15:40:17,456 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:17,456 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:17,456 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532054999] [2019-11-28 15:40:17,457 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:17,457 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:17,458 INFO L87 Difference]: Start difference. First operand 1185 states and 1780 transitions. Second operand 3 states. [2019-11-28 15:40:17,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,542 INFO L93 Difference]: Finished difference Result 3421 states and 5102 transitions. [2019-11-28 15:40:17,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:17,543 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-11-28 15:40:17,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,554 INFO L225 Difference]: With dead ends: 3421 [2019-11-28 15:40:17,555 INFO L226 Difference]: Without dead ends: 2245 [2019-11-28 15:40:17,557 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:17,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2245 states. [2019-11-28 15:40:17,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2245 to 2243. [2019-11-28 15:40:17,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2243 states. [2019-11-28 15:40:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2243 states to 2243 states and 3304 transitions. [2019-11-28 15:40:17,657 INFO L78 Accepts]: Start accepts. Automaton has 2243 states and 3304 transitions. Word has length 55 [2019-11-28 15:40:17,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,657 INFO L462 AbstractCegarLoop]: Abstraction has 2243 states and 3304 transitions. [2019-11-28 15:40:17,657 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 2243 states and 3304 transitions. [2019-11-28 15:40:17,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-11-28 15:40:17,662 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:17,662 INFO L410 BasicCegarLoop]: trace histogram [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:17,663 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:17,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:17,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1445576834, now seen corresponding path program 1 times [2019-11-28 15:40:17,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:17,664 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930493599] [2019-11-28 15:40:17,664 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:17,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:17,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-28 15:40:17,736 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-28 15:40:17,737 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-28 15:40:17,808 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:17 BoogieIcfgContainer [2019-11-28 15:40:17,808 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:17,809 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:17,809 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:17,809 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:17,810 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:13" (3/4) ... [2019-11-28 15:40:17,812 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-28 15:40:17,914 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:17,914 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:17,922 INFO L168 Benchmark]: Toolchain (without parser) took 6167.33 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 331.4 MB). Free memory was 961.7 MB in the beginning and 1.2 GB in the end (delta: -244.4 MB). Peak memory consumption was 87.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,923 INFO L168 Benchmark]: CDTParser took 0.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:17,923 INFO L168 Benchmark]: CACSL2BoogieTranslator took 513.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,924 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,924 INFO L168 Benchmark]: Boogie Preprocessor took 40.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:17,924 INFO L168 Benchmark]: RCFGBuilder took 857.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,925 INFO L168 Benchmark]: TraceAbstraction took 4584.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.2 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,925 INFO L168 Benchmark]: Witness Printer took 105.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:17,927 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.75 ms. Allocated memory is still 1.0 GB. Free memory is still 987.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 513.38 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 961.7 MB in the beginning and 1.1 GB in the end (delta: -174.3 MB). Peak memory consumption was 25.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.01 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.51 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 857.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 58.2 MB). Peak memory consumption was 58.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 4584.72 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 183.5 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -144.2 MB). Peak memory consumption was 39.3 MB. Max. memory is 11.5 GB. * Witness Printer took 105.21 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.4 MB). Peak memory consumption was 9.4 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 640]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L645] int s ; [L646] int tmp ; [L650] s = 8464 [L11] int s__info_callback = __VERIFIER_nondet_int() ; [L12] int s__in_handshake = __VERIFIER_nondet_int() ; [L13] int s__state ; [L14] int s__new_session ; [L15] int s__server ; [L16] int s__version = __VERIFIER_nondet_int() ; [L17] int s__type ; [L18] int s__init_num ; [L19] int s__hit = __VERIFIER_nondet_int() ; [L20] int s__rwstate ; [L21] int s__init_buf___0 = 1; [L22] int s__debug = __VERIFIER_nondet_int() ; [L23] int s__shutdown ; [L24] int s__cert = __VERIFIER_nondet_int() ; [L25] int s__options = __VERIFIER_nondet_int() ; [L26] int s__verify_mode = __VERIFIER_nondet_int() ; [L27] int s__session__peer = __VERIFIER_nondet_int() ; [L28] int s__cert__pkeys__AT0__privatekey = __VERIFIER_nondet_int() ; [L29] int s__ctx__info_callback = __VERIFIER_nondet_int() ; [L30] int s__ctx__stats__sess_accept_renegotiate = __VERIFIER_nondet_int() ; [L31] int s__ctx__stats__sess_accept = __VERIFIER_nondet_int() ; [L32] int s__ctx__stats__sess_accept_good = __VERIFIER_nondet_int() ; [L33] int s__s3__tmp__cert_request ; [L34] int s__s3__tmp__reuse_message ; [L35] int s__s3__tmp__use_rsa_tmp ; [L36] int s__s3__tmp__new_cipher = __VERIFIER_nondet_int() ; [L37] int s__s3__tmp__new_cipher__algorithms = __VERIFIER_nondet_int() ; [L38] int s__s3__tmp__next_state___0 ; [L39] int s__s3__tmp__new_cipher__algo_strength = __VERIFIER_nondet_int() ; [L40] int s__session__cipher ; [L41] int buf ; [L42] unsigned long l ; [L43] unsigned long Time ; [L44] unsigned long tmp ; [L45] int cb ; [L46] long num1 = __VERIFIER_nondet_long() ; [L47] int ret ; [L48] int new_state ; [L49] int state ; [L50] int skip ; [L51] int got_new_session ; [L52] int tmp___1 = __VERIFIER_nondet_int() ; [L53] int tmp___2 = __VERIFIER_nondet_int() ; [L54] int tmp___3 = __VERIFIER_nondet_int() ; [L55] int tmp___4 = __VERIFIER_nondet_int() ; [L56] int tmp___5 = __VERIFIER_nondet_int() ; [L57] int tmp___6 = __VERIFIER_nondet_int() ; [L58] int tmp___7 ; [L59] long tmp___8 = __VERIFIER_nondet_long() ; [L60] int tmp___9 = __VERIFIER_nondet_int() ; [L61] int tmp___10 = __VERIFIER_nondet_int() ; [L62] int blastFlag ; [L63] int __cil_tmp55 ; [L64] unsigned long __cil_tmp56 ; [L65] unsigned long __cil_tmp57 ; [L66] unsigned long __cil_tmp58 ; [L67] unsigned long __cil_tmp59 ; [L68] int __cil_tmp60 ; [L69] unsigned long __cil_tmp61 ; [L72] s__s3__tmp__reuse_message = 0 [L73] s__state = initial_state [L74] blastFlag = 0 [L75] tmp = __VERIFIER_nondet_int() [L76] Time = tmp [L77] cb = 0 [L78] ret = -1 [L79] skip = 0 [L80] got_new_session = 0 [L81] COND TRUE s__info_callback != 0 [L82] cb = s__info_callback [L88] s__in_handshake ++ [L89] COND TRUE tmp___1 + 12288 [L90] COND TRUE tmp___2 + 16384 [L94] COND FALSE !(s__cert == 0) [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND TRUE s__state == 8464 [L271] s__shutdown = 0 [L272] ret = __VERIFIER_nondet_int() [L273] COND TRUE blastFlag == 0 [L274] blastFlag = 1 [L276] COND FALSE !(ret <= 0) [L279] got_new_session = 1 [L280] s__state = 8496 [L281] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND FALSE !(state == 8496) [L614] COND FALSE !(\read(s__debug)) [L620] COND TRUE cb != 0 [L621] COND TRUE s__state != state [L622] new_state = s__state [L623] s__state = state [L624] s__state = new_state [L629] skip = 0 [L98] COND TRUE 1 [L100] state = s__state [L101] COND FALSE !(s__state == 12292) [L104] COND FALSE !(s__state == 16384) [L107] COND FALSE !(s__state == 8192) [L110] COND FALSE !(s__state == 24576) [L113] COND FALSE !(s__state == 8195) [L116] COND FALSE !(s__state == 8480) [L119] COND FALSE !(s__state == 8481) [L122] COND FALSE !(s__state == 8482) [L125] COND FALSE !(s__state == 8464) [L128] COND FALSE !(s__state == 8465) [L131] COND FALSE !(s__state == 8466) [L134] COND TRUE s__state == 8496 [L285] ret = __VERIFIER_nondet_int() [L286] COND TRUE blastFlag == 1 [L287] blastFlag = 2 [L289] COND FALSE !(ret <= 0) [L292] COND FALSE !(\read(s__hit)) [L295] s__state = 8512 [L297] s__init_num = 0 [L602] COND TRUE ! s__s3__tmp__reuse_message [L603] COND TRUE ! skip [L604] COND TRUE tmp___1 != -12288 [L605] COND TRUE s__state != 8656 [L606] COND TRUE tmp___2 != -16384 [L607] COND TRUE state == 8496 [L640] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 150 locations, 1 error locations. Result: UNSAFE, OverallTime: 4.4s, OverallIterations: 18, TraceHistogramMax: 2, AutomataDifference: 2.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3434 SDtfs, 3298 SDslu, 1317 SDs, 0 SdLazy, 1077 SolverSat, 427 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 41 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2243occurred in iteration=17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 17 MinimizatonAttempts, 1140 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 652 NumberOfCodeBlocks, 652 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 579 ConstructedInterpolants, 0 QuantifiedInterpolants, 70785 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 102/102 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...