./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/eca-rers2012/Problem10_label01_true-unreach-call.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/eca-rers2012/Problem10_label01_true-unreach-call.c -s /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e164009279dbb4f44c2a62d6b9419f669fb4fb2b .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 11:49:54,600 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 11:49:54,601 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 11:49:54,608 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 11:49:54,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 11:49:54,609 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 11:49:54,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 11:49:54,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 11:49:54,612 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 11:49:54,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 11:49:54,613 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 11:49:54,614 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 11:49:54,614 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 11:49:54,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 11:49:54,616 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 11:49:54,616 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 11:49:54,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 11:49:54,618 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 11:49:54,619 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 11:49:54,620 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 11:49:54,621 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 11:49:54,622 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 11:49:54,623 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 11:49:54,624 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 11:49:54,624 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 11:49:54,625 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 11:49:54,625 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 11:49:54,626 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 11:49:54,626 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 11:49:54,627 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 11:49:54,627 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 11:49:54,628 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 11:49:54,628 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 11:49:54,628 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 11:49:54,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 11:49:54,629 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 11:49:54,629 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 11:49:54,640 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 11:49:54,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 11:49:54,640 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 11:49:54,640 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 11:49:54,641 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 11:49:54,641 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 11:49:54,641 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 11:49:54,641 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 11:49:54,641 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 11:49:54,641 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 11:49:54,641 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 11:49:54,642 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 11:49:54,642 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 11:49:54,642 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 11:49:54,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 11:49:54,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 11:49:54,642 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 11:49:54,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 11:49:54,643 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 11:49:54,643 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 11:49:54,643 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 11:49:54,643 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 11:49:54,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 11:49:54,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 11:49:54,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 11:49:54,644 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 11:49:54,644 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan 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 -> Taipan 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 -> e164009279dbb4f44c2a62d6b9419f669fb4fb2b [2018-11-10 11:49:54,667 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 11:49:54,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 11:49:54,677 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 11:49:54,678 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 11:49:54,678 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 11:49:54,679 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/../../sv-benchmarks/c/eca-rers2012/Problem10_label01_true-unreach-call.c [2018-11-10 11:49:54,715 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/data/48a515c66/b766cf646c0841a0a25169c3ccfa11e6/FLAG87ba7a8ff [2018-11-10 11:49:55,072 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 11:49:55,072 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/sv-benchmarks/c/eca-rers2012/Problem10_label01_true-unreach-call.c [2018-11-10 11:49:55,083 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/data/48a515c66/b766cf646c0841a0a25169c3ccfa11e6/FLAG87ba7a8ff [2018-11-10 11:49:55,095 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/data/48a515c66/b766cf646c0841a0a25169c3ccfa11e6 [2018-11-10 11:49:55,097 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 11:49:55,098 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 11:49:55,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 11:49:55,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 11:49:55,101 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 11:49:55,102 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61258a75 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55, skipping insertion in model container [2018-11-10 11:49:55,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 11:49:55,151 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 11:49:55,383 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:49:55,386 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 11:49:55,452 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 11:49:55,462 INFO L193 MainTranslator]: Completed translation [2018-11-10 11:49:55,463 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55 WrapperNode [2018-11-10 11:49:55,463 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 11:49:55,463 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 11:49:55,464 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 11:49:55,464 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 11:49:55,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,531 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,575 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 11:49:55,576 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 11:49:55,576 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 11:49:55,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 11:49:55,582 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,586 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,586 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,601 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,609 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,613 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... [2018-11-10 11:49:55,620 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 11:49:55,620 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 11:49:55,620 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 11:49:55,620 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 11:49:55,621 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/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 [2018-11-10 11:49:55,670 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 11:49:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 11:49:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure calculate_output [2018-11-10 11:49:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure calculate_output [2018-11-10 11:49:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 11:49:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 11:49:55,671 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 11:49:55,671 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 11:49:56,627 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 11:49:56,628 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:49:56 BoogieIcfgContainer [2018-11-10 11:49:56,628 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 11:49:56,629 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 11:49:56,629 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 11:49:56,631 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 11:49:56,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 11:49:55" (1/3) ... [2018-11-10 11:49:56,632 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2494f210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:49:56, skipping insertion in model container [2018-11-10 11:49:56,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 11:49:55" (2/3) ... [2018-11-10 11:49:56,633 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2494f210 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 11:49:56, skipping insertion in model container [2018-11-10 11:49:56,633 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:49:56" (3/3) ... [2018-11-10 11:49:56,634 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem10_label01_true-unreach-call.c [2018-11-10 11:49:56,642 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 11:49:56,649 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 11:49:56,663 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 11:49:56,691 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 11:49:56,691 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 11:49:56,692 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 11:49:56,692 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 11:49:56,692 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 11:49:56,692 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 11:49:56,692 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 11:49:56,692 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 11:49:56,711 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states. [2018-11-10 11:49:56,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-11-10 11:49:56,718 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:49:56,718 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:49:56,720 INFO L424 AbstractCegarLoop]: === Iteration 1 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:49:56,725 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:56,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1691291748, now seen corresponding path program 1 times [2018-11-10 11:49:56,727 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:49:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:56,768 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:49:56,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:56,768 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:49:56,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:49:56,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:49:56,971 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:49:56,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 11:49:56,971 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:49:56,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 11:49:56,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 11:49:56,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:49:56,985 INFO L87 Difference]: Start difference. First operand 216 states. Second operand 3 states. [2018-11-10 11:49:57,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:49:57,620 INFO L93 Difference]: Finished difference Result 574 states and 992 transitions. [2018-11-10 11:49:57,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 11:49:57,622 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 60 [2018-11-10 11:49:57,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:49:57,631 INFO L225 Difference]: With dead ends: 574 [2018-11-10 11:49:57,631 INFO L226 Difference]: Without dead ends: 356 [2018-11-10 11:49:57,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 11:49:57,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-11-10 11:49:57,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 356. [2018-11-10 11:49:57,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-11-10 11:49:57,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 609 transitions. [2018-11-10 11:49:57,682 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 609 transitions. Word has length 60 [2018-11-10 11:49:57,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:49:57,683 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 609 transitions. [2018-11-10 11:49:57,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 11:49:57,683 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 609 transitions. [2018-11-10 11:49:57,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-11-10 11:49:57,689 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:49:57,689 INFO L375 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, 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] [2018-11-10 11:49:57,690 INFO L424 AbstractCegarLoop]: === Iteration 2 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:49:57,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:57,691 INFO L82 PathProgramCache]: Analyzing trace with hash -1506437984, now seen corresponding path program 1 times [2018-11-10 11:49:57,691 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:49:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:57,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:49:57,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:57,692 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:49:57,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:49:57,832 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:49:57,832 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:49:57,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:49:57,832 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:49:57,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:49:57,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:49:57,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:49:57,834 INFO L87 Difference]: Start difference. First operand 356 states and 609 transitions. Second operand 4 states. [2018-11-10 11:49:58,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:49:58,594 INFO L93 Difference]: Finished difference Result 1282 states and 2328 transitions. [2018-11-10 11:49:58,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:49:58,596 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 180 [2018-11-10 11:49:58,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:49:58,602 INFO L225 Difference]: With dead ends: 1282 [2018-11-10 11:49:58,603 INFO L226 Difference]: Without dead ends: 932 [2018-11-10 11:49:58,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:49:58,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 932 states. [2018-11-10 11:49:58,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 932 to 932. [2018-11-10 11:49:58,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 932 states. [2018-11-10 11:49:58,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 932 states to 932 states and 1469 transitions. [2018-11-10 11:49:58,638 INFO L78 Accepts]: Start accepts. Automaton has 932 states and 1469 transitions. Word has length 180 [2018-11-10 11:49:58,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:49:58,639 INFO L481 AbstractCegarLoop]: Abstraction has 932 states and 1469 transitions. [2018-11-10 11:49:58,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:49:58,639 INFO L276 IsEmpty]: Start isEmpty. Operand 932 states and 1469 transitions. [2018-11-10 11:49:58,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-11-10 11:49:58,644 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:49:58,644 INFO L375 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, 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] [2018-11-10 11:49:58,644 INFO L424 AbstractCegarLoop]: === Iteration 3 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:49:58,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:58,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1775578949, now seen corresponding path program 1 times [2018-11-10 11:49:58,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:49:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:58,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:49:58,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:58,646 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:49:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:49:58,820 INFO L134 CoverageAnalysis]: Checked inductivity of 53 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:49:58,821 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:49:58,821 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 11:49:58,821 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:49:58,821 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:49:58,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:49:58,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2018-11-10 11:49:58,822 INFO L87 Difference]: Start difference. First operand 932 states and 1469 transitions. Second operand 6 states. [2018-11-10 11:49:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:49:59,810 INFO L93 Difference]: Finished difference Result 2162 states and 3509 transitions. [2018-11-10 11:49:59,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-10 11:49:59,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2018-11-10 11:49:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:49:59,819 INFO L225 Difference]: With dead ends: 2162 [2018-11-10 11:49:59,819 INFO L226 Difference]: Without dead ends: 1236 [2018-11-10 11:49:59,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-11-10 11:49:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2018-11-10 11:49:59,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1216. [2018-11-10 11:49:59,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1216 states. [2018-11-10 11:49:59,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1216 states to 1216 states and 1766 transitions. [2018-11-10 11:49:59,860 INFO L78 Accepts]: Start accepts. Automaton has 1216 states and 1766 transitions. Word has length 187 [2018-11-10 11:49:59,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:49:59,860 INFO L481 AbstractCegarLoop]: Abstraction has 1216 states and 1766 transitions. [2018-11-10 11:49:59,860 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:49:59,860 INFO L276 IsEmpty]: Start isEmpty. Operand 1216 states and 1766 transitions. [2018-11-10 11:49:59,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-11-10 11:49:59,866 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:49:59,866 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:49:59,866 INFO L424 AbstractCegarLoop]: === Iteration 4 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:49:59,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:49:59,867 INFO L82 PathProgramCache]: Analyzing trace with hash -1634613069, now seen corresponding path program 1 times [2018-11-10 11:49:59,867 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:49:59,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:59,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:49:59,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:49:59,881 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:49:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:00,019 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 106 proven. 65 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-10 11:50:00,019 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:50:00,019 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:50:00,020 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 258 with the following transitions: [2018-11-10 11:50:00,022 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [494], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 11:50:00,069 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:50:00,069 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:50:03,044 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:50:03,045 INFO L272 AbstractInterpreter]: Visited 132 different actions 132 times. Never merged. Never widened. Never found a fixpoint. Largest state had 24 variables. [2018-11-10 11:50:03,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:03,052 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:50:05,504 INFO L227 lantSequenceWeakener]: Weakened 236 states. On average, predicates are now at 73.75% of their original sizes. [2018-11-10 11:50:05,505 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:50:09,455 INFO L415 sIntCurrentIteration]: We unified 256 AI predicates to 256 [2018-11-10 11:50:09,455 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:50:09,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:50:09,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [6] total 15 [2018-11-10 11:50:09,456 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:50:09,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 11:50:09,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 11:50:09,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2018-11-10 11:50:09,457 INFO L87 Difference]: Start difference. First operand 1216 states and 1766 transitions. Second operand 11 states. [2018-11-10 11:50:17,556 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:50:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:50:37,813 INFO L93 Difference]: Finished difference Result 2575 states and 3779 transitions. [2018-11-10 11:50:37,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-10 11:50:37,813 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 257 [2018-11-10 11:50:37,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:50:37,819 INFO L225 Difference]: With dead ends: 2575 [2018-11-10 11:50:37,819 INFO L226 Difference]: Without dead ends: 1365 [2018-11-10 11:50:37,821 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 261 GetRequests, 202 SyntacticMatches, 45 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2018-11-10 11:50:37,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1365 states. [2018-11-10 11:50:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1365 to 1360. [2018-11-10 11:50:37,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1360 states. [2018-11-10 11:50:37,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1360 states to 1360 states and 1918 transitions. [2018-11-10 11:50:37,862 INFO L78 Accepts]: Start accepts. Automaton has 1360 states and 1918 transitions. Word has length 257 [2018-11-10 11:50:37,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:50:37,863 INFO L481 AbstractCegarLoop]: Abstraction has 1360 states and 1918 transitions. [2018-11-10 11:50:37,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 11:50:37,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1360 states and 1918 transitions. [2018-11-10 11:50:37,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-11-10 11:50:37,867 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:50:37,867 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:50:37,867 INFO L424 AbstractCegarLoop]: === Iteration 5 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:50:37,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:37,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1971133543, now seen corresponding path program 1 times [2018-11-10 11:50:37,868 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:50:37,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:37,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:50:37,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:50:37,869 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:50:37,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:50:37,997 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 184 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 11:50:37,997 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:50:37,997 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:50:37,997 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 268 with the following transitions: [2018-11-10 11:50:37,998 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [534], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 11:50:38,002 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:50:38,003 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:50:39,010 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:50:52,562 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:50:52,562 INFO L272 AbstractInterpreter]: Visited 135 different actions 780 times. Merged at 5 different actions 25 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 11:50:52,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:50:52,565 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:50:54,942 INFO L227 lantSequenceWeakener]: Weakened 72 states. On average, predicates are now at 75.13% of their original sizes. [2018-11-10 11:50:54,943 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:51:15,161 INFO L415 sIntCurrentIteration]: We unified 266 AI predicates to 266 [2018-11-10 11:51:15,161 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:51:15,162 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:51:15,162 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [22] imperfect sequences [6] total 26 [2018-11-10 11:51:15,162 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:51:15,162 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-10 11:51:15,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-10 11:51:15,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=365, Unknown=0, NotChecked=0, Total=462 [2018-11-10 11:51:15,163 INFO L87 Difference]: Start difference. First operand 1360 states and 1918 transitions. Second operand 22 states. [2018-11-10 11:53:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:53:12,581 INFO L93 Difference]: Finished difference Result 3697 states and 5378 transitions. [2018-11-10 11:53:12,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-11-10 11:53:12,581 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 267 [2018-11-10 11:53:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:53:12,589 INFO L225 Difference]: With dead ends: 3697 [2018-11-10 11:53:12,590 INFO L226 Difference]: Without dead ends: 2487 [2018-11-10 11:53:12,595 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 277 GetRequests, 214 SyntacticMatches, 32 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 21.5s TimeCoverageRelationStatistics Valid=229, Invalid=827, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 11:53:12,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2018-11-10 11:53:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2430. [2018-11-10 11:53:12,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2430 states. [2018-11-10 11:53:12,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 3081 transitions. [2018-11-10 11:53:12,723 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 3081 transitions. Word has length 267 [2018-11-10 11:53:12,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:53:12,723 INFO L481 AbstractCegarLoop]: Abstraction has 2430 states and 3081 transitions. [2018-11-10 11:53:12,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-10 11:53:12,723 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 3081 transitions. [2018-11-10 11:53:12,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-11-10 11:53:12,731 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:53:12,732 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 11:53:12,732 INFO L424 AbstractCegarLoop]: === Iteration 6 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:53:12,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:12,732 INFO L82 PathProgramCache]: Analyzing trace with hash -1838402321, now seen corresponding path program 1 times [2018-11-10 11:53:12,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:53:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:12,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:53:12,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:53:12,733 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:53:12,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:53:12,931 INFO L134 CoverageAnalysis]: Checked inductivity of 222 backedges. 107 proven. 46 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 11:53:12,931 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:53:12,931 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:53:12,931 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 304 with the following transitions: [2018-11-10 11:53:12,932 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 11:53:12,935 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:53:12,935 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:53:14,723 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:53:20,489 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:53:20,489 INFO L272 AbstractInterpreter]: Visited 135 different actions 392 times. Merged at 5 different actions 9 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 11:53:20,495 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:53:20,495 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:53:22,857 INFO L227 lantSequenceWeakener]: Weakened 90 states. On average, predicates are now at 75.44% of their original sizes. [2018-11-10 11:53:22,857 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:53:37,170 INFO L415 sIntCurrentIteration]: We unified 302 AI predicates to 302 [2018-11-10 11:53:37,170 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:53:37,170 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:53:37,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [6] total 24 [2018-11-10 11:53:37,170 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:53:37,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-10 11:53:37,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-10 11:53:37,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=311, Unknown=0, NotChecked=0, Total=380 [2018-11-10 11:53:37,171 INFO L87 Difference]: Start difference. First operand 2430 states and 3081 transitions. Second operand 20 states. [2018-11-10 11:57:17,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:57:17,803 INFO L93 Difference]: Finished difference Result 4584 states and 6182 transitions. [2018-11-10 11:57:17,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-11-10 11:57:17,803 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 303 [2018-11-10 11:57:17,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:57:17,810 INFO L225 Difference]: With dead ends: 4584 [2018-11-10 11:57:17,810 INFO L226 Difference]: Without dead ends: 2881 [2018-11-10 11:57:17,814 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 314 GetRequests, 266 SyntacticMatches, 18 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=185, Invalid=807, Unknown=0, NotChecked=0, Total=992 [2018-11-10 11:57:17,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2881 states. [2018-11-10 11:57:18,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2881 to 2726. [2018-11-10 11:57:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2726 states. [2018-11-10 11:57:18,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2726 states to 2726 states and 3423 transitions. [2018-11-10 11:57:18,023 INFO L78 Accepts]: Start accepts. Automaton has 2726 states and 3423 transitions. Word has length 303 [2018-11-10 11:57:18,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:57:18,024 INFO L481 AbstractCegarLoop]: Abstraction has 2726 states and 3423 transitions. [2018-11-10 11:57:18,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-10 11:57:18,024 INFO L276 IsEmpty]: Start isEmpty. Operand 2726 states and 3423 transitions. [2018-11-10 11:57:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-11-10 11:57:18,033 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:57:18,033 INFO L375 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, 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, 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] [2018-11-10 11:57:18,033 INFO L424 AbstractCegarLoop]: === Iteration 7 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:57:18,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:57:18,034 INFO L82 PathProgramCache]: Analyzing trace with hash 1269127172, now seen corresponding path program 1 times [2018-11-10 11:57:18,034 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:57:18,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:57:18,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:57:18,035 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:57:18,035 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:57:18,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:57:18,214 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 232 proven. 69 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2018-11-10 11:57:18,214 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:57:18,214 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:57:18,215 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 329 with the following transitions: [2018-11-10 11:57:18,215 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [494], [495], [498], [499], [503], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 11:57:18,218 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:57:18,218 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:57:19,063 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:57:32,838 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2018-11-10 11:57:32,838 INFO L272 AbstractInterpreter]: Visited 136 different actions 785 times. Merged at 5 different actions 24 times. Widened at 1 different actions 1 times. Found 1 fixpoints after 1 different actions. Largest state had 24 variables. [2018-11-10 11:57:32,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:57:32,843 INFO L398 sIntCurrentIteration]: Generating AbsInt predicates [2018-11-10 11:57:34,334 INFO L227 lantSequenceWeakener]: Weakened 93 states. On average, predicates are now at 75.47% of their original sizes. [2018-11-10 11:57:34,334 INFO L413 sIntCurrentIteration]: Unifying AI predicates [2018-11-10 11:57:50,646 INFO L415 sIntCurrentIteration]: We unified 327 AI predicates to 327 [2018-11-10 11:57:50,646 INFO L424 sIntCurrentIteration]: Finished generation of AbsInt predicates [2018-11-10 11:57:50,646 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-10 11:57:50,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [6] total 25 [2018-11-10 11:57:50,647 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:57:50,647 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-10 11:57:50,647 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-10 11:57:50,647 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2018-11-10 11:57:50,647 INFO L87 Difference]: Start difference. First operand 2726 states and 3423 transitions. Second operand 21 states. [2018-11-10 11:59:03,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:03,301 INFO L93 Difference]: Finished difference Result 4883 states and 6365 transitions. [2018-11-10 11:59:03,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-11-10 11:59:03,301 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 328 [2018-11-10 11:59:03,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:03,309 INFO L225 Difference]: With dead ends: 4883 [2018-11-10 11:59:03,309 INFO L226 Difference]: Without dead ends: 3032 [2018-11-10 11:59:03,313 INFO L605 BasicCegarLoop]: 2 DeclaredPredicates, 338 GetRequests, 269 SyntacticMatches, 39 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 488 ImplicationChecksByTransitivity, 18.0s TimeCoverageRelationStatistics Valid=183, Invalid=809, Unknown=0, NotChecked=0, Total=992 [2018-11-10 11:59:03,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3032 states. [2018-11-10 11:59:03,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3032 to 2878. [2018-11-10 11:59:03,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2878 states. [2018-11-10 11:59:03,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2878 states to 2878 states and 3587 transitions. [2018-11-10 11:59:03,551 INFO L78 Accepts]: Start accepts. Automaton has 2878 states and 3587 transitions. Word has length 328 [2018-11-10 11:59:03,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:03,552 INFO L481 AbstractCegarLoop]: Abstraction has 2878 states and 3587 transitions. [2018-11-10 11:59:03,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-10 11:59:03,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2878 states and 3587 transitions. [2018-11-10 11:59:03,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-11-10 11:59:03,562 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:03,563 INFO L375 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 11:59:03,563 INFO L424 AbstractCegarLoop]: === Iteration 8 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:59:03,563 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:03,563 INFO L82 PathProgramCache]: Analyzing trace with hash -550898564, now seen corresponding path program 1 times [2018-11-10 11:59:03,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:03,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:03,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:03,564 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:03,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:03,747 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 11:59:03,747 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:59:03,748 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 11:59:03,748 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 377 with the following transitions: [2018-11-10 11:59:03,748 INFO L202 CegarAbsIntRunner]: [0], [1], [2], [9], [17], [25], [33], [41], [49], [57], [65], [73], [81], [89], [97], [105], [113], [121], [129], [137], [145], [153], [161], [169], [177], [185], [193], [201], [209], [217], [225], [233], [241], [249], [257], [265], [273], [281], [289], [297], [305], [313], [321], [329], [337], [345], [353], [361], [369], [377], [381], [383], [386], [394], [402], [410], [418], [426], [434], [442], [450], [458], [466], [474], [482], [490], [495], [499], [503], [506], [507], [511], [515], [519], [523], [527], [531], [535], [539], [543], [547], [551], [555], [559], [563], [567], [571], [575], [579], [583], [587], [591], [595], [599], [603], [607], [611], [615], [619], [623], [627], [631], [635], [639], [643], [647], [651], [655], [659], [663], [667], [671], [675], [678], [679], [683], [687], [691], [695], [699], [703], [707], [711], [715], [719], [722], [792], [796], [800], [806], [810], [812], [817], [818], [819], [821], [822] [2018-11-10 11:59:03,751 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 11:59:03,751 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 11:59:05,685 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 11:59:21,250 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 11:59:21,250 INFO L272 AbstractInterpreter]: Visited 137 different actions 806 times. Merged at 8 different actions 44 times. Widened at 1 different actions 1 times. Found 10 fixpoints after 2 different actions. Largest state had 24 variables. [2018-11-10 11:59:21,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:21,260 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 11:59:21,260 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 11:59:21,260 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/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 [2018-11-10 11:59:21,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:21,278 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 11:59:21,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:21,351 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 11:59:21,487 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 11:59:21,487 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 11:59:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 421 backedges. 349 proven. 2 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2018-11-10 11:59:21,731 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 11:59:21,731 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2018-11-10 11:59:21,732 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 11:59:21,732 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 11:59:21,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 11:59:21,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-11-10 11:59:21,733 INFO L87 Difference]: Start difference. First operand 2878 states and 3587 transitions. Second operand 6 states. [2018-11-10 11:59:23,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:23,675 INFO L93 Difference]: Finished difference Result 7325 states and 10118 transitions. [2018-11-10 11:59:23,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-10 11:59:23,676 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 376 [2018-11-10 11:59:23,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:23,691 INFO L225 Difference]: With dead ends: 7325 [2018-11-10 11:59:23,692 INFO L226 Difference]: Without dead ends: 5131 [2018-11-10 11:59:23,707 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 766 GetRequests, 753 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-11-10 11:59:23,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5131 states. [2018-11-10 11:59:24,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5131 to 5014. [2018-11-10 11:59:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5014 states. [2018-11-10 11:59:24,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5014 states to 5014 states and 6403 transitions. [2018-11-10 11:59:24,010 INFO L78 Accepts]: Start accepts. Automaton has 5014 states and 6403 transitions. Word has length 376 [2018-11-10 11:59:24,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:24,011 INFO L481 AbstractCegarLoop]: Abstraction has 5014 states and 6403 transitions. [2018-11-10 11:59:24,011 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 11:59:24,011 INFO L276 IsEmpty]: Start isEmpty. Operand 5014 states and 6403 transitions. [2018-11-10 11:59:24,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-11-10 11:59:24,027 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 11:59:24,028 INFO L375 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, 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, 2, 2, 2, 2, 2, 2, 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] [2018-11-10 11:59:24,028 INFO L424 AbstractCegarLoop]: === Iteration 9 === [calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 11:59:24,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 11:59:24,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1583924999, now seen corresponding path program 1 times [2018-11-10 11:59:24,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 11:59:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:24,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 11:59:24,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 11:59:24,029 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 11:59:24,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 11:59:24,240 INFO L134 CoverageAnalysis]: Checked inductivity of 447 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2018-11-10 11:59:24,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 11:59:24,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 11:59:24,240 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 11:59:24,241 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 11:59:24,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 11:59:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:59:24,241 INFO L87 Difference]: Start difference. First operand 5014 states and 6403 transitions. Second operand 4 states. [2018-11-10 11:59:25,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 11:59:25,050 INFO L93 Difference]: Finished difference Result 10970 states and 15092 transitions. [2018-11-10 11:59:25,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-10 11:59:25,050 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 389 [2018-11-10 11:59:25,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 11:59:25,051 INFO L225 Difference]: With dead ends: 10970 [2018-11-10 11:59:25,051 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 11:59:25,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-11-10 11:59:25,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 11:59:25,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 11:59:25,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 11:59:25,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 11:59:25,066 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 389 [2018-11-10 11:59:25,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 11:59:25,066 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 11:59:25,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 11:59:25,066 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 11:59:25,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 11:59:25,069 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 11:59:25,215 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 357 [2018-11-10 11:59:26,186 WARN L179 SmtUtils]: Spent 968.00 ms on a formula simplification that was a NOOP. DAG size: 1178 [2018-11-10 11:59:31,815 WARN L179 SmtUtils]: Spent 5.63 s on a formula simplification. DAG size of input: 2006 DAG size of output: 2006 [2018-11-10 11:59:34,094 WARN L179 SmtUtils]: Spent 2.21 s on a formula simplification that was a NOOP. DAG size: 1398 [2018-11-10 11:59:38,539 WARN L179 SmtUtils]: Spent 4.43 s on a formula simplification. DAG size of input: 1766 DAG size of output: 1766 [2018-11-10 11:59:40,833 WARN L179 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 1350 [2018-11-10 11:59:52,655 WARN L179 SmtUtils]: Spent 11.82 s on a formula simplification. DAG size of input: 2600 DAG size of output: 2302 [2018-11-10 12:00:08,260 WARN L179 SmtUtils]: Spent 15.60 s on a formula simplification. DAG size of input: 2604 DAG size of output: 2557 [2018-11-10 12:00:09,483 WARN L179 SmtUtils]: Spent 1.22 s on a formula simplification. DAG size of input: 357 DAG size of output: 44 [2018-11-10 12:00:20,755 WARN L179 SmtUtils]: Spent 11.27 s on a formula simplification. DAG size of input: 912 DAG size of output: 73 [2018-11-10 12:00:53,288 WARN L179 SmtUtils]: Spent 32.47 s on a formula simplification. DAG size of input: 1961 DAG size of output: 197 [2018-11-10 12:01:08,736 WARN L179 SmtUtils]: Spent 15.43 s on a formula simplification. DAG size of input: 1787 DAG size of output: 78 [2018-11-10 12:01:31,245 WARN L179 SmtUtils]: Spent 22.49 s on a formula simplification. DAG size of input: 1998 DAG size of output: 78 [2018-11-10 12:01:31,246 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L421 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~a10~0)| ~a10~0) (= ~a1~0 |old(~a1~0)|)) [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L465(lines 465 572) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L201-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L168-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L135-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L102-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L69-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L36-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L499(lines 499 572) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L301(lines 301 572) no Hoare annotation was computed. [2018-11-10 12:01:31,247 INFO L425 ceAbstractionStarter]: For program point L202(line 202) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L169(line 169) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L136(line 136) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L103(line 103) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L70(line 70) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point calculate_outputErr0ASSERT_VIOLATIONERROR_FUNCTION(line 163) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L335(lines 335 572) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L236(lines 236 572) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L534(lines 534 572) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L171-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L138-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L105-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L72-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L39-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L436(lines 436 572) no Hoare annotation was computed. [2018-11-10 12:01:31,248 INFO L425 ceAbstractionStarter]: For program point L403(lines 403 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L370(lines 370 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L271(lines 271 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L172(line 172) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L139(line 139) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L106(line 106) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L73(line 73) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L569(lines 569 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L239(lines 239 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L504(lines 504 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L471(lines 471 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L306(lines 306 572) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L174-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L141-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,249 INFO L425 ceAbstractionStarter]: For program point L108-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L75-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L42-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L340(lines 340 572) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L175(line 175) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L142(line 142) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L109(line 109) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L76(line 76) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L43(line 43) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L540(lines 540 572) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L408(lines 408 572) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L375(lines 375 572) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L210(lines 210 572) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L177-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L144-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L111-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,250 INFO L425 ceAbstractionStarter]: For program point L78-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L45-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L442(lines 442 572) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L277(lines 277 572) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L244(lines 244 572) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L178(line 178) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L145(line 145) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L112(line 112) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L79(line 79) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L46(line 46) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L509(lines 509 572) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L476(lines 476 572) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L378(lines 378 572) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L345(lines 345 572) no Hoare annotation was computed. [2018-11-10 12:01:31,251 INFO L425 ceAbstractionStarter]: For program point L312(lines 312 572) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L180-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L147-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L114-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L81-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L48-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L181(line 181) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L148(line 148) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L115(line 115) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L82(line 82) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L49(line 49) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L545(lines 545 572) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L215(lines 215 572) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L414(lines 414 572) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L249(lines 249 572) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L183-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,252 INFO L425 ceAbstractionStarter]: For program point L150-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L117-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L84-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L51-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point calculate_outputFINAL(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point calculate_outputEXIT(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L514(lines 514 572) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L481(lines 481 572) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L448(lines 448 572) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L283(lines 283 572) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L184(line 184) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L151(line 151) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L118(line 118) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L85(line 85) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L52(line 52) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L548(lines 548 572) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L383(lines 383 572) no Hoare annotation was computed. [2018-11-10 12:01:31,253 INFO L425 ceAbstractionStarter]: For program point L317(lines 317 572) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L351(lines 351 572) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L186-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L153-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L120-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L87-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 23) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L54-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L21-2(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L517(lines 517 572) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L286(lines 286 572) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L220(lines 220 572) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L187(line 187) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L154(line 154) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L121(line 121) no Hoare annotation was computed. [2018-11-10 12:01:31,254 INFO L425 ceAbstractionStarter]: For program point L88(line 88) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L55(line 55) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L419(lines 419 572) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L320(lines 320 572) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L254(lines 254 572) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L354(lines 354 572) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L189-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L156-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L123-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L90-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L57-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L24-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L487(lines 487 572) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L454(lines 454 572) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L388(lines 388 572) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L190(line 190) no Hoare annotation was computed. [2018-11-10 12:01:31,255 INFO L425 ceAbstractionStarter]: For program point L157(line 157) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L124(line 124) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L91(line 91) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L58(line 58) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L554(lines 554 572) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L323(lines 323 572) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L421 ceAbstractionStarter]: At program point calculate_outputENTRY(lines 20 574) the Hoare annotation is: (let ((.cse16 (= |old(~a10~0)| ~a10~0)) (.cse17 (= ~a1~0 |old(~a1~0)|)) (.cse3 (+ |old(~a19~0)| |old(~a10~0)|))) (let ((.cse5 (< 10 (+ ~inputD~0 ~inputF~0))) (.cse6 (< ~inputF~0 (+ ~a12~0 6))) (.cse8 (< (+ ~a12~0 ~inputB~0) 2)) (.cse10 (< (+ ~a4~0 ~inputD~0) 18)) (.cse13 (< 5 (+ ~inputB~0 ~inputC~0))) (.cse2 (< 9 .cse3)) (.cse18 (< 28 (* 2 ~a4~0))) (.cse4 (< |old(~a1~0)| (+ |old(~a10~0)| 23))) (.cse19 (not (= 9 |old(~a19~0)|))) (.cse7 (< 15 (+ ~a4~0 |old(~a10~0)|))) (.cse20 (< 9 (+ |old(~a19~0)| ~a12~0))) (.cse9 (+ |old(~a1~0)| ~a12~0)) (.cse0 (and .cse16 .cse17)) (.cse1 (= 1 |old(~a10~0)|)) (.cse15 (= 0 |old(~a10~0)|)) (.cse11 (< ~a4~0 (+ |calculate_output_#in~input| 8))) (.cse12 (< (+ |calculate_output_#in~input| ~a12~0) 2)) (.cse21 (< (+ ~a4~0 ~a12~0) 14)) (.cse14 (< (* 2 |old(~a10~0)|) 0)) (.cse22 (< 23 (+ |old(~a19~0)| ~a4~0))) (.cse23 (<= (+ ~a4~0 ~a19~0) 23))) (and (or .cse0 .cse1 (< 0 (+ |old(~a1~0)| 551894))) (or (and (<= (+ ~a19~0 |old(~a10~0)|) 9) (<= (+ ~inputD~0 4) ~a19~0)) (or .cse2 (< .cse3 9) .cse4 (< 10 (* 2 ~inputE~0)) (< (+ ~inputE~0 ~inputB~0) 7) .cse5 .cse6 (< ~inputC~0 (+ ~inputB~0 1)) .cse7 .cse8 (< 441469 .cse9) .cse10 .cse11 .cse12 .cse13 .cse14) .cse15) (or (and (not (= ~a19~0 6)) .cse16 .cse17) (= 6 |old(~a19~0)|)) (or (and (<= (+ ~inputC~0 6) ~a19~0) (<= (+ ~a19~0 5) ~a4~0)) (or .cse4 .cse5 .cse6 (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a19~0)| ~inputC~0) 12) .cse8 (< 11 (+ |old(~a19~0)| ~inputB~0)) .cse18 .cse10 .cse11 .cse12 .cse13 .cse14) (< 28 (+ |old(~a1~0)| ~inputE~0))) (or (or (< (+ |old(~a10~0)| 505271) |old(~a1~0)|) .cse19 .cse7 .cse20 .cse21 .cse14 .cse22) (< |old(~a1~0)| 219) (= ~a19~0 9)) (or (or .cse2 (< 218 .cse9) (< |old(~a19~0)| (+ ~a12~0 8)) (< (+ |old(~a19~0)| |old(~a1~0)|) 32) .cse18 .cse21 .cse14) .cse15 (and (<= (+ ~a19~0 ~a10~0) 9) (<= 16 (* 2 ~a19~0)))) (or .cse15 (and (<= (+ ~a10~0 8) ~a19~0) .cse23) .cse4 .cse19 .cse7 .cse20 .cse21 .cse14 (< 505272 .cse9)) (or .cse0 (< 38 |old(~a1~0)|) .cse15 .cse1) (or (or .cse15 (< 23 (+ |old(~a1~0)| |old(~a10~0)|)) (< |old(~a19~0)| (+ |old(~a10~0)| 7)) (< 2 (+ ~a12~0 |old(~a10~0)|)) .cse11 .cse12 .cse21 (< (+ ~a4~0 |old(~a1~0)| 105934) 0) (not (= 0 (mod |old(~a10~0)| 2))) .cse14 .cse22) (and (<= (+ ~a10~0 7) ~a19~0) .cse23))))) [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L357(lines 357 572) no Hoare annotation was computed. [2018-11-10 12:01:31,256 INFO L425 ceAbstractionStarter]: For program point L291(lines 291 572) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L225(lines 225 572) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L192-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L159-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L126-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L93-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L60-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L27-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L523(lines 523 572) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L193(line 193) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L160(line 160) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L127(line 127) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L94(line 94) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L61(line 61) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L557(lines 557 572) no Hoare annotation was computed. [2018-11-10 12:01:31,257 INFO L425 ceAbstractionStarter]: For program point L425(lines 425 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L326(lines 326 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L260(lines 260 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L393(lines 393 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L360(lines 360 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L195-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L162-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L129-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L96-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L63-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L30-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L526(lines 526 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L493(lines 493 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L460(lines 460 572) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L196(line 196) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L163(line 163) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L130(line 130) no Hoare annotation was computed. [2018-11-10 12:01:31,258 INFO L425 ceAbstractionStarter]: For program point L97(line 97) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L64(line 64) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L31(line 31) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L329(lines 329 572) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L296(lines 296 572) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L231(lines 231 572) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L198-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L165-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L132-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L99-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L66-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L33-1(lines 20 574) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L529(lines 529 572) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L430(lines 430 572) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L265(lines 265 572) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L199(line 199) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L166(line 166) no Hoare annotation was computed. [2018-11-10 12:01:31,259 INFO L425 ceAbstractionStarter]: For program point L133(line 133) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point L100(line 100) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point L67(line 67) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point L34(line 34) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point L563(lines 563 572) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point L398(lines 398 572) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point L365(lines 365 572) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L421 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= (+ ~a10~0 14) ~a4~0) (<= (+ ~inputC~0 6) ~a19~0) (<= (+ ~inputB~0 2) ~inputD~0) (<= (+ ~a19~0 ~inputD~0) 13) (<= (+ ~inputF~0 17) ~a1~0) (<= 5 (+ ~a12~0 ~inputE~0)) (<= 2 (+ ~a10~0 ~inputB~0)) (<= (+ ~a12~0 5) ~inputE~0) (<= ~a4~0 (+ ~inputF~0 8)) (<= (+ ~a1~0 ~inputE~0) 28) (<= 6 (+ ~a10~0 ~inputF~0)) (<= (+ ~a10~0 3) ~inputC~0)) [2018-11-10 12:01:31,260 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 12:01:31,260 INFO L421 ceAbstractionStarter]: At program point mainENTRY(lines 576 592) the Hoare annotation is: (or (and (<= (+ ~a12~0 ~a10~0) 0) (<= 9 (+ ~a19~0 ~a10~0)) (= ~a1~0 23) (<= (+ ~a19~0 5) ~a4~0)) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (< (* 2 |old(~a10~0)|) 0)) [2018-11-10 12:01:31,260 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 576 592) no Hoare annotation was computed. [2018-11-10 12:01:31,261 INFO L421 ceAbstractionStarter]: At program point L590(line 590) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 1)))) (or (not (= ~a19~0 6)) (and (<= (+ ~a1~0 551894) 0) .cse0) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (and (<= ~a1~0 38) (not (= 0 ~a10~0)) .cse0) (< (* 2 |old(~a10~0)|) 0))) [2018-11-10 12:01:31,261 INFO L425 ceAbstractionStarter]: For program point L590-1(line 590) no Hoare annotation was computed. [2018-11-10 12:01:31,261 INFO L425 ceAbstractionStarter]: For program point L587(line 587) no Hoare annotation was computed. [2018-11-10 12:01:31,261 INFO L425 ceAbstractionStarter]: For program point L582-1(lines 582 591) no Hoare annotation was computed. [2018-11-10 12:01:31,261 INFO L421 ceAbstractionStarter]: At program point L582-3(lines 582 591) the Hoare annotation is: (let ((.cse0 (not (= ~a10~0 1)))) (or (not (= ~a19~0 6)) (and (<= (+ ~a1~0 551894) 0) .cse0) (< (+ |old(~a19~0)| ~inputE~0) 14) (< (+ |old(~a1~0)| ~inputF~0) 29) (< (+ |old(~a19~0)| ~inputC~0) 12) (< (+ ~a12~0 ~inputB~0) 2) (< 4 (+ ~inputD~0 |old(~a10~0)|)) (< ~inputD~0 (+ ~a12~0 4)) (< 11 (+ |old(~a19~0)| ~inputB~0)) (< (+ ~a4~0 ~inputD~0) 18) (< 14 (+ ~a4~0 |old(~a10~0)|)) (< 5 (+ ~inputB~0 ~inputC~0)) (< 28 (+ |old(~a1~0)| ~inputE~0)) (< 12 (* 2 ~inputF~0)) (and (<= ~a1~0 38) (not (= 0 ~a10~0)) .cse0) (< (* 2 |old(~a10~0)|) 0))) [2018-11-10 12:01:31,261 INFO L425 ceAbstractionStarter]: For program point L582-4(lines 576 592) no Hoare annotation was computed. [2018-11-10 12:01:31,270 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 12:01:31 BoogieIcfgContainer [2018-11-10 12:01:31,270 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 12:01:31,270 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 12:01:31,270 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 12:01:31,272 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 12:01:31,273 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 11:49:56" (3/4) ... [2018-11-10 12:01:31,276 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 12:01:31,280 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 12:01:31,280 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure calculate_output [2018-11-10 12:01:31,281 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 12:01:31,295 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-11-10 12:01:31,296 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 12:01:31,312 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((((((((!(a19 == 6) || (a1 + 551894 <= 0 && !(a10 == 1))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || ((a1 <= 38 && !(0 == a10)) && !(a10 == 1))) || 2 * \old(a10) < 0 [2018-11-10 12:01:31,375 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_009009be-93e0-43be-b4b7-3ef11a4e66fb/bin-2019/utaipan/witness.graphml [2018-11-10 12:01:31,376 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 12:01:31,376 INFO L168 Benchmark]: Toolchain (without parser) took 696278.40 ms. Allocated memory was 1.0 GB in the beginning and 5.4 GB in the end (delta: 4.4 GB). Free memory was 956.5 MB in the beginning and 1.5 GB in the end (delta: -529.9 MB). Peak memory consumption was 3.9 GB. Max. memory is 11.5 GB. [2018-11-10 12:01:31,377 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 12:01:31,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 364.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 921.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:31,377 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 921.6 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:31,377 INFO L168 Benchmark]: Boogie Preprocessor took 44.42 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:31,377 INFO L168 Benchmark]: RCFGBuilder took 1007.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.7 MB). Peak memory consumption was 107.7 MB. Max. memory is 11.5 GB. [2018-11-10 12:01:31,378 INFO L168 Benchmark]: TraceAbstraction took 694641.32 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -466.9 MB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. [2018-11-10 12:01:31,378 INFO L168 Benchmark]: Witness Printer took 105.30 ms. Allocated memory is still 5.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. [2018-11-10 12:01:31,379 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.12 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 364.26 ms. Allocated memory is still 1.0 GB. Free memory was 956.5 MB in the beginning and 921.6 MB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 111.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 145.2 MB). Free memory was 921.6 MB in the beginning and 1.1 GB in the end (delta: -213.7 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 44.42 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: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1007.74 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 107.7 MB). Peak memory consumption was 107.7 MB. Max. memory is 11.5 GB. * TraceAbstraction took 694641.32 ms. Allocated memory was 1.2 GB in the beginning and 5.4 GB in the end (delta: 4.2 GB). Free memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: -466.9 MB). Peak memory consumption was 4.8 GB. Max. memory is 11.5 GB. * Witness Printer took 105.30 ms. Allocated memory is still 5.4 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 2.1 kB). Peak memory consumption was 2.1 kB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 163]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 582]: Loop Invariant Derived loop invariant: ((((((((((((((!(a19 == 6) || (a1 + 551894 <= 0 && !(a10 == 1))) || \old(a19) + inputE < 14) || \old(a1) + inputF < 29) || \old(a19) + inputC < 12) || a12 + inputB < 2) || 4 < inputD + \old(a10)) || inputD < a12 + 4) || 11 < \old(a19) + inputB) || a4 + inputD < 18) || 14 < a4 + \old(a10)) || 5 < inputB + inputC) || 28 < \old(a1) + inputE) || 12 < 2 * inputF) || ((a1 <= 38 && !(0 == a10)) && !(a10 == 1))) || 2 * \old(a10) < 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 216 locations, 1 error locations. SAFE Result, 694.5s OverallTime, 9 OverallIterations, 4 TraceHistogramMax, 444.3s AutomataDifference, 0.0s DeadEndRemovalTime, 126.1s HoareAnnotationTime, HoareTripleCheckerStatistics: 1595 SDtfs, 9054 SDslu, 1096 SDs, 0 SdLazy, 11634 SolverSat, 1885 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 261.2s Time, PredicateUnifierStatistics: 8 DeclaredPredicates, 1981 GetRequests, 1714 SyntacticMatches, 139 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1369 ImplicationChecksByTransitivity, 61.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5014occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 57.3s AbstIntTime, 5 AbstIntIterations, 4 AbstIntStrong, 0.9958275097898485 AbsIntWeakeningRatio, 0.09556907037358818 AbsIntAvgWeakeningVarsNumRemoved, 296.95916594265856 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 508 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 115 PreInvPairs, 181 NumberOfFragments, 876 HoareAnnotationTreeSize, 115 FomulaSimplifications, 146167 FormulaSimplificationTreeSizeReduction, 43.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 162331 FormulaSimplificationTreeSizeReductionInter, 82.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 2723 NumberOfCodeBlocks, 2723 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 3088 ConstructedInterpolants, 0 QuantifiedInterpolants, 2329657 SizeOfPredicates, 1 NumberOfNonLiveVariables, 588 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 11 InterpolantComputations, 4 PerfectInterpolantSequences, 2582/2770 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...