/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/ldv-regression/test25-2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 21:10:47,403 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 21:10:47,405 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 21:10:47,417 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 21:10:47,418 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 21:10:47,419 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 21:10:47,420 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 21:10:47,422 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 21:10:47,426 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 21:10:47,427 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 21:10:47,431 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 21:10:47,432 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 21:10:47,432 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 21:10:47,435 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 21:10:47,437 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 21:10:47,438 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 21:10:47,439 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 21:10:47,440 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 21:10:47,444 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 21:10:47,446 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 21:10:47,448 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 21:10:47,451 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 21:10:47,454 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 21:10:47,455 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 21:10:47,459 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 21:10:47,459 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 21:10:47,459 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 21:10:47,461 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 21:10:47,462 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 21:10:47,464 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 21:10:47,465 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 21:10:47,467 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 21:10:47,468 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 21:10:47,468 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 21:10:47,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 21:10:47,472 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 21:10:47,472 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 21:10:47,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 21:10:47,473 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 21:10:47,474 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 21:10:47,474 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 21:10:47,475 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:10:47,507 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 21:10:47,507 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 21:10:47,512 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 21:10:47,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 21:10:47,513 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 21:10:47,513 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 21:10:47,513 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 21:10:47,514 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 21:10:47,514 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 21:10:47,514 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 21:10:47,514 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 21:10:47,514 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 21:10:47,514 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 21:10:47,515 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 21:10:47,517 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 21:10:47,517 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 21:10:47,517 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 21:10:47,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 21:10:47,518 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 21:10:47,518 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 21:10:47,518 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 21:10:47,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 21:10:47,518 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 21:10:47,519 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 21:10:47,519 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 21:10:47,519 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 21:10:47,519 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 21:10:47,519 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 21:10:47,519 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-11-06 21:10:47,806 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 21:10:47,818 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 21:10:47,822 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 21:10:47,824 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 21:10:47,824 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 21:10:47,825 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test25-2.c [2019-11-06 21:10:47,902 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42308ec5/69620937bf484002a1d8620193e9793a/FLAG67451b1c0 [2019-11-06 21:10:48,408 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 21:10:48,409 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test25-2.c [2019-11-06 21:10:48,415 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42308ec5/69620937bf484002a1d8620193e9793a/FLAG67451b1c0 [2019-11-06 21:10:48,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e42308ec5/69620937bf484002a1d8620193e9793a [2019-11-06 21:10:48,763 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 21:10:48,765 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 21:10:48,765 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 21:10:48,766 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 21:10:48,769 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 21:10:48,770 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:48" (1/1) ... [2019-11-06 21:10:48,773 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2ae34fa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:48, skipping insertion in model container [2019-11-06 21:10:48,773 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:10:48" (1/1) ... [2019-11-06 21:10:48,780 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 21:10:48,804 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 21:10:48,989 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:10:48,999 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 21:10:49,022 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 21:10:49,118 INFO L192 MainTranslator]: Completed translation [2019-11-06 21:10:49,119 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49 WrapperNode [2019-11-06 21:10:49,119 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 21:10:49,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 21:10:49,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 21:10:49,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 21:10:49,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (1/1) ... [2019-11-06 21:10:49,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (1/1) ... [2019-11-06 21:10:49,142 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (1/1) ... [2019-11-06 21:10:49,142 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (1/1) ... [2019-11-06 21:10:49,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (1/1) ... [2019-11-06 21:10:49,157 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (1/1) ... [2019-11-06 21:10:49,159 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (1/1) ... [2019-11-06 21:10:49,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 21:10:49,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 21:10:49,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 21:10:49,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 21:10:49,165 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (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:10:49,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 21:10:49,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 21:10:49,213 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-11-06 21:10:49,214 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 21:10:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 21:10:49,214 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 21:10:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-11-06 21:10:49,215 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 21:10:49,216 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 21:10:49,216 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 21:10:49,216 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-06 21:10:49,216 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 21:10:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 21:10:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 21:10:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 21:10:49,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 21:10:49,508 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 21:10:49,509 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-11-06 21:10:49,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:49 BoogieIcfgContainer [2019-11-06 21:10:49,510 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 21:10:49,511 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 21:10:49,512 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 21:10:49,515 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 21:10:49,515 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:10:48" (1/3) ... [2019-11-06 21:10:49,516 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22546d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:49, skipping insertion in model container [2019-11-06 21:10:49,516 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:10:49" (2/3) ... [2019-11-06 21:10:49,517 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22546d7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:10:49, skipping insertion in model container [2019-11-06 21:10:49,517 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:10:49" (3/3) ... [2019-11-06 21:10:49,518 INFO L109 eAbstractionObserver]: Analyzing ICFG test25-2.c [2019-11-06 21:10:49,528 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 21:10:49,538 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-06 21:10:49,558 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-06 21:10:49,587 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 21:10:49,587 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 21:10:49,587 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 21:10:49,588 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 21:10:49,588 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 21:10:49,588 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 21:10:49,588 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 21:10:49,588 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 21:10:49,604 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-11-06 21:10:49,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 21:10:49,610 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:49,611 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:49,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:49,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:49,617 INFO L82 PathProgramCache]: Analyzing trace with hash -899836778, now seen corresponding path program 1 times [2019-11-06 21:10:49,624 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:49,625 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839231040] [2019-11-06 21:10:49,625 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:49,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:49,817 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:10:49,817 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1839231040] [2019-11-06 21:10:49,818 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:10:49,818 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 21:10:49,819 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629462556] [2019-11-06 21:10:49,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 21:10:49,825 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:49,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 21:10:49,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 21:10:49,838 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 3 states. [2019-11-06 21:10:49,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:49,940 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-11-06 21:10:49,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 21:10:49,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 21:10:49,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:49,953 INFO L225 Difference]: With dead ends: 42 [2019-11-06 21:10:49,953 INFO L226 Difference]: Without dead ends: 20 [2019-11-06 21:10:49,957 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-11-06 21:10:49,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-11-06 21:10:49,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-11-06 21:10:49,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-11-06 21:10:49,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-11-06 21:10:49,992 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-11-06 21:10:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:49,993 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-11-06 21:10:49,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 21:10:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-11-06 21:10:49,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-11-06 21:10:49,994 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:49,994 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:49,995 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:49,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:49,995 INFO L82 PathProgramCache]: Analyzing trace with hash -1137678901, now seen corresponding path program 1 times [2019-11-06 21:10:49,996 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:49,996 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063119739] [2019-11-06 21:10:49,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:50,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,124 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:10:50,127 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063119739] [2019-11-06 21:10:50,127 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 21:10:50,128 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 21:10:50,128 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347701540] [2019-11-06 21:10:50,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 21:10:50,131 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:50,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 21:10:50,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 21:10:50,133 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-11-06 21:10:50,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:50,208 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-11-06 21:10:50,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 21:10:50,210 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-11-06 21:10:50,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:50,211 INFO L225 Difference]: With dead ends: 34 [2019-11-06 21:10:50,211 INFO L226 Difference]: Without dead ends: 22 [2019-11-06 21:10:50,212 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 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:10:50,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-11-06 21:10:50,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-11-06 21:10:50,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-06 21:10:50,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-11-06 21:10:50,220 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-11-06 21:10:50,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:50,220 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-11-06 21:10:50,220 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 21:10:50,220 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-11-06 21:10:50,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-11-06 21:10:50,221 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:50,222 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:10:50,222 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:50,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:50,223 INFO L82 PathProgramCache]: Analyzing trace with hash 278779309, now seen corresponding path program 1 times [2019-11-06 21:10:50,223 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:50,223 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [350342657] [2019-11-06 21:10:50,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:50,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:10:50,344 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [350342657] [2019-11-06 21:10:50,344 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [315605544] [2019-11-06 21:10:50,345 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:10:50,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjunts are in the unsatisfiable core [2019-11-06 21:10:50,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:50,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:10:50,491 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:50,491 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4] total 6 [2019-11-06 21:10:50,494 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947144144] [2019-11-06 21:10:50,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-11-06 21:10:50,497 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:50,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-11-06 21:10:50,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:10:50,505 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 6 states. [2019-11-06 21:10:50,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:50,609 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-11-06 21:10:50,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:10:50,610 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-11-06 21:10:50,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:50,612 INFO L225 Difference]: With dead ends: 36 [2019-11-06 21:10:50,612 INFO L226 Difference]: Without dead ends: 24 [2019-11-06 21:10:50,613 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-11-06 21:10:50,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-11-06 21:10:50,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-11-06 21:10:50,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-11-06 21:10:50,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-11-06 21:10:50,619 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-11-06 21:10:50,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:50,619 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-11-06 21:10:50,620 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-11-06 21:10:50,620 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-11-06 21:10:50,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-11-06 21:10:50,621 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:50,621 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:50,826 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:50,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:50,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:50,828 INFO L82 PathProgramCache]: Analyzing trace with hash -9513713, now seen corresponding path program 2 times [2019-11-06 21:10:50,828 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:50,829 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312985480] [2019-11-06 21:10:50,829 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:50,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:50,972 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 21:10:50,974 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312985480] [2019-11-06 21:10:50,974 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1014243535] [2019-11-06 21:10:50,974 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:51,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-11-06 21:10:51,037 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:10:51,038 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-06 21:10:51,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:51,144 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:10:51,155 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:51,156 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-11-06 21:10:51,157 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:51,164 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:51,167 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:51,168 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-06 21:10:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-11-06 21:10:51,184 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-06 21:10:51,184 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2019-11-06 21:10:51,185 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912724099] [2019-11-06 21:10:51,185 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 21:10:51,186 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:51,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 21:10:51,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-11-06 21:10:51,186 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 5 states. [2019-11-06 21:10:51,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:51,859 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2019-11-06 21:10:51,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-06 21:10:51,860 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-11-06 21:10:51,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:51,861 INFO L225 Difference]: With dead ends: 33 [2019-11-06 21:10:51,861 INFO L226 Difference]: Without dead ends: 25 [2019-11-06 21:10:51,862 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-11-06 21:10:51,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-11-06 21:10:51,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-11-06 21:10:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-11-06 21:10:51,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-11-06 21:10:51,867 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 22 [2019-11-06 21:10:51,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:51,868 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-11-06 21:10:51,868 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 21:10:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-11-06 21:10:51,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-11-06 21:10:51,869 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:51,869 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:52,070 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:52,070 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:52,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:52,071 INFO L82 PathProgramCache]: Analyzing trace with hash -413303094, now seen corresponding path program 1 times [2019-11-06 21:10:52,072 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:52,072 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272418770] [2019-11-06 21:10:52,072 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:52,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:52,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:52,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:52,176 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:10:52,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272418770] [2019-11-06 21:10:52,177 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [900186898] [2019-11-06 21:10:52,177 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:52,234 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-06 21:10:52,236 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:52,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:10:52,252 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:52,252 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2019-11-06 21:10:52,257 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [328413800] [2019-11-06 21:10:52,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-06 21:10:52,258 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:52,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-06 21:10:52,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:10:52,258 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2019-11-06 21:10:52,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:52,345 INFO L93 Difference]: Finished difference Result 42 states and 44 transitions. [2019-11-06 21:10:52,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 21:10:52,345 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2019-11-06 21:10:52,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:52,346 INFO L225 Difference]: With dead ends: 42 [2019-11-06 21:10:52,346 INFO L226 Difference]: Without dead ends: 28 [2019-11-06 21:10:52,348 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-06 21:10:52,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-11-06 21:10:52,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-11-06 21:10:52,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-11-06 21:10:52,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-11-06 21:10:52,358 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 24 [2019-11-06 21:10:52,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:52,358 INFO L462 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-11-06 21:10:52,359 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-06 21:10:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-11-06 21:10:52,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-11-06 21:10:52,360 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:52,360 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:52,561 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:52,561 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:52,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:52,562 INFO L82 PathProgramCache]: Analyzing trace with hash -50594516, now seen corresponding path program 2 times [2019-11-06 21:10:52,562 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:52,563 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150702565] [2019-11-06 21:10:52,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:52,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:52,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:52,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:10:52,643 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150702565] [2019-11-06 21:10:52,643 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013187357] [2019-11-06 21:10:52,643 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:52,700 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-06 21:10:52,700 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:10:52,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 5 conjunts are in the unsatisfiable core [2019-11-06 21:10:52,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:52,720 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:10:52,720 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:52,720 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2019-11-06 21:10:52,722 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582018166] [2019-11-06 21:10:52,723 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-11-06 21:10:52,723 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:52,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-11-06 21:10:52,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:10:52,724 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 8 states. [2019-11-06 21:10:52,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:52,809 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-11-06 21:10:52,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-11-06 21:10:52,810 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2019-11-06 21:10:52,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:52,811 INFO L225 Difference]: With dead ends: 44 [2019-11-06 21:10:52,812 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 21:10:52,812 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-11-06 21:10:52,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 21:10:52,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-11-06 21:10:52,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-11-06 21:10:52,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-11-06 21:10:52,823 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-11-06 21:10:52,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:52,824 INFO L462 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-11-06 21:10:52,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-11-06 21:10:52,824 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-11-06 21:10:52,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-11-06 21:10:52,826 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:52,826 INFO L410 BasicCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:53,030 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:53,030 INFO L410 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:53,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:53,031 INFO L82 PathProgramCache]: Analyzing trace with hash 619997966, now seen corresponding path program 3 times [2019-11-06 21:10:53,031 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:53,031 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220367742] [2019-11-06 21:10:53,031 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:53,119 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-06 21:10:53,119 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220367742] [2019-11-06 21:10:53,120 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831810910] [2019-11-06 21:10:53,120 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:53,173 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-11-06 21:10:53,174 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:10:53,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 14 conjunts are in the unsatisfiable core [2019-11-06 21:10:53,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:53,304 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:10:53,308 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:53,309 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-11-06 21:10:53,310 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:53,315 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:53,317 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:53,318 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-06 21:10:53,333 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-11-06 21:10:53,334 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:53,334 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2019-11-06 21:10:53,334 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547573179] [2019-11-06 21:10:53,335 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-11-06 21:10:53,335 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:53,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-11-06 21:10:53,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2019-11-06 21:10:53,336 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 12 states. [2019-11-06 21:10:55,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:10:55,180 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2019-11-06 21:10:55,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-11-06 21:10:55,180 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2019-11-06 21:10:55,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:10:55,181 INFO L225 Difference]: With dead ends: 48 [2019-11-06 21:10:55,181 INFO L226 Difference]: Without dead ends: 34 [2019-11-06 21:10:55,181 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2019-11-06 21:10:55,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-11-06 21:10:55,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2019-11-06 21:10:55,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-11-06 21:10:55,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2019-11-06 21:10:55,187 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2019-11-06 21:10:55,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:10:55,188 INFO L462 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2019-11-06 21:10:55,188 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-11-06 21:10:55,188 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2019-11-06 21:10:55,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-11-06 21:10:55,189 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:10:55,189 INFO L410 BasicCegarLoop]: trace histogram [5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:10:55,398 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:55,399 INFO L410 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:10:55,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:10:55,400 INFO L82 PathProgramCache]: Analyzing trace with hash 977288683, now seen corresponding path program 4 times [2019-11-06 21:10:55,400 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:10:55,400 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356723386] [2019-11-06 21:10:55,401 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:10:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:55,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:10:55,505 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-11-06 21:10:55,507 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356723386] [2019-11-06 21:10:55,508 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117871373] [2019-11-06 21:10:55,509 INFO L92 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:10:55,559 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-11-06 21:10:55,559 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:10:55,560 INFO L256 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 13 conjunts are in the unsatisfiable core [2019-11-06 21:10:55,564 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:10:59,791 INFO L172 IndexEqualityManager]: detected equality via solver [2019-11-06 21:10:59,792 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:59,793 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 12 [2019-11-06 21:10:59,793 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:10:59,803 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:10:59,806 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:10:59,807 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:38, output treesize:5 [2019-11-06 21:10:59,830 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-11-06 21:10:59,830 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:10:59,831 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2019-11-06 21:10:59,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848112727] [2019-11-06 21:10:59,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-11-06 21:10:59,832 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:10:59,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-11-06 21:10:59,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=139, Unknown=2, NotChecked=0, Total=182 [2019-11-06 21:10:59,832 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 14 states. [2019-11-06 21:11:06,024 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 33 [2019-11-06 21:11:10,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:10,297 INFO L93 Difference]: Finished difference Result 54 states and 57 transitions. [2019-11-06 21:11:10,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-11-06 21:11:10,297 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2019-11-06 21:11:10,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:10,298 INFO L225 Difference]: With dead ends: 54 [2019-11-06 21:11:10,298 INFO L226 Difference]: Without dead ends: 38 [2019-11-06 21:11:10,299 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=63, Invalid=239, Unknown=4, NotChecked=0, Total=306 [2019-11-06 21:11:10,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-06 21:11:10,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2019-11-06 21:11:10,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-11-06 21:11:10,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2019-11-06 21:11:10,313 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2019-11-06 21:11:10,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:10,313 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2019-11-06 21:11:10,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-11-06 21:11:10,314 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2019-11-06 21:11:10,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-11-06 21:11:10,314 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:11:10,316 INFO L410 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:11:10,517 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:10,517 INFO L410 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:11:10,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:11:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1797098632, now seen corresponding path program 5 times [2019-11-06 21:11:10,518 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:11:10,518 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364911271] [2019-11-06 21:11:10,518 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:11:10,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:10,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:10,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:10,641 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:11:10,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364911271] [2019-11-06 21:11:10,642 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234552832] [2019-11-06 21:11:10,642 INFO L92 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:11,690 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2019-11-06 21:11:11,691 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:11:11,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-06 21:11:11,696 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:11:11,725 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:11:11,726 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:11:11,726 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2019-11-06 21:11:11,726 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699894977] [2019-11-06 21:11:11,727 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-11-06 21:11:11,727 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:11:11,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-11-06 21:11:11,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:11:11,727 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand 11 states. [2019-11-06 21:11:11,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:11,815 INFO L93 Difference]: Finished difference Result 58 states and 60 transitions. [2019-11-06 21:11:11,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-11-06 21:11:11,816 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-11-06 21:11:11,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:11,817 INFO L225 Difference]: With dead ends: 58 [2019-11-06 21:11:11,817 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 21:11:11,817 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2019-11-06 21:11:11,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 21:11:11,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2019-11-06 21:11:11,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 21:11:11,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2019-11-06 21:11:11,823 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2019-11-06 21:11:11,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:11,823 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2019-11-06 21:11:11,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-11-06 21:11:11,824 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2019-11-06 21:11:11,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-11-06 21:11:11,825 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 21:11:11,825 INFO L410 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 21:11:12,025 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:12,026 INFO L410 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 21:11:12,026 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 21:11:12,027 INFO L82 PathProgramCache]: Analyzing trace with hash -820541462, now seen corresponding path program 6 times [2019-11-06 21:11:12,027 INFO L161 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-06 21:11:12,027 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549630791] [2019-11-06 21:11:12,027 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 21:11:12,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:12,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 21:11:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-11-06 21:11:12,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549630791] [2019-11-06 21:11:12,143 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24923467] [2019-11-06 21:11:12,143 INFO L92 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:12,307 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2019-11-06 21:11:12,307 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-06 21:11:12,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 37 conjunts are in the unsatisfiable core [2019-11-06 21:11:12,314 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 21:11:12,330 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-11-06 21:11:12,330 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,336 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:12,337 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,337 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-11-06 21:11:12,379 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2019-11-06 21:11:12,380 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,404 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:12,411 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2019-11-06 21:11:12,411 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,426 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 21:11:12,428 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 21:11:12,428 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:50, output treesize:28 [2019-11-06 21:11:14,600 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#cont~0.base_BEFORE_CALL_1| Int)) (not (= (select (select |c_#memory_$Pointer$.base| |v_main_~#cont~0.base_BEFORE_CALL_1|) 0) |v_main_~#cont~0.base_BEFORE_CALL_1|))) is different from true [2019-11-06 21:11:20,675 WARN L191 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 30 [2019-11-06 21:11:20,702 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 21:11:20,735 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2019-11-06 21:11:20,735 INFO L218 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-06 21:11:20,736 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2019-11-06 21:11:20,736 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1465110090] [2019-11-06 21:11:20,736 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-11-06 21:11:20,736 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-06 21:11:20,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-11-06 21:11:20,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=278, Unknown=1, NotChecked=34, Total=380 [2019-11-06 21:11:20,737 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 20 states. [2019-11-06 21:11:25,315 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 18 [2019-11-06 21:11:31,375 WARN L191 SmtUtils]: Spent 6.03 s on a formula simplification that was a NOOP. DAG size: 40 [2019-11-06 21:11:31,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 21:11:31,528 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2019-11-06 21:11:31,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-11-06 21:11:31,528 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2019-11-06 21:11:31,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 21:11:31,529 INFO L225 Difference]: With dead ends: 58 [2019-11-06 21:11:31,529 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 21:11:31,530 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 18.8s TimeCoverageRelationStatistics Valid=207, Invalid=985, Unknown=2, NotChecked=66, Total=1260 [2019-11-06 21:11:31,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 21:11:31,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 21:11:31,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 21:11:31,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 21:11:31,531 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2019-11-06 21:11:31,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 21:11:31,531 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 21:11:31,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-11-06 21:11:31,531 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 21:11:31,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 21:11:31,732 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 21:11:31,738 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 21:11:32,104 WARN L191 SmtUtils]: Spent 283.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 27 [2019-11-06 21:11:32,115 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:11:32,116 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#valid| |old(#valid)|) (= |#NULL.base| |old(#NULL.base)|) (= |#NULL.offset| |old(#NULL.offset)|)) [2019-11-06 21:11:32,116 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:11:32,116 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 21:11:32,116 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 21:11:32,116 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 21:11:32,116 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 21:11:32,116 INFO L439 ceAbstractionStarter]: At program point L37-4(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|)) (.cse1 (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4))) (let ((.cse2 (select (select |#memory_int| .cse0) .cse1))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (= main_~pa~0.offset .cse1) (<= main_~i~0 .cse2) (not (= .cse0 |main_~#cont~0.base|)) (<= .cse2 main_~i~0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))))) [2019-11-06 21:11:32,116 INFO L443 ceAbstractionStarter]: For program point L27-2(lines 27 30) no Hoare annotation was computed. [2019-11-06 21:11:32,116 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 20 50) no Hoare annotation was computed. [2019-11-06 21:11:32,116 INFO L439 ceAbstractionStarter]: At program point L27-3(lines 27 30) the Hoare annotation is: (and (= |main_~#cont~0.offset| 0) (not (= |main_~#array~0.base| |main_~#cont~0.base|))) [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point L27-4(lines 21 50) no Hoare annotation was computed. [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 48) no Hoare annotation was computed. [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 20 50) no Hoare annotation was computed. [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point L40(line 40) no Hoare annotation was computed. [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point L40-1(lines 40 42) no Hoare annotation was computed. [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point L32(lines 32 44) no Hoare annotation was computed. [2019-11-06 21:11:32,117 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 20 50) the Hoare annotation is: (= |#valid| |old(#valid)|) [2019-11-06 21:11:32,117 INFO L439 ceAbstractionStarter]: At program point L41(lines 21 50) the Hoare annotation is: false [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point L37-1(lines 37 39) no Hoare annotation was computed. [2019-11-06 21:11:32,117 INFO L443 ceAbstractionStarter]: For program point L35(lines 35 43) no Hoare annotation was computed. [2019-11-06 21:11:32,118 INFO L439 ceAbstractionStarter]: At program point L37-3(lines 37 39) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.base| |main_~#cont~0.base|) |main_~#cont~0.offset|))) (and (= main_~pa~0.base .cse0) (= |main_~#cont~0.offset| 0) (<= main_~i~0 (select (select |#memory_int| main_~pa~0.base) main_~pa~0.offset)) (= main_~pa~0.offset (+ (select (select |#memory_$Pointer$.offset| |main_~#cont~0.base|) |main_~#cont~0.offset|) 4)) (not (= .cse0 |main_~#cont~0.base|)) (not (= |main_~#array~0.base| |main_~#cont~0.base|)))) [2019-11-06 21:11:32,118 INFO L446 ceAbstractionStarter]: At program point checkENTRY(lines 15 18) the Hoare annotation is: true [2019-11-06 21:11:32,118 INFO L443 ceAbstractionStarter]: For program point checkFINAL(lines 15 18) no Hoare annotation was computed. [2019-11-06 21:11:32,118 INFO L443 ceAbstractionStarter]: For program point checkEXIT(lines 15 18) no Hoare annotation was computed. [2019-11-06 21:11:32,126 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 21:11:32,127 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,129 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:32,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,130 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,132 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 21:11:32,133 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,133 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:32,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,134 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,138 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 09:11:32 BoogieIcfgContainer [2019-11-06 21:11:32,138 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 21:11:32,140 INFO L168 Benchmark]: Toolchain (without parser) took 43375.29 ms. Allocated memory was 139.5 MB in the beginning and 266.3 MB in the end (delta: 126.9 MB). Free memory was 103.0 MB in the beginning and 138.8 MB in the end (delta: -35.7 MB). Peak memory consumption was 91.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:32,141 INFO L168 Benchmark]: CDTParser took 0.46 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 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:11:32,141 INFO L168 Benchmark]: CACSL2BoogieTranslator took 354.07 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 183.6 MB in the end (delta: -80.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:32,142 INFO L168 Benchmark]: Boogie Preprocessor took 42.26 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 180.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:32,143 INFO L168 Benchmark]: RCFGBuilder took 347.19 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 163.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:32,144 INFO L168 Benchmark]: TraceAbstraction took 42626.54 ms. Allocated memory was 203.4 MB in the beginning and 266.3 MB in the end (delta: 62.9 MB). Free memory was 163.1 MB in the beginning and 138.8 MB in the end (delta: 24.3 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. [2019-11-06 21:11:32,147 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.46 ms. Allocated memory is still 139.5 MB. Free memory was 121.4 MB in the beginning and 121.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 354.07 ms. Allocated memory was 139.5 MB in the beginning and 203.4 MB in the end (delta: 64.0 MB). Free memory was 102.8 MB in the beginning and 183.6 MB in the end (delta: -80.8 MB). Peak memory consumption was 24.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.26 ms. Allocated memory is still 203.4 MB. Free memory was 182.7 MB in the beginning and 180.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 347.19 ms. Allocated memory is still 203.4 MB. Free memory was 180.3 MB in the beginning and 163.7 MB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 42626.54 ms. Allocated memory was 203.4 MB in the beginning and 266.3 MB in the end (delta: 62.9 MB). Free memory was 163.1 MB in the beginning and 138.8 MB in the end (delta: 24.3 MB). Peak memory consumption was 87.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 48]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 37]: Loop Invariant [2019-11-06 21:11:32,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,157 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 21:11:32,158 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:32,158 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,159 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,159 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 21:11:32,160 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 21:11:32,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 21:11:32,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 21:11:32,160 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((pa == #memory_$Pointer$[cont][cont] && cont == 0) && i <= unknown-#memory_int-unknown[pa][pa]) && pa == #memory_$Pointer$[cont][cont] + 4) && !(#memory_$Pointer$[cont][cont] == cont)) && !(array == cont) - InvariantResult [Line: 27]: Loop Invariant Derived loop invariant: cont == 0 && !(array == cont) - InvariantResult [Line: 21]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 42.5s, OverallIterations: 10, TraceHistogramMax: 7, AutomataDifference: 24.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, HoareTripleCheckerStatistics: 164 SDtfs, 67 SDslu, 433 SDs, 0 SdLazy, 634 SolverSat, 38 SolverUnsat, 2 SolverUnknown, 0 SolverNotchecked, 5.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 340 GetRequests, 242 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 31.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=39occurred in iteration=9, 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, 10 MinimizatonAttempts, 7 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 19 PreInvPairs, 32 NumberOfFragments, 130 HoareAnnotationTreeSize, 19 FomulaSimplifications, 263 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 131 FormulaSimplificationTreeSizeReductionInter, 0.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 13.9s InterpolantComputationTime, 487 NumberOfCodeBlocks, 462 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 469 ConstructedInterpolants, 12 QuantifiedInterpolants, 51108 SizeOfPredicates, 53 NumberOfNonLiveVariables, 1018 ConjunctsInSsa, 93 ConjunctsInUnsatCore, 18 InterpolantComputations, 3 PerfectInterpolantSequences, 155/360 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...