java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.trace.refinement.strategy SIFA_TAIPAN --sifa.abstract.domain CompoundDomain --rcfgbuilder.size.of.a.code.block LoopFreeBlock --sifa.call.summarizer TopInputCallSummarizer --sifa.fluid SizeLimitFluid --sifa.simplification.technique SIMPLIFY_QUICK -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-36ac518-m [2019-10-07 13:34:18,425 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-07 13:34:18,427 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-07 13:34:18,442 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-07 13:34:18,442 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-07 13:34:18,444 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-07 13:34:18,446 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-07 13:34:18,455 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-07 13:34:18,460 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-07 13:34:18,462 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-07 13:34:18,464 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-07 13:34:18,465 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-07 13:34:18,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-07 13:34:18,467 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-07 13:34:18,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-07 13:34:18,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-07 13:34:18,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-07 13:34:18,473 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-07 13:34:18,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-07 13:34:18,479 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-07 13:34:18,483 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-07 13:34:18,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-07 13:34:18,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-07 13:34:18,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-07 13:34:18,490 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-07 13:34:18,490 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-07 13:34:18,491 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-07 13:34:18,492 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-07 13:34:18,493 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-07 13:34:18,494 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-07 13:34:18,494 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-07 13:34:18,496 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-07 13:34:18,497 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-07 13:34:18,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-07 13:34:18,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-07 13:34:18,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-07 13:34:18,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-07 13:34:18,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-07 13:34:18,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-07 13:34:18,501 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-07 13:34:18,502 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-07 13:34:18,503 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-07 13:34:18,535 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-07 13:34:18,535 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-07 13:34:18,536 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-07 13:34:18,538 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-07 13:34:18,538 INFO L138 SettingsManager]: * Use SBE=true [2019-10-07 13:34:18,539 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-07 13:34:18,539 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-07 13:34:18,539 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-07 13:34:18,539 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-07 13:34:18,539 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-07 13:34:18,540 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-07 13:34:18,540 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-07 13:34:18,540 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-07 13:34:18,540 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-07 13:34:18,540 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-07 13:34:18,540 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-07 13:34:18,541 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-07 13:34:18,541 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-07 13:34:18,543 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-07 13:34:18,543 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-07 13:34:18,543 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-07 13:34:18,543 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:34:18,543 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-07 13:34:18,544 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-07 13:34:18,544 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-07 13:34:18,544 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-07 13:34:18,544 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-07 13:34:18,545 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-07 13:34:18,545 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> SIFA_TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> CompoundDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> LoopFreeBlock Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Call Summarizer -> TopInputCallSummarizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Fluid -> SizeLimitFluid Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Simplification Technique -> SIMPLIFY_QUICK [2019-10-07 13:34:18,824 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-07 13:34:18,836 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-07 13:34:18,839 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-07 13:34:18,841 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-07 13:34:18,841 INFO L275 PluginConnector]: CDTParser initialized [2019-10-07 13:34:18,842 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-07 13:34:18,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ac70b7e/d5d5da9de57741dd9664cb1f96488ede/FLAG8b0dc65b8 [2019-10-07 13:34:19,342 INFO L306 CDTParser]: Found 1 translation units. [2019-10-07 13:34:19,343 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-07 13:34:19,349 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ac70b7e/d5d5da9de57741dd9664cb1f96488ede/FLAG8b0dc65b8 [2019-10-07 13:34:19,649 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c0ac70b7e/d5d5da9de57741dd9664cb1f96488ede [2019-10-07 13:34:19,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-07 13:34:19,661 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-07 13:34:19,662 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-07 13:34:19,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-07 13:34:19,667 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-07 13:34:19,668 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:34:19" (1/1) ... [2019-10-07 13:34:19,671 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1431bfa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:19, skipping insertion in model container [2019-10-07 13:34:19,671 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.10 01:34:19" (1/1) ... [2019-10-07 13:34:19,679 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-07 13:34:19,712 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-07 13:34:19,961 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:34:19,965 INFO L188 MainTranslator]: Completed pre-run [2019-10-07 13:34:20,081 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-07 13:34:20,106 INFO L192 MainTranslator]: Completed translation [2019-10-07 13:34:20,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20 WrapperNode [2019-10-07 13:34:20,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-07 13:34:20,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-07 13:34:20,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-07 13:34:20,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-07 13:34:20,118 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... [2019-10-07 13:34:20,119 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... [2019-10-07 13:34:20,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... [2019-10-07 13:34:20,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... [2019-10-07 13:34:20,135 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... [2019-10-07 13:34:20,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... [2019-10-07 13:34:20,141 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... [2019-10-07 13:34:20,143 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-07 13:34:20,144 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-07 13:34:20,144 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-07 13:34:20,144 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-07 13:34:20,145 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-07 13:34:20,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-07 13:34:20,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-07 13:34:20,213 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-07 13:34:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-07 13:34:20,213 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-07 13:34:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-07 13:34:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-10-07 13:34:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-07 13:34:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-07 13:34:20,214 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-07 13:34:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-07 13:34:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-07 13:34:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-07 13:34:20,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-07 13:34:20,593 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-07 13:34:20,594 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-07 13:34:20,595 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:34:20 BoogieIcfgContainer [2019-10-07 13:34:20,595 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-07 13:34:20,596 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-07 13:34:20,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-07 13:34:20,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-07 13:34:20,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.10 01:34:19" (1/3) ... [2019-10-07 13:34:20,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751debaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:34:20, skipping insertion in model container [2019-10-07 13:34:20,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.10 01:34:20" (2/3) ... [2019-10-07 13:34:20,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@751debaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.10 01:34:20, skipping insertion in model container [2019-10-07 13:34:20,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.10 01:34:20" (3/3) ... [2019-10-07 13:34:20,603 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+lhb-reducer.c [2019-10-07 13:34:20,614 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-07 13:34:20,622 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2019-10-07 13:34:20,632 INFO L249 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2019-10-07 13:34:20,657 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-07 13:34:20,657 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-07 13:34:20,657 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-07 13:34:20,657 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-07 13:34:20,657 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-07 13:34:20,658 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-07 13:34:20,658 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-07 13:34:20,658 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-07 13:34:20,676 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2019-10-07 13:34:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-07 13:34:20,681 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:20,682 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:20,684 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:20,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:20,690 INFO L82 PathProgramCache]: Analyzing trace with hash -2043100231, now seen corresponding path program 1 times [2019-10-07 13:34:20,696 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:20,696 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:20,697 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:20,697 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:20,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:20,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:20,894 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:20,895 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:34:20,895 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:34:20,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:34:20,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:34:20,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:34:20,914 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 3 states. [2019-10-07 13:34:20,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:20,951 INFO L93 Difference]: Finished difference Result 55 states and 73 transitions. [2019-10-07 13:34:20,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:34:20,954 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-10-07 13:34:20,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:20,962 INFO L225 Difference]: With dead ends: 55 [2019-10-07 13:34:20,962 INFO L226 Difference]: Without dead ends: 33 [2019-10-07 13:34:20,965 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:34:20,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-10-07 13:34:20,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-10-07 13:34:20,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-07 13:34:20,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-10-07 13:34:20,999 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 12 [2019-10-07 13:34:20,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:20,999 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-10-07 13:34:20,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:34:21,000 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-10-07 13:34:21,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:34:21,000 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:21,001 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:21,001 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:21,001 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:21,002 INFO L82 PathProgramCache]: Analyzing trace with hash -1071190840, now seen corresponding path program 1 times [2019-10-07 13:34:21,002 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:21,002 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:21,002 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,003 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:21,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:21,068 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:21,068 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:34:21,070 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-07 13:34:21,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-07 13:34:21,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-07 13:34:21,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-07 13:34:21,072 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2019-10-07 13:34:21,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:21,122 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2019-10-07 13:34:21,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-07 13:34:21,123 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-10-07 13:34:21,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:21,124 INFO L225 Difference]: With dead ends: 52 [2019-10-07 13:34:21,124 INFO L226 Difference]: Without dead ends: 50 [2019-10-07 13:34:21,126 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-07 13:34:21,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-10-07 13:34:21,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 33. [2019-10-07 13:34:21,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:34:21,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-10-07 13:34:21,135 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 13 [2019-10-07 13:34:21,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:21,136 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-10-07 13:34:21,136 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-07 13:34:21,137 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-10-07 13:34:21,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-10-07 13:34:21,137 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:21,138 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:21,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:21,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:21,139 INFO L82 PathProgramCache]: Analyzing trace with hash -1006514579, now seen corresponding path program 1 times [2019-10-07 13:34:21,139 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:21,139 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:21,139 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,139 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:21,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:21,191 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:21,192 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:34:21,192 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:34:21,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:34:21,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:34:21,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:34:21,193 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2019-10-07 13:34:21,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:21,247 INFO L93 Difference]: Finished difference Result 61 states and 69 transitions. [2019-10-07 13:34:21,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:34:21,248 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-10-07 13:34:21,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:21,250 INFO L225 Difference]: With dead ends: 61 [2019-10-07 13:34:21,250 INFO L226 Difference]: Without dead ends: 40 [2019-10-07 13:34:21,252 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:34:21,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-07 13:34:21,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-10-07 13:34:21,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-10-07 13:34:21,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-10-07 13:34:21,264 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 13 [2019-10-07 13:34:21,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:21,265 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-10-07 13:34:21,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:34:21,267 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-10-07 13:34:21,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-07 13:34:21,267 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:21,267 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:21,268 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:21,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:21,269 INFO L82 PathProgramCache]: Analyzing trace with hash 1210971472, now seen corresponding path program 1 times [2019-10-07 13:34:21,269 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:21,270 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:21,270 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,270 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:21,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:21,333 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:21,334 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:21,334 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:34:21,334 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-07 13:34:21,337 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-07 13:34:21,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-07 13:34:21,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:34:21,338 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2019-10-07 13:34:21,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:21,387 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2019-10-07 13:34:21,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-07 13:34:21,387 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-07 13:34:21,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:21,388 INFO L225 Difference]: With dead ends: 55 [2019-10-07 13:34:21,388 INFO L226 Difference]: Without dead ends: 34 [2019-10-07 13:34:21,389 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-07 13:34:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-07 13:34:21,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-10-07 13:34:21,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-07 13:34:21,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-10-07 13:34:21,395 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 14 [2019-10-07 13:34:21,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:21,395 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-10-07 13:34:21,395 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-07 13:34:21,395 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-10-07 13:34:21,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-07 13:34:21,396 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:21,396 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:21,397 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:21,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:21,397 INFO L82 PathProgramCache]: Analyzing trace with hash 1694409031, now seen corresponding path program 1 times [2019-10-07 13:34:21,397 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:21,398 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:21,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,398 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:22,395 WARN L191 SmtUtils]: Spent 453.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2019-10-07 13:34:22,827 WARN L191 SmtUtils]: Spent 382.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-10-07 13:34:22,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:22,849 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:22,849 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:34:22,850 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-07 13:34:22,850 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-07 13:34:22,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-07 13:34:22,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-07 13:34:22,851 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 9 states. [2019-10-07 13:34:23,229 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 42 [2019-10-07 13:34:23,380 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 46 [2019-10-07 13:34:23,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:23,576 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-07 13:34:23,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-07 13:34:23,584 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 19 [2019-10-07 13:34:23,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:23,585 INFO L225 Difference]: With dead ends: 46 [2019-10-07 13:34:23,585 INFO L226 Difference]: Without dead ends: 30 [2019-10-07 13:34:23,586 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2019-10-07 13:34:23,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-07 13:34:23,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-07 13:34:23,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-07 13:34:23,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-07 13:34:23,593 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 19 [2019-10-07 13:34:23,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:23,595 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-07 13:34:23,595 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-07 13:34:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-07 13:34:23,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-07 13:34:23,596 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:23,596 INFO L385 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:23,597 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:23,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:23,597 INFO L82 PathProgramCache]: Analyzing trace with hash 336204734, now seen corresponding path program 1 times [2019-10-07 13:34:23,597 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:23,598 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:23,598 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:23,598 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:23,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:23,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:23,655 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:23,656 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:23,656 INFO L211 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-07 13:34:23,656 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-07 13:34:23,657 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-07 13:34:23,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-07 13:34:23,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-07 13:34:23,657 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 6 states. [2019-10-07 13:34:23,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:23,725 INFO L93 Difference]: Finished difference Result 43 states and 45 transitions. [2019-10-07 13:34:23,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-07 13:34:23,726 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-10-07 13:34:23,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:23,727 INFO L225 Difference]: With dead ends: 43 [2019-10-07 13:34:23,728 INFO L226 Difference]: Without dead ends: 41 [2019-10-07 13:34:23,728 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-07 13:34:23,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2019-10-07 13:34:23,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 27. [2019-10-07 13:34:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-07 13:34:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-07 13:34:23,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 20 [2019-10-07 13:34:23,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:23,735 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-07 13:34:23,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-07 13:34:23,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-07 13:34:23,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-07 13:34:23,738 INFO L377 BasicCegarLoop]: Found error trace [2019-10-07 13:34:23,738 INFO L385 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-07 13:34:23,739 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-07 13:34:23,739 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-07 13:34:23,739 INFO L82 PathProgramCache]: Analyzing trace with hash -608232998, now seen corresponding path program 1 times [2019-10-07 13:34:23,740 INFO L150 tionRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-10-07 13:34:23,740 INFO L231 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:23,740 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:23,740 INFO L117 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-07 13:34:23,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-07 13:34:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:23,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:23,910 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019-10-07 13:34:23,910 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2019-10-07 13:34:23,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:34:23,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-07 13:34:23,978 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-07 13:34:23,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-07 13:34:24,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:24,045 INFO L322 TraceCheckSpWp]: Computing backward predicates... [2019-10-07 13:34:24,108 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-07 13:34:24,109 INFO L286 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [2019-10-07 13:34:24,132 INFO L162 IcfgInterpreter]: Started Sifa with 21 locations of interest [2019-10-07 13:34:24,132 INFO L169 IcfgInterpreter]: Building call graph [2019-10-07 13:34:24,138 INFO L174 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2019-10-07 13:34:24,145 INFO L179 IcfgInterpreter]: Starting interpretation [2019-10-07 13:34:24,146 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2019-10-07 13:34:24,339 INFO L199 IcfgInterpreter]: Interpreting procedure main with input of size 30 for LOIs [2019-10-07 13:34:25,166 INFO L199 IcfgInterpreter]: Interpreting procedure ULTIMATE.init with input of size 19 for LOIs [2019-10-07 13:34:25,182 INFO L183 IcfgInterpreter]: Interpretation finished [2019-10-07 13:34:25,182 INFO L191 IcfgInterpreter]: Final predicates for locations of interest are: [2019-10-07 13:34:25,182 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initENTRY satisfy 200#(and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |old(#NULL.base)| |#NULL.base|) (= |#valid| |old(#valid)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(~__return_136~0)| ~__return_136~0)) [2019-10-07 13:34:25,183 INFO L193 IcfgInterpreter]: Reachable states at location L141 satisfy 63#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,183 INFO L193 IcfgInterpreter]: Reachable states at location L45 satisfy 82#(and (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,184 INFO L193 IcfgInterpreter]: Reachable states at location L24 satisfy 53#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (< (mod main_~main__index1~0 4294967296) 100000) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,184 INFO L193 IcfgInterpreter]: Reachable states at location L35 satisfy 68#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= 1 main_~__tmp_1~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 main_~main____CPAchecker_TMP_0~0) (<= main_~__tmp_1~0 1) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,184 INFO L193 IcfgInterpreter]: Reachable states at location L26 satisfy 58#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,185 INFO L193 IcfgInterpreter]: Reachable states at location L16 satisfy 38#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,185 INFO L193 IcfgInterpreter]: Reachable states at location L-1 satisfy 23#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= ~__tmp_155_0~0 0) (<= 0 ~__return_main~0) (= ~__tmp_155_0~0 0) (<= 0 ~__return_136~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 ~__tmp_155_0~0) (= 0 (select |#valid| 0)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,186 INFO L193 IcfgInterpreter]: Reachable states at location mainENTRY satisfy 33#(and (= 0 |old(~__tmp_155_0~0)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= ~__tmp_155_0~0 0) (<= 0 ~__return_136~0) (<= ~__return_main~0 0) (= 0 (select |old(#valid)| 0)) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (<= 0 ~__tmp_155_0~0) (= |#valid| |old(#valid)|) (<= 0 |old(~__tmp_155_0~0)|) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= |old(#length)| |#length|) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,186 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.initEXIT satisfy 205#(and (= 0 |#NULL.base|) (<= |#NULL.base| 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= ~__tmp_155_0~0 0) (<= 0 ~__return_main~0) (= ~__tmp_155_0~0 0) (<= 0 ~__return_136~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= |#NULL.offset| 0) (= |#valid| (store |old(#valid)| 0 0)) (<= 0 ~__tmp_155_0~0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,186 INFO L193 IcfgInterpreter]: Reachable states at location L102 satisfy 181#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296)) 1 0) main_~__tmp_3~0) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_3~0 1) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__VERIFIER_assert__cond~2 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,187 INFO L193 IcfgInterpreter]: Reachable states at location ULTIMATE.startENTRY satisfy 6#true [2019-10-07 13:34:25,187 INFO L193 IcfgInterpreter]: Reachable states at location L92 satisfy 100#(and (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,188 INFO L193 IcfgInterpreter]: Reachable states at location L167 satisfy 196#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296)) 1 0) main_~__tmp_3~0) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (not (= main_~__VERIFIER_assert__cond~2 0)) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_3~0 1) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__VERIFIER_assert__cond~2 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,188 INFO L193 IcfgInterpreter]: Reachable states at location L114 satisfy 176#(and (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,188 INFO L193 IcfgInterpreter]: Reachable states at location L104 satisfy 186#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= main_~__VERIFIER_assert__cond~2 0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296)) 1 0) main_~__tmp_3~0) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (= main_~__VERIFIER_assert__cond~2 0) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__tmp_3~0 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,189 INFO L193 IcfgInterpreter]: Reachable states at location L19 satisfy 43#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,189 INFO L193 IcfgInterpreter]: Reachable states at location mainErr2ASSERT_VIOLATIONERROR_FUNCTION satisfy 191#(and (< (mod main_~main__index2~0 4294967296) (mod main_~main__index1~0 4294967296)) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= main_~__VERIFIER_assert__cond~2 0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (= (ite (= (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index2~0 4294967296) 2147483647) (mod main_~main__index2~0 4294967296) (+ (mod main_~main__index2~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296) (mod (select (select |#memory_int| |main_~#main__array~0.base|) (+ (* 4 (ite (<= (mod main_~main__index1~0 4294967296) 2147483647) (mod main_~main__index1~0 4294967296) (+ (mod main_~main__index1~0 4294967296) (- 4294967296)))) |main_~#main__array~0.offset|)) 4294967296)) 1 0) main_~__tmp_3~0) (= main_~__tmp_3~0 main_~__VERIFIER_assert__cond~2) (= main_~__VERIFIER_assert__cond~2 0) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (<= 0 main_~__VERIFIER_assert__cond~2) (<= 0 main_~__tmp_3~0) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (<= main_~__tmp_3~0 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,190 INFO L193 IcfgInterpreter]: Reachable states at location L52 satisfy 91#(and (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 1 main_~__tmp_1~0) (<= 0 ~__return_main~0) (<= ~__return_main~0 0) (<= 0 |#NULL.offset|) (<= main_~__VERIFIER_assert__cond~0 1) (<= 0 |old(~__tmp_155_0~0)|) (= |old(~__tmp_155_0~0)| 0) (<= ~__tmp_155_0~0 1) (= |#NULL.base| 0) (<= main_~main__loop_entered~0 1) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (= main_~main__loop_entered~0 1) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (<= main_~__tmp_1~0 1) (= main_~__tmp_1~0 1) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= 1 main_~main__loop_entered~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,190 INFO L193 IcfgInterpreter]: Reachable states at location L74 satisfy 73#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= 1 main_~main____CPAchecker_TMP_0~0) (<= ~__return_136~0 0) (<= 1 ~__tmp_155_0~0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (<= 1 main_~__tmp_1~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (not (= main_~__VERIFIER_assert__cond~0 0)) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~__VERIFIER_assert__cond~0 1) (= ~__tmp_155_0~0 main_~main____CPAchecker_TMP_0~0) (<= 0 |old(~__tmp_155_0~0)|) (<= ~__tmp_155_0~0 1) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (<= main_~main____CPAchecker_TMP_0~0 1) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (= main_~__tmp_1~0 main_~main____CPAchecker_TMP_0~0) (<= main_~__tmp_1~0 1) (< (mod main_~main__index1~0 4294967296) 100000) (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= 1 main_~__VERIFIER_assert__cond~0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,191 INFO L193 IcfgInterpreter]: Reachable states at location L21 satisfy 48#(and (= 0 |old(~__tmp_155_0~0)|) (= 0 |#NULL.base|) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (<= main_~main__loop_entered~0 0) (<= ~__return_136~0 0) (<= 0 |#NULL.base|) (<= 0 ~__return_main~0) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (<= ~__return_main~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (<= 0 |#NULL.offset|) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (<= 0 ~__tmp_155_0~0) (<= 0 |old(~__tmp_155_0~0)|) (< |main_~#main__array~0.base| |#StackHeapBarrier|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (<= 0 |main_~#main__array~0.offset|) (<= |#NULL.base| 0) (<= 0 main_~main__loop_entered~0) (<= ~__tmp_155_0~0 0) (= main_~main__loop_entered~0 0) (<= 0 ~__return_136~0) (= 0 (select |old(#valid)| 0)) (<= |#NULL.offset| 0) (<= |main_~#main__array~0.offset| 0) (= |main_~#main__array~0.offset| 0) (< (mod main_~main__index1~0 4294967296) 100000) (= |#NULL.offset| 0) (= ~__return_main~0 0) (<= |old(~__tmp_155_0~0)| 0) (= ~__return_136~0 0)) [2019-10-07 13:34:25,473 WARN L191 SmtUtils]: Spent 237.00 ms on a formula simplification. DAG size of input: 81 DAG size of output: 61 [2019-10-07 13:34:26,097 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 44 [2019-10-07 13:34:26,301 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2019-10-07 13:34:26,489 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 47 [2019-10-07 13:34:27,089 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 49 [2019-10-07 13:34:27,318 WARN L191 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 54 [2019-10-07 13:34:27,538 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 54 [2019-10-07 13:34:27,673 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 28 [2019-10-07 13:34:28,018 WARN L191 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 60 [2019-10-07 13:34:28,276 WARN L191 SmtUtils]: Spent 181.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 62 [2019-10-07 13:34:28,279 INFO L211 tionRefinementEngine]: Constructing automaton from 0 perfect and 4 imperfect interpolant sequences. [2019-10-07 13:34:28,279 INFO L224 tionRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4, 16] total 25 [2019-10-07 13:34:28,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-10-07 13:34:28,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-10-07 13:34:28,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2019-10-07 13:34:28,281 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 25 states. [2019-10-07 13:34:30,972 WARN L191 SmtUtils]: Spent 1.19 s on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-10-07 13:34:32,434 WARN L191 SmtUtils]: Spent 1.27 s on a formula simplification that was a NOOP. DAG size: 70 [2019-10-07 13:34:35,053 WARN L191 SmtUtils]: Spent 2.57 s on a formula simplification that was a NOOP. DAG size: 72 [2019-10-07 13:34:37,371 WARN L191 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 26 DAG size of output: 23 [2019-10-07 13:34:44,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-07 13:34:44,123 INFO L93 Difference]: Finished difference Result 41 states and 43 transitions. [2019-10-07 13:34:44,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-07 13:34:44,126 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 22 [2019-10-07 13:34:44,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-07 13:34:44,127 INFO L225 Difference]: With dead ends: 41 [2019-10-07 13:34:44,127 INFO L226 Difference]: Without dead ends: 0 [2019-10-07 13:34:44,128 INFO L606 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=164, Invalid=828, Unknown=0, NotChecked=0, Total=992 [2019-10-07 13:34:44,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-07 13:34:44,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-07 13:34:44,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-07 13:34:44,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-07 13:34:44,129 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-10-07 13:34:44,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-07 13:34:44,130 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-07 13:34:44,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-10-07 13:34:44,130 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-07 13:34:44,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-07 13:34:44,331 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-07 13:34:44,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-07 13:34:44,693 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 84 [2019-10-07 13:34:51,424 WARN L191 SmtUtils]: Spent 6.72 s on a formula simplification. DAG size of input: 74 DAG size of output: 53 [2019-10-07 13:34:51,559 WARN L191 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-07 13:34:51,969 WARN L191 SmtUtils]: Spent 408.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 89 [2019-10-07 13:34:51,972 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= ~__return_main~0 |old(~__return_main~0)|) (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |#valid| |old(#valid)|) (= |old(#NULL.base)| |#NULL.base|) (= |old(~__return_136~0)| ~__return_136~0) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-10-07 13:34:51,972 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:34:51,972 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-07 13:34:51,973 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= |#NULL.base| 0) (= 0 (select |#valid| 0)) (<= 0 |#NULL.base|) (= ~__tmp_155_0~0 0) (= |#NULL.offset| 0) (= ~__return_main~0 0) (= ~__return_136~0 0)) [2019-10-07 13:34:51,973 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-07 13:34:51,973 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-07 13:34:51,973 INFO L446 ceAbstractionStarter]: At program point L126(lines 92 127) the Hoare annotation is: true [2019-10-07 13:34:51,973 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 104) no Hoare annotation was computed. [2019-10-07 13:34:51,973 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 191) no Hoare annotation was computed. [2019-10-07 13:34:51,974 INFO L443 ceAbstractionStarter]: For program point L151(lines 151 179) no Hoare annotation was computed. [2019-10-07 13:34:51,974 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-10-07 13:34:51,974 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 185) no Hoare annotation was computed. [2019-10-07 13:34:51,974 INFO L439 ceAbstractionStarter]: At program point L114(lines 93 123) the Hoare annotation is: (let ((.cse7 (div main_~main__index1~0 4294967296)) (.cse6 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse8 (* 4294967296 .cse6)) (.cse9 (+ (* 4294967296 .cse7) main_~main__index2~0))) (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) .cse0 (or (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse5 (+ (* (- 17179869184) .cse7) (* 4 main_~main__index1~0) |main_~#main__array~0.offset|))) (.cse2 (select .cse5 (+ (* 4 main_~main__index2~0) |main_~#main__array~0.offset| (* (- 17179869184) .cse6))))) (let ((.cse3 (+ .cse4 (* 4294967296 (div .cse2 4294967296)))) (.cse1 (* 4294967296 (div .cse4 4294967296)))) (and (<= (+ .cse1 .cse2) .cse3) (< .cse3 (+ .cse1 .cse2 1)))))) (<= (+ main_~main__index1~0 .cse8) .cse9))) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (and (<= main_~main__index2~0 (+ .cse8 99999)) .cse0 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse8 1) .cse9)) (not (<= |old(~__tmp_155_0~0)| 0))))) [2019-10-07 13:34:51,974 INFO L443 ceAbstractionStarter]: For program point L102(lines 102 115) no Hoare annotation was computed. [2019-10-07 13:34:51,975 INFO L443 ceAbstractionStarter]: For program point L160(lines 160 168) no Hoare annotation was computed. [2019-10-07 13:34:51,975 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-10-07 13:34:51,975 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-10-07 13:34:51,975 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-10-07 13:34:51,975 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-07 13:34:51,975 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 190) no Hoare annotation was computed. [2019-10-07 13:34:51,975 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-10-07 13:34:51,976 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (let ((.cse4 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse1 (<= main_~main__index2~0 (+ .cse4 99999))) (.cse2 (= main_~__VERIFIER_assert__cond~0 1)) (.cse3 (<= (+ main_~main__index1~0 .cse4 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse1 .cse2 .cse3) (and .cse1 .cse2 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse3)))))) (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) .cse0) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0)) (and (not (= 0 |main_~#main__array~0.base|)) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (= main_~main__loop_entered~0 0) (= main_~__tmp_1~0 main_~__VERIFIER_assert__cond~0) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= |main_~#main__array~0.offset| 0) (= ~__tmp_155_0~0 main_~main____CPAchecker_TMP_0~0) (= main_~__tmp_1~0 main_~main____CPAchecker_TMP_0~0) (< |main_~#main__array~0.base| |#StackHeapBarrier|) .cse0))) [2019-10-07 13:34:51,976 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-10-07 13:34:51,976 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-10-07 13:34:51,976 INFO L443 ceAbstractionStarter]: For program point L153(lines 153 174) no Hoare annotation was computed. [2019-10-07 13:34:51,976 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-07 13:34:51,976 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 180) no Hoare annotation was computed. [2019-10-07 13:34:51,977 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (not (= 0 |main_~#main__array~0.base|)) (= (store |old(#length)| |main_~#main__array~0.base| 400000) |#length|) (= |#valid| (store |old(#valid)| |main_~#main__array~0.base| 1)) (= main_~main__loop_entered~0 0) (< (mod main_~main__index2~0 4294967296) 100000) (= (select |old(#valid)| |main_~#main__array~0.base|) 0) (= 1 main_~main____CPAchecker_TMP_0~0) (= |main_~#main__array~0.offset| 0) (<= (+ main_~main__index1~0 (* 4294967296 (div main_~main__index2~0 4294967296)) 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)) (< |main_~#main__array~0.base| |#StackHeapBarrier|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-07 13:34:51,977 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 191) no Hoare annotation was computed. [2019-10-07 13:34:51,977 INFO L443 ceAbstractionStarter]: For program point L104(line 104) no Hoare annotation was computed. [2019-10-07 13:34:51,977 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-10-07 13:34:51,977 INFO L443 ceAbstractionStarter]: For program point L162(line 162) no Hoare annotation was computed. [2019-10-07 13:34:51,977 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 9 191) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (and (<= ~__tmp_155_0~0 0) (<= 0 ~__tmp_155_0~0) (= |#valid| |old(#valid)|) (= |old(#length)| |#length|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-07 13:34:51,978 INFO L443 ceAbstractionStarter]: For program point L92(lines 92 127) no Hoare annotation was computed. [2019-10-07 13:34:51,978 INFO L443 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONERROR_FUNCTION(line 162) no Hoare annotation was computed. [2019-10-07 13:34:51,978 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-10-07 13:34:51,978 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-10-07 13:34:51,978 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-07 13:34:51,979 INFO L439 ceAbstractionStarter]: At program point L167(lines 21 180) the Hoare annotation is: (or (not (= ~__return_136~0 0)) (not (= 0 ~__return_main~0)) (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (* (- 4294967296) (div (+ main_~main__index2~0 4294867297) 4294967296)) (- 1)) 4294967296)) main_~main__index2~0 1)) (= main_~__VERIFIER_assert__cond~0 1) (not (= main_~__VERIFIER_assert__cond~2 0))) (not (= |#NULL.offset| 0)) (not (<= 0 |old(~__tmp_155_0~0)|)) (not (<= 0 |#NULL.base|)) (not (= 0 (select |old(#valid)| 0))) (not (<= |#NULL.base| 0)) (not (<= |old(~__tmp_155_0~0)| 0))) [2019-10-07 13:34:51,979 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-10-07 13:34:51,979 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-10-07 13:34:51,987 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,988 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,993 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,994 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,995 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,996 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,997 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:51,998 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,000 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,001 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,002 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,004 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,005 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,006 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,007 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,008 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,009 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,010 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,011 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,012 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:34:52,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,013 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,014 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:34:52,015 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,015 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,016 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,017 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,018 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:34:52,021 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,021 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,022 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,022 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,022 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,023 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:34:52,027 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.10 01:34:52 BoogieIcfgContainer [2019-10-07 13:34:52,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-07 13:34:52,029 INFO L168 Benchmark]: Toolchain (without parser) took 32368.07 ms. Allocated memory was 138.9 MB in the beginning and 297.8 MB in the end (delta: 158.9 MB). Free memory was 102.9 MB in the beginning and 97.1 MB in the end (delta: 5.8 MB). Peak memory consumption was 164.7 MB. Max. memory is 7.1 GB. [2019-10-07 13:34:52,030 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-07 13:34:52,031 INFO L168 Benchmark]: CACSL2BoogieTranslator took 445.07 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 102.5 MB in the beginning and 179.7 MB in the end (delta: -77.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. [2019-10-07 13:34:52,031 INFO L168 Benchmark]: Boogie Preprocessor took 35.89 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 177.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:34:52,032 INFO L168 Benchmark]: RCFGBuilder took 451.64 ms. Allocated memory is still 201.9 MB. Free memory was 177.7 MB in the beginning and 157.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. [2019-10-07 13:34:52,033 INFO L168 Benchmark]: TraceAbstraction took 31430.84 ms. Allocated memory was 201.9 MB in the beginning and 297.8 MB in the end (delta: 95.9 MB). Free memory was 157.1 MB in the beginning and 97.1 MB in the end (delta: 60.0 MB). Peak memory consumption was 156.0 MB. Max. memory is 7.1 GB. [2019-10-07 13:34:52,037 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 138.9 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 445.07 ms. Allocated memory was 138.9 MB in the beginning and 201.9 MB in the end (delta: 62.9 MB). Free memory was 102.5 MB in the beginning and 179.7 MB in the end (delta: -77.2 MB). Peak memory consumption was 23.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.89 ms. Allocated memory is still 201.9 MB. Free memory was 179.7 MB in the beginning and 177.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 451.64 ms. Allocated memory is still 201.9 MB. Free memory was 177.7 MB in the beginning and 157.8 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 31430.84 ms. Allocated memory was 201.9 MB in the beginning and 297.8 MB in the end (delta: 95.9 MB). Free memory was 157.1 MB in the beginning and 97.1 MB in the end (delta: 60.0 MB). Peak memory consumption was 156.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #NULL - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 162]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 104]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2019-10-07 13:34:52,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,050 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,051 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((!(__return_136 == 0) || !(0 == __return_main)) || ((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0))) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 55]: Loop Invariant [2019-10-07 13:34:52,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,052 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 24]: Loop Invariant [2019-10-07 13:34:52,053 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,054 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,070 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,072 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 93]: Loop Invariant [2019-10-07 13:34:52,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,073 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,074 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,075 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,076 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,077 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-07 13:34:52,078 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,079 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: ((((((((!(__return_136 == 0) || !(0 == __return_main)) || ((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && ((4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] <= unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) && unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] / 4294967296) < 4294967296 * (unknown-#memory_int-unknown[main__array][-17179869184 * (main__index1 / 4294967296) + 4 * main__index1 + main__array] / 4294967296) + unknown-#memory_int-unknown[main__array][4 * main__index2 + main__array + -17179869184 * (main__index2 / 4294967296)] + 1) || main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2))) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || (((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 57]: Loop Invariant [2019-10-07 13:34:52,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,080 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,081 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || (((main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2)) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 26]: Loop Invariant [2019-10-07 13:34:52,082 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,082 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,082 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,082 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:34:52,083 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,083 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,084 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,084 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,084 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,084 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:34:52,085 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,085 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL Derived loop invariant: (((((((!(__return_136 == 0) || !(0 == __return_main)) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || ((((((((((__tmp_155_0 == \old(__tmp_155_0) && !(0 == main__array)) && \old(unknown-#length-unknown)[main__array := 400000] == unknown-#length-unknown) && \valid == \old(\valid)[main__array := 1]) && main__loop_entered == 0) && main__index2 % 4294967296 < 100000) && \old(\valid)[main__array] == 0) && 1 == main____CPAchecker_TMP_0) && main__array == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) && main__array < unknown-#StackHeapBarrier-unknown)) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0) - InvariantResult [Line: 92]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant [2019-10-07 13:34:52,086 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,086 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,086 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,086 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,086 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,087 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-07 13:34:52,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #NULL [2019-10-07 13:34:52,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,088 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2019-10-07 13:34:52,089 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier Derived loop invariant: ((((((((!(__return_136 == 0) || !(0 == __return_main)) || (main__index1 <= 4294967296 * ((main__index1 + -4294967296 * ((main__index2 + 4294867297) / 4294967296) + -1) / 4294967296) + main__index2 + 1 && ((((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2)))) || !(#NULL == 0)) || !(0 <= \old(__tmp_155_0))) || !(0 <= #NULL)) || !(0 == \old(\valid)[0])) || !(#NULL <= 0)) || !(\old(__tmp_155_0) <= 0)) || ((((((((((!(0 == main__array) && \old(unknown-#length-unknown)[main__array := 400000] == unknown-#length-unknown) && \valid == \old(\valid)[main__array := 1]) && main__loop_entered == 0) && __tmp_1 == __VERIFIER_assert__cond) && \old(\valid)[main__array] == 0) && main__array == 0) && __tmp_155_0 == main____CPAchecker_TMP_0) && __tmp_1 == main____CPAchecker_TMP_0) && main__array < unknown-#StackHeapBarrier-unknown) && ((((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) || ((((main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && !(__VERIFIER_assert__cond == 0)) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2))) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 41 locations, 4 error locations. Result: SAFE, OverallTime: 31.3s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 7.6s, HoareTripleCheckerStatistics: 197 SDtfs, 239 SDslu, 275 SDs, 0 SdLazy, 327 SolverSat, 27 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 8.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 118 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 7 MinimizatonAttempts, 47 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 24 NumberOfFragments, 874 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1492 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 474 FormulaSimplificationTreeSizeReductionInter, 7.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 135 NumberOfCodeBlocks, 135 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 148 ConstructedInterpolants, 0 QuantifiedInterpolants, 57845 SizeOfPredicates, 3 NumberOfNonLiveVariables, 116 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 9 InterpolantComputations, 6 PerfectInterpolantSequences, 3/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: OVERALL_TIME[ms]: 1059, ICFG_INTERPRETER_ENTERED_PROCEDURES: 3, DAG_INTERPRETER_EARLY_EXIT_QUERIES: 33, DAG_INTERPRETER_EARLY_EXITS: 0, TOOLS_POST_APPLICATIONS: 24, TOOLS_POST_TIME[ms]: 81, TOOLS_POST_CALL_APPLICATIONS: 4, TOOLS_POST_CALL_TIME[ms]: 11, TOOLS_POST_RETURN_APPLICATIONS: 2, TOOLS_POST_RETURN_TIME[ms]: 4, TOOLS_QUANTIFIERELIM_APPLICATIONS: 30, TOOLS_QUANTIFIERELIM_TIME[ms]: 75, TOOLS_QUANTIFIERELIM_MAX_TIME[ms]: 30, FLUID_QUERY_TIME[ms]: 4, FLUID_QUERIES: 35, FLUID_YES_ANSWERS: 0, DOMAIN_JOIN_APPLICATIONS: 27, DOMAIN_JOIN_TIME[ms]: 806, DOMAIN_ALPHA_APPLICATIONS: 0, DOMAIN_ALPHA_TIME[ms]: 0, DOMAIN_WIDEN_APPLICATIONS: 1, DOMAIN_WIDEN_TIME[ms]: 42, DOMAIN_ISSUBSETEQ_APPLICATIONS: 2, DOMAIN_ISSUBSETEQ_TIME[ms]: 15, DOMAIN_ISBOTTOM_APPLICATIONS: 2, DOMAIN_ISBOTTOM_TIME[ms]: 5, LOOP_SUMMARIZER_APPLICATIONS: 1, LOOP_SUMMARIZER_CACHE_MISSES: 1, LOOP_SUMMARIZER_OVERALL_TIME[ms]: 246, LOOP_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 246, LOOP_SUMMARIZER_FIXPOINT_ITERATIONS: 2, CALL_SUMMARIZER_APPLICATIONS: 2, CALL_SUMMARIZER_CACHE_MISSES: 1, CALL_SUMMARIZER_OVERALL_TIME[ms]: 57, CALL_SUMMARIZER_NEW_COMPUTATION_TIME[ms]: 56, PROCEDURE_GRAPH_BUILDER_TIME[ms]: 4, PATH_EXPR_TIME[ms]: 5, REGEX_TO_DAG_TIME[ms]: 4, DAG_COMPRESSION_TIME[ms]: 21, DAG_COMPRESSION_PROCESSED_NODES: 188, DAG_COMPRESSION_RETAINED_NODES: 58, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...