/usr/bin/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 -i ../../../trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:21:16,625 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:21:16,628 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:21:16,641 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:21:16,641 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:21:16,643 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:21:16,645 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:21:16,654 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:21:16,655 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:21:16,657 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:21:16,657 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:21:16,660 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:21:16,661 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:21:16,663 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:21:16,665 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:21:16,667 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:21:16,668 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:21:16,671 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:21:16,673 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:21:16,677 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:21:16,680 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:21:16,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:21:16,684 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:21:16,685 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:21:16,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:21:16,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:21:16,687 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:21:16,689 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:21:16,689 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:21:16,691 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:21:16,692 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:21:16,692 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:21:16,693 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:21:16,694 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:21:16,695 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:21:16,696 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:21:16,696 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:21:16,696 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:21:16,697 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:21:16,698 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:21:16,699 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:21:16,700 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-11-06 21:21:16,735 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:21:16,735 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:21:16,739 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:21:16,739 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:21:16,740 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:21:16,740 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:21:16,740 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:21:16,740 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:21:16,740 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:21:16,741 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:21:16,741 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:21:16,741 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:21:16,741 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:21:16,741 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:21:16,741 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:21:16,742 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:21:16,742 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:21:16,742 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:21:16,742 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:21:16,742 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:21:16,743 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:21:16,743 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:21:16,743 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:21:16,743 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:21:16,743 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:21:16,744 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:21:16,745 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:21:16,745 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:21:16,745 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:21:17,001 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:21:17,020 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:21:17,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:21:17,024 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:21:17,024 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:21:17,025 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+nlh-reducer.c [2019-11-06 21:21:17,092 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58ab5c3b/0437656a846548509c9e263de4a9327b/FLAG7057fb8e9 [2019-11-06 21:21:17,550 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:21:17,551 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-crafted/simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-06 21:21:17,559 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58ab5c3b/0437656a846548509c9e263de4a9327b/FLAG7057fb8e9 [2019-11-06 21:21:17,923 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b58ab5c3b/0437656a846548509c9e263de4a9327b [2019-11-06 21:21:17,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:21:17,935 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:21:17,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:21:17,937 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:21:17,940 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:21:17,941 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:21:17" (1/1) ... [2019-11-06 21:21:17,944 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40d1ab0a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:17, skipping insertion in model container [2019-11-06 21:21:17,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:21:17" (1/1) ... [2019-11-06 21:21:17,953 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:21:17,983 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:21:18,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:21:18,175 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:21:18,206 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:21:18,308 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:21:18,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18 WrapperNode [2019-11-06 21:21:18,309 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:21:18,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:21:18,309 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:21:18,310 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:21:18,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... [2019-11-06 21:21:18,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... [2019-11-06 21:21:18,328 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... [2019-11-06 21:21:18,329 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... [2019-11-06 21:21:18,337 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... [2019-11-06 21:21:18,340 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... [2019-11-06 21:21:18,342 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... [2019-11-06 21:21:18,345 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:21:18,345 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:21:18,345 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:21:18,346 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:21:18,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:21:18,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:21:18,409 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:21:18,409 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:21:18,409 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:21:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-11-06 21:21:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-11-06 21:21:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-11-06 21:21:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:21:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:21:18,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:21:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:21:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:21:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:21:18,411 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:21:18,728 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:21:18,729 INFO L284 CfgBuilder]: Removed 0 assume(true) statements. [2019-11-06 21:21:18,730 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:21:18 BoogieIcfgContainer [2019-11-06 21:21:18,730 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:21:18,731 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:21:18,731 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:21:18,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:21:18,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:21:17" (1/3) ... [2019-11-06 21:21:18,741 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8ed924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:21:18, skipping insertion in model container [2019-11-06 21:21:18,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:21:18" (2/3) ... [2019-11-06 21:21:18,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b8ed924 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:21:18, skipping insertion in model container [2019-11-06 21:21:18,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:21:18" (3/3) ... [2019-11-06 21:21:18,744 INFO L109 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_4.i.v+nlh-reducer.c [2019-11-06 21:21:18,754 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:21:18,761 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-06 21:21:18,771 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-06 21:21:18,792 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:21:18,793 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:21:18,793 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:21:18,793 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:21:18,793 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:21:18,793 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:21:18,793 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:21:18,794 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:21:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2019-11-06 21:21:18,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-11-06 21:21:18,813 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:18,814 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:18,815 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:18,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:18,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2019-11-06 21:21:18,827 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:18,827 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707162206] [2019-11-06 21:21:18,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:19,057 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707162206] [2019-11-06 21:21:19,058 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:19,058 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:21:19,059 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770496849] [2019-11-06 21:21:19,064 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:21:19,064 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:19,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:21:19,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:19,081 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 4 states. [2019-11-06 21:21:19,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:19,231 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2019-11-06 21:21:19,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:21:19,234 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-11-06 21:21:19,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:19,245 INFO L225 Difference]: With dead ends: 51 [2019-11-06 21:21:19,246 INFO L226 Difference]: Without dead ends: 33 [2019-11-06 21:21:19,249 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-11-06 21:21:19,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2019-11-06 21:21:19,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-06 21:21:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2019-11-06 21:21:19,296 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2019-11-06 21:21:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:19,297 INFO L462 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2019-11-06 21:21:19,297 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:21:19,297 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2019-11-06 21:21:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 21:21:19,298 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:19,298 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:19,299 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2019-11-06 21:21:19,300 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:19,300 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903588284] [2019-11-06 21:21:19,301 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:19,421 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903588284] [2019-11-06 21:21:19,421 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:19,421 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 21:21:19,422 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205020136] [2019-11-06 21:21:19,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:21:19,425 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:19,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:21:19,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 21:21:19,430 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 5 states. [2019-11-06 21:21:19,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:19,550 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2019-11-06 21:21:19,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:21:19,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2019-11-06 21:21:19,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:19,552 INFO L225 Difference]: With dead ends: 51 [2019-11-06 21:21:19,553 INFO L226 Difference]: Without dead ends: 49 [2019-11-06 21:21:19,555 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:21:19,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2019-11-06 21:21:19,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2019-11-06 21:21:19,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:21:19,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2019-11-06 21:21:19,569 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2019-11-06 21:21:19,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:19,570 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2019-11-06 21:21:19,570 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:21:19,570 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2019-11-06 21:21:19,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 21:21:19,572 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:19,572 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:19,572 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:19,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:19,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2019-11-06 21:21:19,573 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:19,574 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138535938] [2019-11-06 21:21:19,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:19,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:19,681 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138535938] [2019-11-06 21:21:19,681 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:19,682 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:21:19,682 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945761217] [2019-11-06 21:21:19,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:21:19,683 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:19,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:21:19,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:19,683 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 4 states. [2019-11-06 21:21:19,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:19,799 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2019-11-06 21:21:19,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:21:19,800 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-11-06 21:21:19,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:19,801 INFO L225 Difference]: With dead ends: 60 [2019-11-06 21:21:19,801 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 21:21:19,802 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:19,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 21:21:19,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2019-11-06 21:21:19,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:21:19,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-11-06 21:21:19,809 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2019-11-06 21:21:19,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:19,809 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-11-06 21:21:19,809 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:21:19,809 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-11-06 21:21:19,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-11-06 21:21:19,810 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:19,810 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:19,811 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:19,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:19,811 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2019-11-06 21:21:19,811 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:19,812 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427166354] [2019-11-06 21:21:19,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:19,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:19,862 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427166354] [2019-11-06 21:21:19,862 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:19,862 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:21:19,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323116378] [2019-11-06 21:21:19,863 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:21:19,863 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:19,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:21:19,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:19,864 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 4 states. [2019-11-06 21:21:19,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:19,935 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2019-11-06 21:21:19,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:21:19,935 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-11-06 21:21:19,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:19,936 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:21:19,936 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 21:21:19,937 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:21:19,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 21:21:19,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2019-11-06 21:21:19,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-11-06 21:21:19,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2019-11-06 21:21:19,942 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2019-11-06 21:21:19,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:19,943 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2019-11-06 21:21:19,943 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:21:19,943 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2019-11-06 21:21:19,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:21:19,944 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:19,944 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:19,944 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:19,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:19,945 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2019-11-06 21:21:19,945 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:19,945 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299066101] [2019-11-06 21:21:19,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:20,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:20,791 WARN L191 SmtUtils]: Spent 404.00 ms on a formula simplification. DAG size of input: 164 DAG size of output: 88 [2019-11-06 21:21:21,229 WARN L191 SmtUtils]: Spent 372.00 ms on a formula simplification. DAG size of input: 160 DAG size of output: 91 [2019-11-06 21:21:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:21,282 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:21,283 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299066101] [2019-11-06 21:21:21,283 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:21,283 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-11-06 21:21:21,284 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369463740] [2019-11-06 21:21:21,284 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-11-06 21:21:21,284 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:21,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-11-06 21:21:21,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:21:21,285 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 10 states. [2019-11-06 21:21:21,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:21,713 INFO L93 Difference]: Finished difference Result 44 states and 51 transitions. [2019-11-06 21:21:21,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:21:21,714 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 20 [2019-11-06 21:21:21,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:21,715 INFO L225 Difference]: With dead ends: 44 [2019-11-06 21:21:21,715 INFO L226 Difference]: Without dead ends: 29 [2019-11-06 21:21:21,716 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-11-06 21:21:21,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-11-06 21:21:21,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-11-06 21:21:21,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 21:21:21,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-06 21:21:21,724 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 20 [2019-11-06 21:21:21,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:21,724 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-06 21:21:21,725 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-11-06 21:21:21,726 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-06 21:21:21,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-11-06 21:21:21,727 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:21,727 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:21:21,727 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:21,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:21,728 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2019-11-06 21:21:21,728 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:21,728 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908956344] [2019-11-06 21:21:21,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:21,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:21,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:21,824 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908956344] [2019-11-06 21:21:21,824 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:21:21,824 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-06 21:21:21,824 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456955817] [2019-11-06 21:21:21,825 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:21:21,826 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:21,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:21:21,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:21:21,826 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 7 states. [2019-11-06 21:21:21,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:21,940 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-06 21:21:21,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-06 21:21:21,940 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2019-11-06 21:21:21,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:21,941 INFO L225 Difference]: With dead ends: 42 [2019-11-06 21:21:21,941 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 21:21:21,942 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:21:21,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 21:21:21,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 27. [2019-11-06 21:21:21,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 21:21:21,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-06 21:21:21,947 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 21 [2019-11-06 21:21:21,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:21,947 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-06 21:21:21,947 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:21:21,947 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-06 21:21:21,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:21:21,948 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:21:21,948 INFO L410 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-11-06 21:21:21,949 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:21:21,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:21:21,949 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2019-11-06 21:21:21,949 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:21:21,949 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271076614] [2019-11-06 21:21:21,950 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:21:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:22,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:22,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:22,110 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271076614] [2019-11-06 21:21:22,110 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089820020] [2019-11-06 21:21:22,111 INFO L94 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-11-06 21:21:22,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:21:22,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-06 21:21:22,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:21:22,245 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:21:22,245 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:21:22,245 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4] total 8 [2019-11-06 21:21:22,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592786474] [2019-11-06 21:21:22,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:21:22,246 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:21:22,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:21:22,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:21:22,247 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2019-11-06 21:21:26,594 WARN L191 SmtUtils]: Spent 4.12 s on a formula simplification that was a NOOP. DAG size: 26 [2019-11-06 21:21:32,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:21:32,299 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-11-06 21:21:32,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:21:32,301 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-11-06 21:21:32,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:21:32,301 INFO L225 Difference]: With dead ends: 30 [2019-11-06 21:21:32,301 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:21:32,302 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:21:32,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:21:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:21:32,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:21:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:21:32,303 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 22 [2019-11-06 21:21:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:21:32,303 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:21:32,303 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:21:32,303 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:21:32,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:21:32,504 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:21:32,509 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:21:32,680 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2019-11-06 21:21:34,947 WARN L191 SmtUtils]: Spent 2.27 s on a formula simplification. DAG size of input: 63 DAG size of output: 61 [2019-11-06 21:21:35,141 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:21:35,141 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)|) (= ~__return_136~0 |old(~__return_136~0)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-11-06 21:21:35,141 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:21:35,141 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:21:35,142 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:21:35,142 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:21:35,142 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:21:35,142 INFO L446 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2019-11-06 21:21:35,142 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2019-11-06 21:21:35,143 INFO L439 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) main_~main__index2~0 1)) (= main_~__VERIFIER_assert__cond~0 1) (let ((.cse1 (div main_~main__index1~0 4294967296)) (.cse0 (div main_~main__index2~0 4294967296))) (or (<= (+ main_~main__index1~0 (* 4294967296 .cse0)) (+ (* 4294967296 .cse1) main_~main__index2~0)) (let ((.cse6 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse3 (select .cse6 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse0 (- 17179869184))))) (.cse5 (select .cse6 (+ (* .cse1 (- 17179869184)) (* main_~main__index1~0 4) |main_~#main__array~0.offset|)))) (let ((.cse4 (* 4294967296 (div .cse5 4294967296))) (.cse2 (+ .cse5 (* 4294967296 (div .cse3 4294967296))))) (and (< .cse2 (+ .cse3 .cse4 1)) (<= (+ .cse3 .cse4) .cse2)))))))) (= main_~main__loop_entered~0 0)) [2019-11-06 21:21:35,143 INFO L443 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2019-11-06 21:21:35,143 INFO L443 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2019-11-06 21:21:35,143 INFO L439 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse8 (div main_~main__index1~0 4294967296)) (.cse9 (div main_~main__index2~0 4294967296))) (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse1 (* 4294967296 .cse9)) (.cse2 (+ (* 4294967296 .cse8) main_~main__index2~0))) (or (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 4294967296)) main_~main__index2~0 1)) .cse0 (or (<= (+ main_~main__index1~0 .cse1) .cse2) (let ((.cse7 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse4 (select .cse7 (+ (* main_~main__index2~0 4) |main_~#main__array~0.offset| (* .cse9 (- 17179869184))))) (.cse6 (select .cse7 (+ (* .cse8 (- 17179869184)) (* main_~main__index1~0 4) |main_~#main__array~0.offset|)))) (let ((.cse5 (* 4294967296 (div .cse6 4294967296))) (.cse3 (+ .cse6 (* 4294967296 (div .cse4 4294967296))))) (and (< .cse3 (+ .cse4 .cse5 1)) (<= (+ .cse4 .cse5) .cse3))))))) (and (<= main_~main__index2~0 (+ .cse1 99999)) .cse0 (not (= main_~__VERIFIER_assert__cond~2 0)) (<= (+ main_~main__index1~0 .cse1 1) .cse2))))) [2019-11-06 21:21:35,144 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2019-11-06 21:21:35,144 INFO L443 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2019-11-06 21:21:35,144 INFO L443 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2019-11-06 21:21:35,144 INFO L439 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (<= main_~main__index1~0 (+ (* 4294967296 (div (+ (* (div (+ main_~main__index1~0 (- 1)) 4294967296) 4294967296) (* main_~main__index2~0 (- 1)) 99998) 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))) [2019-11-06 21:21:35,144 INFO L443 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2019-11-06 21:21:35,144 INFO L443 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2019-11-06 21:21:35,145 INFO L439 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse3 (* 4294967296 (div main_~main__index2~0 4294967296)))) (let ((.cse0 (<= main_~main__index2~0 (+ .cse3 99999))) (.cse1 (= main_~__VERIFIER_assert__cond~0 1)) (.cse2 (<= (+ main_~main__index1~0 .cse3 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) (or (and (= 1 main_~main____CPAchecker_TMP_0~0) .cse0 .cse1 .cse2) (and .cse0 .cse1 (not (= 0 main_~main____CPAchecker_TMP_0~1)) (not (= main_~__VERIFIER_assert__cond~1 0)) .cse2)))) [2019-11-06 21:21:35,145 INFO L443 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2019-11-06 21:21:35,145 INFO L443 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2019-11-06 21:21:35,145 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2019-11-06 21:21:35,145 INFO L443 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2019-11-06 21:21:35,145 INFO L439 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2019-11-06 21:21:35,146 INFO L443 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2019-11-06 21:21:35,146 INFO L439 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= 1 main_~main____CPAchecker_TMP_0~0) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2019-11-06 21:21:35,146 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2019-11-06 21:21:35,146 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2019-11-06 21:21:35,146 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: (and (= ~__tmp_155_0~0 |old(~__tmp_155_0~0)|) (= |#valid| |old(#valid)|)) [2019-11-06 21:21:35,146 INFO L443 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2019-11-06 21:21:35,147 INFO L443 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2019-11-06 21:21:35,147 INFO L439 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2019-11-06 21:21:35,147 INFO L443 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2019-11-06 21:21:35,147 INFO L443 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2019-11-06 21:21:35,147 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2019-11-06 21:21:35,157 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,166 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,167 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,168 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,171 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,172 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,174 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,175 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,176 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:21:35 BoogieIcfgContainer [2019-11-06 21:21:35,186 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:21:35,190 INFO L168 Benchmark]: Toolchain (without parser) took 17252.91 ms. Allocated memory was 146.8 MB in the beginning and 243.8 MB in the end (delta: 97.0 MB). Free memory was 104.4 MB in the beginning and 132.4 MB in the end (delta: -28.0 MB). Peak memory consumption was 69.0 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:35,191 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-11-06 21:21:35,192 INFO L168 Benchmark]: CACSL2BoogieTranslator took 372.52 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 104.2 MB in the beginning and 182.7 MB in the end (delta: -78.5 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:35,193 INFO L168 Benchmark]: Boogie Preprocessor took 35.67 ms. Allocated memory is still 204.5 MB. Free memory was 182.7 MB in the beginning and 180.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:35,196 INFO L168 Benchmark]: RCFGBuilder took 385.11 ms. Allocated memory is still 204.5 MB. Free memory was 180.8 MB in the beginning and 162.6 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:35,198 INFO L168 Benchmark]: TraceAbstraction took 16455.23 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 162.0 MB in the beginning and 132.4 MB in the end (delta: 29.5 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. [2019-11-06 21:21:35,206 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.41 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.8 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 372.52 ms. Allocated memory was 146.8 MB in the beginning and 204.5 MB in the end (delta: 57.7 MB). Free memory was 104.2 MB in the beginning and 182.7 MB in the end (delta: -78.5 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.67 ms. Allocated memory is still 204.5 MB. Free memory was 182.7 MB in the beginning and 180.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 385.11 ms. Allocated memory is still 204.5 MB. Free memory was 180.8 MB in the beginning and 162.6 MB in the end (delta: 18.2 MB). Peak memory consumption was 18.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16455.23 ms. Allocated memory was 204.5 MB in the beginning and 243.8 MB in the end (delta: 39.3 MB). Free memory was 162.0 MB in the beginning and 132.4 MB in the end (delta: 29.5 MB). Peak memory consumption was 68.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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 #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 #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 #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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2019-11-06 21:21:35,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,226 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,227 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,232 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,233 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,234 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,235 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index1 <= 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && (main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 || (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) < unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] / 4294967296) + 1 && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] / 4294967296) <= unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296)))) || main__loop_entered == 0 - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2019-11-06 21:21:35,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,240 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,242 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,244 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,245 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,246 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:21:35,247 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((main__index1 <= 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 4294967296) + main__index2 + 1 && __VERIFIER_assert__cond == 1) && (main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 || (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296) < unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] / 4294967296) + 1 && unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] / 4294967296) <= unknown-#memory_int-unknown[main__array][main__index1 / 4294967296 * -17179869184 + main__index1 * 4 + main__array] + 4294967296 * (unknown-#memory_int-unknown[main__array][main__index2 * 4 + main__array + main__index2 / 4294967296 * -17179869184] / 4294967296)))) || (((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) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: ((main__index1 <= 4294967296 * (((main__index1 + -1) / 4294967296 * 4294967296 + main__index2 * -1 + 99998) / 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 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((1 == main____CPAchecker_TMP_0 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (((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, 36 locations, 3 error locations. Result: SAFE, OverallTime: 16.3s, OverallIterations: 7, TraceHistogramMax: 2, AutomataDifference: 11.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 2.6s, HoareTripleCheckerStatistics: 188 SDtfs, 173 SDslu, 260 SDs, 0 SdLazy, 395 SolverSat, 22 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 6.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 82 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36occurred 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, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 22 NumberOfFragments, 570 HoareAnnotationTreeSize, 12 FomulaSimplifications, 497 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 158 FormulaSimplificationTreeSizeReductionInter, 2.5s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 141 NumberOfCodeBlocks, 141 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 133 ConstructedInterpolants, 0 QuantifiedInterpolants, 59496 SizeOfPredicates, 2 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 8 InterpolantComputations, 6 PerfectInterpolantSequences, 2/4 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...