./Ultimate.py --spec /storage/repos/svcomp/c/properties/unreach-call.prp --file /storage/repos/svcomp/c/eca-rers2012/Problem15_label57_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/Problem15_label57_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 a05245e72c38d3a7f9ff0366f3967a8f0c6a7edd ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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 04:37:49,902 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-12 04:37:49,904 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-12 04:37:49,915 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-12 04:37:49,916 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-12 04:37:49,917 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-12 04:37:49,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-12 04:37:49,927 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-12 04:37:49,929 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-12 04:37:49,930 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-12 04:37:49,931 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-12 04:37:49,931 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-12 04:37:49,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-12 04:37:49,933 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-12 04:37:49,934 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-12 04:37:49,935 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-12 04:37:49,936 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-12 04:37:49,938 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-12 04:37:49,940 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-12 04:37:49,942 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-12 04:37:49,943 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-12 04:37:49,944 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-12 04:37:49,947 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-12 04:37:49,947 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-12 04:37:49,947 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-12 04:37:49,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-12 04:37:49,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-12 04:37:49,957 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-12 04:37:49,958 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-12 04:37:49,960 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-12 04:37:49,960 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-12 04:37:49,961 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-12 04:37:49,961 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-12 04:37:49,961 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-12 04:37:49,963 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-12 04:37:49,964 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-12 04:37:49,965 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-01-12 04:37:49,996 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-12 04:37:49,997 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-12 04:37:49,999 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-12 04:37:50,000 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-12 04:37:50,000 INFO L133 SettingsManager]: * Use SBE=true [2019-01-12 04:37:50,000 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-12 04:37:50,000 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-12 04:37:50,001 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-12 04:37:50,002 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-12 04:37:50,002 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-12 04:37:50,002 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-12 04:37:50,002 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-12 04:37:50,002 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-12 04:37:50,002 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-12 04:37:50,003 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-12 04:37:50,004 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-12 04:37:50,004 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-12 04:37:50,004 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-12 04:37:50,004 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-12 04:37:50,004 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-12 04:37:50,005 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-12 04:37:50,005 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-12 04:37:50,005 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-12 04:37:50,005 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-12 04:37:50,005 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-12 04:37:50,006 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-12 04:37:50,008 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-12 04:37:50,009 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-12 04:37:50,009 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 -> a05245e72c38d3a7f9ff0366f3967a8f0c6a7edd [2019-01-12 04:37:50,056 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-12 04:37:50,074 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-12 04:37:50,082 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-12 04:37:50,083 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-12 04:37:50,084 INFO L276 PluginConnector]: CDTParser initialized [2019-01-12 04:37:50,084 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/eca-rers2012/Problem15_label57_true-unreach-call.c [2019-01-12 04:37:50,142 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a07a1428/4185017f32d646bdb05dc51c46b6f911/FLAG767d9a0fe [2019-01-12 04:37:50,763 INFO L307 CDTParser]: Found 1 translation units. [2019-01-12 04:37:50,764 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/eca-rers2012/Problem15_label57_true-unreach-call.c [2019-01-12 04:37:50,785 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a07a1428/4185017f32d646bdb05dc51c46b6f911/FLAG767d9a0fe [2019-01-12 04:37:50,933 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0a07a1428/4185017f32d646bdb05dc51c46b6f911 [2019-01-12 04:37:50,937 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-12 04:37:50,939 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-12 04:37:50,940 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-12 04:37:50,940 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-12 04:37:50,946 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-12 04:37:50,947 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:37:50" (1/1) ... [2019-01-12 04:37:50,951 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4667f227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:50, skipping insertion in model container [2019-01-12 04:37:50,951 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.01 04:37:50" (1/1) ... [2019-01-12 04:37:50,960 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-12 04:37:51,047 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-12 04:37:51,956 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:37:51,967 INFO L191 MainTranslator]: Completed pre-run [2019-01-12 04:37:52,499 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-12 04:37:52,704 INFO L195 MainTranslator]: Completed translation [2019-01-12 04:37:52,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52 WrapperNode [2019-01-12 04:37:52,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-12 04:37:52,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-12 04:37:52,707 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-12 04:37:52,707 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-12 04:37:52,720 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:52,757 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:52,926 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-12 04:37:52,927 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-12 04:37:52,927 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-12 04:37:52,927 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-12 04:37:52,937 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:52,937 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:52,956 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:52,956 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:53,008 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:53,030 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:53,075 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (1/1) ... [2019-01-12 04:37:53,097 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-12 04:37:53,098 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-12 04:37:53,098 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-12 04:37:53,098 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-12 04:37:53,099 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (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 04:37:53,169 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-12 04:37:53,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-12 04:37:59,994 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-12 04:37:59,995 INFO L286 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-12 04:37:59,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:37:59 BoogieIcfgContainer [2019-01-12 04:37:59,996 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-12 04:37:59,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-12 04:37:59,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-12 04:38:00,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-12 04:38:00,002 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.01 04:37:50" (1/3) ... [2019-01-12 04:38:00,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6486258d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:38:00, skipping insertion in model container [2019-01-12 04:38:00,004 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.01 04:37:52" (2/3) ... [2019-01-12 04:38:00,004 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6486258d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.01 04:38:00, skipping insertion in model container [2019-01-12 04:38:00,005 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:37:59" (3/3) ... [2019-01-12 04:38:00,007 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label57_true-unreach-call.c [2019-01-12 04:38:00,018 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-12 04:38:00,029 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-01-12 04:38:00,047 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-01-12 04:38:00,097 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-12 04:38:00,097 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-12 04:38:00,098 INFO L383 AbstractCegarLoop]: Hoare is true [2019-01-12 04:38:00,098 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-12 04:38:00,098 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-12 04:38:00,098 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-12 04:38:00,098 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-12 04:38:00,098 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-12 04:38:00,098 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-12 04:38:00,136 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states. [2019-01-12 04:38:00,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-01-12 04:38:00,146 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:00,148 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-12 04:38:00,150 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:00,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:00,157 INFO L82 PathProgramCache]: Analyzing trace with hash 751578873, now seen corresponding path program 1 times [2019-01-12 04:38:00,159 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:00,159 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:00,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:00,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:00,209 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:00,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:00,685 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 04:38:00,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:00,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:38:00,693 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:38:00,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:38:00,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:00,712 INFO L87 Difference]: Start difference. First operand 424 states. Second operand 4 states. [2019-01-12 04:38:05,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:05,937 INFO L93 Difference]: Finished difference Result 1467 states and 2715 transitions. [2019-01-12 04:38:05,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:38:05,939 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 41 [2019-01-12 04:38:05,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:05,964 INFO L225 Difference]: With dead ends: 1467 [2019-01-12 04:38:05,964 INFO L226 Difference]: Without dead ends: 976 [2019-01-12 04:38:05,970 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 04:38:05,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2019-01-12 04:38:06,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 974. [2019-01-12 04:38:06,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2019-01-12 04:38:06,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1477 transitions. [2019-01-12 04:38:06,128 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1477 transitions. Word has length 41 [2019-01-12 04:38:06,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:06,129 INFO L480 AbstractCegarLoop]: Abstraction has 974 states and 1477 transitions. [2019-01-12 04:38:06,129 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:38:06,129 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1477 transitions. [2019-01-12 04:38:06,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-01-12 04:38:06,140 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:06,141 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-01-12 04:38:06,141 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:06,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:06,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1021933281, now seen corresponding path program 1 times [2019-01-12 04:38:06,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:06,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:06,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:06,147 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:06,147 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:06,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:06,472 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-12 04:38:06,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:06,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:38:06,475 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:38:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:38:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:06,476 INFO L87 Difference]: Start difference. First operand 974 states and 1477 transitions. Second operand 4 states. [2019-01-12 04:38:11,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:11,903 INFO L93 Difference]: Finished difference Result 3747 states and 5705 transitions. [2019-01-12 04:38:11,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:38:11,904 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 116 [2019-01-12 04:38:11,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:11,921 INFO L225 Difference]: With dead ends: 3747 [2019-01-12 04:38:11,921 INFO L226 Difference]: Without dead ends: 2775 [2019-01-12 04:38:11,929 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 04:38:11,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2775 states. [2019-01-12 04:38:11,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2775 to 1872. [2019-01-12 04:38:11,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1872 states. [2019-01-12 04:38:11,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1872 states to 1872 states and 2484 transitions. [2019-01-12 04:38:11,987 INFO L78 Accepts]: Start accepts. Automaton has 1872 states and 2484 transitions. Word has length 116 [2019-01-12 04:38:11,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:11,988 INFO L480 AbstractCegarLoop]: Abstraction has 1872 states and 2484 transitions. [2019-01-12 04:38:11,988 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:38:11,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1872 states and 2484 transitions. [2019-01-12 04:38:12,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2019-01-12 04:38:12,004 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:12,004 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1] [2019-01-12 04:38:12,005 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:12,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:12,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1419332684, now seen corresponding path program 1 times [2019-01-12 04:38:12,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:12,005 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:12,006 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:12,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:12,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 153 trivial. 0 not checked. [2019-01-12 04:38:12,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:12,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:38:12,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:38:12,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:38:12,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:38:12,975 INFO L87 Difference]: Start difference. First operand 1872 states and 2484 transitions. Second operand 5 states. [2019-01-12 04:38:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:20,947 INFO L93 Difference]: Finished difference Result 4641 states and 5945 transitions. [2019-01-12 04:38:20,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:38:20,948 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 388 [2019-01-12 04:38:20,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:20,963 INFO L225 Difference]: With dead ends: 4641 [2019-01-12 04:38:20,963 INFO L226 Difference]: Without dead ends: 2771 [2019-01-12 04:38:20,967 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:38:20,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2771 states. [2019-01-12 04:38:21,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2771 to 2471. [2019-01-12 04:38:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2471 states. [2019-01-12 04:38:21,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2471 states to 2471 states and 3125 transitions. [2019-01-12 04:38:21,014 INFO L78 Accepts]: Start accepts. Automaton has 2471 states and 3125 transitions. Word has length 388 [2019-01-12 04:38:21,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:21,015 INFO L480 AbstractCegarLoop]: Abstraction has 2471 states and 3125 transitions. [2019-01-12 04:38:21,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:38:21,016 INFO L276 IsEmpty]: Start isEmpty. Operand 2471 states and 3125 transitions. [2019-01-12 04:38:21,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2019-01-12 04:38:21,026 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:21,027 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:21,027 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:21,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:21,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1163277150, now seen corresponding path program 1 times [2019-01-12 04:38:21,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:21,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:21,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:21,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:21,481 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 265 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-01-12 04:38:21,481 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:21,481 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:38:21,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:38:21,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:38:21,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:21,483 INFO L87 Difference]: Start difference. First operand 2471 states and 3125 transitions. Second operand 4 states. [2019-01-12 04:38:25,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:25,498 INFO L93 Difference]: Finished difference Result 5542 states and 7080 transitions. [2019-01-12 04:38:25,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:38:25,498 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 462 [2019-01-12 04:38:25,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:25,514 INFO L225 Difference]: With dead ends: 5542 [2019-01-12 04:38:25,515 INFO L226 Difference]: Without dead ends: 3073 [2019-01-12 04:38:25,519 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 4 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:25,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3073 states. [2019-01-12 04:38:25,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3073 to 3071. [2019-01-12 04:38:25,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3071 states. [2019-01-12 04:38:25,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3071 states to 3071 states and 3699 transitions. [2019-01-12 04:38:25,573 INFO L78 Accepts]: Start accepts. Automaton has 3071 states and 3699 transitions. Word has length 462 [2019-01-12 04:38:25,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:25,574 INFO L480 AbstractCegarLoop]: Abstraction has 3071 states and 3699 transitions. [2019-01-12 04:38:25,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:38:25,575 INFO L276 IsEmpty]: Start isEmpty. Operand 3071 states and 3699 transitions. [2019-01-12 04:38:25,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2019-01-12 04:38:25,585 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:25,586 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:25,586 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:25,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:25,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1467053135, now seen corresponding path program 1 times [2019-01-12 04:38:25,587 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:25,587 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:25,589 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:25,589 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:25,590 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:26,176 INFO L134 CoverageAnalysis]: Checked inductivity of 350 backedges. 311 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-01-12 04:38:26,176 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:26,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:38:26,177 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:38:26,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:38:26,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:26,178 INFO L87 Difference]: Start difference. First operand 3071 states and 3699 transitions. Second operand 4 states. [2019-01-12 04:38:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:29,273 INFO L93 Difference]: Finished difference Result 6745 states and 8190 transitions. [2019-01-12 04:38:29,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:38:29,273 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 471 [2019-01-12 04:38:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:29,291 INFO L225 Difference]: With dead ends: 6745 [2019-01-12 04:38:29,291 INFO L226 Difference]: Without dead ends: 3676 [2019-01-12 04:38:29,296 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:29,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2019-01-12 04:38:29,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 3672. [2019-01-12 04:38:29,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3672 states. [2019-01-12 04:38:29,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3672 states to 3672 states and 4289 transitions. [2019-01-12 04:38:29,364 INFO L78 Accepts]: Start accepts. Automaton has 3672 states and 4289 transitions. Word has length 471 [2019-01-12 04:38:29,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:29,365 INFO L480 AbstractCegarLoop]: Abstraction has 3672 states and 4289 transitions. [2019-01-12 04:38:29,365 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:38:29,365 INFO L276 IsEmpty]: Start isEmpty. Operand 3672 states and 4289 transitions. [2019-01-12 04:38:29,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2019-01-12 04:38:29,377 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:29,378 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:29,379 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:29,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:29,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1919427349, now seen corresponding path program 1 times [2019-01-12 04:38:29,379 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:29,379 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:29,382 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:29,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:29,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:30,010 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 129 trivial. 0 not checked. [2019-01-12 04:38:30,011 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:30,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:38:30,012 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:38:30,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:38:30,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:30,014 INFO L87 Difference]: Start difference. First operand 3672 states and 4289 transitions. Second operand 3 states. [2019-01-12 04:38:33,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:33,331 INFO L93 Difference]: Finished difference Result 9136 states and 10587 transitions. [2019-01-12 04:38:33,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:38:33,332 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 492 [2019-01-12 04:38:33,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:33,354 INFO L225 Difference]: With dead ends: 9136 [2019-01-12 04:38:33,354 INFO L226 Difference]: Without dead ends: 5466 [2019-01-12 04:38:33,360 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:33,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5466 states. [2019-01-12 04:38:33,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5466 to 3971. [2019-01-12 04:38:33,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3971 states. [2019-01-12 04:38:33,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3971 states to 3971 states and 4630 transitions. [2019-01-12 04:38:33,441 INFO L78 Accepts]: Start accepts. Automaton has 3971 states and 4630 transitions. Word has length 492 [2019-01-12 04:38:33,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:33,442 INFO L480 AbstractCegarLoop]: Abstraction has 3971 states and 4630 transitions. [2019-01-12 04:38:33,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:38:33,443 INFO L276 IsEmpty]: Start isEmpty. Operand 3971 states and 4630 transitions. [2019-01-12 04:38:33,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2019-01-12 04:38:33,459 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:33,460 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:38:33,460 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:33,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:33,460 INFO L82 PathProgramCache]: Analyzing trace with hash -1416928913, now seen corresponding path program 1 times [2019-01-12 04:38:33,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:33,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:33,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:33,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:33,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 155 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2019-01-12 04:38:34,087 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:34,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:38:34,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:38:34,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:38:34,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:34,092 INFO L87 Difference]: Start difference. First operand 3971 states and 4630 transitions. Second operand 4 states. [2019-01-12 04:38:37,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:37,586 INFO L93 Difference]: Finished difference Result 13287 states and 15292 transitions. [2019-01-12 04:38:37,587 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:38:37,587 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 494 [2019-01-12 04:38:37,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:37,611 INFO L225 Difference]: With dead ends: 13287 [2019-01-12 04:38:37,611 INFO L226 Difference]: Without dead ends: 5730 [2019-01-12 04:38:37,622 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:38:37,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5730 states. [2019-01-12 04:38:37,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5730 to 5730. [2019-01-12 04:38:37,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5730 states. [2019-01-12 04:38:37,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5730 states to 5730 states and 6014 transitions. [2019-01-12 04:38:37,708 INFO L78 Accepts]: Start accepts. Automaton has 5730 states and 6014 transitions. Word has length 494 [2019-01-12 04:38:37,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:37,709 INFO L480 AbstractCegarLoop]: Abstraction has 5730 states and 6014 transitions. [2019-01-12 04:38:37,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:38:37,710 INFO L276 IsEmpty]: Start isEmpty. Operand 5730 states and 6014 transitions. [2019-01-12 04:38:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 814 [2019-01-12 04:38:37,725 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:37,725 INFO L402 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1] [2019-01-12 04:38:37,726 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:37,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:37,726 INFO L82 PathProgramCache]: Analyzing trace with hash -1386252808, now seen corresponding path program 1 times [2019-01-12 04:38:37,726 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:37,726 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:37,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:37,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:37,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:38,401 INFO L134 CoverageAnalysis]: Checked inductivity of 1359 backedges. 998 proven. 0 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2019-01-12 04:38:38,401 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:38,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:38:38,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:38:38,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:38:38,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:38,403 INFO L87 Difference]: Start difference. First operand 5730 states and 6014 transitions. Second operand 3 states. [2019-01-12 04:38:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:40,136 INFO L93 Difference]: Finished difference Result 14449 states and 15177 transitions. [2019-01-12 04:38:40,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:38:40,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 813 [2019-01-12 04:38:40,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:40,171 INFO L225 Difference]: With dead ends: 14449 [2019-01-12 04:38:40,171 INFO L226 Difference]: Without dead ends: 8721 [2019-01-12 04:38:40,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:40,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2019-01-12 04:38:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 7226. [2019-01-12 04:38:40,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7226 states. [2019-01-12 04:38:40,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7226 states to 7226 states and 7572 transitions. [2019-01-12 04:38:40,284 INFO L78 Accepts]: Start accepts. Automaton has 7226 states and 7572 transitions. Word has length 813 [2019-01-12 04:38:40,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:40,285 INFO L480 AbstractCegarLoop]: Abstraction has 7226 states and 7572 transitions. [2019-01-12 04:38:40,285 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:38:40,286 INFO L276 IsEmpty]: Start isEmpty. Operand 7226 states and 7572 transitions. [2019-01-12 04:38:40,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 827 [2019-01-12 04:38:40,305 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:40,305 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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] [2019-01-12 04:38:40,307 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:40,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:40,307 INFO L82 PathProgramCache]: Analyzing trace with hash 462925156, now seen corresponding path program 1 times [2019-01-12 04:38:40,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:40,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:40,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:40,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:40,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:41,164 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 532 proven. 0 refuted. 0 times theorem prover too weak. 502 trivial. 0 not checked. [2019-01-12 04:38:41,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:38:41,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-12 04:38:41,165 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-12 04:38:41,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-12 04:38:41,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:41,166 INFO L87 Difference]: Start difference. First operand 7226 states and 7572 transitions. Second operand 3 states. [2019-01-12 04:38:43,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:38:43,152 INFO L93 Difference]: Finished difference Result 15346 states and 16079 transitions. [2019-01-12 04:38:43,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-12 04:38:43,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 826 [2019-01-12 04:38:43,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:38:43,169 INFO L225 Difference]: With dead ends: 15346 [2019-01-12 04:38:43,170 INFO L226 Difference]: Without dead ends: 8122 [2019-01-12 04:38:43,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-12 04:38:43,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8122 states. [2019-01-12 04:38:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8122 to 7225. [2019-01-12 04:38:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7225 states. [2019-01-12 04:38:43,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7225 states to 7225 states and 7570 transitions. [2019-01-12 04:38:43,265 INFO L78 Accepts]: Start accepts. Automaton has 7225 states and 7570 transitions. Word has length 826 [2019-01-12 04:38:43,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:38:43,266 INFO L480 AbstractCegarLoop]: Abstraction has 7225 states and 7570 transitions. [2019-01-12 04:38:43,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-12 04:38:43,266 INFO L276 IsEmpty]: Start isEmpty. Operand 7225 states and 7570 transitions. [2019-01-12 04:38:43,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 848 [2019-01-12 04:38:43,284 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:38:43,284 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 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, 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] [2019-01-12 04:38:43,285 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:38:43,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:38:43,285 INFO L82 PathProgramCache]: Analyzing trace with hash 849786758, now seen corresponding path program 1 times [2019-01-12 04:38:43,285 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:38:43,285 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:38:43,288 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:43,288 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:43,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:38:43,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:45,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 39 proven. 531 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2019-01-12 04:38:45,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:38:45,044 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 04:38:45,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:38:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:38:45,343 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:38:46,607 WARN L860 $PredicateComparison]: unable to prove that (or (exists ((v_~a0~0_825 Int)) (and (<= (+ v_~a0~0_825 44) 0) (<= (mod v_~a0~0_825 299926) (+ c_~a0~0 300074)) (<= 0 v_~a0~0_825))) (exists ((v_prenex_1 Int)) (let ((.cse0 (mod v_prenex_1 299926))) (and (not (= .cse0 0)) (< v_prenex_1 0) (<= (+ v_prenex_1 44) 0) (<= .cse0 (+ c_~a0~0 600000))))) (exists ((v_prenex_2 Int)) (let ((.cse1 (mod v_prenex_2 299926))) (and (= .cse1 0) (<= (+ v_prenex_2 44) 0) (<= .cse1 (+ c_~a0~0 300074)))))) is different from true [2019-01-12 04:38:49,648 WARN L181 SmtUtils]: Spent 2.54 s on a formula simplification. DAG size of input: 164 DAG size of output: 42 [2019-01-12 04:38:52,338 INFO L134 CoverageAnalysis]: Checked inductivity of 1050 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 480 trivial. 454 not checked. [2019-01-12 04:38:52,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:38:52,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 04:38:52,360 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:38:52,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:38:52,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=35, Unknown=1, NotChecked=12, Total=72 [2019-01-12 04:38:52,361 INFO L87 Difference]: Start difference. First operand 7225 states and 7570 transitions. Second operand 9 states. [2019-01-12 04:39:05,109 WARN L181 SmtUtils]: Spent 4.53 s on a formula simplification. DAG size of input: 38 DAG size of output: 19 [2019-01-12 04:39:09,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:39:09,013 INFO L93 Difference]: Finished difference Result 18778 states and 19649 transitions. [2019-01-12 04:39:09,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-12 04:39:09,014 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 847 [2019-01-12 04:39:09,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:39:09,048 INFO L225 Difference]: With dead ends: 18778 [2019-01-12 04:39:09,048 INFO L226 Difference]: Without dead ends: 18776 [2019-01-12 04:39:09,054 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 855 GetRequests, 844 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=42, Invalid=70, Unknown=2, NotChecked=18, Total=132 [2019-01-12 04:39:09,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18776 states. [2019-01-12 04:39:09,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18776 to 14578. [2019-01-12 04:39:09,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14578 states. [2019-01-12 04:39:09,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14578 states to 14578 states and 15280 transitions. [2019-01-12 04:39:09,327 INFO L78 Accepts]: Start accepts. Automaton has 14578 states and 15280 transitions. Word has length 847 [2019-01-12 04:39:09,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:39:09,328 INFO L480 AbstractCegarLoop]: Abstraction has 14578 states and 15280 transitions. [2019-01-12 04:39:09,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:39:09,328 INFO L276 IsEmpty]: Start isEmpty. Operand 14578 states and 15280 transitions. [2019-01-12 04:39:09,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 878 [2019-01-12 04:39:09,364 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:39:09,365 INFO L402 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:09,366 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:39:09,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:39:09,371 INFO L82 PathProgramCache]: Analyzing trace with hash -1005938050, now seen corresponding path program 1 times [2019-01-12 04:39:09,373 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:39:09,373 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:39:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:09,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:09,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:09,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:09,950 WARN L181 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 5 [2019-01-12 04:39:10,570 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 1087 proven. 0 refuted. 0 times theorem prover too weak. 473 trivial. 0 not checked. [2019-01-12 04:39:10,571 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:39:10,571 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:39:10,573 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:39:10,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:39:10,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:39:10,573 INFO L87 Difference]: Start difference. First operand 14578 states and 15280 transitions. Second operand 4 states. [2019-01-12 04:39:13,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:39:13,102 INFO L93 Difference]: Finished difference Result 41727 states and 43740 transitions. [2019-01-12 04:39:13,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:39:13,104 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 877 [2019-01-12 04:39:13,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:39:13,150 INFO L225 Difference]: With dead ends: 41727 [2019-01-12 04:39:13,151 INFO L226 Difference]: Without dead ends: 27450 [2019-01-12 04:39:13,169 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 04:39:13,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27450 states. [2019-01-12 04:39:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27450 to 24739. [2019-01-12 04:39:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24739 states. [2019-01-12 04:39:13,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24739 states to 24739 states and 25793 transitions. [2019-01-12 04:39:13,574 INFO L78 Accepts]: Start accepts. Automaton has 24739 states and 25793 transitions. Word has length 877 [2019-01-12 04:39:13,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:39:13,576 INFO L480 AbstractCegarLoop]: Abstraction has 24739 states and 25793 transitions. [2019-01-12 04:39:13,576 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:39:13,576 INFO L276 IsEmpty]: Start isEmpty. Operand 24739 states and 25793 transitions. [2019-01-12 04:39:13,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 954 [2019-01-12 04:39:13,642 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:39:13,643 INFO L402 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:13,643 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:39:13,644 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:39:13,646 INFO L82 PathProgramCache]: Analyzing trace with hash 527234291, now seen corresponding path program 1 times [2019-01-12 04:39:13,646 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:39:13,647 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:39:13,649 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:13,650 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:13,650 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1757 backedges. 1034 proven. 195 refuted. 0 times theorem prover too weak. 528 trivial. 0 not checked. [2019-01-12 04:39:14,933 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:39:14,934 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 04:39:14,943 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:15,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:15,192 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:39:16,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1757 backedges. 786 proven. 0 refuted. 0 times theorem prover too weak. 971 trivial. 0 not checked. [2019-01-12 04:39:16,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-12 04:39:16,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2019-01-12 04:39:16,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:39:16,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:39:16,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:39:16,470 INFO L87 Difference]: Start difference. First operand 24739 states and 25793 transitions. Second operand 6 states. [2019-01-12 04:39:27,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:39:27,584 INFO L93 Difference]: Finished difference Result 49943 states and 52147 transitions. [2019-01-12 04:39:27,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-12 04:39:27,585 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 953 [2019-01-12 04:39:27,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:39:27,624 INFO L225 Difference]: With dead ends: 49943 [2019-01-12 04:39:27,624 INFO L226 Difference]: Without dead ends: 25208 [2019-01-12 04:39:27,650 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 963 GetRequests, 955 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:39:27,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25208 states. [2019-01-12 04:39:27,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25208 to 23095. [2019-01-12 04:39:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23095 states. [2019-01-12 04:39:27,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23095 states to 23095 states and 23905 transitions. [2019-01-12 04:39:27,971 INFO L78 Accepts]: Start accepts. Automaton has 23095 states and 23905 transitions. Word has length 953 [2019-01-12 04:39:27,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:39:27,972 INFO L480 AbstractCegarLoop]: Abstraction has 23095 states and 23905 transitions. [2019-01-12 04:39:27,972 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:39:27,972 INFO L276 IsEmpty]: Start isEmpty. Operand 23095 states and 23905 transitions. [2019-01-12 04:39:28,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1033 [2019-01-12 04:39:28,003 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:39:28,004 INFO L402 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:28,005 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:39:28,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:39:28,005 INFO L82 PathProgramCache]: Analyzing trace with hash 561344990, now seen corresponding path program 1 times [2019-01-12 04:39:28,005 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:39:28,006 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:39:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:28,008 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:28,008 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:29,331 WARN L181 SmtUtils]: Spent 374.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 7 [2019-01-12 04:39:29,675 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 5 [2019-01-12 04:39:31,127 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 78 proven. 1095 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-01-12 04:39:31,127 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:39:31,128 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 04:39:31,138 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:31,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:31,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:39:32,160 WARN L181 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 33 [2019-01-12 04:39:35,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1916 backedges. 78 proven. 1095 refuted. 0 times theorem prover too weak. 743 trivial. 0 not checked. [2019-01-12 04:39:35,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:39:35,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 8 [2019-01-12 04:39:35,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-12 04:39:35,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-12 04:39:35,770 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-01-12 04:39:35,770 INFO L87 Difference]: Start difference. First operand 23095 states and 23905 transitions. Second operand 9 states. [2019-01-12 04:39:45,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:39:45,464 INFO L93 Difference]: Finished difference Result 38990 states and 40410 transitions. [2019-01-12 04:39:45,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-12 04:39:45,464 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 1032 [2019-01-12 04:39:45,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:39:45,505 INFO L225 Difference]: With dead ends: 38990 [2019-01-12 04:39:45,505 INFO L226 Difference]: Without dead ends: 38988 [2019-01-12 04:39:45,517 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1038 GetRequests, 1029 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2019-01-12 04:39:45,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38988 states. [2019-01-12 04:39:45,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38988 to 17096. [2019-01-12 04:39:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17096 states. [2019-01-12 04:39:45,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17096 states to 17096 states and 17672 transitions. [2019-01-12 04:39:45,852 INFO L78 Accepts]: Start accepts. Automaton has 17096 states and 17672 transitions. Word has length 1032 [2019-01-12 04:39:45,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:39:45,853 INFO L480 AbstractCegarLoop]: Abstraction has 17096 states and 17672 transitions. [2019-01-12 04:39:45,853 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-12 04:39:45,853 INFO L276 IsEmpty]: Start isEmpty. Operand 17096 states and 17672 transitions. [2019-01-12 04:39:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1064 [2019-01-12 04:39:45,868 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:39:45,869 INFO L402 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2019-01-12 04:39:45,869 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:39:45,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:39:45,871 INFO L82 PathProgramCache]: Analyzing trace with hash -233083865, now seen corresponding path program 1 times [2019-01-12 04:39:45,872 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:39:45,872 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:39:45,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:45,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:45,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:45,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:46,511 WARN L181 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 3 [2019-01-12 04:39:47,075 INFO L134 CoverageAnalysis]: Checked inductivity of 1913 backedges. 1485 proven. 0 refuted. 0 times theorem prover too weak. 428 trivial. 0 not checked. [2019-01-12 04:39:47,075 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-12 04:39:47,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-01-12 04:39:47,076 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-01-12 04:39:47,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-01-12 04:39:47,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-01-12 04:39:47,077 INFO L87 Difference]: Start difference. First operand 17096 states and 17672 transitions. Second operand 4 states. [2019-01-12 04:39:49,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:39:49,013 INFO L93 Difference]: Finished difference Result 35701 states and 36896 transitions. [2019-01-12 04:39:49,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-12 04:39:49,013 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 1063 [2019-01-12 04:39:49,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:39:49,035 INFO L225 Difference]: With dead ends: 35701 [2019-01-12 04:39:49,035 INFO L226 Difference]: Without dead ends: 19205 [2019-01-12 04:39:49,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 04:39:49,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19205 states. [2019-01-12 04:39:49,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19205 to 16795. [2019-01-12 04:39:49,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16795 states. [2019-01-12 04:39:49,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16795 states to 16795 states and 17330 transitions. [2019-01-12 04:39:49,251 INFO L78 Accepts]: Start accepts. Automaton has 16795 states and 17330 transitions. Word has length 1063 [2019-01-12 04:39:49,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:39:49,252 INFO L480 AbstractCegarLoop]: Abstraction has 16795 states and 17330 transitions. [2019-01-12 04:39:49,252 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-01-12 04:39:49,252 INFO L276 IsEmpty]: Start isEmpty. Operand 16795 states and 17330 transitions. [2019-01-12 04:39:49,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1115 [2019-01-12 04:39:49,271 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:39:49,272 INFO L402 BasicCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:49,272 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:39:49,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:39:49,273 INFO L82 PathProgramCache]: Analyzing trace with hash 328248536, now seen corresponding path program 1 times [2019-01-12 04:39:49,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:39:49,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:39:49,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:49,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:49,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:49,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:50,078 WARN L181 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 7 [2019-01-12 04:39:52,215 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 78 proven. 1047 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-01-12 04:39:52,215 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:39:52,215 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 04:39:52,224 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:52,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:52,492 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:39:54,632 INFO L134 CoverageAnalysis]: Checked inductivity of 2011 backedges. 78 proven. 1047 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2019-01-12 04:39:54,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:39:54,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 5 [2019-01-12 04:39:54,652 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-12 04:39:54,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-12 04:39:54,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:39:54,653 INFO L87 Difference]: Start difference. First operand 16795 states and 17330 transitions. Second operand 6 states. [2019-01-12 04:39:57,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:39:57,572 INFO L93 Difference]: Finished difference Result 23995 states and 24787 transitions. [2019-01-12 04:39:57,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-12 04:39:57,574 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 1114 [2019-01-12 04:39:57,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:39:57,595 INFO L225 Difference]: With dead ends: 23995 [2019-01-12 04:39:57,595 INFO L226 Difference]: Without dead ends: 23993 [2019-01-12 04:39:57,601 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1118 GetRequests, 1111 SyntacticMatches, 3 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-01-12 04:39:57,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23993 states. [2019-01-12 04:39:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23993 to 21595. [2019-01-12 04:39:57,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21595 states. [2019-01-12 04:39:57,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21595 states to 21595 states and 22310 transitions. [2019-01-12 04:39:57,878 INFO L78 Accepts]: Start accepts. Automaton has 21595 states and 22310 transitions. Word has length 1114 [2019-01-12 04:39:57,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:39:57,880 INFO L480 AbstractCegarLoop]: Abstraction has 21595 states and 22310 transitions. [2019-01-12 04:39:57,880 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-12 04:39:57,880 INFO L276 IsEmpty]: Start isEmpty. Operand 21595 states and 22310 transitions. [2019-01-12 04:39:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1497 [2019-01-12 04:39:57,924 INFO L394 BasicCegarLoop]: Found error trace [2019-01-12 04:39:57,926 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 04:39:57,927 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-01-12 04:39:57,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-12 04:39:57,927 INFO L82 PathProgramCache]: Analyzing trace with hash 260784746, now seen corresponding path program 1 times [2019-01-12 04:39:57,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-12 04:39:57,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-12 04:39:57,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:39:57,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-12 04:39:58,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:39:58,851 WARN L181 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 9 DAG size of output: 5 [2019-01-12 04:40:00,317 INFO L134 CoverageAnalysis]: Checked inductivity of 4381 backedges. 2530 proven. 311 refuted. 0 times theorem prover too weak. 1540 trivial. 0 not checked. [2019-01-12 04:40:00,318 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-12 04:40:00,318 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 04:40:00,327 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-12 04:40:00,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-12 04:40:00,705 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-12 04:40:02,825 INFO L134 CoverageAnalysis]: Checked inductivity of 4381 backedges. 2562 proven. 311 refuted. 0 times theorem prover too weak. 1508 trivial. 0 not checked. [2019-01-12 04:40:02,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-12 04:40:02,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-01-12 04:40:02,847 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-12 04:40:02,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-12 04:40:02,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:40:02,847 INFO L87 Difference]: Start difference. First operand 21595 states and 22310 transitions. Second operand 5 states. [2019-01-12 04:40:05,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-12 04:40:05,497 INFO L93 Difference]: Finished difference Result 27886 states and 28807 transitions. [2019-01-12 04:40:05,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-12 04:40:05,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 1496 [2019-01-12 04:40:05,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-12 04:40:05,499 INFO L225 Difference]: With dead ends: 27886 [2019-01-12 04:40:05,500 INFO L226 Difference]: Without dead ends: 0 [2019-01-12 04:40:05,511 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1502 GetRequests, 1495 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-12 04:40:05,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-01-12 04:40:05,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-01-12 04:40:05,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-01-12 04:40:05,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-01-12 04:40:05,513 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1496 [2019-01-12 04:40:05,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-12 04:40:05,513 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-12 04:40:05,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-12 04:40:05,513 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-01-12 04:40:05,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-01-12 04:40:05,521 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-01-12 04:40:05,614 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:06,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:06,063 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:06,170 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:06,384 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:06,545 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:06,583 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:06,599 WARN L181 SmtUtils]: Spent 1.07 s on a formula simplification. DAG size of input: 558 DAG size of output: 480 [2019-01-12 04:40:06,642 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,009 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,057 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,154 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,347 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,503 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,531 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,540 WARN L181 SmtUtils]: Spent 937.00 ms on a formula simplification. DAG size of input: 558 DAG size of output: 480 [2019-01-12 04:40:07,574 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,817 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,845 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:07,904 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:08,051 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:08,139 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:08,157 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2019-01-12 04:40:08,163 WARN L181 SmtUtils]: Spent 619.00 ms on a formula simplification. DAG size of input: 558 DAG size of output: 480 [2019-01-12 04:40:27,297 WARN L181 SmtUtils]: Spent 19.13 s on a formula simplification. DAG size of input: 468 DAG size of output: 135 [2019-01-12 04:40:45,778 WARN L181 SmtUtils]: Spent 18.48 s on a formula simplification. DAG size of input: 468 DAG size of output: 135 [2019-01-12 04:41:04,240 WARN L181 SmtUtils]: Spent 18.46 s on a formula simplification. DAG size of input: 468 DAG size of output: 135 [2019-01-12 04:41:04,244 INFO L448 ceAbstractionStarter]: For program point L234(lines 234 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L102-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L895(lines 895 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L367(lines 367 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L1162(lines 1162 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L105-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L1030(lines 1030 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L634(lines 634 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L1559(lines 1559 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,245 INFO L448 ceAbstractionStarter]: For program point L502(lines 502 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L768(lines 768 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L108-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L901(lines 901 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L1694(lines 1694 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L373(lines 373 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L241(lines 241 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L1431(lines 1431 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L1035(lines 1035 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,246 INFO L448 ceAbstractionStarter]: For program point L507(lines 507 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L1300(lines 1300 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L1168(lines 1168 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L111-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L641(lines 641 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L1566(lines 1566 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L1038(lines 1038 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L774(lines 774 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L642(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L642-2(lines 642 651) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L114-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,247 INFO L448 ceAbstractionStarter]: For program point L907(lines 907 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 130) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L247(lines 247 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L1172(lines 1172 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L1701(lines 1701 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L380(lines 380 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L1570(lines 1570 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L1438(lines 1438 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L1306(lines 1306 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,248 INFO L448 ceAbstractionStarter]: For program point L117-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L1571(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L514(lines 514 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L1571-2(lines 1571 1581) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L1439(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L1439-2(lines 1439 1448) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L779(lines 779 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L1044(lines 1044 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L912(lines 912 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L384(lines 384 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,249 INFO L448 ceAbstractionStarter]: For program point L120-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,250 INFO L448 ceAbstractionStarter]: For program point L1706(lines 1706 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,250 INFO L448 ceAbstractionStarter]: For program point L253(lines 253 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L1178(lines 1178 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L123-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L1709(lines 1709 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L652(lines 652 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L520(lines 520 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L1313(lines 1313 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2019-01-12 04:41:04,252 INFO L448 ceAbstractionStarter]: For program point L1049(lines 1049 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L1710(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L1710-2(lines 1710 1721) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L521(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L521-2(lines 521 528) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L1050(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L1050-2(lines 1050 1061) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L786(lines 786 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L390(lines 390 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L126-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L919(lines 919 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L391(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:41:04,253 INFO L448 ceAbstractionStarter]: For program point L391-2(lines 391 402) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L1184(lines 1184 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L1449(lines 1449 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L1317(lines 1317 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L260(lines 260 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L657(lines 657 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L1582(lines 1582 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L129-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-01-12 04:41:04,254 INFO L448 ceAbstractionStarter]: For program point L1321(lines 1321 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,255 INFO L448 ceAbstractionStarter]: For program point L132-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,255 INFO L448 ceAbstractionStarter]: For program point L925(lines 925 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,263 INFO L448 ceAbstractionStarter]: For program point L793(lines 793 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L529(lines 529 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L1322(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L1322-2(lines 1322 1332) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L1190(lines 1190 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L794(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L794-2(lines 794 803) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L662(lines 662 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L530(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:41:04,264 INFO L448 ceAbstractionStarter]: For program point L530-2(lines 530 541) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L266(lines 266 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L1456(lines 1456 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L135-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L1589(lines 1589 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L1722(lines 1722 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L1062(lines 1062 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L930(lines 930 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L138-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L1063(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:41:04,265 INFO L448 ceAbstractionStarter]: For program point L1063-2(lines 1063 1073) no Hoare annotation was computed. [2019-01-12 04:41:04,266 INFO L448 ceAbstractionStarter]: For program point L403(lines 403 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,272 INFO L448 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2019-01-12 04:41:04,272 INFO L448 ceAbstractionStarter]: For program point L668(lines 668 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,272 INFO L448 ceAbstractionStarter]: For program point L1461(lines 1461 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,272 INFO L448 ceAbstractionStarter]: For program point L1197(lines 1197 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,272 INFO L448 ceAbstractionStarter]: For program point L273(lines 273 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,272 INFO L448 ceAbstractionStarter]: For program point L141-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,272 INFO L448 ceAbstractionStarter]: For program point L1595(lines 1595 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L935(lines 935 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L804(lines 804 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L1729(lines 1729 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L408(lines 408 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L1333(lines 1333 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L144-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L1466(lines 1466 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L542(lines 542 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L278(lines 278 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,273 INFO L448 ceAbstractionStarter]: For program point L1203(lines 1203 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L675(lines 675 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L147-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L1602(lines 1602 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L1338(lines 1338 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L1074(lines 1074 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L942(lines 942 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L1735(lines 1735 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L546(lines 546 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L150-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,274 INFO L448 ceAbstractionStarter]: For program point L811(lines 811 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L547(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L547-2(lines 547 556) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L415(lines 415 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L1208(lines 1208 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L1473(lines 1473 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L681(lines 681 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L1606(lines 1606 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L285(lines 285 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L153-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2019-01-12 04:41:04,275 INFO L448 ceAbstractionStarter]: For program point L1344(lines 1344 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L1212(lines 1212 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L948(lines 948 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L156-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L1081(lines 1081 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L24(lines 24 26) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L24-2(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L817(lines 817 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L1742(lines 1742 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L1478(lines 1478 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2019-01-12 04:41:04,276 INFO L448 ceAbstractionStarter]: For program point L422(lines 422 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,277 INFO L448 ceAbstractionStarter]: For program point L687(lines 687 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L1612(lines 1612 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L159-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L27-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L1613(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L1613-2(lines 1613 1622) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L292(lines 292 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2019-01-12 04:41:04,281 INFO L448 ceAbstractionStarter]: For program point L557(lines 557 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L1482(lines 1482 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L1350(lines 1350 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L1218(lines 1218 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L1086(lines 1086 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L558(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L558-2(lines 558 568) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L1351(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L1351-2(lines 1351 1358) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L162-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L30-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L955(lines 955 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,282 INFO L448 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L824(lines 824 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L1749(lines 1749 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L428(lines 428 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L693(lines 693 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L165-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L33-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L694(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L694-2(lines 694 706) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2019-01-12 04:41:04,283 INFO L448 ceAbstractionStarter]: For program point L1091(lines 1091 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L959(lines 959 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L1488(lines 1488 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L299(lines 299 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L1224(lines 1224 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L168-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L36-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L829(lines 829 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L433(lines 433 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-01-12 04:41:04,284 INFO L448 ceAbstractionStarter]: For program point L830(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:41:04,285 INFO L448 ceAbstractionStarter]: For program point L830-2(lines 830 839) no Hoare annotation was computed. [2019-01-12 04:41:04,285 INFO L448 ceAbstractionStarter]: For program point L1623(lines 1623 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,285 INFO L448 ceAbstractionStarter]: For program point L1359(lines 1359 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,285 INFO L448 ceAbstractionStarter]: For program point L171-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,285 INFO L448 ceAbstractionStarter]: For program point L39-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,286 INFO L444 ceAbstractionStarter]: At program point L1757(lines 1658 1758) the Hoare annotation is: (let ((.cse24 (+ ~a0~0 61)) (.cse12 (<= (+ ~a4~0 86) 0)) (.cse2 (not (= ~a2~0 5)))) (let ((.cse22 (= ~a2~0 1)) (.cse20 (and .cse12 .cse2)) (.cse11 (< 0 .cse24)) (.cse1 (not (= 1 ~a2~0))) (.cse3 (not (= 4 ~a2~0)))) (let ((.cse7 (or (and .cse20 .cse1 .cse3) (and .cse11 .cse1 .cse2 .cse3))) (.cse4 (< 43 ~a29~0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse17 (< 0 (+ ~a0~0 147))) (.cse8 (exists ((v_prenex_20 Int)) (let ((.cse25 (* 9 v_prenex_20))) (let ((.cse26 (div .cse25 10))) (and (<= 0 .cse25) (<= (+ ~a29~0 80) (mod (+ .cse26 22) 63)) (<= 26438 .cse26)))))) (.cse19 (< 0 (+ ~a29~0 144))) (.cse14 (and (= ~a2~0 4) .cse20)) (.cse10 (<= ~a29~0 41)) (.cse13 (< 0 (+ ~a29~0 16))) (.cse6 (<= 0 (+ ~a0~0 595438))) (.cse16 (and .cse12 .cse22)) (.cse23 (<= ~a29~0 43)) (.cse15 (<= .cse24 0)) (.cse9 (<= 0 (+ ~a0~0 595423))) (.cse21 (= ~a2~0 2)) (.cse0 (<= (+ ~a0~0 32950) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= 0 (+ ~a0~0 399360)) .cse4) (and .cse5 .cse6 .cse1 .cse4) (and .cse7 .cse8) (and .cse5 .cse1 .cse2 .cse9 .cse3) (and .cse10 (and (<= (+ ~a0~0 588830) 0) .cse1 .cse2 .cse3)) (and .cse11 .cse1 .cse12 .cse3 .cse4) (and .cse10 (and .cse7 .cse13)) (and .cse14 .cse8) (and .cse7 .cse15) (and .cse5 .cse12) (and .cse8 .cse16) (and .cse7 .cse4) (and .cse5 .cse10 .cse13 .cse17) (and .cse8 (exists ((v_prenex_29 Int)) (let ((.cse18 (mod v_prenex_29 299926))) (and (<= (+ v_prenex_29 44) 0) (<= (div (+ .cse18 (- 599998)) 5) (+ ~a0~0 339336)) (< v_prenex_29 0) (not (= .cse18 0)) (not (= 0 (mod (+ .cse18 2) 5))) (< .cse18 599998)))) .cse0 .cse19) (and .cse13 (and .cse20 .cse21)) (and .cse5 .cse8 .cse17) (and .cse10 (and .cse13 .cse11 .cse12)) (and .cse5 .cse17 .cse2) (and .cse17 .cse15 .cse22 .cse8 .cse19) (and .cse23 (and .cse14 .cse13 .cse11)) (and .cse10 .cse22 .cse13 .cse6) (and (and .cse16 .cse23) .cse15) (and .cse0 .cse1 .cse9) (and .cse21 .cse0))))) [2019-01-12 04:41:04,286 INFO L448 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2019-01-12 04:41:04,286 INFO L448 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-01-12 04:41:04,286 INFO L448 ceAbstractionStarter]: For program point L569(lines 569 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,286 INFO L448 ceAbstractionStarter]: For program point L1494(lines 1494 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,286 INFO L448 ceAbstractionStarter]: For program point L1098(lines 1098 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,286 INFO L448 ceAbstractionStarter]: For program point L966(lines 966 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,286 INFO L448 ceAbstractionStarter]: For program point L306(lines 306 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L1231(lines 1231 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L174-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L1099(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L42-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L1099-2(lines 1099 1107) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L451 ceAbstractionStarter]: At program point L1760(lines 1760 1776) the Hoare annotation is: true [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L439(lines 439 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L307(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L307-2(lines 307 319) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2019-01-12 04:41:04,287 INFO L448 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L1629(lines 1629 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L1365(lines 1365 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L177-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L45-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L574(lines 574 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L707(lines 707 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L575(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L575-2(lines 575 586) no Hoare annotation was computed. [2019-01-12 04:41:04,288 INFO L448 ceAbstractionStarter]: For program point L840(lines 840 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,289 INFO L448 ceAbstractionStarter]: For program point L1501(lines 1501 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,289 INFO L448 ceAbstractionStarter]: For program point L1237(lines 1237 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,289 INFO L448 ceAbstractionStarter]: For program point L180-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,289 INFO L448 ceAbstractionStarter]: For program point L48-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,289 INFO L448 ceAbstractionStarter]: For program point L973(lines 973 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,289 INFO L444 ceAbstractionStarter]: At program point L1766-2(lines 1766 1775) the Hoare annotation is: (let ((.cse24 (+ ~a0~0 61)) (.cse12 (<= (+ ~a4~0 86) 0)) (.cse2 (not (= ~a2~0 5)))) (let ((.cse22 (= ~a2~0 1)) (.cse20 (and .cse12 .cse2)) (.cse11 (< 0 .cse24)) (.cse1 (not (= 1 ~a2~0))) (.cse3 (not (= 4 ~a2~0)))) (let ((.cse7 (or (and .cse20 .cse1 .cse3) (and .cse11 .cse1 .cse2 .cse3))) (.cse4 (< 43 ~a29~0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse17 (< 0 (+ ~a0~0 147))) (.cse8 (exists ((v_prenex_20 Int)) (let ((.cse25 (* 9 v_prenex_20))) (let ((.cse26 (div .cse25 10))) (and (<= 0 .cse25) (<= (+ ~a29~0 80) (mod (+ .cse26 22) 63)) (<= 26438 .cse26)))))) (.cse19 (< 0 (+ ~a29~0 144))) (.cse14 (and (= ~a2~0 4) .cse20)) (.cse10 (<= ~a29~0 41)) (.cse13 (< 0 (+ ~a29~0 16))) (.cse6 (<= 0 (+ ~a0~0 595438))) (.cse16 (and .cse12 .cse22)) (.cse23 (<= ~a29~0 43)) (.cse15 (<= .cse24 0)) (.cse9 (<= 0 (+ ~a0~0 595423))) (.cse21 (= ~a2~0 2)) (.cse0 (<= (+ ~a0~0 32950) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= 0 (+ ~a0~0 399360)) .cse4) (and .cse5 .cse6 .cse1 .cse4) (and .cse7 .cse8) (and .cse5 .cse1 .cse2 .cse9 .cse3) (and .cse10 (and (<= (+ ~a0~0 588830) 0) .cse1 .cse2 .cse3)) (and .cse11 .cse1 .cse12 .cse3 .cse4) (and .cse10 (and .cse7 .cse13)) (and .cse14 .cse8) (and .cse7 .cse15) (and .cse5 .cse12) (and .cse8 .cse16) (and .cse7 .cse4) (and .cse5 .cse10 .cse13 .cse17) (and .cse8 (exists ((v_prenex_29 Int)) (let ((.cse18 (mod v_prenex_29 299926))) (and (<= (+ v_prenex_29 44) 0) (<= (div (+ .cse18 (- 599998)) 5) (+ ~a0~0 339336)) (< v_prenex_29 0) (not (= .cse18 0)) (not (= 0 (mod (+ .cse18 2) 5))) (< .cse18 599998)))) .cse0 .cse19) (and .cse13 (and .cse20 .cse21)) (and .cse5 .cse8 .cse17) (and .cse10 (and .cse13 .cse11 .cse12)) (and .cse5 .cse17 .cse2) (and .cse17 .cse15 .cse22 .cse8 .cse19) (and .cse23 (and .cse14 .cse13 .cse11)) (and .cse10 .cse22 .cse13 .cse6) (and (and .cse16 .cse23) .cse15) (and .cse0 .cse1 .cse9) (and .cse21 .cse0))))) [2019-01-12 04:41:04,289 INFO L448 ceAbstractionStarter]: For program point L445(lines 445 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L1635(lines 1635 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L1371(lines 1371 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L183-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L1108(lines 1108 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L51-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L712(lines 712 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2019-01-12 04:41:04,290 INFO L448 ceAbstractionStarter]: For program point L845(lines 845 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,291 INFO L448 ceAbstractionStarter]: For program point L449(lines 449 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L1771(line 1771) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L1243(lines 1243 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L186-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L54-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L979(lines 979 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L1640(lines 1640 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L1508(lines 1508 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,296 INFO L448 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L320(lines 320 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L1378(lines 1378 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L189-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L57-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L718(lines 718 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L1511(lines 1511 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L1115(lines 1115 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2019-01-12 04:41:04,297 INFO L448 ceAbstractionStarter]: For program point L851(lines 851 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L587(lines 587 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L456(lines 456 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L1249(lines 1249 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L192-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L60-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L985(lines 985 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L1647(lines 1647 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L855(lines 855 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,298 INFO L448 ceAbstractionStarter]: For program point L1516(lines 1516 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L327(lines 327 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L195-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L63-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L1385(lines 1385 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L725(lines 725 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L1122(lines 1122 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L594(lines 594 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L462(lines 462 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L1255(lines 1255 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,299 INFO L448 ceAbstractionStarter]: For program point L198-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,300 INFO L448 ceAbstractionStarter]: For program point L66-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,300 INFO L448 ceAbstractionStarter]: For program point L595(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:41:04,305 INFO L448 ceAbstractionStarter]: For program point L595-2(lines 595 605) no Hoare annotation was computed. [2019-01-12 04:41:04,305 INFO L448 ceAbstractionStarter]: For program point L1388(lines 1388 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,305 INFO L448 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2019-01-12 04:41:04,305 INFO L448 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2019-01-12 04:41:04,305 INFO L448 ceAbstractionStarter]: For program point L992(lines 992 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,305 INFO L448 ceAbstractionStarter]: For program point L1522(lines 1522 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,306 INFO L448 ceAbstractionStarter]: For program point L333(lines 333 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,306 INFO L448 ceAbstractionStarter]: For program point L201-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,309 INFO L448 ceAbstractionStarter]: For program point L69-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,309 INFO L448 ceAbstractionStarter]: For program point L862(lines 862 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L444 ceAbstractionStarter]: At program point L1655(lines 23 1656) the Hoare annotation is: (let ((.cse24 (+ ~a0~0 61)) (.cse12 (<= (+ ~a4~0 86) 0)) (.cse2 (not (= ~a2~0 5)))) (let ((.cse22 (= ~a2~0 1)) (.cse20 (and .cse12 .cse2)) (.cse11 (< 0 .cse24)) (.cse1 (not (= 1 ~a2~0))) (.cse3 (not (= 4 ~a2~0)))) (let ((.cse7 (or (and .cse20 .cse1 .cse3) (and .cse11 .cse1 .cse2 .cse3))) (.cse4 (< 43 ~a29~0)) (.cse5 (<= (+ ~a0~0 98) 0)) (.cse17 (< 0 (+ ~a0~0 147))) (.cse8 (exists ((v_prenex_20 Int)) (let ((.cse25 (* 9 v_prenex_20))) (let ((.cse26 (div .cse25 10))) (and (<= 0 .cse25) (<= (+ ~a29~0 80) (mod (+ .cse26 22) 63)) (<= 26438 .cse26)))))) (.cse19 (< 0 (+ ~a29~0 144))) (.cse14 (and (= ~a2~0 4) .cse20)) (.cse10 (<= ~a29~0 41)) (.cse13 (< 0 (+ ~a29~0 16))) (.cse6 (<= 0 (+ ~a0~0 595438))) (.cse16 (and .cse12 .cse22)) (.cse23 (<= ~a29~0 43)) (.cse15 (<= .cse24 0)) (.cse9 (<= 0 (+ ~a0~0 595423))) (.cse21 (= ~a2~0 2)) (.cse0 (<= (+ ~a0~0 32950) 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4) (and .cse5 (<= 0 (+ ~a0~0 399360)) .cse4) (and .cse5 .cse6 .cse1 .cse4) (and .cse7 .cse8) (and .cse5 .cse1 .cse2 .cse9 .cse3) (and .cse10 (and (<= (+ ~a0~0 588830) 0) .cse1 .cse2 .cse3)) (and .cse11 .cse1 .cse12 .cse3 .cse4) (and .cse10 (and .cse7 .cse13)) (and .cse14 .cse8) (and .cse7 .cse15) (and .cse5 .cse12) (and .cse8 .cse16) (and .cse7 .cse4) (and .cse5 .cse10 .cse13 .cse17) (and .cse8 (exists ((v_prenex_29 Int)) (let ((.cse18 (mod v_prenex_29 299926))) (and (<= (+ v_prenex_29 44) 0) (<= (div (+ .cse18 (- 599998)) 5) (+ ~a0~0 339336)) (< v_prenex_29 0) (not (= .cse18 0)) (not (= 0 (mod (+ .cse18 2) 5))) (< .cse18 599998)))) .cse0 .cse19) (and .cse13 (and .cse20 .cse21)) (and .cse5 .cse8 .cse17) (and .cse10 (and .cse13 .cse11 .cse12)) (and .cse5 .cse17 .cse2) (and .cse17 .cse15 .cse22 .cse8 .cse19) (and .cse23 (and .cse14 .cse13 .cse11)) (and .cse10 .cse22 .cse13 .cse6) (and (and .cse16 .cse23) .cse15) (and .cse0 .cse1 .cse9) (and .cse21 .cse0))))) [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L1128(lines 1128 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L732(lines 732 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L468(lines 468 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L336(lines 336 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L1261(lines 1261 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L204-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L72-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,310 INFO L448 ceAbstractionStarter]: For program point L1394(lines 1394 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L205(line 205) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L998(lines 998 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L1395(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L1395-2(lines 1395 1407) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L735(lines 735 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L1528(lines 1528 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L1264(lines 1264 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L75-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L868(lines 868 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L1661(lines 1661 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,311 INFO L448 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2019-01-12 04:41:04,312 INFO L448 ceAbstractionStarter]: For program point L341(lines 341 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L1134(lines 1134 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L606(lines 606 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L474(lines 474 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L342(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L342-2(lines 342 349) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L1135(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L78-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,317 INFO L448 ceAbstractionStarter]: For program point L1135-2(lines 1135 1144) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L1004(lines 1004 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L1533(lines 1533 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L81-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L874(lines 874 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L742(lines 742 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L1271(lines 1271 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L214(lines 214 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L1668(lines 1668 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,318 INFO L448 ceAbstractionStarter]: For program point L479(lines 479 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L84-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L613(lines 613 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L350(lines 350 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L1011(lines 1011 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L1672(lines 1672 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L1540(lines 1540 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L1408(lines 1408 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L219(lines 219 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,319 INFO L448 ceAbstractionStarter]: For program point L87-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,320 INFO L448 ceAbstractionStarter]: For program point L880(lines 880 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,320 INFO L448 ceAbstractionStarter]: For program point L748(lines 748 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L1277(lines 1277 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L220(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L220-2(lines 220 228) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L1145(lines 1145 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L486(lines 486 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L90-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,322 INFO L448 ceAbstractionStarter]: For program point L355(lines 355 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L1016(lines 1016 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L620(lines 620 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L1413(lines 1413 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L885(lines 885 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L1678(lines 1678 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L1150(lines 1150 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L93-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L886(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L886-2(lines 886 894) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L754(lines 754 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,323 INFO L448 ceAbstractionStarter]: For program point L1547(lines 1547 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L1283(lines 1283 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L1019(lines 1019 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L491(lines 491 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L96-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L361(lines 361 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L229(lines 229 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L1419(lines 1419 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,324 INFO L448 ceAbstractionStarter]: For program point L627(lines 627 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,325 INFO L448 ceAbstractionStarter]: For program point L1420(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:41:04,325 INFO L448 ceAbstractionStarter]: For program point L1420-2(lines 1420 1430) no Hoare annotation was computed. [2019-01-12 04:41:04,334 INFO L448 ceAbstractionStarter]: For program point L1156(lines 1156 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,334 INFO L448 ceAbstractionStarter]: For program point L99-1(lines 23 1656) no Hoare annotation was computed. [2019-01-12 04:41:04,334 INFO L448 ceAbstractionStarter]: For program point L1685(lines 1685 1756) no Hoare annotation was computed. [2019-01-12 04:41:04,334 INFO L448 ceAbstractionStarter]: For program point L1289(lines 1289 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,335 INFO L448 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2019-01-12 04:41:04,335 INFO L448 ceAbstractionStarter]: For program point L761(lines 761 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,335 INFO L448 ceAbstractionStarter]: For program point L1686(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:41:04,336 INFO L448 ceAbstractionStarter]: For program point L1686-2(lines 1686 1693) no Hoare annotation was computed. [2019-01-12 04:41:04,336 INFO L448 ceAbstractionStarter]: For program point L1554(lines 1554 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,336 INFO L448 ceAbstractionStarter]: For program point L497(lines 497 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,336 INFO L448 ceAbstractionStarter]: For program point L1290(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:41:04,336 INFO L448 ceAbstractionStarter]: For program point L1290-2(lines 1290 1299) no Hoare annotation was computed. [2019-01-12 04:41:04,336 INFO L448 ceAbstractionStarter]: For program point L1026(lines 1026 1654) no Hoare annotation was computed. [2019-01-12 04:41:04,371 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,375 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,376 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,377 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,381 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,382 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,385 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,387 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,388 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,390 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,392 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,413 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,414 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,415 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,416 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,419 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,420 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,421 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,424 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,425 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,426 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,427 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,430 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,431 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,440 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,441 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,444 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,445 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,446 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,449 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,450 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,451 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,452 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,455 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,456 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,458 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,459 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,460 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,461 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,462 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,467 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,468 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,469 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,476 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,480 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,481 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,482 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,484 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,485 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,486 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,487 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,491 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,492 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,494 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,497 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,501 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,502 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,505 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,506 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,508 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,509 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,510 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,514 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,515 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.01 04:41:04 BoogieIcfgContainer [2019-01-12 04:41:04,526 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-12 04:41:04,527 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-12 04:41:04,527 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-12 04:41:04,527 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-12 04:41:04,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.01 04:37:59" (3/4) ... [2019-01-12 04:41:04,537 INFO L144 WitnessPrinter]: Generating witness for correct program [2019-01-12 04:41:04,592 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2019-01-12 04:41:04,596 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2019-01-12 04:41:04,641 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a0 + 32950 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2)) && 43 < a29) || ((a0 + 98 <= 0 && 0 <= a0 + 399360) && 43 < a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 595438) && !(1 == a2)) && 43 < a29)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || ((((a0 + 98 <= 0 && !(1 == a2)) && !(a2 == 5)) && 0 <= a0 + 595423) && !(4 == a2))) || (a29 <= 41 && ((a0 + 588830 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) || ((((0 < a0 + 61 && !(1 == a2)) && a4 + 86 <= 0) && !(4 == a2)) && 43 < a29)) || (a29 <= 41 && ((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 0 < a29 + 16)) || ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && a4 + 86 <= 0 && a2 == 1)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 43 < a29)) || (((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 0 < a0 + 147)) || ((((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && (\exists v_prenex_29 : int :: ((((v_prenex_29 + 44 <= 0 && (v_prenex_29 % 299926 + -599998) / 5 <= a0 + 339336) && v_prenex_29 < 0) && !(v_prenex_29 % 299926 == 0)) && !(0 == (v_prenex_29 % 299926 + 2) % 5)) && v_prenex_29 % 299926 < 599998)) && a0 + 32950 <= 0) && 0 < a29 + 144)) || (0 < a29 + 16 && (a4 + 86 <= 0 && !(a2 == 5)) && a2 == 2)) || ((a0 + 98 <= 0 && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a0 + 147)) || (a29 <= 41 && (0 < a29 + 16 && 0 < a0 + 61) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && !(a2 == 5))) || ((((0 < a0 + 147 && a0 + 61 <= 0) && a2 == 1) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a29 + 144)) || (a29 <= 43 && ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && 0 < a29 + 16) && 0 < a0 + 61)) || (((a29 <= 41 && a2 == 1) && 0 < a29 + 16) && 0 <= a0 + 595438)) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a0 + 32950 <= 0 && !(1 == a2)) && 0 <= a0 + 595423)) || (a2 == 2 && a0 + 32950 <= 0) [2019-01-12 04:41:04,648 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a0 + 32950 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2)) && 43 < a29) || ((a0 + 98 <= 0 && 0 <= a0 + 399360) && 43 < a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 595438) && !(1 == a2)) && 43 < a29)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || ((((a0 + 98 <= 0 && !(1 == a2)) && !(a2 == 5)) && 0 <= a0 + 595423) && !(4 == a2))) || (a29 <= 41 && ((a0 + 588830 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) || ((((0 < a0 + 61 && !(1 == a2)) && a4 + 86 <= 0) && !(4 == a2)) && 43 < a29)) || (a29 <= 41 && ((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 0 < a29 + 16)) || ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && a4 + 86 <= 0 && a2 == 1)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 43 < a29)) || (((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 0 < a0 + 147)) || ((((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && (\exists v_prenex_29 : int :: ((((v_prenex_29 + 44 <= 0 && (v_prenex_29 % 299926 + -599998) / 5 <= a0 + 339336) && v_prenex_29 < 0) && !(v_prenex_29 % 299926 == 0)) && !(0 == (v_prenex_29 % 299926 + 2) % 5)) && v_prenex_29 % 299926 < 599998)) && a0 + 32950 <= 0) && 0 < a29 + 144)) || (0 < a29 + 16 && (a4 + 86 <= 0 && !(a2 == 5)) && a2 == 2)) || ((a0 + 98 <= 0 && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a0 + 147)) || (a29 <= 41 && (0 < a29 + 16 && 0 < a0 + 61) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && !(a2 == 5))) || ((((0 < a0 + 147 && a0 + 61 <= 0) && a2 == 1) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a29 + 144)) || (a29 <= 43 && ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && 0 < a29 + 16) && 0 < a0 + 61)) || (((a29 <= 41 && a2 == 1) && 0 < a29 + 16) && 0 <= a0 + 595438)) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a0 + 32950 <= 0 && !(1 == a2)) && 0 <= a0 + 595423)) || (a2 == 2 && a0 + 32950 <= 0) [2019-01-12 04:41:04,671 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((((((((((((((a0 + 32950 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2)) && 43 < a29) || ((a0 + 98 <= 0 && 0 <= a0 + 399360) && 43 < a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 595438) && !(1 == a2)) && 43 < a29)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || ((((a0 + 98 <= 0 && !(1 == a2)) && !(a2 == 5)) && 0 <= a0 + 595423) && !(4 == a2))) || (a29 <= 41 && ((a0 + 588830 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) || ((((0 < a0 + 61 && !(1 == a2)) && a4 + 86 <= 0) && !(4 == a2)) && 43 < a29)) || (a29 <= 41 && ((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 0 < a29 + 16)) || ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && a4 + 86 <= 0 && a2 == 1)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 43 < a29)) || (((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 0 < a0 + 147)) || ((((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && (\exists v_prenex_29 : int :: ((((v_prenex_29 + 44 <= 0 && (v_prenex_29 % 299926 + -599998) / 5 <= a0 + 339336) && v_prenex_29 < 0) && !(v_prenex_29 % 299926 == 0)) && !(0 == (v_prenex_29 % 299926 + 2) % 5)) && v_prenex_29 % 299926 < 599998)) && a0 + 32950 <= 0) && 0 < a29 + 144)) || (0 < a29 + 16 && (a4 + 86 <= 0 && !(a2 == 5)) && a2 == 2)) || ((a0 + 98 <= 0 && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a0 + 147)) || (a29 <= 41 && (0 < a29 + 16 && 0 < a0 + 61) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && !(a2 == 5))) || ((((0 < a0 + 147 && a0 + 61 <= 0) && a2 == 1) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a29 + 144)) || (a29 <= 43 && ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && 0 < a29 + 16) && 0 < a0 + 61)) || (((a29 <= 41 && a2 == 1) && 0 < a29 + 16) && 0 <= a0 + 595438)) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a0 + 32950 <= 0 && !(1 == a2)) && 0 <= a0 + 595423)) || (a2 == 2 && a0 + 32950 <= 0) [2019-01-12 04:41:04,908 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-12 04:41:04,908 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-12 04:41:04,909 INFO L168 Benchmark]: Toolchain (without parser) took 193971.67 ms. Allocated memory was 1.0 GB in the beginning and 4.9 GB in the end (delta: 3.9 GB). Free memory was 947.3 MB in the beginning and 4.3 GB in the end (delta: -3.4 GB). Peak memory consumption was 502.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:41:04,912 INFO L168 Benchmark]: CDTParser took 0.16 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 04:41:04,912 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1765.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. [2019-01-12 04:41:04,914 INFO L168 Benchmark]: Boogie Procedure Inliner took 220.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. [2019-01-12 04:41:04,914 INFO L168 Benchmark]: Boogie Preprocessor took 171.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2019-01-12 04:41:04,914 INFO L168 Benchmark]: RCFGBuilder took 6898.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.9 MB). Peak memory consumption was 318.8 MB. Max. memory is 11.5 GB. [2019-01-12 04:41:04,919 INFO L168 Benchmark]: TraceAbstraction took 184529.15 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. [2019-01-12 04:41:04,920 INFO L168 Benchmark]: Witness Printer took 381.38 ms. Allocated memory is still 4.9 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 MB. Max. memory is 11.5 GB. [2019-01-12 04:41:04,924 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.16 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 1765.92 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -184.9 MB). Peak memory consumption was 141.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 220.02 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 39.6 MB). Peak memory consumption was 39.6 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 171.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 6898.46 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 104.9 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -127.9 MB). Peak memory consumption was 318.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 184529.15 ms. Allocated memory was 1.3 GB in the beginning and 4.9 GB in the end (delta: 3.6 GB). Free memory was 1.2 GB in the beginning and 4.4 GB in the end (delta: -3.2 GB). Peak memory consumption was 3.7 GB. Max. memory is 11.5 GB. * Witness Printer took 381.38 ms. Allocated memory is still 4.9 GB. Free memory was 4.4 GB in the beginning and 4.3 GB in the end (delta: 79.9 MB). Peak memory consumption was 79.9 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_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 130]: 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: 1766]: Loop Invariant [2019-01-12 04:41:04,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,939 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,940 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,942 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,943 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,944 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,948 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,949 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,950 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,953 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,955 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,958 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,959 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,960 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,961 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,962 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,963 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,966 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a0 + 32950 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2)) && 43 < a29) || ((a0 + 98 <= 0 && 0 <= a0 + 399360) && 43 < a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 595438) && !(1 == a2)) && 43 < a29)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || ((((a0 + 98 <= 0 && !(1 == a2)) && !(a2 == 5)) && 0 <= a0 + 595423) && !(4 == a2))) || (a29 <= 41 && ((a0 + 588830 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) || ((((0 < a0 + 61 && !(1 == a2)) && a4 + 86 <= 0) && !(4 == a2)) && 43 < a29)) || (a29 <= 41 && ((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 0 < a29 + 16)) || ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && a4 + 86 <= 0 && a2 == 1)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 43 < a29)) || (((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 0 < a0 + 147)) || ((((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && (\exists v_prenex_29 : int :: ((((v_prenex_29 + 44 <= 0 && (v_prenex_29 % 299926 + -599998) / 5 <= a0 + 339336) && v_prenex_29 < 0) && !(v_prenex_29 % 299926 == 0)) && !(0 == (v_prenex_29 % 299926 + 2) % 5)) && v_prenex_29 % 299926 < 599998)) && a0 + 32950 <= 0) && 0 < a29 + 144)) || (0 < a29 + 16 && (a4 + 86 <= 0 && !(a2 == 5)) && a2 == 2)) || ((a0 + 98 <= 0 && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a0 + 147)) || (a29 <= 41 && (0 < a29 + 16 && 0 < a0 + 61) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && !(a2 == 5))) || ((((0 < a0 + 147 && a0 + 61 <= 0) && a2 == 1) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a29 + 144)) || (a29 <= 43 && ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && 0 < a29 + 16) && 0 < a0 + 61)) || (((a29 <= 41 && a2 == 1) && 0 < a29 + 16) && 0 <= a0 + 595438)) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a0 + 32950 <= 0 && !(1 == a2)) && 0 <= a0 + 595423)) || (a2 == 2 && a0 + 32950 <= 0) - InvariantResult [Line: 23]: Loop Invariant [2019-01-12 04:41:04,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,971 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,972 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,976 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,977 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,978 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,979 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,980 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,984 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,985 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,986 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,989 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,990 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,991 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:04,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,994 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:04,995 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a0 + 32950 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2)) && 43 < a29) || ((a0 + 98 <= 0 && 0 <= a0 + 399360) && 43 < a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 595438) && !(1 == a2)) && 43 < a29)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || ((((a0 + 98 <= 0 && !(1 == a2)) && !(a2 == 5)) && 0 <= a0 + 595423) && !(4 == a2))) || (a29 <= 41 && ((a0 + 588830 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) || ((((0 < a0 + 61 && !(1 == a2)) && a4 + 86 <= 0) && !(4 == a2)) && 43 < a29)) || (a29 <= 41 && ((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 0 < a29 + 16)) || ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && a4 + 86 <= 0 && a2 == 1)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 43 < a29)) || (((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 0 < a0 + 147)) || ((((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && (\exists v_prenex_29 : int :: ((((v_prenex_29 + 44 <= 0 && (v_prenex_29 % 299926 + -599998) / 5 <= a0 + 339336) && v_prenex_29 < 0) && !(v_prenex_29 % 299926 == 0)) && !(0 == (v_prenex_29 % 299926 + 2) % 5)) && v_prenex_29 % 299926 < 599998)) && a0 + 32950 <= 0) && 0 < a29 + 144)) || (0 < a29 + 16 && (a4 + 86 <= 0 && !(a2 == 5)) && a2 == 2)) || ((a0 + 98 <= 0 && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a0 + 147)) || (a29 <= 41 && (0 < a29 + 16 && 0 < a0 + 61) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && !(a2 == 5))) || ((((0 < a0 + 147 && a0 + 61 <= 0) && a2 == 1) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a29 + 144)) || (a29 <= 43 && ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && 0 < a29 + 16) && 0 < a0 + 61)) || (((a29 <= 41 && a2 == 1) && 0 < a29 + 16) && 0 <= a0 + 595438)) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a0 + 32950 <= 0 && !(1 == a2)) && 0 <= a0 + 595423)) || (a2 == 2 && a0 + 32950 <= 0) - InvariantResult [Line: 1658]: Loop Invariant [2019-01-12 04:41:05,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,000 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,001 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,003 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,004 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,005 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,009 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,010 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,014 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,015 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,016 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,017 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,018 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,024 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_29,QUANTIFIED] [2019-01-12 04:41:05,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,025 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] [2019-01-12 04:41:05,026 WARN L416 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_20,QUANTIFIED] Derived loop invariant: (((((((((((((((((((((((((((a0 + 32950 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2)) && 43 < a29) || ((a0 + 98 <= 0 && 0 <= a0 + 399360) && 43 < a29)) || (((a0 + 98 <= 0 && 0 <= a0 + 595438) && !(1 == a2)) && 43 < a29)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || ((((a0 + 98 <= 0 && !(1 == a2)) && !(a2 == 5)) && 0 <= a0 + 595423) && !(4 == a2))) || (a29 <= 41 && ((a0 + 588830 <= 0 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) || ((((0 < a0 + 61 && !(1 == a2)) && a4 + 86 <= 0) && !(4 == a2)) && 43 < a29)) || (a29 <= 41 && ((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 0 < a29 + 16)) || ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10))) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && a0 + 61 <= 0)) || (a0 + 98 <= 0 && a4 + 86 <= 0)) || ((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && a4 + 86 <= 0 && a2 == 1)) || (((((a4 + 86 <= 0 && !(a2 == 5)) && !(1 == a2)) && !(4 == a2)) || (((0 < a0 + 61 && !(1 == a2)) && !(a2 == 5)) && !(4 == a2))) && 43 < a29)) || (((a0 + 98 <= 0 && a29 <= 41) && 0 < a29 + 16) && 0 < a0 + 147)) || ((((\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10) && (\exists v_prenex_29 : int :: ((((v_prenex_29 + 44 <= 0 && (v_prenex_29 % 299926 + -599998) / 5 <= a0 + 339336) && v_prenex_29 < 0) && !(v_prenex_29 % 299926 == 0)) && !(0 == (v_prenex_29 % 299926 + 2) % 5)) && v_prenex_29 % 299926 < 599998)) && a0 + 32950 <= 0) && 0 < a29 + 144)) || (0 < a29 + 16 && (a4 + 86 <= 0 && !(a2 == 5)) && a2 == 2)) || ((a0 + 98 <= 0 && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a0 + 147)) || (a29 <= 41 && (0 < a29 + 16 && 0 < a0 + 61) && a4 + 86 <= 0)) || ((a0 + 98 <= 0 && 0 < a0 + 147) && !(a2 == 5))) || ((((0 < a0 + 147 && a0 + 61 <= 0) && a2 == 1) && (\exists v_prenex_20 : int :: (0 <= 9 * v_prenex_20 && a29 + 80 <= (9 * v_prenex_20 / 10 + 22) % 63) && 26438 <= 9 * v_prenex_20 / 10)) && 0 < a29 + 144)) || (a29 <= 43 && ((a2 == 4 && a4 + 86 <= 0 && !(a2 == 5)) && 0 < a29 + 16) && 0 < a0 + 61)) || (((a29 <= 41 && a2 == 1) && 0 < a29 + 16) && 0 <= a0 + 595438)) || (((a4 + 86 <= 0 && a2 == 1) && a29 <= 43) && a0 + 61 <= 0)) || ((a0 + 32950 <= 0 && !(1 == a2)) && 0 <= a0 + 595423)) || (a2 == 2 && a0 + 32950 <= 0) - InvariantResult [Line: 1760]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 424 locations, 1 error locations. SAFE Result, 184.2s OverallTime, 16 OverallIterations, 9 TraceHistogramMax, 84.3s AutomataDifference, 0.0s DeadEndRemovalTime, 58.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 3268 SDtfs, 13567 SDslu, 1044 SDs, 0 SdLazy, 33395 SolverSat, 3807 SolverUnsat, 4 SolverUnknown, 0 SolverNotchecked, 68.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5526 GetRequests, 5453 SyntacticMatches, 20 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 14.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24739occurred 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: 2.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 40820 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 346 NumberOfFragments, 2215 HoareAnnotationTreeSize, 4 FomulaSimplifications, 43149 FormulaSimplificationTreeSizeReduction, 2.6s HoareSimplificationTime, 4 FomulaSimplificationsInter, 346122 FormulaSimplificationTreeSizeReductionInter, 56.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.7s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 25.2s InterpolantComputationTime, 16927 NumberOfCodeBlocks, 16927 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 16906 ConstructedInterpolants, 716 QuantifiedInterpolants, 98456635 SizeOfPredicates, 4 NumberOfNonLiveVariables, 6243 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 21 InterpolantComputations, 12 PerfectInterpolantSequences, 24073/30275 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...