./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_7.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/locks/test_locks_7.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 ccd6d122756047ddb1225c106ac06a6748e14c22 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:38,558 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-28 15:40:38,564 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-28 15:40:38,577 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-28 15:40:38,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-28 15:40:38,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-28 15:40:38,580 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-28 15:40:38,582 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-28 15:40:38,584 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-28 15:40:38,585 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-28 15:40:38,591 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-28 15:40:38,593 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-28 15:40:38,593 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-28 15:40:38,594 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-28 15:40:38,595 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-28 15:40:38,597 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-28 15:40:38,598 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-28 15:40:38,599 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-28 15:40:38,601 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-28 15:40:38,603 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-28 15:40:38,605 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-28 15:40:38,606 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-28 15:40:38,607 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-28 15:40:38,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-28 15:40:38,611 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-28 15:40:38,611 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-28 15:40:38,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-28 15:40:38,613 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-28 15:40:38,613 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-28 15:40:38,614 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-28 15:40:38,615 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-28 15:40:38,616 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-28 15:40:38,617 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-28 15:40:38,618 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-28 15:40:38,619 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-28 15:40:38,619 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-28 15:40:38,620 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-28 15:40:38,620 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-28 15:40:38,621 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-28 15:40:38,622 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-28 15:40:38,623 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-28 15:40:38,623 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:38,638 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-28 15:40:38,639 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-28 15:40:38,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-28 15:40:38,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-28 15:40:38,641 INFO L138 SettingsManager]: * Use SBE=true [2019-11-28 15:40:38,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-28 15:40:38,641 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-28 15:40:38,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-28 15:40:38,642 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-28 15:40:38,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-28 15:40:38,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-28 15:40:38,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-28 15:40:38,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-28 15:40:38,643 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-28 15:40:38,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-28 15:40:38,644 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-28 15:40:38,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-28 15:40:38,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-28 15:40:38,645 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-28 15:40:38,645 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-28 15:40:38,645 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-28 15:40:38,646 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-28 15:40:38,646 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-28 15:40:38,646 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-28 15:40:38,647 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-28 15:40:38,647 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-28 15:40:38,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-28 15:40:38,647 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-28 15:40:38,648 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-11-28 15:40:38,648 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 -> ccd6d122756047ddb1225c106ac06a6748e14c22 [2019-11-28 15:40:38,969 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-28 15:40:38,983 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-28 15:40:38,988 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-28 15:40:38,990 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-28 15:40:38,990 INFO L275 PluginConnector]: CDTParser initialized [2019-11-28 15:40:38,992 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_7.c [2019-11-28 15:40:39,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa66f99a2/35e842416fd74c4985b087ca20c08fc9/FLAGbf352f611 [2019-11-28 15:40:39,581 INFO L306 CDTParser]: Found 1 translation units. [2019-11-28 15:40:39,582 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_7.c [2019-11-28 15:40:39,590 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa66f99a2/35e842416fd74c4985b087ca20c08fc9/FLAGbf352f611 [2019-11-28 15:40:39,937 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa66f99a2/35e842416fd74c4985b087ca20c08fc9 [2019-11-28 15:40:39,941 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-28 15:40:39,943 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-28 15:40:39,944 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:39,944 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-28 15:40:39,948 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-28 15:40:39,949 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,954 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18f9215c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:39, skipping insertion in model container [2019-11-28 15:40:39,954 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:40:39" (1/1) ... [2019-11-28 15:40:39,965 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-11-28 15:40:39,999 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-11-28 15:40:40,201 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:40,206 INFO L203 MainTranslator]: Completed pre-run [2019-11-28 15:40:40,230 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-28 15:40:40,248 INFO L208 MainTranslator]: Completed translation [2019-11-28 15:40:40,249 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:40 WrapperNode [2019-11-28 15:40:40,249 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-28 15:40:40,250 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:40,250 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-28 15:40:40,251 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-28 15:40:40,260 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:40" (1/1) ... [2019-11-28 15:40:40,267 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:40" (1/1) ... [2019-11-28 15:40:40,352 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-28 15:40:40,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-28 15:40:40,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-28 15:40:40,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-28 15:40:40,361 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:40" (1/1) ... [2019-11-28 15:40:40,362 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:40" (1/1) ... [2019-11-28 15:40:40,363 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:40" (1/1) ... [2019-11-28 15:40:40,363 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:40" (1/1) ... [2019-11-28 15:40:40,366 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:40" (1/1) ... [2019-11-28 15:40:40,373 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:40" (1/1) ... [2019-11-28 15:40:40,375 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:40" (1/1) ... [2019-11-28 15:40:40,377 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-28 15:40:40,378 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-28 15:40:40,378 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-28 15:40:40,378 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-28 15:40:40,379 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:40" (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:40,441 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-28 15:40:40,441 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-28 15:40:40,800 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-28 15:40:40,803 INFO L287 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-28 15:40:40,804 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:40 BoogieIcfgContainer [2019-11-28 15:40:40,804 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-28 15:40:40,806 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-28 15:40:40,806 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-28 15:40:40,809 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-28 15:40:40,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:40:39" (1/3) ... [2019-11-28 15:40:40,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be09a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:40, skipping insertion in model container [2019-11-28 15:40:40,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:40:40" (2/3) ... [2019-11-28 15:40:40,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5be09a7b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:40:40, skipping insertion in model container [2019-11-28 15:40:40,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:40:40" (3/3) ... [2019-11-28 15:40:40,813 INFO L109 eAbstractionObserver]: Analyzing ICFG test_locks_7.c [2019-11-28 15:40:40,822 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-28 15:40:40,828 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-28 15:40:40,839 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-28 15:40:40,869 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-28 15:40:40,870 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-28 15:40:40,870 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-28 15:40:40,870 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-28 15:40:40,870 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-28 15:40:40,870 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-28 15:40:40,870 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-28 15:40:40,871 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-28 15:40:40,885 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states. [2019-11-28 15:40:40,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:40:40,892 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:40,893 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:40,893 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:40,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:40,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1589939160, now seen corresponding path program 1 times [2019-11-28 15:40:40,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:40,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082542486] [2019-11-28 15:40:40,911 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,082 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:41,083 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082542486] [2019-11-28 15:40:41,083 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,084 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,085 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798038643] [2019-11-28 15:40:41,090 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,091 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,108 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 3 states. [2019-11-28 15:40:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,161 INFO L93 Difference]: Finished difference Result 64 states and 108 transitions. [2019-11-28 15:40:41,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,164 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:40:41,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,174 INFO L225 Difference]: With dead ends: 64 [2019-11-28 15:40:41,176 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 15:40:41,180 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:41,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 15:40:41,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 34. [2019-11-28 15:40:41,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-11-28 15:40:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 61 transitions. [2019-11-28 15:40:41,222 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 61 transitions. Word has length 13 [2019-11-28 15:40:41,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,222 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 61 transitions. [2019-11-28 15:40:41,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,223 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 61 transitions. [2019-11-28 15:40:41,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-28 15:40:41,224 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,224 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,224 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1982966170, now seen corresponding path program 1 times [2019-11-28 15:40:41,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314867649] [2019-11-28 15:40:41,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,312 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:41,315 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314867649] [2019-11-28 15:40:41,315 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,315 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,316 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1025679514] [2019-11-28 15:40:41,318 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,319 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,320 INFO L87 Difference]: Start difference. First operand 34 states and 61 transitions. Second operand 3 states. [2019-11-28 15:40:41,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,384 INFO L93 Difference]: Finished difference Result 83 states and 148 transitions. [2019-11-28 15:40:41,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,385 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-11-28 15:40:41,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,387 INFO L225 Difference]: With dead ends: 83 [2019-11-28 15:40:41,387 INFO L226 Difference]: Without dead ends: 50 [2019-11-28 15:40:41,389 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:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-11-28 15:40:41,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-11-28 15:40:41,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-11-28 15:40:41,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-11-28 15:40:41,408 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 13 [2019-11-28 15:40:41,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,409 INFO L462 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-11-28 15:40:41,410 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,410 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-11-28 15:40:41,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:41,411 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,411 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,411 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,412 INFO L82 PathProgramCache]: Analyzing trace with hash -2043259385, now seen corresponding path program 1 times [2019-11-28 15:40:41,413 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,413 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117708478] [2019-11-28 15:40:41,413 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,495 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:41,495 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117708478] [2019-11-28 15:40:41,498 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,498 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,498 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684275757] [2019-11-28 15:40:41,499 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,499 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,500 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-11-28 15:40:41,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,535 INFO L93 Difference]: Finished difference Result 77 states and 131 transitions. [2019-11-28 15:40:41,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,538 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:41,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,539 INFO L225 Difference]: With dead ends: 77 [2019-11-28 15:40:41,539 INFO L226 Difference]: Without dead ends: 53 [2019-11-28 15:40:41,543 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:41,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-28 15:40:41,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2019-11-28 15:40:41,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2019-11-28 15:40:41,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 87 transitions. [2019-11-28 15:40:41,555 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 87 transitions. Word has length 14 [2019-11-28 15:40:41,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,555 INFO L462 AbstractCegarLoop]: Abstraction has 51 states and 87 transitions. [2019-11-28 15:40:41,555 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 87 transitions. [2019-11-28 15:40:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:41,563 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,564 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,564 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,565 INFO L82 PathProgramCache]: Analyzing trace with hash -1342194807, now seen corresponding path program 1 times [2019-11-28 15:40:41,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,566 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1892271622] [2019-11-28 15:40:41,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,631 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:41,632 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1892271622] [2019-11-28 15:40:41,633 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,633 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,633 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586121809] [2019-11-28 15:40:41,633 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,634 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,634 INFO L87 Difference]: Start difference. First operand 51 states and 87 transitions. Second operand 3 states. [2019-11-28 15:40:41,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,670 INFO L93 Difference]: Finished difference Result 96 states and 164 transitions. [2019-11-28 15:40:41,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,671 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:41,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,675 INFO L225 Difference]: With dead ends: 96 [2019-11-28 15:40:41,675 INFO L226 Difference]: Without dead ends: 94 [2019-11-28 15:40:41,678 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:41,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2019-11-28 15:40:41,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 68. [2019-11-28 15:40:41,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-11-28 15:40:41,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 116 transitions. [2019-11-28 15:40:41,696 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 116 transitions. Word has length 14 [2019-11-28 15:40:41,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,697 INFO L462 AbstractCegarLoop]: Abstraction has 68 states and 116 transitions. [2019-11-28 15:40:41,697 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,697 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 116 transitions. [2019-11-28 15:40:41,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-28 15:40:41,698 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,699 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,699 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,700 INFO L82 PathProgramCache]: Analyzing trace with hash -1735221817, now seen corresponding path program 1 times [2019-11-28 15:40:41,700 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,701 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539667028] [2019-11-28 15:40:41,701 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,749 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:41,751 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539667028] [2019-11-28 15:40:41,751 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,752 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,752 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957856378] [2019-11-28 15:40:41,752 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,753 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,754 INFO L87 Difference]: Start difference. First operand 68 states and 116 transitions. Second operand 3 states. [2019-11-28 15:40:41,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,792 INFO L93 Difference]: Finished difference Result 160 states and 274 transitions. [2019-11-28 15:40:41,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-28 15:40:41,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,794 INFO L225 Difference]: With dead ends: 160 [2019-11-28 15:40:41,794 INFO L226 Difference]: Without dead ends: 96 [2019-11-28 15:40:41,795 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:41,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2019-11-28 15:40:41,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2019-11-28 15:40:41,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-11-28 15:40:41,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 158 transitions. [2019-11-28 15:40:41,805 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 158 transitions. Word has length 14 [2019-11-28 15:40:41,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,806 INFO L462 AbstractCegarLoop]: Abstraction has 94 states and 158 transitions. [2019-11-28 15:40:41,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,806 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 158 transitions. [2019-11-28 15:40:41,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:41,807 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,807 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,807 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1341848603, now seen corresponding path program 1 times [2019-11-28 15:40:41,808 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,808 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236782981] [2019-11-28 15:40:41,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,866 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:41,866 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236782981] [2019-11-28 15:40:41,866 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,866 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,867 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603169870] [2019-11-28 15:40:41,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,868 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,869 INFO L87 Difference]: Start difference. First operand 94 states and 158 transitions. Second operand 3 states. [2019-11-28 15:40:41,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:41,891 INFO L93 Difference]: Finished difference Result 143 states and 237 transitions. [2019-11-28 15:40:41,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:41,894 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:41,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:41,896 INFO L225 Difference]: With dead ends: 143 [2019-11-28 15:40:41,896 INFO L226 Difference]: Without dead ends: 98 [2019-11-28 15:40:41,897 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:41,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-11-28 15:40:41,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2019-11-28 15:40:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2019-11-28 15:40:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 158 transitions. [2019-11-28 15:40:41,924 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 158 transitions. Word has length 15 [2019-11-28 15:40:41,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:41,924 INFO L462 AbstractCegarLoop]: Abstraction has 96 states and 158 transitions. [2019-11-28 15:40:41,924 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:41,924 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 158 transitions. [2019-11-28 15:40:41,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:41,927 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:41,928 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:41,928 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:41,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:41,928 INFO L82 PathProgramCache]: Analyzing trace with hash 2042913181, now seen corresponding path program 1 times [2019-11-28 15:40:41,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:41,930 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624259868] [2019-11-28 15:40:41,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:41,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:41,984 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:41,984 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [624259868] [2019-11-28 15:40:41,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:41,985 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:41,985 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323187304] [2019-11-28 15:40:41,985 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:41,986 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:41,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:41,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:41,988 INFO L87 Difference]: Start difference. First operand 96 states and 158 transitions. Second operand 3 states. [2019-11-28 15:40:42,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,019 INFO L93 Difference]: Finished difference Result 272 states and 448 transitions. [2019-11-28 15:40:42,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,020 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:42,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,021 INFO L225 Difference]: With dead ends: 272 [2019-11-28 15:40:42,022 INFO L226 Difference]: Without dead ends: 182 [2019-11-28 15:40:42,023 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:42,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2019-11-28 15:40:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2019-11-28 15:40:42,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 15:40:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 290 transitions. [2019-11-28 15:40:42,056 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 290 transitions. Word has length 15 [2019-11-28 15:40:42,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,056 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 290 transitions. [2019-11-28 15:40:42,056 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 290 transitions. [2019-11-28 15:40:42,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-28 15:40:42,058 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,061 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,061 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1859027105, now seen corresponding path program 1 times [2019-11-28 15:40:42,062 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,062 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777729701] [2019-11-28 15:40:42,063 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,107 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:42,107 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777729701] [2019-11-28 15:40:42,107 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,107 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,108 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342870644] [2019-11-28 15:40:42,108 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,108 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,110 INFO L87 Difference]: Start difference. First operand 180 states and 290 transitions. Second operand 3 states. [2019-11-28 15:40:42,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,143 INFO L93 Difference]: Finished difference Result 224 states and 364 transitions. [2019-11-28 15:40:42,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,144 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-11-28 15:40:42,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,146 INFO L225 Difference]: With dead ends: 224 [2019-11-28 15:40:42,146 INFO L226 Difference]: Without dead ends: 222 [2019-11-28 15:40:42,148 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:42,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2019-11-28 15:40:42,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 180. [2019-11-28 15:40:42,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-11-28 15:40:42,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 286 transitions. [2019-11-28 15:40:42,173 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 286 transitions. Word has length 15 [2019-11-28 15:40:42,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,174 INFO L462 AbstractCegarLoop]: Abstraction has 180 states and 286 transitions. [2019-11-28 15:40:42,174 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,174 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 286 transitions. [2019-11-28 15:40:42,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:42,176 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,176 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,176 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1093985828, now seen corresponding path program 1 times [2019-11-28 15:40:42,180 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,180 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412515280] [2019-11-28 15:40:42,180 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,232 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:42,233 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412515280] [2019-11-28 15:40:42,233 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,233 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,233 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159533019] [2019-11-28 15:40:42,235 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,235 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,237 INFO L87 Difference]: Start difference. First operand 180 states and 286 transitions. Second operand 3 states. [2019-11-28 15:40:42,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,266 INFO L93 Difference]: Finished difference Result 324 states and 520 transitions. [2019-11-28 15:40:42,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:42,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,269 INFO L225 Difference]: With dead ends: 324 [2019-11-28 15:40:42,270 INFO L226 Difference]: Without dead ends: 322 [2019-11-28 15:40:42,270 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:42,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2019-11-28 15:40:42,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 256. [2019-11-28 15:40:42,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-11-28 15:40:42,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 398 transitions. [2019-11-28 15:40:42,284 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 398 transitions. Word has length 16 [2019-11-28 15:40:42,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,284 INFO L462 AbstractCegarLoop]: Abstraction has 256 states and 398 transitions. [2019-11-28 15:40:42,284 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,285 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 398 transitions. [2019-11-28 15:40:42,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-11-28 15:40:42,286 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,287 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,287 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,287 INFO L82 PathProgramCache]: Analyzing trace with hash -1487012838, now seen corresponding path program 1 times [2019-11-28 15:40:42,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,288 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995007829] [2019-11-28 15:40:42,288 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,310 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:42,311 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995007829] [2019-11-28 15:40:42,311 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,311 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,312 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547630049] [2019-11-28 15:40:42,312 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,312 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,313 INFO L87 Difference]: Start difference. First operand 256 states and 398 transitions. Second operand 3 states. [2019-11-28 15:40:42,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,347 INFO L93 Difference]: Finished difference Result 596 states and 928 transitions. [2019-11-28 15:40:42,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,349 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-11-28 15:40:42,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,351 INFO L225 Difference]: With dead ends: 596 [2019-11-28 15:40:42,351 INFO L226 Difference]: Without dead ends: 346 [2019-11-28 15:40:42,353 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:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2019-11-28 15:40:42,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2019-11-28 15:40:42,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2019-11-28 15:40:42,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 522 transitions. [2019-11-28 15:40:42,370 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 522 transitions. Word has length 16 [2019-11-28 15:40:42,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,370 INFO L462 AbstractCegarLoop]: Abstraction has 344 states and 522 transitions. [2019-11-28 15:40:42,370 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,371 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 522 transitions. [2019-11-28 15:40:42,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:42,372 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,372 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,372 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,373 INFO L82 PathProgramCache]: Analyzing trace with hash 446393042, now seen corresponding path program 1 times [2019-11-28 15:40:42,373 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,373 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985843817] [2019-11-28 15:40:42,374 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,401 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:42,402 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985843817] [2019-11-28 15:40:42,402 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,403 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,403 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357671571] [2019-11-28 15:40:42,403 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,404 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,404 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,405 INFO L87 Difference]: Start difference. First operand 344 states and 522 transitions. Second operand 3 states. [2019-11-28 15:40:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,426 INFO L93 Difference]: Finished difference Result 524 states and 792 transitions. [2019-11-28 15:40:42,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,427 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,429 INFO L225 Difference]: With dead ends: 524 [2019-11-28 15:40:42,430 INFO L226 Difference]: Without dead ends: 358 [2019-11-28 15:40:42,431 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:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2019-11-28 15:40:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2019-11-28 15:40:42,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2019-11-28 15:40:42,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 530 transitions. [2019-11-28 15:40:42,446 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 530 transitions. Word has length 17 [2019-11-28 15:40:42,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,446 INFO L462 AbstractCegarLoop]: Abstraction has 356 states and 530 transitions. [2019-11-28 15:40:42,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,447 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 530 transitions. [2019-11-28 15:40:42,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:42,448 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,448 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,449 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,449 INFO L82 PathProgramCache]: Analyzing trace with hash 1147457620, now seen corresponding path program 1 times [2019-11-28 15:40:42,449 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,450 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656405276] [2019-11-28 15:40:42,450 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,478 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:42,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656405276] [2019-11-28 15:40:42,479 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,479 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,479 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783826014] [2019-11-28 15:40:42,480 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,481 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,481 INFO L87 Difference]: Start difference. First operand 356 states and 530 transitions. Second operand 3 states. [2019-11-28 15:40:42,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,505 INFO L93 Difference]: Finished difference Result 616 states and 924 transitions. [2019-11-28 15:40:42,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,506 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:42,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,509 INFO L225 Difference]: With dead ends: 616 [2019-11-28 15:40:42,509 INFO L226 Difference]: Without dead ends: 614 [2019-11-28 15:40:42,510 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:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-11-28 15:40:42,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 516. [2019-11-28 15:40:42,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2019-11-28 15:40:42,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 746 transitions. [2019-11-28 15:40:42,528 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 746 transitions. Word has length 17 [2019-11-28 15:40:42,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,529 INFO L462 AbstractCegarLoop]: Abstraction has 516 states and 746 transitions. [2019-11-28 15:40:42,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,529 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 746 transitions. [2019-11-28 15:40:42,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-28 15:40:42,530 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,531 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,531 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,531 INFO L82 PathProgramCache]: Analyzing trace with hash 754430610, now seen corresponding path program 1 times [2019-11-28 15:40:42,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,532 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635724193] [2019-11-28 15:40:42,532 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,549 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:42,549 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635724193] [2019-11-28 15:40:42,550 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769791485] [2019-11-28 15:40:42,550 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,551 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,551 INFO L87 Difference]: Start difference. First operand 516 states and 746 transitions. Second operand 3 states. [2019-11-28 15:40:42,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,576 INFO L93 Difference]: Finished difference Result 1176 states and 1692 transitions. [2019-11-28 15:40:42,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,577 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-28 15:40:42,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,581 INFO L225 Difference]: With dead ends: 1176 [2019-11-28 15:40:42,581 INFO L226 Difference]: Without dead ends: 678 [2019-11-28 15:40:42,582 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:42,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2019-11-28 15:40:42,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 676. [2019-11-28 15:40:42,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 676 states. [2019-11-28 15:40:42,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 946 transitions. [2019-11-28 15:40:42,607 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 946 transitions. Word has length 17 [2019-11-28 15:40:42,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,607 INFO L462 AbstractCegarLoop]: Abstraction has 676 states and 946 transitions. [2019-11-28 15:40:42,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,607 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 946 transitions. [2019-11-28 15:40:42,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:42,609 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,609 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,610 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1211663535, now seen corresponding path program 1 times [2019-11-28 15:40:42,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,611 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188325390] [2019-11-28 15:40:42,611 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,645 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:42,646 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188325390] [2019-11-28 15:40:42,646 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,646 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,646 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293456048] [2019-11-28 15:40:42,647 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,647 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,648 INFO L87 Difference]: Start difference. First operand 676 states and 946 transitions. Second operand 3 states. [2019-11-28 15:40:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,680 INFO L93 Difference]: Finished difference Result 1016 states and 1412 transitions. [2019-11-28 15:40:42,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,681 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,684 INFO L225 Difference]: With dead ends: 1016 [2019-11-28 15:40:42,685 INFO L226 Difference]: Without dead ends: 694 [2019-11-28 15:40:42,687 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:42,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2019-11-28 15:40:42,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 692. [2019-11-28 15:40:42,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 692 states. [2019-11-28 15:40:42,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 946 transitions. [2019-11-28 15:40:42,712 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 946 transitions. Word has length 18 [2019-11-28 15:40:42,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,714 INFO L462 AbstractCegarLoop]: Abstraction has 692 states and 946 transitions. [2019-11-28 15:40:42,714 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 946 transitions. [2019-11-28 15:40:42,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:42,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,716 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,716 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1912728113, now seen corresponding path program 1 times [2019-11-28 15:40:42,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686018726] [2019-11-28 15:40:42,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,757 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:42,757 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686018726] [2019-11-28 15:40:42,757 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,757 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,759 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354313914] [2019-11-28 15:40:42,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,760 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,760 INFO L87 Difference]: Start difference. First operand 692 states and 946 transitions. Second operand 3 states. [2019-11-28 15:40:42,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,799 INFO L93 Difference]: Finished difference Result 1160 states and 1588 transitions. [2019-11-28 15:40:42,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,800 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:42,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,806 INFO L225 Difference]: With dead ends: 1160 [2019-11-28 15:40:42,806 INFO L226 Difference]: Without dead ends: 1158 [2019-11-28 15:40:42,809 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:42,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-11-28 15:40:42,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1028. [2019-11-28 15:40:42,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1028 states. [2019-11-28 15:40:42,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1362 transitions. [2019-11-28 15:40:42,848 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1362 transitions. Word has length 18 [2019-11-28 15:40:42,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:42,849 INFO L462 AbstractCegarLoop]: Abstraction has 1028 states and 1362 transitions. [2019-11-28 15:40:42,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:42,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1362 transitions. [2019-11-28 15:40:42,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-28 15:40:42,853 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:42,853 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:42,854 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:42,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:42,854 INFO L82 PathProgramCache]: Analyzing trace with hash 1519701103, now seen corresponding path program 1 times [2019-11-28 15:40:42,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:42,855 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233919747] [2019-11-28 15:40:42,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:42,891 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:42,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [233919747] [2019-11-28 15:40:42,891 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:42,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:42,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970951881] [2019-11-28 15:40:42,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:42,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:42,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:42,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:42,897 INFO L87 Difference]: Start difference. First operand 1028 states and 1362 transitions. Second operand 3 states. [2019-11-28 15:40:42,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:42,942 INFO L93 Difference]: Finished difference Result 2312 states and 3028 transitions. [2019-11-28 15:40:42,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:42,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-11-28 15:40:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:42,952 INFO L225 Difference]: With dead ends: 2312 [2019-11-28 15:40:42,953 INFO L226 Difference]: Without dead ends: 1318 [2019-11-28 15:40:42,956 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:42,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2019-11-28 15:40:43,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2019-11-28 15:40:43,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1316 states. [2019-11-28 15:40:43,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1666 transitions. [2019-11-28 15:40:43,029 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1666 transitions. Word has length 18 [2019-11-28 15:40:43,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,029 INFO L462 AbstractCegarLoop]: Abstraction has 1316 states and 1666 transitions. [2019-11-28 15:40:43,030 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1666 transitions. [2019-11-28 15:40:43,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:43,036 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,037 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,037 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,038 INFO L82 PathProgramCache]: Analyzing trace with hash -834754617, now seen corresponding path program 1 times [2019-11-28 15:40:43,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946411654] [2019-11-28 15:40:43,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,078 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:43,079 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946411654] [2019-11-28 15:40:43,080 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,080 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,080 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22486652] [2019-11-28 15:40:43,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,084 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,085 INFO L87 Difference]: Start difference. First operand 1316 states and 1666 transitions. Second operand 3 states. [2019-11-28 15:40:43,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,141 INFO L93 Difference]: Finished difference Result 1976 states and 2484 transitions. [2019-11-28 15:40:43,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,142 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:43,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,151 INFO L225 Difference]: With dead ends: 1976 [2019-11-28 15:40:43,152 INFO L226 Difference]: Without dead ends: 1350 [2019-11-28 15:40:43,154 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:43,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1350 states. [2019-11-28 15:40:43,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1350 to 1348. [2019-11-28 15:40:43,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1348 states. [2019-11-28 15:40:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1348 states to 1348 states and 1666 transitions. [2019-11-28 15:40:43,224 INFO L78 Accepts]: Start accepts. Automaton has 1348 states and 1666 transitions. Word has length 19 [2019-11-28 15:40:43,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,225 INFO L462 AbstractCegarLoop]: Abstraction has 1348 states and 1666 transitions. [2019-11-28 15:40:43,225 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 1348 states and 1666 transitions. [2019-11-28 15:40:43,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:43,229 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,230 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,230 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,231 INFO L82 PathProgramCache]: Analyzing trace with hash -133690039, now seen corresponding path program 1 times [2019-11-28 15:40:43,232 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,232 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620620452] [2019-11-28 15:40:43,232 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,269 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:43,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620620452] [2019-11-28 15:40:43,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,271 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,271 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586132573] [2019-11-28 15:40:43,272 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,273 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,282 INFO L87 Difference]: Start difference. First operand 1348 states and 1666 transitions. Second operand 3 states. [2019-11-28 15:40:43,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,348 INFO L93 Difference]: Finished difference Result 2182 states and 2659 transitions. [2019-11-28 15:40:43,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,350 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:43,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,364 INFO L225 Difference]: With dead ends: 2182 [2019-11-28 15:40:43,365 INFO L226 Difference]: Without dead ends: 2180 [2019-11-28 15:40:43,366 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:43,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2180 states. [2019-11-28 15:40:43,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2180 to 2052. [2019-11-28 15:40:43,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2052 states. [2019-11-28 15:40:43,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2052 states to 2052 states and 2466 transitions. [2019-11-28 15:40:43,454 INFO L78 Accepts]: Start accepts. Automaton has 2052 states and 2466 transitions. Word has length 19 [2019-11-28 15:40:43,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,455 INFO L462 AbstractCegarLoop]: Abstraction has 2052 states and 2466 transitions. [2019-11-28 15:40:43,455 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2052 states and 2466 transitions. [2019-11-28 15:40:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-11-28 15:40:43,459 INFO L402 BasicCegarLoop]: Found error trace [2019-11-28 15:40:43,460 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-28 15:40:43,460 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-28 15:40:43,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-28 15:40:43,461 INFO L82 PathProgramCache]: Analyzing trace with hash -526717049, now seen corresponding path program 1 times [2019-11-28 15:40:43,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-28 15:40:43,463 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514051633] [2019-11-28 15:40:43,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-28 15:40:43,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-28 15:40:43,489 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:43,490 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514051633] [2019-11-28 15:40:43,490 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-28 15:40:43,490 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-28 15:40:43,491 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [135141798] [2019-11-28 15:40:43,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-28 15:40:43,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-28 15:40:43,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-28 15:40:43,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-28 15:40:43,494 INFO L87 Difference]: Start difference. First operand 2052 states and 2466 transitions. Second operand 3 states. [2019-11-28 15:40:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-28 15:40:43,594 INFO L93 Difference]: Finished difference Result 4548 states and 5346 transitions. [2019-11-28 15:40:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-28 15:40:43,595 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2019-11-28 15:40:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-28 15:40:43,596 INFO L225 Difference]: With dead ends: 4548 [2019-11-28 15:40:43,596 INFO L226 Difference]: Without dead ends: 0 [2019-11-28 15:40:43,601 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:43,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-28 15:40:43,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-28 15:40:43,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-28 15:40:43,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-28 15:40:43,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 19 [2019-11-28 15:40:43,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-28 15:40:43,604 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-28 15:40:43,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-28 15:40:43,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-28 15:40:43,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-28 15:40:43,607 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-28 15:40:43,626 INFO L246 CegarLoopResult]: For program point L102(line 102) no Hoare annotation was computed. [2019-11-28 15:40:43,626 INFO L246 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-11-28 15:40:43,627 INFO L246 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-28 15:40:43,627 INFO L246 CegarLoopResult]: For program point L86-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,627 INFO L249 CegarLoopResult]: At program point L111-1(lines 30 116) the Hoare annotation is: true [2019-11-28 15:40:43,627 INFO L249 CegarLoopResult]: At program point L120(lines 4 121) the Hoare annotation is: true [2019-11-28 15:40:43,627 INFO L246 CegarLoopResult]: For program point L87(line 87) no Hoare annotation was computed. [2019-11-28 15:40:43,628 INFO L246 CegarLoopResult]: For program point L112(line 112) no Hoare annotation was computed. [2019-11-28 15:40:43,628 INFO L242 CegarLoopResult]: At program point L112-1(lines 5 121) the Hoare annotation is: false [2019-11-28 15:40:43,628 INFO L246 CegarLoopResult]: For program point L71-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,629 INFO L246 CegarLoopResult]: For program point L96-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,629 INFO L246 CegarLoopResult]: For program point L63-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,629 INFO L246 CegarLoopResult]: For program point L55-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,629 INFO L246 CegarLoopResult]: For program point L97(line 97) no Hoare annotation was computed. [2019-11-28 15:40:43,629 INFO L246 CegarLoopResult]: For program point L81-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,629 INFO L246 CegarLoopResult]: For program point L106-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,630 INFO L246 CegarLoopResult]: For program point L32(lines 32 34) no Hoare annotation was computed. [2019-11-28 15:40:43,630 INFO L246 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 119) no Hoare annotation was computed. [2019-11-28 15:40:43,630 INFO L246 CegarLoopResult]: For program point L82(line 82) no Hoare annotation was computed. [2019-11-28 15:40:43,630 INFO L246 CegarLoopResult]: For program point L107(line 107) no Hoare annotation was computed. [2019-11-28 15:40:43,630 INFO L246 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-28 15:40:43,632 INFO L246 CegarLoopResult]: For program point L91-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,633 INFO L246 CegarLoopResult]: For program point L75-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,633 INFO L246 CegarLoopResult]: For program point L67-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,633 INFO L246 CegarLoopResult]: For program point L92(line 92) no Hoare annotation was computed. [2019-11-28 15:40:43,633 INFO L246 CegarLoopResult]: For program point L59-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,634 INFO L249 CegarLoopResult]: At program point L117(lines 5 121) the Hoare annotation is: true [2019-11-28 15:40:43,634 INFO L246 CegarLoopResult]: For program point L51(lines 51 53) no Hoare annotation was computed. [2019-11-28 15:40:43,634 INFO L246 CegarLoopResult]: For program point L51-2(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,635 INFO L246 CegarLoopResult]: For program point L101-1(lines 30 116) no Hoare annotation was computed. [2019-11-28 15:40:43,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:40:43 BoogieIcfgContainer [2019-11-28 15:40:43,650 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-28 15:40:43,651 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-28 15:40:43,651 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-28 15:40:43,652 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-28 15:40:43,653 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:40" (3/4) ... [2019-11-28 15:40:43,658 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-11-28 15:40:43,682 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2019-11-28 15:40:43,683 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-11-28 15:40:43,798 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-11-28 15:40:43,799 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-28 15:40:43,802 INFO L168 Benchmark]: Toolchain (without parser) took 3858.28 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 955.0 MB in the beginning and 818.2 MB in the end (delta: 136.8 MB). Peak memory consumption was 270.0 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:43,811 INFO L168 Benchmark]: CDTParser took 1.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-28 15:40:43,811 INFO L168 Benchmark]: CACSL2BoogieTranslator took 305.99 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:43,812 INFO L168 Benchmark]: Boogie Procedure Inliner took 102.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:43,812 INFO L168 Benchmark]: Boogie Preprocessor took 24.41 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:43,813 INFO L168 Benchmark]: RCFGBuilder took 426.84 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:43,813 INFO L168 Benchmark]: TraceAbstraction took 2845.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 824.8 MB in the end (delta: 280.5 MB). Peak memory consumption was 280.5 MB. Max. memory is 11.5 GB. [2019-11-28 15:40:43,814 INFO L168 Benchmark]: Witness Printer took 147.68 ms. Allocated memory is still 1.2 GB. Free memory was 824.8 MB in the beginning and 818.2 MB 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:43,816 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.16 ms. Allocated memory is still 1.0 GB. Free memory is still 981.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 305.99 ms. Allocated memory is still 1.0 GB. Free memory was 955.0 MB in the beginning and 944.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 102.43 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.2 MB). Free memory was 944.2 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 9.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 24.41 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 426.84 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: 17.7 MB). Peak memory consumption was 17.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2845.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 824.8 MB in the end (delta: 280.5 MB). Peak memory consumption was 280.5 MB. Max. memory is 11.5 GB. * Witness Printer took 147.68 ms. Allocated memory is still 1.2 GB. Free memory was 824.8 MB in the beginning and 818.2 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 119]: 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: 5]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 5]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 30 locations, 1 error locations. Result: SAFE, OverallTime: 2.7s, OverallIterations: 19, TraceHistogramMax: 1, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 1109 SDtfs, 543 SDslu, 710 SDs, 0 SdLazy, 101 SolverSat, 19 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2052occurred in iteration=18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 528 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 137 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 307 NumberOfCodeBlocks, 307 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 288 ConstructedInterpolants, 0 QuantifiedInterpolants, 9228 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 PerfectInterpolantSequences, 0/0 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...