./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem10_label56_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0ed9222f Calling Ultimate with: 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 /storage/repos/svcomp/c/eca-rers2012/Problem10_label56_true-unreach-call.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 e20784f8aa644ffcee7dc85218c97681429f7c28 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-12 03:33:07,552 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 03:33:07,553 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 03:33:07,573 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 03:33:07,573 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 03:33:07,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 03:33:07,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 03:33:07,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 03:33:07,584 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 03:33:07,585 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 03:33:07,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 03:33:07,586 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 03:33:07,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 03:33:07,592 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 03:33:07,593 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 03:33:07,596 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 03:33:07,597 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 03:33:07,599 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 03:33:07,603 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 03:33:07,604 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 03:33:07,605 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 03:33:07,606 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 03:33:07,608 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 03:33:07,608 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 03:33:07,608 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 03:33:07,609 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 03:33:07,610 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 03:33:07,611 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 03:33:07,611 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 03:33:07,612 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 03:33:07,613 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 03:33:07,613 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 03:33:07,613 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 03:33:07,614 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 03:33:07,614 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 03:33:07,615 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 03:33:07,615 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 03:33:07,643 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 03:33:07,643 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 03:33:07,648 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 03:33:07,648 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 03:33:07,648 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 03:33:07,648 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 03:33:07,649 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 03:33:07,649 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 03:33:07,649 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 03:33:07,649 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 03:33:07,649 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 03:33:07,649 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 03:33:07,650 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 03:33:07,652 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 03:33:07,652 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 03:33:07,652 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 03:33:07,652 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 03:33:07,653 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 03:33:07,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 03:33:07,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 03:33:07,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 03:33:07,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:33:07,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 03:33:07,654 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 03:33:07,654 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 03:33:07,654 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 03:33:07,654 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 03:33:07,654 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 03:33:07,654 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true 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 -> e20784f8aa644ffcee7dc85218c97681429f7c28 [2019-01-12 03:33:07,706 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 03:33:07,724 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 03:33:07,731 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 03:33:07,733 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 03:33:07,734 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 03:33:07,735 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem10_label56_true-unreach-call.c [2019-01-12 03:33:07,792 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f568cd5b/a3df59f8f4c647fc8afc576503e14ae4/FLAGa1a67c6cb [2019-01-12 03:33:08,342 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 03:33:08,343 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem10_label56_true-unreach-call.c [2019-01-12 03:33:08,355 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f568cd5b/a3df59f8f4c647fc8afc576503e14ae4/FLAGa1a67c6cb [2019-01-12 03:33:08,559 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f568cd5b/a3df59f8f4c647fc8afc576503e14ae4 [2019-01-12 03:33:08,563 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 03:33:08,564 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 03:33:08,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 03:33:08,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 03:33:08,570 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 03:33:08,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:33:08" (1/1) ... [2019-01-12 03:33:08,574 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6de79d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:08, skipping insertion in model container [2019-01-12 03:33:08,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 03:33:08" (1/1) ... [2019-01-12 03:33:08,582 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 03:33:08,648 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 03:33:09,158 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:33:09,167 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 03:33:09,305 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 03:33:09,322 INFO L195 MainTranslator]: Completed translation [2019-01-12 03:33:09,322 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09 WrapperNode [2019-01-12 03:33:09,322 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 03:33:09,325 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 03:33:09,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 03:33:09,326 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 03:33:09,337 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,447 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,518 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 03:33:09,519 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 03:33:09,519 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 03:33:09,520 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 03:33:09,528 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,529 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,535 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,535 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,565 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,606 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... [2019-01-12 03:33:09,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 03:33:09,618 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 03:33:09,618 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 03:33:09,618 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 03:33:09,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 03:33:09,701 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 03:33:09,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 03:33:12,931 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 03:33:12,931 INFO L286 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-12 03:33:12,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:33:12 BoogieIcfgContainer [2019-01-12 03:33:12,933 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 03:33:12,934 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 03:33:12,934 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 03:33:12,937 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 03:33:12,937 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 03:33:08" (1/3) ... [2019-01-12 03:33:12,938 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feeed6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:33:12, skipping insertion in model container [2019-01-12 03:33:12,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 03:33:09" (2/3) ... [2019-01-12 03:33:12,939 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@feeed6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 03:33:12, skipping insertion in model container [2019-01-12 03:33:12,939 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:33:12" (3/3) ... [2019-01-12 03:33:12,941 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label56_true-unreach-call.c [2019-01-12 03:33:12,952 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 03:33:12,961 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 03:33:12,980 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 03:33:13,015 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 03:33:13,016 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 03:33:13,016 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 03:33:13,016 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 03:33:13,016 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 03:33:13,017 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 03:33:13,017 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 03:33:13,017 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 03:33:13,017 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 03:33:13,041 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states. [2019-01-12 03:33:13,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-12 03:33:13,050 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:13,051 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:13,053 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:13,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:13,060 INFO L82 PathProgramCache]: Analyzing trace with hash -573341295, now seen corresponding path program 1 times [2019-01-12 03:33:13,062 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:13,063 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:13,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:13,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:13,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:13,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:13,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:13,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:13,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:33:13,492 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:13,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:13,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:13,512 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 4 states. [2019-01-12 03:33:16,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:16,231 INFO L93 Difference]: Finished difference Result 694 states and 1246 transitions. [2019-01-12 03:33:16,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:16,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2019-01-12 03:33:16,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:16,254 INFO L225 Difference]: With dead ends: 694 [2019-01-12 03:33:16,254 INFO L226 Difference]: Without dead ends: 421 [2019-01-12 03:33:16,259 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:16,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2019-01-12 03:33:16,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 282. [2019-01-12 03:33:16,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2019-01-12 03:33:16,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 432 transitions. [2019-01-12 03:33:16,324 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 432 transitions. Word has length 23 [2019-01-12 03:33:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:16,324 INFO L480 AbstractCegarLoop]: Abstraction has 282 states and 432 transitions. [2019-01-12 03:33:16,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 432 transitions. [2019-01-12 03:33:16,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-01-12 03:33:16,328 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:16,329 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:16,329 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:16,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:16,330 INFO L82 PathProgramCache]: Analyzing trace with hash 1981617417, now seen corresponding path program 1 times [2019-01-12 03:33:16,330 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:16,330 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:16,331 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:16,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:16,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:16,659 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:16,659 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:16,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:33:16,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:16,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:16,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:16,662 INFO L87 Difference]: Start difference. First operand 282 states and 432 transitions. Second operand 4 states. [2019-01-12 03:33:18,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:18,052 INFO L93 Difference]: Finished difference Result 840 states and 1290 transitions. [2019-01-12 03:33:18,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:18,052 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-01-12 03:33:18,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:18,057 INFO L225 Difference]: With dead ends: 840 [2019-01-12 03:33:18,057 INFO L226 Difference]: Without dead ends: 560 [2019-01-12 03:33:18,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:18,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2019-01-12 03:33:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 421. [2019-01-12 03:33:18,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2019-01-12 03:33:18,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 596 transitions. [2019-01-12 03:33:18,084 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 596 transitions. Word has length 92 [2019-01-12 03:33:18,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:18,084 INFO L480 AbstractCegarLoop]: Abstraction has 421 states and 596 transitions. [2019-01-12 03:33:18,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:18,085 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 596 transitions. [2019-01-12 03:33:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-01-12 03:33:18,088 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:18,089 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:18,089 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:18,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:18,089 INFO L82 PathProgramCache]: Analyzing trace with hash 2055444920, now seen corresponding path program 1 times [2019-01-12 03:33:18,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:18,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:18,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:18,091 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:18,091 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:18,304 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:18,304 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:18,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:33:18,305 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:18,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:18,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:18,305 INFO L87 Difference]: Start difference. First operand 421 states and 596 transitions. Second operand 4 states. [2019-01-12 03:33:23,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:23,695 INFO L93 Difference]: Finished difference Result 1535 states and 2162 transitions. [2019-01-12 03:33:23,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:23,696 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 98 [2019-01-12 03:33:23,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:23,703 INFO L225 Difference]: With dead ends: 1535 [2019-01-12 03:33:23,704 INFO L226 Difference]: Without dead ends: 1116 [2019-01-12 03:33:23,705 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:23,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2019-01-12 03:33:23,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 838. [2019-01-12 03:33:23,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 838 states. [2019-01-12 03:33:23,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1093 transitions. [2019-01-12 03:33:23,744 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1093 transitions. Word has length 98 [2019-01-12 03:33:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:23,744 INFO L480 AbstractCegarLoop]: Abstraction has 838 states and 1093 transitions. [2019-01-12 03:33:23,745 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:23,746 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1093 transitions. [2019-01-12 03:33:23,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-01-12 03:33:23,756 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:23,757 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:23,757 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:23,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:23,758 INFO L82 PathProgramCache]: Analyzing trace with hash -1680739469, now seen corresponding path program 1 times [2019-01-12 03:33:23,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:23,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:23,760 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:23,760 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:23,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:24,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:24,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 03:33:24,285 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:24,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:24,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:24,288 INFO L87 Difference]: Start difference. First operand 838 states and 1093 transitions. Second operand 4 states. [2019-01-12 03:33:26,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:26,512 INFO L93 Difference]: Finished difference Result 1813 states and 2363 transitions. [2019-01-12 03:33:26,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:26,513 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 160 [2019-01-12 03:33:26,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:26,519 INFO L225 Difference]: With dead ends: 1813 [2019-01-12 03:33:26,520 INFO L226 Difference]: Without dead ends: 977 [2019-01-12 03:33:26,521 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:26,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2019-01-12 03:33:26,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 977. [2019-01-12 03:33:26,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 977 states. [2019-01-12 03:33:26,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 977 states to 977 states and 1167 transitions. [2019-01-12 03:33:26,544 INFO L78 Accepts]: Start accepts. Automaton has 977 states and 1167 transitions. Word has length 160 [2019-01-12 03:33:26,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:26,544 INFO L480 AbstractCegarLoop]: Abstraction has 977 states and 1167 transitions. [2019-01-12 03:33:26,545 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:26,545 INFO L276 IsEmpty]: Start isEmpty. Operand 977 states and 1167 transitions. [2019-01-12 03:33:26,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-01-12 03:33:26,549 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:26,550 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:26,550 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:26,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:26,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1308448785, now seen corresponding path program 1 times [2019-01-12 03:33:26,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:26,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:26,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:26,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:26,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:26,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:26,839 INFO L134 CoverageAnalysis]: Checked inductivity of 123 backedges. 102 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2019-01-12 03:33:26,839 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:26,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:33:26,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:33:26,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:33:26,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:26,841 INFO L87 Difference]: Start difference. First operand 977 states and 1167 transitions. Second operand 5 states. [2019-01-12 03:33:29,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:29,017 INFO L93 Difference]: Finished difference Result 3622 states and 4322 transitions. [2019-01-12 03:33:29,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:33:29,018 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-01-12 03:33:29,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:29,031 INFO L225 Difference]: With dead ends: 3622 [2019-01-12 03:33:29,031 INFO L226 Difference]: Without dead ends: 2647 [2019-01-12 03:33:29,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:29,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2647 states. [2019-01-12 03:33:29,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2647 to 1950. [2019-01-12 03:33:29,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1950 states. [2019-01-12 03:33:29,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1950 states to 1950 states and 2256 transitions. [2019-01-12 03:33:29,091 INFO L78 Accepts]: Start accepts. Automaton has 1950 states and 2256 transitions. Word has length 192 [2019-01-12 03:33:29,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:29,091 INFO L480 AbstractCegarLoop]: Abstraction has 1950 states and 2256 transitions. [2019-01-12 03:33:29,091 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:33:29,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1950 states and 2256 transitions. [2019-01-12 03:33:29,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-01-12 03:33:29,098 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:29,099 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:29,099 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:29,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:29,100 INFO L82 PathProgramCache]: Analyzing trace with hash 1589151532, now seen corresponding path program 1 times [2019-01-12 03:33:29,101 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:29,101 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:29,102 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:29,103 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:29,103 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:29,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:29,673 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 115 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:29,673 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:29,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:33:29,674 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:33:29,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:33:29,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:29,676 INFO L87 Difference]: Start difference. First operand 1950 states and 2256 transitions. Second operand 5 states. [2019-01-12 03:33:31,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:31,458 INFO L93 Difference]: Finished difference Result 5288 states and 6070 transitions. [2019-01-12 03:33:31,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:33:31,459 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 235 [2019-01-12 03:33:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:31,469 INFO L225 Difference]: With dead ends: 5288 [2019-01-12 03:33:31,469 INFO L226 Difference]: Without dead ends: 1950 [2019-01-12 03:33:31,473 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:31,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1950 states. [2019-01-12 03:33:31,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1950 to 1672. [2019-01-12 03:33:31,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1672 states. [2019-01-12 03:33:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 1832 transitions. [2019-01-12 03:33:31,509 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 1832 transitions. Word has length 235 [2019-01-12 03:33:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:31,510 INFO L480 AbstractCegarLoop]: Abstraction has 1672 states and 1832 transitions. [2019-01-12 03:33:31,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:33:31,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 1832 transitions. [2019-01-12 03:33:31,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2019-01-12 03:33:31,516 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:31,516 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:31,517 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:31,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:31,517 INFO L82 PathProgramCache]: Analyzing trace with hash 433365790, now seen corresponding path program 1 times [2019-01-12 03:33:31,517 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:31,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:31,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:31,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:31,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:32,013 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 210 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:33:32,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:32,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-12 03:33:32,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 03:33:32,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 03:33:32,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:33:32,015 INFO L87 Difference]: Start difference. First operand 1672 states and 1832 transitions. Second operand 6 states. [2019-01-12 03:33:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:33,175 INFO L93 Difference]: Finished difference Result 3631 states and 4001 transitions. [2019-01-12 03:33:33,176 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:33:33,176 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 258 [2019-01-12 03:33:33,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:33,185 INFO L225 Difference]: With dead ends: 3631 [2019-01-12 03:33:33,185 INFO L226 Difference]: Without dead ends: 2089 [2019-01-12 03:33:33,187 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-12 03:33:33,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2089 states. [2019-01-12 03:33:33,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2089 to 1811. [2019-01-12 03:33:33,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1811 states. [2019-01-12 03:33:33,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1811 states to 1811 states and 1940 transitions. [2019-01-12 03:33:33,225 INFO L78 Accepts]: Start accepts. Automaton has 1811 states and 1940 transitions. Word has length 258 [2019-01-12 03:33:33,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:33,226 INFO L480 AbstractCegarLoop]: Abstraction has 1811 states and 1940 transitions. [2019-01-12 03:33:33,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 03:33:33,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1811 states and 1940 transitions. [2019-01-12 03:33:33,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2019-01-12 03:33:33,232 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:33,232 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:33,232 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:33,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:33,233 INFO L82 PathProgramCache]: Analyzing trace with hash 666553426, now seen corresponding path program 1 times [2019-01-12 03:33:33,233 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:33,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:33,234 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:33,234 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:33,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:33,861 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:33,862 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:33,862 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:33,882 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:34,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:34,772 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 21 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 03:33:34,803 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:33:34,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-01-12 03:33:34,804 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-12 03:33:34,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-12 03:33:34,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:33:34,805 INFO L87 Difference]: Start difference. First operand 1811 states and 1940 transitions. Second operand 7 states. [2019-01-12 03:33:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:38,905 INFO L93 Difference]: Finished difference Result 5566 states and 6010 transitions. [2019-01-12 03:33:38,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 03:33:38,908 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 271 [2019-01-12 03:33:38,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:38,924 INFO L225 Difference]: With dead ends: 5566 [2019-01-12 03:33:38,924 INFO L226 Difference]: Without dead ends: 3757 [2019-01-12 03:33:38,928 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 268 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-01-12 03:33:38,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-01-12 03:33:38,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 2784. [2019-01-12 03:33:38,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2784 states. [2019-01-12 03:33:38,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2784 states to 2784 states and 2998 transitions. [2019-01-12 03:33:38,992 INFO L78 Accepts]: Start accepts. Automaton has 2784 states and 2998 transitions. Word has length 271 [2019-01-12 03:33:38,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:38,992 INFO L480 AbstractCegarLoop]: Abstraction has 2784 states and 2998 transitions. [2019-01-12 03:33:38,992 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-12 03:33:38,992 INFO L276 IsEmpty]: Start isEmpty. Operand 2784 states and 2998 transitions. [2019-01-12 03:33:39,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2019-01-12 03:33:39,001 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:39,001 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:39,002 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:39,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:39,002 INFO L82 PathProgramCache]: Analyzing trace with hash 960030519, now seen corresponding path program 1 times [2019-01-12 03:33:39,002 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:39,003 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:39,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:39,614 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 03:33:39,614 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:39,615 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:39,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:39,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:39,762 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:39,969 INFO L134 CoverageAnalysis]: Checked inductivity of 307 backedges. 219 proven. 21 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2019-01-12 03:33:40,002 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:33:40,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-12 03:33:40,003 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 03:33:40,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 03:33:40,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:40,005 INFO L87 Difference]: Start difference. First operand 2784 states and 2998 transitions. Second operand 5 states. [2019-01-12 03:33:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:41,811 INFO L93 Difference]: Finished difference Result 6539 states and 7048 transitions. [2019-01-12 03:33:41,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 03:33:41,813 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 325 [2019-01-12 03:33:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:41,829 INFO L225 Difference]: With dead ends: 6539 [2019-01-12 03:33:41,829 INFO L226 Difference]: Without dead ends: 3757 [2019-01-12 03:33:41,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 03:33:41,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3757 states. [2019-01-12 03:33:41,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3757 to 3340. [2019-01-12 03:33:41,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3340 states. [2019-01-12 03:33:41,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3340 states to 3340 states and 3544 transitions. [2019-01-12 03:33:41,899 INFO L78 Accepts]: Start accepts. Automaton has 3340 states and 3544 transitions. Word has length 325 [2019-01-12 03:33:41,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:41,900 INFO L480 AbstractCegarLoop]: Abstraction has 3340 states and 3544 transitions. [2019-01-12 03:33:41,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 03:33:41,900 INFO L276 IsEmpty]: Start isEmpty. Operand 3340 states and 3544 transitions. [2019-01-12 03:33:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2019-01-12 03:33:41,911 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:41,911 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:41,912 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:41,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:41,912 INFO L82 PathProgramCache]: Analyzing trace with hash 1084368801, now seen corresponding path program 1 times [2019-01-12 03:33:41,912 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:41,912 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:41,913 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:41,913 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:41,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 535 backedges. 449 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2019-01-12 03:33:42,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 03:33:42,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 03:33:42,199 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 03:33:42,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 03:33:42,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:42,200 INFO L87 Difference]: Start difference. First operand 3340 states and 3544 transitions. Second operand 4 states. [2019-01-12 03:33:43,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:33:43,438 INFO L93 Difference]: Finished difference Result 7095 states and 7550 transitions. [2019-01-12 03:33:43,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 03:33:43,439 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 410 [2019-01-12 03:33:43,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:33:43,451 INFO L225 Difference]: With dead ends: 7095 [2019-01-12 03:33:43,451 INFO L226 Difference]: Without dead ends: 3896 [2019-01-12 03:33:43,455 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 03:33:43,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3896 states. [2019-01-12 03:33:43,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3896 to 3757. [2019-01-12 03:33:43,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3757 states. [2019-01-12 03:33:43,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3757 states to 3757 states and 3980 transitions. [2019-01-12 03:33:43,525 INFO L78 Accepts]: Start accepts. Automaton has 3757 states and 3980 transitions. Word has length 410 [2019-01-12 03:33:43,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:33:43,526 INFO L480 AbstractCegarLoop]: Abstraction has 3757 states and 3980 transitions. [2019-01-12 03:33:43,526 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 03:33:43,526 INFO L276 IsEmpty]: Start isEmpty. Operand 3757 states and 3980 transitions. [2019-01-12 03:33:43,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2019-01-12 03:33:43,539 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:33:43,540 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:33:43,540 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:33:43,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:33:43,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1688260000, now seen corresponding path program 1 times [2019-01-12 03:33:43,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:33:43,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:33:43,541 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:43,542 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:43,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:33:43,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:44,130 WARN L181 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-01-12 03:33:44,612 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 45 proven. 443 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:33:44,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:33:44,613 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:33:44,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:33:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:33:44,730 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:33:45,915 WARN L181 SmtUtils]: Spent 946.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 16 [2019-01-12 03:33:47,008 WARN L181 SmtUtils]: Spent 924.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 26 [2019-01-12 03:33:47,553 INFO L134 CoverageAnalysis]: Checked inductivity of 553 backedges. 168 proven. 320 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-01-12 03:33:47,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 03:33:47,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 6] total 12 [2019-01-12 03:33:47,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-12 03:33:47,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-12 03:33:47,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=105, Unknown=0, NotChecked=0, Total=156 [2019-01-12 03:33:47,574 INFO L87 Difference]: Start difference. First operand 3757 states and 3980 transitions. Second operand 13 states. [2019-01-12 03:33:50,549 WARN L181 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 25 [2019-01-12 03:34:04,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:34:04,570 INFO L93 Difference]: Finished difference Result 6152 states and 6509 transitions. [2019-01-12 03:34:04,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-01-12 03:34:04,571 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 419 [2019-01-12 03:34:04,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:34:04,592 INFO L225 Difference]: With dead ends: 6152 [2019-01-12 03:34:04,593 INFO L226 Difference]: Without dead ends: 6011 [2019-01-12 03:34:04,594 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 440 GetRequests, 415 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=188, Invalid=412, Unknown=0, NotChecked=0, Total=600 [2019-01-12 03:34:04,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6011 states. [2019-01-12 03:34:04,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6011 to 4035. [2019-01-12 03:34:04,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4035 states. [2019-01-12 03:34:04,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4035 states to 4035 states and 4274 transitions. [2019-01-12 03:34:04,679 INFO L78 Accepts]: Start accepts. Automaton has 4035 states and 4274 transitions. Word has length 419 [2019-01-12 03:34:04,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:34:04,681 INFO L480 AbstractCegarLoop]: Abstraction has 4035 states and 4274 transitions. [2019-01-12 03:34:04,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-12 03:34:04,681 INFO L276 IsEmpty]: Start isEmpty. Operand 4035 states and 4274 transitions. [2019-01-12 03:34:04,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2019-01-12 03:34:04,693 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:34:04,693 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:34:04,695 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:34:04,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:34:04,695 INFO L82 PathProgramCache]: Analyzing trace with hash 615073138, now seen corresponding path program 1 times [2019-01-12 03:34:04,695 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:34:04,695 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:34:04,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:34:04,697 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:34:04,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:34:04,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:34:05,541 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 563 proven. 109 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2019-01-12 03:34:05,542 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:34:05,542 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:34:05,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:34:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:34:05,733 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:34:06,220 INFO L134 CoverageAnalysis]: Checked inductivity of 802 backedges. 455 proven. 0 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2019-01-12 03:34:06,238 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:34:06,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2019-01-12 03:34:06,240 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-12 03:34:06,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-12 03:34:06,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:34:06,240 INFO L87 Difference]: Start difference. First operand 4035 states and 4274 transitions. Second operand 8 states. [2019-01-12 03:34:08,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:34:08,468 INFO L93 Difference]: Finished difference Result 10431 states and 11049 transitions. [2019-01-12 03:34:08,469 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-12 03:34:08,469 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 533 [2019-01-12 03:34:08,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:34:08,492 INFO L225 Difference]: With dead ends: 10431 [2019-01-12 03:34:08,493 INFO L226 Difference]: Without dead ends: 6259 [2019-01-12 03:34:08,499 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 532 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-12 03:34:08,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6259 states. [2019-01-12 03:34:08,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6259 to 3896. [2019-01-12 03:34:08,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3896 states. [2019-01-12 03:34:08,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3896 states to 3896 states and 4127 transitions. [2019-01-12 03:34:08,581 INFO L78 Accepts]: Start accepts. Automaton has 3896 states and 4127 transitions. Word has length 533 [2019-01-12 03:34:08,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:34:08,582 INFO L480 AbstractCegarLoop]: Abstraction has 3896 states and 4127 transitions. [2019-01-12 03:34:08,582 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-12 03:34:08,582 INFO L276 IsEmpty]: Start isEmpty. Operand 3896 states and 4127 transitions. [2019-01-12 03:34:08,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2019-01-12 03:34:08,594 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 03:34:08,594 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 03:34:08,594 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 03:34:08,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 03:34:08,596 INFO L82 PathProgramCache]: Analyzing trace with hash -1979476456, now seen corresponding path program 1 times [2019-01-12 03:34:08,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 03:34:08,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 03:34:08,598 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:34:08,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:34:08,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 03:34:08,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:34:09,056 WARN L181 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-01-12 03:34:09,482 WARN L181 SmtUtils]: Spent 367.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-01-12 03:34:09,938 WARN L181 SmtUtils]: Spent 371.00 ms on a formula simplification. DAG size of input: 21 DAG size of output: 19 [2019-01-12 03:34:10,319 WARN L181 SmtUtils]: Spent 269.00 ms on a formula simplification. DAG size of input: 27 DAG size of output: 24 [2019-01-12 03:34:10,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 682 proven. 228 refuted. 0 times theorem prover too weak. 330 trivial. 0 not checked. [2019-01-12 03:34:10,900 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 03:34:10,900 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-12 03:34:10,915 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 03:34:11,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 03:34:11,049 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 03:34:11,330 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 700 proven. 0 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2019-01-12 03:34:11,380 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 03:34:11,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 11 [2019-01-12 03:34:11,383 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-12 03:34:11,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-12 03:34:11,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-01-12 03:34:11,385 INFO L87 Difference]: Start difference. First operand 3896 states and 4127 transitions. Second operand 11 states. [2019-01-12 03:34:11,680 WARN L181 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 25 DAG size of output: 22 [2019-01-12 03:34:13,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 03:34:13,499 INFO L93 Difference]: Finished difference Result 6741 states and 7138 transitions. [2019-01-12 03:34:13,500 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-01-12 03:34:13,500 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 561 [2019-01-12 03:34:13,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 03:34:13,501 INFO L225 Difference]: With dead ends: 6741 [2019-01-12 03:34:13,501 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 03:34:13,505 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 586 GetRequests, 568 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2019-01-12 03:34:13,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 03:34:13,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 03:34:13,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 03:34:13,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 03:34:13,506 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 561 [2019-01-12 03:34:13,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 03:34:13,506 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 03:34:13,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-12 03:34:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 03:34:13,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 03:34:13,511 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 03:34:13,590 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,668 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,747 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,775 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,829 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,856 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,858 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,859 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,862 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:13,878 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,014 WARN L181 SmtUtils]: Spent 499.00 ms on a formula simplification. DAG size of input: 335 DAG size of output: 302 [2019-01-12 03:34:14,089 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,203 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,301 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,348 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,428 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,473 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,475 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,477 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,478 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,490 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 03:34:14,621 WARN L181 SmtUtils]: Spent 600.00 ms on a formula simplification. DAG size of input: 334 DAG size of output: 301 [2019-01-12 03:34:18,599 WARN L181 SmtUtils]: Spent 3.97 s on a formula simplification. DAG size of input: 293 DAG size of output: 85 [2019-01-12 03:34:21,378 WARN L181 SmtUtils]: Spent 2.78 s on a formula simplification. DAG size of input: 292 DAG size of output: 85 [2019-01-12 03:34:21,381 INFO L448 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2019-01-12 03:34:21,382 INFO L448 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,383 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 03:34:21,384 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2019-01-12 03:34:21,385 INFO L448 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2019-01-12 03:34:21,385 INFO L448 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2019-01-12 03:34:21,386 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 03:34:21,387 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 03:34:21,387 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 03:34:21,387 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 03:34:21,387 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 03:34:21,387 INFO L444 ceAbstractionStarter]: At program point L573(lines 20 574) the Hoare annotation is: (let ((.cse8 (= ~a10~0 4)) (.cse9 (< 218 ~a1~0)) (.cse6 (= ~a10~0 3)) (.cse2 (= ~a19~0 8)) (.cse4 (= ~a10~0 0)) (.cse11 (+ ~a1~0 13)) (.cse1 (<= 56 ~a1~0)) (.cse5 (<= ~a1~0 218)) (.cse10 (= ~a10~0 2)) (.cse12 (= ~a10~0 1)) (.cse0 (= ~a12~0 0)) (.cse13 (<= ~a1~0 12)) (.cse7 (= ~a19~0 9)) (.cse3 (= ~a4~0 14))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 .cse7 (and (< 38 ~a1~0) .cse5) .cse0 .cse3) (and (<= ~a19~0 8) (not .cse2)) (and (and .cse7 .cse8 .cse0 (<= (+ ~a1~0 14285) 0)) .cse3) (and (<= ~a1~0 505232) .cse9 .cse7 .cse8 .cse0 .cse3) (and (and .cse9 .cse7 .cse0) .cse10 .cse3) (and .cse6 .cse9 .cse7 .cse0 .cse3 (<= ~a1~0 589865)) (and (not .cse8) .cse2) (and .cse7 (and (and .cse5 (< 0 .cse11)) .cse8 .cse0 .cse3)) (and .cse9 (<= ~a1~0 589891) .cse12 .cse0 .cse3) (and .cse6 .cse7 .cse0 .cse13 .cse3) (and .cse0 .cse2 (exists ((v_prenex_49 Int)) (let ((.cse14 (* 9 v_prenex_49))) (and (< 218 v_prenex_49) (<= (+ ~a1~0 545163) (div .cse14 10)) (<= 0 .cse14) (<= v_prenex_49 589891)))) .cse3) (and .cse7 .cse0 .cse3 (or .cse4 (and (<= .cse11 0) .cse12))) (and .cse0 .cse1 .cse3 .cse12 .cse5) (and .cse10 .cse7 .cse0 .cse13 .cse3) (and .cse12 .cse0 .cse13 (not .cse7) .cse3))) [2019-01-12 03:34:21,387 INFO L448 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2019-01-12 03:34:21,388 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L451 ceAbstractionStarter]: At program point L576(lines 576 592) the Hoare annotation is: true [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,389 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2019-01-12 03:34:21,390 INFO L448 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 03:34:21,391 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 03:34:21,392 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 03:34:21,393 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 03:34:21,393 INFO L448 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2019-01-12 03:34:21,393 INFO L448 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2019-01-12 03:34:21,393 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 03:34:21,394 INFO L448 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2019-01-12 03:34:21,394 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 73) no Hoare annotation was computed. [2019-01-12 03:34:21,394 INFO L444 ceAbstractionStarter]: At program point L582-2(lines 582 591) the Hoare annotation is: (let ((.cse8 (= ~a10~0 4)) (.cse9 (< 218 ~a1~0)) (.cse6 (= ~a10~0 3)) (.cse2 (= ~a19~0 8)) (.cse4 (= ~a10~0 0)) (.cse11 (+ ~a1~0 13)) (.cse1 (<= 56 ~a1~0)) (.cse5 (<= ~a1~0 218)) (.cse10 (= ~a10~0 2)) (.cse12 (= ~a10~0 1)) (.cse0 (= ~a12~0 0)) (.cse13 (<= ~a1~0 12)) (.cse7 (= ~a19~0 9)) (.cse3 (= ~a4~0 14))) (or (and .cse0 .cse1 .cse2 .cse3) (and .cse4 .cse0 .cse5 .cse3) (and .cse6 .cse7 (and (< 38 ~a1~0) .cse5) .cse0 .cse3) (and (<= ~a19~0 8) (not .cse2)) (and (and .cse7 .cse8 .cse0 (<= (+ ~a1~0 14285) 0)) .cse3) (and (<= ~a1~0 505232) .cse9 .cse7 .cse8 .cse0 .cse3) (and (and .cse9 .cse7 .cse0) .cse10 .cse3) (and .cse6 .cse9 .cse7 .cse0 .cse3 (<= ~a1~0 589865)) (and (not .cse8) .cse2) (and .cse7 (and (and .cse5 (< 0 .cse11)) .cse8 .cse0 .cse3)) (and .cse9 (<= ~a1~0 589891) .cse12 .cse0 .cse3) (and .cse6 .cse7 .cse0 .cse13 .cse3) (and .cse0 .cse2 (exists ((v_prenex_49 Int)) (let ((.cse14 (* 9 v_prenex_49))) (and (< 218 v_prenex_49) (<= (+ ~a1~0 545163) (div .cse14 10)) (<= 0 .cse14) (<= v_prenex_49 589891)))) .cse3) (and .cse7 .cse0 .cse3 (or .cse4 (and (<= .cse11 0) .cse12))) (and .cse0 .cse1 .cse3 .cse12 .cse5) (and .cse10 .cse7 .cse0 .cse13 .cse3) (and .cse12 .cse0 .cse13 (not .cse7) .cse3))) [2019-01-12 03:34:21,394 INFO L448 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2019-01-12 03:34:21,394 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,394 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,394 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 03:34:21,395 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2019-01-12 03:34:21,396 INFO L448 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2019-01-12 03:34:21,397 INFO L448 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2019-01-12 03:34:21,398 INFO L448 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,399 INFO L448 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2019-01-12 03:34:21,400 INFO L448 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2019-01-12 03:34:21,401 INFO L448 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2019-01-12 03:34:21,401 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 03:34:21,407 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,408 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2019-01-12 03:34:21,409 INFO L448 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2019-01-12 03:34:21,429 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,432 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,433 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,461 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 03:34:21 BoogieIcfgContainer [2019-01-12 03:34:21,461 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 03:34:21,461 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 03:34:21,461 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 03:34:21,462 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 03:34:21,462 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 03:33:12" (3/4) ... [2019-01-12 03:34:21,468 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 03:34:21,491 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2019-01-12 03:34:21,492 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 03:34:21,526 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((a12 == 0 && 56 <= a1) && a19 == 8) && a4 == 14) || (((a10 == 0 && a12 == 0) && a1 <= 218) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && 38 < a1 && a1 <= 218) && a12 == 0) && a4 == 14)) || (a19 <= 8 && !(a19 == 8))) || ((((a19 == 9 && a10 == 4) && a12 == 0) && a1 + 14285 <= 0) && a4 == 14)) || (((((a1 <= 505232 && 218 < a1) && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a19 == 9) && a12 == 0) && a10 == 2) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || (!(a10 == 4) && a19 == 8)) || (a19 == 9 && (((a1 <= 218 && 0 < a1 + 13) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || (((a12 == 0 && a19 == 8) && (\exists v_prenex_49 : int :: ((218 < v_prenex_49 && a1 + 545163 <= 9 * v_prenex_49 / 10) && 0 <= 9 * v_prenex_49) && v_prenex_49 <= 589891)) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && (a10 == 0 || (a1 + 13 <= 0 && a10 == 1)))) || ((((a12 == 0 && 56 <= a1) && a4 == 14) && a10 == 1) && a1 <= 218)) || ((((a10 == 2 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14) [2019-01-12 03:34:21,531 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((((((a12 == 0 && 56 <= a1) && a19 == 8) && a4 == 14) || (((a10 == 0 && a12 == 0) && a1 <= 218) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && 38 < a1 && a1 <= 218) && a12 == 0) && a4 == 14)) || (a19 <= 8 && !(a19 == 8))) || ((((a19 == 9 && a10 == 4) && a12 == 0) && a1 + 14285 <= 0) && a4 == 14)) || (((((a1 <= 505232 && 218 < a1) && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a19 == 9) && a12 == 0) && a10 == 2) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || (!(a10 == 4) && a19 == 8)) || (a19 == 9 && (((a1 <= 218 && 0 < a1 + 13) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || (((a12 == 0 && a19 == 8) && (\exists v_prenex_49 : int :: ((218 < v_prenex_49 && a1 + 545163 <= 9 * v_prenex_49 / 10) && 0 <= 9 * v_prenex_49) && v_prenex_49 <= 589891)) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && (a10 == 0 || (a1 + 13 <= 0 && a10 == 1)))) || ((((a12 == 0 && 56 <= a1) && a4 == 14) && a10 == 1) && a1 <= 218)) || ((((a10 == 2 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14) [2019-01-12 03:34:21,730 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 03:34:21,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 03:34:21,732 INFO L168 Benchmark]: Toolchain (without parser) took 73168.41 ms. Allocated memory was 1.0 GB in the beginning and 1.8 GB in the end (delta: 724.0 MB). Free memory was 942.0 MB in the beginning and 980.2 MB in the end (delta: -38.3 MB). Peak memory consumption was 685.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:34:21,734 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:34:21,735 INFO L168 Benchmark]: CACSL2BoogieTranslator took 758.94 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:34:21,735 INFO L168 Benchmark]: Boogie Procedure Inliner took 193.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-01-12 03:34:21,736 INFO L168 Benchmark]: Boogie Preprocessor took 98.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-12 03:34:21,739 INFO L168 Benchmark]: RCFGBuilder took 3314.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.9 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. [2019-01-12 03:34:21,739 INFO L168 Benchmark]: TraceAbstraction took 68527.22 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 599.8 MB). Free memory was 991.9 MB in the beginning and 998.4 MB in the end (delta: -6.5 MB). Peak memory consumption was 806.8 MB. Max. memory is 11.5 GB. [2019-01-12 03:34:21,740 INFO L168 Benchmark]: Witness Printer took 269.45 ms. Allocated memory is still 1.8 GB. Free memory was 998.4 MB in the beginning and 980.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-01-12 03:34:21,746 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 758.94 ms. Allocated memory is still 1.0 GB. Free memory was 942.0 MB in the beginning and 915.1 MB in the end (delta: 26.8 MB). Peak memory consumption was 26.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 193.75 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 915.1 MB in the beginning and 1.1 GB in the end (delta: -189.2 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 98.65 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 3314.57 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 991.9 MB in the end (delta: 112.4 MB). Peak memory consumption was 112.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 68527.22 ms. Allocated memory was 1.2 GB in the beginning and 1.8 GB in the end (delta: 599.8 MB). Free memory was 991.9 MB in the beginning and 998.4 MB in the end (delta: -6.5 MB). Peak memory consumption was 806.8 MB. Max. memory is 11.5 GB. * Witness Printer took 269.45 ms. Allocated memory is still 1.8 GB. Free memory was 998.4 MB in the beginning and 980.2 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 73]: 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: 582]: Loop Invariant [2019-01-12 03:34:21,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,766 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,767 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,777 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,783 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] Derived loop invariant: ((((((((((((((((((a12 == 0 && 56 <= a1) && a19 == 8) && a4 == 14) || (((a10 == 0 && a12 == 0) && a1 <= 218) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && 38 < a1 && a1 <= 218) && a12 == 0) && a4 == 14)) || (a19 <= 8 && !(a19 == 8))) || ((((a19 == 9 && a10 == 4) && a12 == 0) && a1 + 14285 <= 0) && a4 == 14)) || (((((a1 <= 505232 && 218 < a1) && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a19 == 9) && a12 == 0) && a10 == 2) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || (!(a10 == 4) && a19 == 8)) || (a19 == 9 && (((a1 <= 218 && 0 < a1 + 13) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || (((a12 == 0 && a19 == 8) && (\exists v_prenex_49 : int :: ((218 < v_prenex_49 && a1 + 545163 <= 9 * v_prenex_49 / 10) && 0 <= 9 * v_prenex_49) && v_prenex_49 <= 589891)) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && (a10 == 0 || (a1 + 13 <= 0 && a10 == 1)))) || ((((a12 == 0 && 56 <= a1) && a4 == 14) && a10 == 1) && a1 <= 218)) || ((((a10 == 2 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14) - InvariantResult [Line: 20]: Loop Invariant [2019-01-12 03:34:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,788 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,796 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] [2019-01-12 03:34:21,797 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_49,QUANTIFIED] Derived loop invariant: ((((((((((((((((((a12 == 0 && 56 <= a1) && a19 == 8) && a4 == 14) || (((a10 == 0 && a12 == 0) && a1 <= 218) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && 38 < a1 && a1 <= 218) && a12 == 0) && a4 == 14)) || (a19 <= 8 && !(a19 == 8))) || ((((a19 == 9 && a10 == 4) && a12 == 0) && a1 + 14285 <= 0) && a4 == 14)) || (((((a1 <= 505232 && 218 < a1) && a19 == 9) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a19 == 9) && a12 == 0) && a10 == 2) && a4 == 14)) || (((((a10 == 3 && 218 < a1) && a19 == 9) && a12 == 0) && a4 == 14) && a1 <= 589865)) || (!(a10 == 4) && a19 == 8)) || (a19 == 9 && (((a1 <= 218 && 0 < a1 + 13) && a10 == 4) && a12 == 0) && a4 == 14)) || ((((218 < a1 && a1 <= 589891) && a10 == 1) && a12 == 0) && a4 == 14)) || ((((a10 == 3 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || (((a12 == 0 && a19 == 8) && (\exists v_prenex_49 : int :: ((218 < v_prenex_49 && a1 + 545163 <= 9 * v_prenex_49 / 10) && 0 <= 9 * v_prenex_49) && v_prenex_49 <= 589891)) && a4 == 14)) || (((a19 == 9 && a12 == 0) && a4 == 14) && (a10 == 0 || (a1 + 13 <= 0 && a10 == 1)))) || ((((a12 == 0 && 56 <= a1) && a4 == 14) && a10 == 1) && a1 <= 218)) || ((((a10 == 2 && a19 == 9) && a12 == 0) && a1 <= 12) && a4 == 14)) || ((((a10 == 1 && a12 == 0) && a1 <= 12) && !(a19 == 9)) && a4 == 14) - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 206 locations, 1 error locations. SAFE Result, 68.4s OverallTime, 13 OverallIterations, 7 TraceHistogramMax, 45.5s AutomataDifference, 0.0s DeadEndRemovalTime, 7.8s HoareAnnotationTime, HoareTripleCheckerStatistics: 824 SDtfs, 5675 SDslu, 264 SDs, 0 SdLazy, 15106 SolverSat, 2003 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 39.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2203 GetRequests, 2119 SyntacticMatches, 10 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4035occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 13 MinimizatonAttempts, 7677 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 3 LocationsWithAnnotation, 3 PreInvPairs, 123 NumberOfFragments, 593 HoareAnnotationTreeSize, 3 FomulaSimplifications, 18749 FormulaSimplificationTreeSizeReduction, 1.1s HoareSimplificationTime, 3 FomulaSimplificationsInter, 97228 FormulaSimplificationTreeSizeReductionInter, 6.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 10.6s InterpolantComputationTime, 5686 NumberOfCodeBlocks, 5686 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 5668 ConstructedInterpolants, 200 QuantifiedInterpolants, 11432567 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2792 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 5812/7214 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...