./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.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_clnt_3.cil-3.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 b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-11-28 15:40:00,405 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:00,408 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:00,421 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:00,422 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:00,423 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:00,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:00,427 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:00,429 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:00,430 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:00,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:00,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:00,433 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:00,434 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:00,435 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:00,436 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:00,437 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:00,439 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:00,440 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:00,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:00,444 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:00,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:00,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:00,448 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:00,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:00,451 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:00,451 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:00,452 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:00,452 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:00,453 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:00,454 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:00,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:00,455 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:00,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:00,458 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:00,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:00,459 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:00,459 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:00,460 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:00,461 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:00,462 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:00,463 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:00,478 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:00,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:00,480 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:00,480 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:00,480 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:00,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:00,481 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:00,481 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:00,481 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:00,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:00,482 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:00,482 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:00,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:00,483 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:00,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:00,483 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:00,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:00,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:00,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:00,485 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:00,485 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:00,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:00,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:00,486 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:00,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:00,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:00,486 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:00,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:00,487 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:00,487 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 -> b1d7062786d1cbe42a29d98cc634a5c85ac9a3f1 [2019-11-28 15:40:00,828 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:00,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:00,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:00,847 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:00,849 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:00,850 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-28 15:40:00,939 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098be5d45/22f77f15d9ed4991b9545d1d7143abe2/FLAG63123000a [2019-11-28 15:40:01,478 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:01,479 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ssh-simplified/s3_clnt_3.cil-3.c [2019-11-28 15:40:01,498 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098be5d45/22f77f15d9ed4991b9545d1d7143abe2/FLAG63123000a [2019-11-28 15:40:01,761 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/098be5d45/22f77f15d9ed4991b9545d1d7143abe2 [2019-11-28 15:40:01,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:01,767 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:01,768 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:01,768 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:01,772 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:01,773 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:01" (1/1) ... [2019-11-28 15:40:01,776 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@569f7f9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:01, skipping insertion in model container [2019-11-28 15:40:01,776 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:01" (1/1) ... [2019-11-28 15:40:01,785 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:01,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:02,117 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:02,122 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:02,245 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:02,264 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:02,264 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:02 WrapperNode [2019-11-28 15:40:02,265 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:02,266 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:02,266 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:02,266 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:02,276 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:02" (1/1) ... [2019-11-28 15:40:02,291 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:02" (1/1) ... [2019-11-28 15:40:02,340 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:02,341 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:02,341 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:02,341 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:02,352 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:02" (1/1) ... [2019-11-28 15:40:02,353 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:02" (1/1) ... [2019-11-28 15:40:02,360 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:02" (1/1) ... [2019-11-28 15:40:02,361 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:02" (1/1) ... [2019-11-28 15:40:02,379 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:02" (1/1) ... [2019-11-28 15:40:02,392 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:02" (1/1) ... [2019-11-28 15:40:02,395 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:02" (1/1) ... [2019-11-28 15:40:02,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:02,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:02,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:02,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:02,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:02" (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:02,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:02,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:02,602 WARN L738 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-11-28 15:40:03,232 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##85: assume !false; [2019-11-28 15:40:03,233 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##84: assume false; [2019-11-28 15:40:03,235 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:03,235 INFO L287 CfgBuilder]: Removed 7 assume(true) statements. [2019-11-28 15:40:03,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:03 BoogieIcfgContainer [2019-11-28 15:40:03,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:03,240 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:03,241 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:03,244 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:03,244 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:01" (1/3) ... [2019-11-28 15:40:03,245 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaad27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:03, skipping insertion in model container [2019-11-28 15:40:03,245 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:02" (2/3) ... [2019-11-28 15:40:03,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1aaad27d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:03, skipping insertion in model container [2019-11-28 15:40:03,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:03" (3/3) ... [2019-11-28 15:40:03,248 INFO L109 eAbstractionObserver]: Analyzing ICFG s3_clnt_3.cil-3.c [2019-11-28 15:40:03,258 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:03,265 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:03,278 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:03,309 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:03,310 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:03,310 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:03,310 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:03,310 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:03,311 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:03,311 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:03,311 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states. [2019-11-28 15:40:03,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-11-28 15:40:03,337 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:03,338 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:03,338 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:03,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:03,343 INFO L82 PathProgramCache]: Analyzing trace with hash -1449576961, now seen corresponding path program 1 times [2019-11-28 15:40:03,350 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:03,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362418412] [2019-11-28 15:40:03,351 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:03,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:03,558 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:03,559 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362418412] [2019-11-28 15:40:03,561 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:03,561 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-28 15:40:03,563 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420183265] [2019-11-28 15:40:03,568 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:03,569 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:03,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:03,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:03,585 INFO L87 Difference]: Start difference. First operand 127 states. Second operand 3 states. [2019-11-28 15:40:03,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:03,847 INFO L93 Difference]: Finished difference Result 251 states and 426 transitions. [2019-11-28 15:40:03,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:03,850 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-11-28 15:40:03,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:03,868 INFO L225 Difference]: With dead ends: 251 [2019-11-28 15:40:03,869 INFO L226 Difference]: Without dead ends: 114 [2019-11-28 15:40:03,875 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:03,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2019-11-28 15:40:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2019-11-28 15:40:03,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-11-28 15:40:03,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 171 transitions. [2019-11-28 15:40:03,923 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 171 transitions. Word has length 23 [2019-11-28 15:40:03,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:03,923 INFO L462 AbstractCegarLoop]: Abstraction has 114 states and 171 transitions. [2019-11-28 15:40:03,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:03,923 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 171 transitions. [2019-11-28 15:40:03,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-28 15:40:03,925 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:03,925 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:03,926 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:03,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:03,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1395170557, now seen corresponding path program 1 times [2019-11-28 15:40:03,927 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:03,927 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790665336] [2019-11-28 15:40:03,927 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,031 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-28 15:40:04,032 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790665336] [2019-11-28 15:40:04,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462693446] [2019-11-28 15:40:04,035 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,035 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,036 INFO L87 Difference]: Start difference. First operand 114 states and 171 transitions. Second operand 3 states. [2019-11-28 15:40:04,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:04,221 INFO L93 Difference]: Finished difference Result 237 states and 359 transitions. [2019-11-28 15:40:04,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:04,222 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 36 [2019-11-28 15:40:04,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:04,224 INFO L225 Difference]: With dead ends: 237 [2019-11-28 15:40:04,224 INFO L226 Difference]: Without dead ends: 132 [2019-11-28 15:40:04,226 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:04,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-11-28 15:40:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2019-11-28 15:40:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2019-11-28 15:40:04,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 191 transitions. [2019-11-28 15:40:04,240 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 191 transitions. Word has length 36 [2019-11-28 15:40:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,240 INFO L462 AbstractCegarLoop]: Abstraction has 129 states and 191 transitions. [2019-11-28 15:40:04,240 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 191 transitions. [2019-11-28 15:40:04,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-28 15:40:04,243 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,243 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:04,243 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,244 INFO L82 PathProgramCache]: Analyzing trace with hash -462623258, now seen corresponding path program 1 times [2019-11-28 15:40:04,244 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,245 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33707820] [2019-11-28 15:40:04,245 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,336 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-11-28 15:40:04,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [33707820] [2019-11-28 15:40:04,337 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,339 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730465481] [2019-11-28 15:40:04,341 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,342 INFO L87 Difference]: Start difference. First operand 129 states and 191 transitions. Second operand 3 states. [2019-11-28 15:40:04,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:04,527 INFO L93 Difference]: Finished difference Result 271 states and 407 transitions. [2019-11-28 15:40:04,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:04,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-28 15:40:04,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:04,532 INFO L225 Difference]: With dead ends: 271 [2019-11-28 15:40:04,532 INFO L226 Difference]: Without dead ends: 151 [2019-11-28 15:40:04,534 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:04,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2019-11-28 15:40:04,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 146. [2019-11-28 15:40:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-11-28 15:40:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 213 transitions. [2019-11-28 15:40:04,556 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 213 transitions. Word has length 50 [2019-11-28 15:40:04,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,557 INFO L462 AbstractCegarLoop]: Abstraction has 146 states and 213 transitions. [2019-11-28 15:40:04,561 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,561 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 213 transitions. [2019-11-28 15:40:04,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:40:04,564 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,567 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:04,567 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,568 INFO L82 PathProgramCache]: Analyzing trace with hash -1174891697, now seen corresponding path program 1 times [2019-11-28 15:40:04,568 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,568 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991225737] [2019-11-28 15:40:04,569 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:04,739 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:40:04,739 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991225737] [2019-11-28 15:40:04,740 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:04,740 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:04,741 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545278770] [2019-11-28 15:40:04,741 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:04,742 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:04,742 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:04,742 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:04,742 INFO L87 Difference]: Start difference. First operand 146 states and 213 transitions. Second operand 3 states. [2019-11-28 15:40:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:04,952 INFO L93 Difference]: Finished difference Result 334 states and 502 transitions. [2019-11-28 15:40:04,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:04,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:40:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:04,955 INFO L225 Difference]: With dead ends: 334 [2019-11-28 15:40:04,956 INFO L226 Difference]: Without dead ends: 196 [2019-11-28 15:40:04,957 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:04,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-11-28 15:40:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 187. [2019-11-28 15:40:04,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2019-11-28 15:40:04,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 263 transitions. [2019-11-28 15:40:04,970 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 263 transitions. Word has length 67 [2019-11-28 15:40:04,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:04,971 INFO L462 AbstractCegarLoop]: Abstraction has 187 states and 263 transitions. [2019-11-28 15:40:04,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:04,971 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 263 transitions. [2019-11-28 15:40:04,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-11-28 15:40:04,973 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:04,973 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:04,974 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:04,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:04,974 INFO L82 PathProgramCache]: Analyzing trace with hash 1314637265, now seen corresponding path program 1 times [2019-11-28 15:40:04,974 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:04,975 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726728918] [2019-11-28 15:40:04,975 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:04,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,038 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-28 15:40:05,042 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726728918] [2019-11-28 15:40:05,042 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,042 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,043 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564114842] [2019-11-28 15:40:05,043 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,044 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,045 INFO L87 Difference]: Start difference. First operand 187 states and 263 transitions. Second operand 3 states. [2019-11-28 15:40:05,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,217 INFO L93 Difference]: Finished difference Result 389 states and 554 transitions. [2019-11-28 15:40:05,217 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,217 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-11-28 15:40:05,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,219 INFO L225 Difference]: With dead ends: 389 [2019-11-28 15:40:05,220 INFO L226 Difference]: Without dead ends: 211 [2019-11-28 15:40:05,221 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:05,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2019-11-28 15:40:05,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 206. [2019-11-28 15:40:05,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-11-28 15:40:05,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 287 transitions. [2019-11-28 15:40:05,232 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 287 transitions. Word has length 67 [2019-11-28 15:40:05,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,233 INFO L462 AbstractCegarLoop]: Abstraction has 206 states and 287 transitions. [2019-11-28 15:40:05,233 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,233 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 287 transitions. [2019-11-28 15:40:05,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-11-28 15:40:05,235 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,235 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:05,235 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1231866158, now seen corresponding path program 1 times [2019-11-28 15:40:05,236 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,236 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396184601] [2019-11-28 15:40:05,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,320 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-11-28 15:40:05,321 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396184601] [2019-11-28 15:40:05,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,322 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,322 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628607746] [2019-11-28 15:40:05,324 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,325 INFO L87 Difference]: Start difference. First operand 206 states and 287 transitions. Second operand 3 states. [2019-11-28 15:40:05,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,474 INFO L93 Difference]: Finished difference Result 427 states and 603 transitions. [2019-11-28 15:40:05,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,475 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 84 [2019-11-28 15:40:05,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,478 INFO L225 Difference]: With dead ends: 427 [2019-11-28 15:40:05,478 INFO L226 Difference]: Without dead ends: 230 [2019-11-28 15:40:05,479 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:05,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2019-11-28 15:40:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 227. [2019-11-28 15:40:05,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2019-11-28 15:40:05,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 313 transitions. [2019-11-28 15:40:05,489 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 313 transitions. Word has length 84 [2019-11-28 15:40:05,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,490 INFO L462 AbstractCegarLoop]: Abstraction has 227 states and 313 transitions. [2019-11-28 15:40:05,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 313 transitions. [2019-11-28 15:40:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-11-28 15:40:05,492 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,492 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:05,493 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash 266431114, now seen corresponding path program 1 times [2019-11-28 15:40:05,493 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250458396] [2019-11-28 15:40:05,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,562 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-11-28 15:40:05,563 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250458396] [2019-11-28 15:40:05,563 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,563 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,564 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790155036] [2019-11-28 15:40:05,564 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,564 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,565 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,565 INFO L87 Difference]: Start difference. First operand 227 states and 313 transitions. Second operand 3 states. [2019-11-28 15:40:05,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,605 INFO L93 Difference]: Finished difference Result 661 states and 912 transitions. [2019-11-28 15:40:05,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,606 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-11-28 15:40:05,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,609 INFO L225 Difference]: With dead ends: 661 [2019-11-28 15:40:05,609 INFO L226 Difference]: Without dead ends: 443 [2019-11-28 15:40:05,610 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:05,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2019-11-28 15:40:05,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 443. [2019-11-28 15:40:05,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-11-28 15:40:05,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 609 transitions. [2019-11-28 15:40:05,650 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 609 transitions. Word has length 104 [2019-11-28 15:40:05,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,650 INFO L462 AbstractCegarLoop]: Abstraction has 443 states and 609 transitions. [2019-11-28 15:40:05,651 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,651 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 609 transitions. [2019-11-28 15:40:05,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-11-28 15:40:05,659 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,661 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:05,661 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1706663820, now seen corresponding path program 1 times [2019-11-28 15:40:05,663 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,665 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053841694] [2019-11-28 15:40:05,665 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,747 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-11-28 15:40:05,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053841694] [2019-11-28 15:40:05,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,748 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,749 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385217377] [2019-11-28 15:40:05,749 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,750 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,751 INFO L87 Difference]: Start difference. First operand 443 states and 609 transitions. Second operand 3 states. [2019-11-28 15:40:05,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:05,797 INFO L93 Difference]: Finished difference Result 661 states and 909 transitions. [2019-11-28 15:40:05,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:05,797 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 106 [2019-11-28 15:40:05,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:05,803 INFO L225 Difference]: With dead ends: 661 [2019-11-28 15:40:05,803 INFO L226 Difference]: Without dead ends: 659 [2019-11-28 15:40:05,804 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:05,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2019-11-28 15:40:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 659. [2019-11-28 15:40:05,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2019-11-28 15:40:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 907 transitions. [2019-11-28 15:40:05,825 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 907 transitions. Word has length 106 [2019-11-28 15:40:05,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:05,826 INFO L462 AbstractCegarLoop]: Abstraction has 659 states and 907 transitions. [2019-11-28 15:40:05,826 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:05,826 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 907 transitions. [2019-11-28 15:40:05,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-11-28 15:40:05,829 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:05,829 INFO L410 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:05,830 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:05,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:05,830 INFO L82 PathProgramCache]: Analyzing trace with hash 589479754, now seen corresponding path program 1 times [2019-11-28 15:40:05,831 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:05,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001316921] [2019-11-28 15:40:05,832 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:05,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:05,908 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 260 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2019-11-28 15:40:05,909 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001316921] [2019-11-28 15:40:05,909 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:05,909 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:05,912 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957697388] [2019-11-28 15:40:05,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:05,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:05,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:05,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:05,914 INFO L87 Difference]: Start difference. First operand 659 states and 907 transitions. Second operand 3 states. [2019-11-28 15:40:06,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,087 INFO L93 Difference]: Finished difference Result 1462 states and 2068 transitions. [2019-11-28 15:40:06,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 161 [2019-11-28 15:40:06,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,093 INFO L225 Difference]: With dead ends: 1462 [2019-11-28 15:40:06,093 INFO L226 Difference]: Without dead ends: 809 [2019-11-28 15:40:06,095 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:06,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 809 states. [2019-11-28 15:40:06,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 809 to 776. [2019-11-28 15:40:06,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-11-28 15:40:06,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1096 transitions. [2019-11-28 15:40:06,119 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1096 transitions. Word has length 161 [2019-11-28 15:40:06,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:06,120 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1096 transitions. [2019-11-28 15:40:06,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:06,120 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1096 transitions. [2019-11-28 15:40:06,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2019-11-28 15:40:06,124 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,124 INFO L410 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 9, 9, 9, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:06,125 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,125 INFO L82 PathProgramCache]: Analyzing trace with hash 1596288335, now seen corresponding path program 1 times [2019-11-28 15:40:06,125 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183977400] [2019-11-28 15:40:06,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:06,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 327 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2019-11-28 15:40:06,209 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183977400] [2019-11-28 15:40:06,210 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:06,210 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:06,211 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631125615] [2019-11-28 15:40:06,211 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,212 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,213 INFO L87 Difference]: Start difference. First operand 776 states and 1096 transitions. Second operand 3 states. [2019-11-28 15:40:06,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,430 INFO L93 Difference]: Finished difference Result 1824 states and 2649 transitions. [2019-11-28 15:40:06,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 188 [2019-11-28 15:40:06,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,440 INFO L225 Difference]: With dead ends: 1824 [2019-11-28 15:40:06,440 INFO L226 Difference]: Without dead ends: 1006 [2019-11-28 15:40:06,443 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:06,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1006 states. [2019-11-28 15:40:06,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1006 to 965. [2019-11-28 15:40:06,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 965 states. [2019-11-28 15:40:06,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1348 transitions. [2019-11-28 15:40:06,486 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1348 transitions. Word has length 188 [2019-11-28 15:40:06,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:06,487 INFO L462 AbstractCegarLoop]: Abstraction has 965 states and 1348 transitions. [2019-11-28 15:40:06,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:06,487 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1348 transitions. [2019-11-28 15:40:06,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2019-11-28 15:40:06,494 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,494 INFO L410 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 10, 10, 10, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:06,495 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,495 INFO L82 PathProgramCache]: Analyzing trace with hash -1275827432, now seen corresponding path program 1 times [2019-11-28 15:40:06,496 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,496 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489695930] [2019-11-28 15:40:06,496 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:06,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,594 INFO L134 CoverageAnalysis]: Checked inductivity of 659 backedges. 404 proven. 0 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-11-28 15:40:06,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489695930] [2019-11-28 15:40:06,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:06,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:06,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792963527] [2019-11-28 15:40:06,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,598 INFO L87 Difference]: Start difference. First operand 965 states and 1348 transitions. Second operand 3 states. [2019-11-28 15:40:06,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:06,826 INFO L93 Difference]: Finished difference Result 2080 states and 2926 transitions. [2019-11-28 15:40:06,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:06,827 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 209 [2019-11-28 15:40:06,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:06,834 INFO L225 Difference]: With dead ends: 2080 [2019-11-28 15:40:06,834 INFO L226 Difference]: Without dead ends: 1079 [2019-11-28 15:40:06,837 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:06,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2019-11-28 15:40:06,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1040. [2019-11-28 15:40:06,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1040 states. [2019-11-28 15:40:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1040 states to 1040 states and 1444 transitions. [2019-11-28 15:40:06,869 INFO L78 Accepts]: Start accepts. Automaton has 1040 states and 1444 transitions. Word has length 209 [2019-11-28 15:40:06,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:06,870 INFO L462 AbstractCegarLoop]: Abstraction has 1040 states and 1444 transitions. [2019-11-28 15:40:06,870 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1040 states and 1444 transitions. [2019-11-28 15:40:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-28 15:40:06,875 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:06,876 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:06,876 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:06,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:06,877 INFO L82 PathProgramCache]: Analyzing trace with hash 1859847365, now seen corresponding path program 1 times [2019-11-28 15:40:06,877 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:06,878 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485001330] [2019-11-28 15:40:06,878 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:06,993 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-28 15:40:06,994 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485001330] [2019-11-28 15:40:06,994 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:06,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:06,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452540844] [2019-11-28 15:40:06,996 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:06,996 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:06,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:06,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:06,997 INFO L87 Difference]: Start difference. First operand 1040 states and 1444 transitions. Second operand 3 states. [2019-11-28 15:40:07,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,193 INFO L93 Difference]: Finished difference Result 2230 states and 3115 transitions. [2019-11-28 15:40:07,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,194 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-28 15:40:07,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,200 INFO L225 Difference]: With dead ends: 2230 [2019-11-28 15:40:07,200 INFO L226 Difference]: Without dead ends: 1160 [2019-11-28 15:40:07,203 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:07,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2019-11-28 15:40:07,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1124. [2019-11-28 15:40:07,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1124 states. [2019-11-28 15:40:07,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1124 states to 1124 states and 1555 transitions. [2019-11-28 15:40:07,243 INFO L78 Accepts]: Start accepts. Automaton has 1124 states and 1555 transitions. Word has length 233 [2019-11-28 15:40:07,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,243 INFO L462 AbstractCegarLoop]: Abstraction has 1124 states and 1555 transitions. [2019-11-28 15:40:07,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1124 states and 1555 transitions. [2019-11-28 15:40:07,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-11-28 15:40:07,248 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,248 INFO L410 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 11, 11, 11, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:07,249 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1978288839, now seen corresponding path program 1 times [2019-11-28 15:40:07,250 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,250 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077742696] [2019-11-28 15:40:07,250 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,345 INFO L134 CoverageAnalysis]: Checked inductivity of 807 backedges. 479 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2019-11-28 15:40:07,345 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077742696] [2019-11-28 15:40:07,346 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:07,346 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:07,346 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [897532886] [2019-11-28 15:40:07,347 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:07,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:07,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,348 INFO L87 Difference]: Start difference. First operand 1124 states and 1555 transitions. Second operand 3 states. [2019-11-28 15:40:07,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,529 INFO L93 Difference]: Finished difference Result 2398 states and 3340 transitions. [2019-11-28 15:40:07,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,529 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 233 [2019-11-28 15:40:07,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,537 INFO L225 Difference]: With dead ends: 2398 [2019-11-28 15:40:07,537 INFO L226 Difference]: Without dead ends: 1256 [2019-11-28 15:40:07,539 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:07,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1256 states. [2019-11-28 15:40:07,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1256 to 1217. [2019-11-28 15:40:07,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1217 states. [2019-11-28 15:40:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1687 transitions. [2019-11-28 15:40:07,580 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1687 transitions. Word has length 233 [2019-11-28 15:40:07,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,581 INFO L462 AbstractCegarLoop]: Abstraction has 1217 states and 1687 transitions. [2019-11-28 15:40:07,582 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,583 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1687 transitions. [2019-11-28 15:40:07,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-28 15:40:07,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,588 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:07,588 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1116608197, now seen corresponding path program 1 times [2019-11-28 15:40:07,589 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,594 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804705981] [2019-11-28 15:40:07,594 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:07,694 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 622 proven. 0 refuted. 0 times theorem prover too weak. 353 trivial. 0 not checked. [2019-11-28 15:40:07,694 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804705981] [2019-11-28 15:40:07,695 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:07,695 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:07,695 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310791241] [2019-11-28 15:40:07,696 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:07,696 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:07,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:07,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,697 INFO L87 Difference]: Start difference. First operand 1217 states and 1687 transitions. Second operand 3 states. [2019-11-28 15:40:07,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:07,751 INFO L93 Difference]: Finished difference Result 3630 states and 5032 transitions. [2019-11-28 15:40:07,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:07,752 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-28 15:40:07,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:07,769 INFO L225 Difference]: With dead ends: 3630 [2019-11-28 15:40:07,770 INFO L226 Difference]: Without dead ends: 2422 [2019-11-28 15:40:07,773 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:07,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2019-11-28 15:40:07,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 2420. [2019-11-28 15:40:07,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2420 states. [2019-11-28 15:40:07,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2420 states to 2420 states and 3354 transitions. [2019-11-28 15:40:07,866 INFO L78 Accepts]: Start accepts. Automaton has 2420 states and 3354 transitions. Word has length 263 [2019-11-28 15:40:07,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:07,867 INFO L462 AbstractCegarLoop]: Abstraction has 2420 states and 3354 transitions. [2019-11-28 15:40:07,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:07,868 INFO L276 IsEmpty]: Start isEmpty. Operand 2420 states and 3354 transitions. [2019-11-28 15:40:07,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2019-11-28 15:40:07,881 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:07,881 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 12, 12, 12, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:07,882 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:07,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:07,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1235049671, now seen corresponding path program 1 times [2019-11-28 15:40:07,883 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:07,883 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702266185] [2019-11-28 15:40:07,884 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,030 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 554 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2019-11-28 15:40:08,031 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702266185] [2019-11-28 15:40:08,031 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:08,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:08,032 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971321403] [2019-11-28 15:40:08,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,033 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:08,034 INFO L87 Difference]: Start difference. First operand 2420 states and 3354 transitions. Second operand 3 states. [2019-11-28 15:40:08,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,314 INFO L93 Difference]: Finished difference Result 5143 states and 7169 transitions. [2019-11-28 15:40:08,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:08,315 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 263 [2019-11-28 15:40:08,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,334 INFO L225 Difference]: With dead ends: 5143 [2019-11-28 15:40:08,334 INFO L226 Difference]: Without dead ends: 2702 [2019-11-28 15:40:08,340 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:08,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2702 states. [2019-11-28 15:40:08,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2702 to 2630. [2019-11-28 15:40:08,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2630 states. [2019-11-28 15:40:08,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2630 states to 2630 states and 3666 transitions. [2019-11-28 15:40:08,440 INFO L78 Accepts]: Start accepts. Automaton has 2630 states and 3666 transitions. Word has length 263 [2019-11-28 15:40:08,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,441 INFO L462 AbstractCegarLoop]: Abstraction has 2630 states and 3666 transitions. [2019-11-28 15:40:08,441 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:08,442 INFO L276 IsEmpty]: Start isEmpty. Operand 2630 states and 3666 transitions. [2019-11-28 15:40:08,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-11-28 15:40:08,451 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,452 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 13, 13, 13, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:08,452 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,453 INFO L82 PathProgramCache]: Analyzing trace with hash 2135776069, now seen corresponding path program 1 times [2019-11-28 15:40:08,453 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,453 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218206209] [2019-11-28 15:40:08,454 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:08,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1169 backedges. 629 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-11-28 15:40:08,615 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218206209] [2019-11-28 15:40:08,615 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:08,615 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:08,616 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673917082] [2019-11-28 15:40:08,616 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:08,617 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:08,617 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:08,617 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:08,617 INFO L87 Difference]: Start difference. First operand 2630 states and 3666 transitions. Second operand 3 states. [2019-11-28 15:40:08,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:08,824 INFO L93 Difference]: Finished difference Result 5335 states and 7421 transitions. [2019-11-28 15:40:08,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:08,825 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 298 [2019-11-28 15:40:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:08,838 INFO L225 Difference]: With dead ends: 5335 [2019-11-28 15:40:08,839 INFO L226 Difference]: Without dead ends: 2696 [2019-11-28 15:40:08,843 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:08,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2696 states. [2019-11-28 15:40:08,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2696 to 2624. [2019-11-28 15:40:08,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-28 15:40:08,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3630 transitions. [2019-11-28 15:40:08,930 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3630 transitions. Word has length 298 [2019-11-28 15:40:08,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:08,931 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3630 transitions. [2019-11-28 15:40:08,931 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:08,932 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3630 transitions. [2019-11-28 15:40:08,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2019-11-28 15:40:08,940 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:08,941 INFO L410 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:08,941 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:08,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:08,942 INFO L82 PathProgramCache]: Analyzing trace with hash -901475869, now seen corresponding path program 1 times [2019-11-28 15:40:08,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:08,942 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512515206] [2019-11-28 15:40:08,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:08,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1175 backedges. 562 proven. 0 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-28 15:40:09,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512515206] [2019-11-28 15:40:09,048 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:09,048 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:09,048 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181250690] [2019-11-28 15:40:09,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:09,049 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:09,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:09,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:09,050 INFO L87 Difference]: Start difference. First operand 2624 states and 3630 transitions. Second operand 3 states. [2019-11-28 15:40:09,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,273 INFO L93 Difference]: Finished difference Result 5299 states and 7319 transitions. [2019-11-28 15:40:09,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:09,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 307 [2019-11-28 15:40:09,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:09,290 INFO L225 Difference]: With dead ends: 5299 [2019-11-28 15:40:09,290 INFO L226 Difference]: Without dead ends: 2684 [2019-11-28 15:40:09,294 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:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2684 states. [2019-11-28 15:40:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2684 to 2624. [2019-11-28 15:40:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2624 states. [2019-11-28 15:40:09,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2624 states to 2624 states and 3576 transitions. [2019-11-28 15:40:09,391 INFO L78 Accepts]: Start accepts. Automaton has 2624 states and 3576 transitions. Word has length 307 [2019-11-28 15:40:09,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:09,392 INFO L462 AbstractCegarLoop]: Abstraction has 2624 states and 3576 transitions. [2019-11-28 15:40:09,392 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:09,392 INFO L276 IsEmpty]: Start isEmpty. Operand 2624 states and 3576 transitions. [2019-11-28 15:40:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2019-11-28 15:40:09,404 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:09,405 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,405 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:09,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:09,406 INFO L82 PathProgramCache]: Analyzing trace with hash 503398906, now seen corresponding path program 1 times [2019-11-28 15:40:09,406 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:09,407 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839673873] [2019-11-28 15:40:09,407 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:09,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:09,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 731 proven. 0 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-28 15:40:09,589 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839673873] [2019-11-28 15:40:09,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:09,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:09,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686599396] [2019-11-28 15:40:09,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:09,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:09,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:09,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:09,592 INFO L87 Difference]: Start difference. First operand 2624 states and 3576 transitions. Second operand 3 states. [2019-11-28 15:40:09,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:09,779 INFO L93 Difference]: Finished difference Result 5545 states and 7499 transitions. [2019-11-28 15:40:09,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:09,780 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 335 [2019-11-28 15:40:09,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:09,794 INFO L225 Difference]: With dead ends: 5545 [2019-11-28 15:40:09,794 INFO L226 Difference]: Without dead ends: 2930 [2019-11-28 15:40:09,798 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:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2930 states. [2019-11-28 15:40:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2930 to 2714. [2019-11-28 15:40:09,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2714 states. [2019-11-28 15:40:09,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2714 states to 2714 states and 3696 transitions. [2019-11-28 15:40:09,873 INFO L78 Accepts]: Start accepts. Automaton has 2714 states and 3696 transitions. Word has length 335 [2019-11-28 15:40:09,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:09,874 INFO L462 AbstractCegarLoop]: Abstraction has 2714 states and 3696 transitions. [2019-11-28 15:40:09,874 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:09,874 INFO L276 IsEmpty]: Start isEmpty. Operand 2714 states and 3696 transitions. [2019-11-28 15:40:09,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2019-11-28 15:40:09,883 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:09,884 INFO L410 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 14, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09,884 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:09,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:09,885 INFO L82 PathProgramCache]: Analyzing trace with hash -121520003, now seen corresponding path program 1 times [2019-11-28 15:40:09,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:09,885 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446616131] [2019-11-28 15:40:09,885 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1420 backedges. 871 proven. 0 refuted. 0 times theorem prover too weak. 549 trivial. 0 not checked. [2019-11-28 15:40:10,029 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446616131] [2019-11-28 15:40:10,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:10,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:10,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763802666] [2019-11-28 15:40:10,032 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:10,032 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:10,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:10,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:10,033 INFO L87 Difference]: Start difference. First operand 2714 states and 3696 transitions. Second operand 3 states. [2019-11-28 15:40:10,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:10,120 INFO L93 Difference]: Finished difference Result 7734 states and 10582 transitions. [2019-11-28 15:40:10,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:10,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 336 [2019-11-28 15:40:10,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:10,143 INFO L225 Difference]: With dead ends: 7734 [2019-11-28 15:40:10,144 INFO L226 Difference]: Without dead ends: 5029 [2019-11-28 15:40:10,149 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:10,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5029 states. [2019-11-28 15:40:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5029 to 5027. [2019-11-28 15:40:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5027 states. [2019-11-28 15:40:10,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5027 states to 5027 states and 6880 transitions. [2019-11-28 15:40:10,273 INFO L78 Accepts]: Start accepts. Automaton has 5027 states and 6880 transitions. Word has length 336 [2019-11-28 15:40:10,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:10,274 INFO L462 AbstractCegarLoop]: Abstraction has 5027 states and 6880 transitions. [2019-11-28 15:40:10,274 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 5027 states and 6880 transitions. [2019-11-28 15:40:10,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2019-11-28 15:40:10,285 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:10,286 INFO L410 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:10,286 INFO L410 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:10,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:10,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1651416633, now seen corresponding path program 1 times [2019-11-28 15:40:10,287 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:10,287 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864043446] [2019-11-28 15:40:10,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:10,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-28 15:40:10,419 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864043446] [2019-11-28 15:40:10,420 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [850870729] [2019-11-28 15:40:10,420 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:10,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:10,598 INFO L264 TraceCheckSpWp]: Trace formula consists of 623 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:10,624 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:10,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1416 backedges. 791 proven. 12 refuted. 0 times theorem prover too weak. 613 trivial. 0 not checked. [2019-11-28 15:40:10,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:10,890 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:10,891 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30045282] [2019-11-28 15:40:10,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:10,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:10,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:10,893 INFO L87 Difference]: Start difference. First operand 5027 states and 6880 transitions. Second operand 4 states. [2019-11-28 15:40:11,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:11,337 INFO L93 Difference]: Finished difference Result 9987 states and 13646 transitions. [2019-11-28 15:40:11,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-28 15:40:11,338 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 346 [2019-11-28 15:40:11,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:11,354 INFO L225 Difference]: With dead ends: 9987 [2019-11-28 15:40:11,354 INFO L226 Difference]: Without dead ends: 7540 [2019-11-28 15:40:11,361 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 348 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:11,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7540 states. [2019-11-28 15:40:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7540 to 5561. [2019-11-28 15:40:11,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5561 states. [2019-11-28 15:40:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5561 states to 5561 states and 7516 transitions. [2019-11-28 15:40:11,563 INFO L78 Accepts]: Start accepts. Automaton has 5561 states and 7516 transitions. Word has length 346 [2019-11-28 15:40:11,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:11,564 INFO L462 AbstractCegarLoop]: Abstraction has 5561 states and 7516 transitions. [2019-11-28 15:40:11,564 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:11,565 INFO L276 IsEmpty]: Start isEmpty. Operand 5561 states and 7516 transitions. [2019-11-28 15:40:11,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2019-11-28 15:40:11,578 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:11,579 INFO L410 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 15, 15, 15, 15, 15, 13, 13, 11, 11, 9, 9, 7, 7, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:11,787 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:11,787 INFO L410 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:11,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:11,788 INFO L82 PathProgramCache]: Analyzing trace with hash -1397611342, now seen corresponding path program 1 times [2019-11-28 15:40:11,788 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:11,788 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682010825] [2019-11-28 15:40:11,789 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:11,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-28 15:40:12,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682010825] [2019-11-28 15:40:12,131 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040336765] [2019-11-28 15:40:12,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:12,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:12,285 INFO L264 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:12,308 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:12,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1649 backedges. 955 proven. 5 refuted. 0 times theorem prover too weak. 689 trivial. 0 not checked. [2019-11-28 15:40:12,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:12,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:12,490 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413557725] [2019-11-28 15:40:12,491 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:12,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:12,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:12,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:12,492 INFO L87 Difference]: Start difference. First operand 5561 states and 7516 transitions. Second operand 4 states. [2019-11-28 15:40:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:12,996 INFO L93 Difference]: Finished difference Result 12544 states and 16972 transitions. [2019-11-28 15:40:12,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:40:12,997 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 373 [2019-11-28 15:40:12,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,019 INFO L225 Difference]: With dead ends: 12544 [2019-11-28 15:40:13,019 INFO L226 Difference]: Without dead ends: 6979 [2019-11-28 15:40:13,032 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 378 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:13,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6979 states. [2019-11-28 15:40:13,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6979 to 5709. [2019-11-28 15:40:13,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5709 states. [2019-11-28 15:40:13,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5709 states to 5709 states and 7634 transitions. [2019-11-28 15:40:13,187 INFO L78 Accepts]: Start accepts. Automaton has 5709 states and 7634 transitions. Word has length 373 [2019-11-28 15:40:13,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,188 INFO L462 AbstractCegarLoop]: Abstraction has 5709 states and 7634 transitions. [2019-11-28 15:40:13,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:13,189 INFO L276 IsEmpty]: Start isEmpty. Operand 5709 states and 7634 transitions. [2019-11-28 15:40:13,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2019-11-28 15:40:13,198 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,199 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 16, 16, 16, 14, 14, 12, 12, 10, 10, 8, 8, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,411 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:13,412 INFO L410 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,413 INFO L82 PathProgramCache]: Analyzing trace with hash -236946382, now seen corresponding path program 1 times [2019-11-28 15:40:13,414 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,414 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12255448] [2019-11-28 15:40:13,414 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:13,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1970 backedges. 885 proven. 0 refuted. 0 times theorem prover too weak. 1085 trivial. 0 not checked. [2019-11-28 15:40:13,570 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12255448] [2019-11-28 15:40:13,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:13,575 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:13,575 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1551423084] [2019-11-28 15:40:13,576 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:13,576 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:13,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:13,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:13,577 INFO L87 Difference]: Start difference. First operand 5709 states and 7634 transitions. Second operand 3 states. [2019-11-28 15:40:13,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:13,837 INFO L93 Difference]: Finished difference Result 11015 states and 14510 transitions. [2019-11-28 15:40:13,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:13,838 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 412 [2019-11-28 15:40:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:13,848 INFO L225 Difference]: With dead ends: 11015 [2019-11-28 15:40:13,849 INFO L226 Difference]: Without dead ends: 3069 [2019-11-28 15:40:13,862 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:13,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3069 states. [2019-11-28 15:40:13,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3069 to 2976. [2019-11-28 15:40:13,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-11-28 15:40:13,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 3983 transitions. [2019-11-28 15:40:13,951 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 3983 transitions. Word has length 412 [2019-11-28 15:40:13,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:13,951 INFO L462 AbstractCegarLoop]: Abstraction has 2976 states and 3983 transitions. [2019-11-28 15:40:13,952 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:13,952 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 3983 transitions. [2019-11-28 15:40:13,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2019-11-28 15:40:13,960 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:13,961 INFO L410 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 17, 17, 15, 15, 13, 13, 11, 11, 9, 9, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:13,962 INFO L410 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:13,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:13,962 INFO L82 PathProgramCache]: Analyzing trace with hash -788979008, now seen corresponding path program 1 times [2019-11-28 15:40:13,963 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:13,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071201890] [2019-11-28 15:40:13,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:13,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,374 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1571 proven. 14 refuted. 0 times theorem prover too weak. 1126 trivial. 0 not checked. [2019-11-28 15:40:14,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071201890] [2019-11-28 15:40:14,375 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [469007705] [2019-11-28 15:40:14,375 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:14,596 INFO L264 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:14,605 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:14,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2711 backedges. 1018 proven. 0 refuted. 0 times theorem prover too weak. 1693 trivial. 0 not checked. [2019-11-28 15:40:14,986 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:14,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:14,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984361328] [2019-11-28 15:40:14,987 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:14,987 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:14,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:14,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:14,988 INFO L87 Difference]: Start difference. First operand 2976 states and 3983 transitions. Second operand 3 states. [2019-11-28 15:40:15,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:15,018 INFO L93 Difference]: Finished difference Result 3028 states and 4049 transitions. [2019-11-28 15:40:15,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:15,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 496 [2019-11-28 15:40:15,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:15,024 INFO L225 Difference]: With dead ends: 3028 [2019-11-28 15:40:15,024 INFO L226 Difference]: Without dead ends: 2531 [2019-11-28 15:40:15,026 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 499 GetRequests, 496 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:15,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2531 states. [2019-11-28 15:40:15,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2531 to 2481. [2019-11-28 15:40:15,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2481 states. [2019-11-28 15:40:15,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2481 states to 2481 states and 3319 transitions. [2019-11-28 15:40:15,073 INFO L78 Accepts]: Start accepts. Automaton has 2481 states and 3319 transitions. Word has length 496 [2019-11-28 15:40:15,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:15,074 INFO L462 AbstractCegarLoop]: Abstraction has 2481 states and 3319 transitions. [2019-11-28 15:40:15,074 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:15,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2481 states and 3319 transitions. [2019-11-28 15:40:15,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2019-11-28 15:40:15,080 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:15,081 INFO L410 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 16, 16, 14, 14, 13, 13, 12, 12, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:15,289 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:15,289 INFO L410 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:15,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:15,290 INFO L82 PathProgramCache]: Analyzing trace with hash 866163585, now seen corresponding path program 1 times [2019-11-28 15:40:15,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:15,291 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113961080] [2019-11-28 15:40:15,291 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:15,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 1546 proven. 14 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2019-11-28 15:40:15,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113961080] [2019-11-28 15:40:15,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [199773365] [2019-11-28 15:40:15,549 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:15,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:15,757 INFO L264 TraceCheckSpWp]: Trace formula consists of 813 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-28 15:40:15,762 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:16,103 INFO L134 CoverageAnalysis]: Checked inductivity of 2607 backedges. 268 proven. 0 refuted. 0 times theorem prover too weak. 2339 trivial. 0 not checked. [2019-11-28 15:40:16,104 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-28 15:40:16,104 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2019-11-28 15:40:16,105 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872225995] [2019-11-28 15:40:16,109 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:16,109 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:16,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:16,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:16,110 INFO L87 Difference]: Start difference. First operand 2481 states and 3319 transitions. Second operand 3 states. [2019-11-28 15:40:16,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:16,329 INFO L93 Difference]: Finished difference Result 5060 states and 6783 transitions. [2019-11-28 15:40:16,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:16,330 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 497 [2019-11-28 15:40:16,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:16,336 INFO L225 Difference]: With dead ends: 5060 [2019-11-28 15:40:16,336 INFO L226 Difference]: Without dead ends: 2589 [2019-11-28 15:40:16,340 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 497 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-28 15:40:16,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2589 states. [2019-11-28 15:40:16,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2589 to 2586. [2019-11-28 15:40:16,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2586 states. [2019-11-28 15:40:16,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2586 states to 2586 states and 3331 transitions. [2019-11-28 15:40:16,393 INFO L78 Accepts]: Start accepts. Automaton has 2586 states and 3331 transitions. Word has length 497 [2019-11-28 15:40:16,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:16,394 INFO L462 AbstractCegarLoop]: Abstraction has 2586 states and 3331 transitions. [2019-11-28 15:40:16,394 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:16,395 INFO L276 IsEmpty]: Start isEmpty. Operand 2586 states and 3331 transitions. [2019-11-28 15:40:16,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 609 [2019-11-28 15:40:16,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:16,403 INFO L410 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 19, 19, 17, 17, 16, 16, 15, 15, 13, 13, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 8, 8, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:16,616 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:16,616 INFO L410 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:16,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:16,617 INFO L82 PathProgramCache]: Analyzing trace with hash -1604973917, now seen corresponding path program 2 times [2019-11-28 15:40:16,618 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:16,618 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089331918] [2019-11-28 15:40:16,618 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:16,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:17,020 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-28 15:40:17,021 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089331918] [2019-11-28 15:40:17,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619395116] [2019-11-28 15:40:17,022 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:17,242 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-28 15:40:17,242 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-28 15:40:17,245 INFO L264 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-28 15:40:17,251 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-11-28 15:40:17,539 INFO L134 CoverageAnalysis]: Checked inductivity of 3928 backedges. 2054 proven. 14 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2019-11-28 15:40:17,540 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-28 15:40:17,540 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2019-11-28 15:40:17,541 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333043171] [2019-11-28 15:40:17,542 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-28 15:40:17,542 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:17,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-28 15:40:17,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-28 15:40:17,543 INFO L87 Difference]: Start difference. First operand 2586 states and 3331 transitions. Second operand 4 states. [2019-11-28 15:40:17,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:17,770 INFO L93 Difference]: Finished difference Result 2848 states and 3664 transitions. [2019-11-28 15:40:17,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-28 15:40:17,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 608 [2019-11-28 15:40:17,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:17,773 INFO L225 Difference]: With dead ends: 2848 [2019-11-28 15:40:17,773 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:17,777 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 610 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:17,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:17,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:17,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:17,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:17,780 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 608 [2019-11-28 15:40:17,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:17,781 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:17,781 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-28 15:40:17,781 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:17,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:18,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-28 15:40:18,028 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:18,511 WARN L192 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 253 DAG size of output: 111 [2019-11-28 15:40:19,614 WARN L192 SmtUtils]: Spent 541.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 50 [2019-11-28 15:40:19,816 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 7 [2019-11-28 15:40:20,034 INFO L242 CegarLoopResult]: At program point L201(lines 197 514) the Hoare annotation is: (let ((.cse1 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-28 15:40:20,035 INFO L242 CegarLoopResult]: At program point L135(lines 131 536) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,035 INFO L246 CegarLoopResult]: For program point L102(lines 102 104) no Hoare annotation was computed. [2019-11-28 15:40:20,035 INFO L246 CegarLoopResult]: For program point L235(lines 235 251) no Hoare annotation was computed. [2019-11-28 15:40:20,035 INFO L246 CegarLoopResult]: For program point L235-2(lines 210 508) no Hoare annotation was computed. [2019-11-28 15:40:20,035 INFO L246 CegarLoopResult]: For program point L467(lines 467 479) no Hoare annotation was computed. [2019-11-28 15:40:20,035 INFO L246 CegarLoopResult]: For program point L434(lines 434 448) no Hoare annotation was computed. [2019-11-28 15:40:20,035 INFO L246 CegarLoopResult]: For program point L434-1(lines 434 448) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L467-2(lines 467 479) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L335(lines 335 338) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L269(lines 269 271) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L203(lines 203 512) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L269-2(lines 210 508) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L170(lines 170 523) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L137(lines 137 534) no Hoare annotation was computed. [2019-11-28 15:40:20,036 INFO L246 CegarLoopResult]: For program point L501(lines 501 503) no Hoare annotation was computed. [2019-11-28 15:40:20,037 INFO L242 CegarLoopResult]: At program point L204(lines 203 512) the Hoare annotation is: (let ((.cse1 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse2 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (not .cse0) .cse1 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse2) (and .cse1 .cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)))) [2019-11-28 15:40:20,038 INFO L242 CegarLoopResult]: At program point L171(lines 161 526) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4480) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,040 INFO L246 CegarLoopResult]: For program point L568(lines 568 570) no Hoare annotation was computed. [2019-11-28 15:40:20,040 INFO L246 CegarLoopResult]: For program point L568-2(lines 568 570) no Hoare annotation was computed. [2019-11-28 15:40:20,041 INFO L246 CegarLoopResult]: For program point L370(lines 370 372) no Hoare annotation was computed. [2019-11-28 15:40:20,041 INFO L246 CegarLoopResult]: For program point L404(lines 404 406) no Hoare annotation was computed. [2019-11-28 15:40:20,043 INFO L246 CegarLoopResult]: For program point L206(lines 206 511) no Hoare annotation was computed. [2019-11-28 15:40:20,043 INFO L246 CegarLoopResult]: For program point L173(lines 173 522) no Hoare annotation was computed. [2019-11-28 15:40:20,044 INFO L246 CegarLoopResult]: For program point L140(lines 140 533) no Hoare annotation was computed. [2019-11-28 15:40:20,044 INFO L246 CegarLoopResult]: For program point L107-1(lines 84 574) no Hoare annotation was computed. [2019-11-28 15:40:20,044 INFO L246 CegarLoopResult]: For program point L438(lines 438 444) no Hoare annotation was computed. [2019-11-28 15:40:20,044 INFO L249 CegarLoopResult]: At program point L207(lines 206 511) the Hoare annotation is: true [2019-11-28 15:40:20,044 INFO L242 CegarLoopResult]: At program point L141(lines 137 534) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432)) (.cse1 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse2 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (or (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse0 .cse1 .cse2 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) .cse0 .cse1 .cse2))) [2019-11-28 15:40:20,045 INFO L246 CegarLoopResult]: For program point L108(line 108) no Hoare annotation was computed. [2019-11-28 15:40:20,045 INFO L246 CegarLoopResult]: For program point L241(lines 241 244) no Hoare annotation was computed. [2019-11-28 15:40:20,045 INFO L246 CegarLoopResult]: For program point L473(lines 473 476) no Hoare annotation was computed. [2019-11-28 15:40:20,045 INFO L249 CegarLoopResult]: At program point L209(lines 208 511) the Hoare annotation is: true [2019-11-28 15:40:20,045 INFO L246 CegarLoopResult]: For program point L176(lines 176 521) no Hoare annotation was computed. [2019-11-28 15:40:20,046 INFO L246 CegarLoopResult]: For program point L143(lines 143 532) no Hoare annotation was computed. [2019-11-28 15:40:20,046 INFO L246 CegarLoopResult]: For program point L110(lines 110 543) no Hoare annotation was computed. [2019-11-28 15:40:20,046 INFO L249 CegarLoopResult]: At program point L573(lines 10 575) the Hoare annotation is: true [2019-11-28 15:40:20,046 INFO L246 CegarLoopResult]: For program point L309(lines 309 319) no Hoare annotation was computed. [2019-11-28 15:40:20,046 INFO L246 CegarLoopResult]: For program point L309-2(lines 309 319) no Hoare annotation was computed. [2019-11-28 15:40:20,047 INFO L242 CegarLoopResult]: At program point L177(lines 173 522) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,048 INFO L242 CegarLoopResult]: At program point L111(lines 110 543) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (= 12292 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,048 INFO L246 CegarLoopResult]: For program point L343(lines 343 345) no Hoare annotation was computed. [2019-11-28 15:40:20,050 INFO L242 CegarLoopResult]: At program point L509(lines 107 562) the Hoare annotation is: (let ((.cse8 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0))) (let ((.cse4 (<= ULTIMATE.start_ssl3_connect_~s__state~0 3)) (.cse2 (<= 4560 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse3 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560)) (.cse12 (<= 4560 ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0)) (.cse5 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560)) (.cse7 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4)) (.cse1 (not .cse8)) (.cse10 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4352)) (.cse11 (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse9 (= 4400 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse6 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2))) (or (and .cse0 (= 4368 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse1 .cse2 .cse3 .cse0) (and .cse4 .cse5) (and .cse6 .cse7 .cse8 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse7 .cse8 .cse5 .cse9) (and .cse0 .cse4 .cse8) (and .cse10 .cse11 .cse12 .cse8 .cse5) (and .cse2 .cse3 .cse12 .cse8 .cse5) (and (= 4416 ULTIMATE.start_ssl3_connect_~s__state~0) .cse7 .cse8) (and .cse1 .cse10 .cse0 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 3) .cse11) (and .cse0 (= 4384 ULTIMATE.start_ssl3_connect_~s__state~0)) (and .cse0 .cse8 .cse9) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse6 .cse0)))) [2019-11-28 15:40:20,050 INFO L246 CegarLoopResult]: For program point L410(lines 410 414) no Hoare annotation was computed. [2019-11-28 15:40:20,050 INFO L242 CegarLoopResult]: At program point L344(lines 84 574) the Hoare annotation is: false [2019-11-28 15:40:20,051 INFO L246 CegarLoopResult]: For program point L410-2(lines 210 508) no Hoare annotation was computed. [2019-11-28 15:40:20,051 INFO L246 CegarLoopResult]: For program point L179(lines 179 520) no Hoare annotation was computed. [2019-11-28 15:40:20,051 INFO L246 CegarLoopResult]: For program point L146(lines 146 531) no Hoare annotation was computed. [2019-11-28 15:40:20,051 INFO L246 CegarLoopResult]: For program point L113(lines 113 542) no Hoare annotation was computed. [2019-11-28 15:40:20,051 INFO L246 CegarLoopResult]: For program point L246(lines 246 249) no Hoare annotation was computed. [2019-11-28 15:40:20,052 INFO L242 CegarLoopResult]: At program point L147(lines 143 532) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) [2019-11-28 15:40:20,052 INFO L246 CegarLoopResult]: For program point L544(lines 544 560) no Hoare annotation was computed. [2019-11-28 15:40:20,052 INFO L246 CegarLoopResult]: For program point L379(lines 379 381) no Hoare annotation was computed. [2019-11-28 15:40:20,052 INFO L246 CegarLoopResult]: For program point L346(lines 346 348) no Hoare annotation was computed. [2019-11-28 15:40:20,052 INFO L246 CegarLoopResult]: For program point L313(lines 313 315) no Hoare annotation was computed. [2019-11-28 15:40:20,052 INFO L246 CegarLoopResult]: For program point L280(lines 280 282) no Hoare annotation was computed. [2019-11-28 15:40:20,053 INFO L246 CegarLoopResult]: For program point L313-2(lines 311 319) no Hoare annotation was computed. [2019-11-28 15:40:20,053 INFO L246 CegarLoopResult]: For program point L545(lines 545 559) no Hoare annotation was computed. [2019-11-28 15:40:20,053 INFO L242 CegarLoopResult]: At program point L215(lines 113 542) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)) [2019-11-28 15:40:20,053 INFO L246 CegarLoopResult]: For program point L182(lines 182 519) no Hoare annotation was computed. [2019-11-28 15:40:20,053 INFO L246 CegarLoopResult]: For program point L149(lines 149 530) no Hoare annotation was computed. [2019-11-28 15:40:20,054 INFO L246 CegarLoopResult]: For program point L116(lines 116 541) no Hoare annotation was computed. [2019-11-28 15:40:20,054 INFO L246 CegarLoopResult]: For program point L546(lines 546 551) no Hoare annotation was computed. [2019-11-28 15:40:20,054 INFO L246 CegarLoopResult]: For program point L546-2(lines 545 559) no Hoare annotation was computed. [2019-11-28 15:40:20,054 INFO L242 CegarLoopResult]: At program point L183(lines 179 520) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4512) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,054 INFO L246 CegarLoopResult]: For program point L548(lines 548 550) no Hoare annotation was computed. [2019-11-28 15:40:20,055 INFO L246 CegarLoopResult]: For program point L383(lines 383 388) no Hoare annotation was computed. [2019-11-28 15:40:20,055 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:20,055 INFO L246 CegarLoopResult]: For program point L383-2(lines 383 388) no Hoare annotation was computed. [2019-11-28 15:40:20,055 INFO L246 CegarLoopResult]: For program point L185(lines 185 518) no Hoare annotation was computed. [2019-11-28 15:40:20,055 INFO L246 CegarLoopResult]: For program point L152(lines 152 529) no Hoare annotation was computed. [2019-11-28 15:40:20,055 INFO L246 CegarLoopResult]: For program point L119(lines 119 540) no Hoare annotation was computed. [2019-11-28 15:40:20,056 INFO L242 CegarLoopResult]: At program point L153(lines 149 530) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4448) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,057 INFO L246 CegarLoopResult]: For program point L484-1(lines 484 486) no Hoare annotation was computed. [2019-11-28 15:40:20,057 INFO L246 CegarLoopResult]: For program point L220(lines 220 222) no Hoare annotation was computed. [2019-11-28 15:40:20,057 INFO L246 CegarLoopResult]: For program point L220-2(lines 220 222) no Hoare annotation was computed. [2019-11-28 15:40:20,057 INFO L249 CegarLoopResult]: At program point L584(lines 576 586) the Hoare annotation is: true [2019-11-28 15:40:20,057 INFO L246 CegarLoopResult]: For program point L419(lines 419 422) no Hoare annotation was computed. [2019-11-28 15:40:20,058 INFO L246 CegarLoopResult]: For program point L188(lines 188 517) no Hoare annotation was computed. [2019-11-28 15:40:20,058 INFO L246 CegarLoopResult]: For program point L155(lines 155 528) no Hoare annotation was computed. [2019-11-28 15:40:20,058 INFO L246 CegarLoopResult]: For program point L122(lines 122 539) no Hoare annotation was computed. [2019-11-28 15:40:20,058 INFO L246 CegarLoopResult]: For program point L288(lines 288 294) no Hoare annotation was computed. [2019-11-28 15:40:20,058 INFO L242 CegarLoopResult]: At program point L189(lines 185 518) the Hoare annotation is: (let ((.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4528))) (or (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-28 15:40:20,059 INFO L246 CegarLoopResult]: For program point L553(lines 553 557) no Hoare annotation was computed. [2019-11-28 15:40:20,059 INFO L246 CegarLoopResult]: For program point L454(lines 454 456) no Hoare annotation was computed. [2019-11-28 15:40:20,059 INFO L246 CegarLoopResult]: For program point L355(lines 355 357) no Hoare annotation was computed. [2019-11-28 15:40:20,059 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:20,060 INFO L246 CegarLoopResult]: For program point L257(lines 257 260) no Hoare annotation was computed. [2019-11-28 15:40:20,061 INFO L246 CegarLoopResult]: For program point L191(lines 191 516) no Hoare annotation was computed. [2019-11-28 15:40:20,061 INFO L246 CegarLoopResult]: For program point L158(lines 158 527) no Hoare annotation was computed. [2019-11-28 15:40:20,061 INFO L246 CegarLoopResult]: For program point L125(lines 125 538) no Hoare annotation was computed. [2019-11-28 15:40:20,061 INFO L246 CegarLoopResult]: For program point L291(lines 291 293) no Hoare annotation was computed. [2019-11-28 15:40:20,061 INFO L246 CegarLoopResult]: For program point L225(lines 225 228) no Hoare annotation was computed. [2019-11-28 15:40:20,062 INFO L246 CegarLoopResult]: For program point L291-2(lines 210 508) no Hoare annotation was computed. [2019-11-28 15:40:20,062 INFO L242 CegarLoopResult]: At program point L159(lines 155 528) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~s__state~0 4464) (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0) (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,062 INFO L246 CegarLoopResult]: For program point L93(lines 93 99) no Hoare annotation was computed. [2019-11-28 15:40:20,062 INFO L246 CegarLoopResult]: For program point L490(lines 490 492) no Hoare annotation was computed. [2019-11-28 15:40:20,062 INFO L246 CegarLoopResult]: For program point L457(lines 457 461) no Hoare annotation was computed. [2019-11-28 15:40:20,062 INFO L246 CegarLoopResult]: For program point L490-2(lines 490 492) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L457-2(lines 457 461) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L358(lines 358 362) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L358-2(lines 358 362) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L194(lines 194 515) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L161(lines 161 526) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L128(lines 128 537) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L327(lines 327 329) no Hoare annotation was computed. [2019-11-28 15:40:20,063 INFO L246 CegarLoopResult]: For program point L327-2(lines 210 508) no Hoare annotation was computed. [2019-11-28 15:40:20,064 INFO L242 CegarLoopResult]: At program point L195(lines 191 516) the Hoare annotation is: (let ((.cse1 (= 0 ULTIMATE.start_ssl3_connect_~s__hit~0)) (.cse2 (<= 4432 ULTIMATE.start_ssl3_connect_~s__state~0)) (.cse0 (<= ULTIMATE.start_ssl3_connect_~s__state~0 4560))) (or (and .cse0 .cse1 (<= ULTIMATE.start_ssl3_connect_~s__s3__tmp__next_state___0~0 4560) .cse2) (and .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 4) .cse1 .cse2) (and (<= 4512 ULTIMATE.start_ssl3_connect_~s__state~0) .cse0 (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2)))) [2019-11-28 15:40:20,064 INFO L242 CegarLoopResult]: At program point L129(lines 125 538) the Hoare annotation is: (and (<= ULTIMATE.start_ssl3_connect_~blastFlag~0 2) (<= ULTIMATE.start_ssl3_connect_~s__state~0 4432) (<= 4352 ULTIMATE.start_ssl3_connect_~s__state~0)) [2019-11-28 15:40:20,064 INFO L246 CegarLoopResult]: For program point L96(lines 96 98) no Hoare annotation was computed. [2019-11-28 15:40:20,064 INFO L246 CegarLoopResult]: For program point L96-2(lines 93 99) no Hoare annotation was computed. [2019-11-28 15:40:20,064 INFO L246 CegarLoopResult]: For program point L427(lines 427 429) no Hoare annotation was computed. [2019-11-28 15:40:20,064 INFO L246 CegarLoopResult]: For program point L394(lines 394 396) no Hoare annotation was computed. [2019-11-28 15:40:20,064 INFO L246 CegarLoopResult]: For program point L197(lines 197 514) no Hoare annotation was computed. [2019-11-28 15:40:20,065 INFO L246 CegarLoopResult]: For program point L164(lines 164 525) no Hoare annotation was computed. [2019-11-28 15:40:20,065 INFO L246 CegarLoopResult]: For program point L131(lines 131 536) no Hoare annotation was computed. [2019-11-28 15:40:20,065 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 572) no Hoare annotation was computed. [2019-11-28 15:40:20,065 INFO L246 CegarLoopResult]: For program point L496(lines 496 498) no Hoare annotation was computed. [2019-11-28 15:40:20,065 INFO L246 CegarLoopResult]: For program point L496-2(lines 496 498) no Hoare annotation was computed. [2019-11-28 15:40:20,065 INFO L246 CegarLoopResult]: For program point L298(lines 298 302) no Hoare annotation was computed. [2019-11-28 15:40:20,066 INFO L246 CegarLoopResult]: For program point L298-2(lines 298 302) no Hoare annotation was computed. [2019-11-28 15:40:20,066 INFO L249 CegarLoopResult]: At program point L563(lines 106 564) the Hoare annotation is: true [2019-11-28 15:40:20,066 INFO L246 CegarLoopResult]: For program point L200(lines 200 513) no Hoare annotation was computed. [2019-11-28 15:40:20,066 INFO L246 CegarLoopResult]: For program point L167(lines 167 524) no Hoare annotation was computed. [2019-11-28 15:40:20,066 INFO L246 CegarLoopResult]: For program point L134(lines 134 535) no Hoare annotation was computed. [2019-11-28 15:40:20,067 INFO L246 CegarLoopResult]: For program point L101(lines 101 105) no Hoare annotation was computed. [2019-11-28 15:40:20,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:20 BoogieIcfgContainer [2019-11-28 15:40:20,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:20,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:20,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:20,094 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:20,094 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:03" (3/4) ... [2019-11-28 15:40:20,098 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:20,118 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-11-28 15:40:20,119 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:20,266 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:20,267 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:20,268 INFO L168 Benchmark]: Toolchain (without parser) took 18502.03 ms. Allocated memory was 1.0 GB in the beginning and 2.0 GB in the end (delta: 996.1 MB). Free memory was 960.4 MB in the beginning and 1.6 GB in the end (delta: -636.6 MB). Peak memory consumption was 359.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,269 INFO L168 Benchmark]: CDTParser took 0.25 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:20,269 INFO L168 Benchmark]: CACSL2BoogieTranslator took 497.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,269 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.60 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:20,270 INFO L168 Benchmark]: Boogie Preprocessor took 60.69 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:20,270 INFO L168 Benchmark]: RCFGBuilder took 836.87 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: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,271 INFO L168 Benchmark]: TraceAbstraction took 16852.24 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 860.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -554.8 MB). Peak memory consumption was 305.6 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,271 INFO L168 Benchmark]: Witness Printer took 173.66 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:20,273 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.25 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 497.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.8 MB). Free memory was 960.4 MB in the beginning and 1.1 GB in the end (delta: -165.0 MB). Peak memory consumption was 26.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 74.60 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. * Boogie Preprocessor took 60.69 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. * RCFGBuilder took 836.87 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: 53.6 MB). Peak memory consumption was 53.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 16852.24 ms. Allocated memory was 1.2 GB in the beginning and 2.0 GB in the end (delta: 860.4 MB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -554.8 MB). Peak memory consumption was 305.6 MB. Max. memory is 11.5 GB. * Witness Printer took 173.66 ms. Allocated memory is still 2.0 GB. Free memory was 1.6 GB in the beginning and 1.6 GB in the end (delta: 23.0 MB). Peak memory consumption was 23.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 572]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 110]: Loop Invariant Derived loop invariant: blastFlag <= 2 && 12292 == s__state - InvariantResult [Line: 206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 84]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 173]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 208]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 131]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 185]: Loop Invariant Derived loop invariant: (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 143]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit - InvariantResult [Line: 197]: Loop Invariant Derived loop invariant: (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 155]: Loop Invariant Derived loop invariant: ((s__state <= 4464 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 106]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 161]: Loop Invariant Derived loop invariant: ((s__state <= 4480 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 10]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 107]: Loop Invariant Derived loop invariant: ((((((((((((blastFlag <= 2 && 4368 == s__state) || (((!(0 == s__hit) && 4560 <= s__state) && s__state <= 4560) && blastFlag <= 2)) || (s__state <= 3 && s__s3__tmp__next_state___0 <= 4560)) || (((s__state <= 4528 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || (((blastFlag <= 4 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4400 == s__state)) || ((blastFlag <= 2 && s__state <= 3) && 0 == s__hit)) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((((4560 <= s__state && s__state <= 4560) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560)) || ((4416 == s__state && blastFlag <= 4) && 0 == s__hit)) || ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state)) || (blastFlag <= 2 && 4384 == s__state)) || ((blastFlag <= 2 && 0 == s__hit) && 4400 == s__state)) || ((4512 <= s__state && s__state <= 4528) && blastFlag <= 2) - InvariantResult [Line: 125]: Loop Invariant Derived loop invariant: (blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state - InvariantResult [Line: 203]: Loop Invariant Derived loop invariant: ((((!(0 == s__hit) && s__state <= 4352) && blastFlag <= 2) && s__s3__tmp__next_state___0 <= 3) && 4352 <= s__state) || ((((s__state <= 4352 && 4352 <= s__state) && 4560 <= s__s3__tmp__next_state___0) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) - InvariantResult [Line: 113]: Loop Invariant Derived loop invariant: s__state <= 4560 && blastFlag <= 2 - InvariantResult [Line: 179]: Loop Invariant Derived loop invariant: ((s__state <= 4512 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state - InvariantResult [Line: 137]: Loop Invariant Derived loop invariant: ((((blastFlag <= 4 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) || (((blastFlag <= 2 && s__state <= 4432) && 4352 <= s__state) && 0 == s__hit) - InvariantResult [Line: 191]: Loop Invariant Derived loop invariant: ((((s__state <= 4560 && 0 == s__hit) && s__s3__tmp__next_state___0 <= 4560) && 4432 <= s__state) || (((s__state <= 4560 && blastFlag <= 4) && 0 == s__hit) && 4432 <= s__state)) || ((4512 <= s__state && s__state <= 4560) && blastFlag <= 2) - InvariantResult [Line: 149]: Loop Invariant Derived loop invariant: ((blastFlag <= 4 && s__state <= 4448) && 0 == s__hit) && 4432 <= s__state - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 127 locations, 1 error locations. Result: SAFE, OverallTime: 14.7s, OverallIterations: 25, TraceHistogramMax: 21, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.0s, HoareTripleCheckerStatistics: 4490 SDtfs, 2114 SDslu, 2318 SDs, 0 SdLazy, 2460 SolverSat, 611 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2400 GetRequests, 2365 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5709occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 25 MinimizatonAttempts, 4032 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 22 LocationsWithAnnotation, 22 PreInvPairs, 155 NumberOfFragments, 425 HoareAnnotationTreeSize, 22 FomulaSimplifications, 31460 FormulaSimplificationTreeSizeReduction, 0.6s HoareSimplificationTime, 22 FomulaSimplificationsInter, 24851 FormulaSimplificationTreeSizeReductionInter, 1.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 8415 NumberOfCodeBlocks, 8415 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 8385 ConstructedInterpolants, 0 QuantifiedInterpolants, 4385301 SizeOfPredicates, 7 NumberOfNonLiveVariables, 3916 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 30 InterpolantComputations, 22 PerfectInterpolantSequences, 37271/37361 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 correct! Received shutdown request...