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/test27-1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 10:19:08,184 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 10:19:08,186 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 10:19:08,200 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 10:19:08,200 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 10:19:08,201 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 10:19:08,203 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 10:19:08,205 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 10:19:08,208 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 10:19:08,209 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 10:19:08,210 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 10:19:08,212 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 10:19:08,212 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 10:19:08,213 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 10:19:08,215 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 10:19:08,216 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 10:19:08,217 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 10:19:08,219 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 10:19:08,221 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 10:19:08,224 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 10:19:08,226 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 10:19:08,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 10:19:08,229 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 10:19:08,231 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 10:19:08,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 10:19:08,234 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 10:19:08,234 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 10:19:08,236 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 10:19:08,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 10:19:08,238 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 10:19:08,238 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 10:19:08,239 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 10:19:08,240 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 10:19:08,241 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 10:19:08,243 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 10:19:08,243 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 10:19:08,244 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 10:19:08,244 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 10:19:08,244 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 10:19:08,245 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 10:19:08,246 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 10:19:08,247 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 10:19:08,264 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 10:19:08,264 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 10:19:08,268 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 10:19:08,268 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 10:19:08,268 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 10:19:08,269 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 10:19:08,269 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 10:19:08,269 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 10:19:08,269 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 10:19:08,270 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 10:19:08,270 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 10:19:08,270 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 10:19:08,270 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 10:19:08,270 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 10:19:08,271 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 10:19:08,271 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 10:19:08,271 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 10:19:08,272 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 10:19:08,273 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 10:19:08,273 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 10:19:08,273 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 10:19:08,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:19:08,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 10:19:08,274 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 10:19:08,274 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 10:19:08,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 10:19:08,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 10:19:08,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 10:19:08,276 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 10:19:08,334 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 10:19:08,348 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 10:19:08,353 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 10:19:08,354 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 10:19:08,355 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 10:19:08,356 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-regression/test27-1.c [2019-10-02 10:19:08,450 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e947082/0ed6359e2d144156b817f69a9d88662c/FLAGb5e44bae1 [2019-10-02 10:19:09,034 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 10:19:09,035 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-regression/test27-1.c [2019-10-02 10:19:09,043 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e947082/0ed6359e2d144156b817f69a9d88662c/FLAGb5e44bae1 [2019-10-02 10:19:09,384 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/67e947082/0ed6359e2d144156b817f69a9d88662c [2019-10-02 10:19:09,397 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 10:19:09,399 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 10:19:09,401 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 10:19:09,401 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 10:19:09,405 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 10:19:09,406 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,410 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b112849 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09, skipping insertion in model container [2019-10-02 10:19:09,411 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,420 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 10:19:09,443 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 10:19:09,666 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:19:09,680 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 10:19:09,709 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 10:19:09,828 INFO L192 MainTranslator]: Completed translation [2019-10-02 10:19:09,828 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09 WrapperNode [2019-10-02 10:19:09,829 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 10:19:09,829 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 10:19:09,830 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 10:19:09,830 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 10:19:09,842 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,843 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,854 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,867 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... [2019-10-02 10:19:09,881 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 10:19:09,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 10:19:09,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 10:19:09,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 10:19:09,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 10:19:09,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 10:19:09,948 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 10:19:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-10-02 10:19:09,949 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 10:19:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 10:19:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 10:19:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 10:19:09,949 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-10-02 10:19:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 10:19:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 10:19:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 10:19:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 10:19:09,950 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 10:19:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 10:19:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 10:19:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 10:19:09,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 10:19:10,404 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 10:19:10,405 INFO L283 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-02 10:19:10,408 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:19:10 BoogieIcfgContainer [2019-10-02 10:19:10,408 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 10:19:10,412 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 10:19:10,412 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 10:19:10,422 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 10:19:10,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 10:19:09" (1/3) ... [2019-10-02 10:19:10,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a2576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:19:10, skipping insertion in model container [2019-10-02 10:19:10,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 10:19:09" (2/3) ... [2019-10-02 10:19:10,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@571a2576 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 10:19:10, skipping insertion in model container [2019-10-02 10:19:10,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 10:19:10" (3/3) ... [2019-10-02 10:19:10,435 INFO L109 eAbstractionObserver]: Analyzing ICFG test27-1.c [2019-10-02 10:19:10,463 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 10:19:10,476 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 10:19:10,494 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 10:19:10,527 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 10:19:10,528 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 10:19:10,528 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 10:19:10,528 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 10:19:10,529 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 10:19:10,529 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 10:19:10,529 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 10:19:10,529 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 10:19:10,529 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 10:19:10,548 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-02 10:19:10,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-02 10:19:10,555 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:10,557 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:19:10,559 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:10,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:10,565 INFO L82 PathProgramCache]: Analyzing trace with hash 63236786, now seen corresponding path program 1 times [2019-10-02 10:19:10,567 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:10,567 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:10,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:10,621 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:10,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:10,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:10,779 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:19:10,782 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:19:10,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-02 10:19:10,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 10:19:10,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 10:19:10,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:19:10,808 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-02 10:19:10,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:10,830 INFO L93 Difference]: Finished difference Result 42 states and 52 transitions. [2019-10-02 10:19:10,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 10:19:10,832 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-02 10:19:10,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:10,844 INFO L225 Difference]: With dead ends: 42 [2019-10-02 10:19:10,844 INFO L226 Difference]: Without dead ends: 20 [2019-10-02 10:19:10,849 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 10:19:10,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-02 10:19:10,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-02 10:19:10,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-02 10:19:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-02 10:19:10,897 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2019-10-02 10:19:10,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:10,898 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-02 10:19:10,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 10:19:10,898 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-02 10:19:10,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-02 10:19:10,900 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:10,900 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:19:10,900 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:10,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:10,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1428873564, now seen corresponding path program 1 times [2019-10-02 10:19:10,901 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:10,902 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:10,905 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:10,905 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:10,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:11,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:19:11,025 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 10:19:11,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 10:19:11,028 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 10:19:11,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 10:19:11,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:19:11,029 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 3 states. [2019-10-02 10:19:11,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:11,066 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2019-10-02 10:19:11,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 10:19:11,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-10-02 10:19:11,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:11,069 INFO L225 Difference]: With dead ends: 34 [2019-10-02 10:19:11,070 INFO L226 Difference]: Without dead ends: 22 [2019-10-02 10:19:11,071 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 10:19:11,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-02 10:19:11,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2019-10-02 10:19:11,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-02 10:19:11,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2019-10-02 10:19:11,080 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 18 [2019-10-02 10:19:11,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:11,080 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2019-10-02 10:19:11,084 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 10:19:11,085 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2019-10-02 10:19:11,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-10-02 10:19:11,086 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:11,086 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:19:11,087 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:11,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:11,090 INFO L82 PathProgramCache]: Analyzing trace with hash -2015026266, now seen corresponding path program 1 times [2019-10-02 10:19:11,090 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:11,090 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:11,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:11,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:11,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:11,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:19:11,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:11,223 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:11,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:11,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 10:19:11,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:11,399 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (2)] Exception during sending of exit command (exit): Stream closed [2019-10-02 10:19:11,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:19:11,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-02 10:19:11,412 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 10:19:11,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 10:19:11,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:19:11,418 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2019-10-02 10:19:11,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:11,492 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2019-10-02 10:19:11,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 10:19:11,495 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-10-02 10:19:11,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:11,500 INFO L225 Difference]: With dead ends: 36 [2019-10-02 10:19:11,500 INFO L226 Difference]: Without dead ends: 24 [2019-10-02 10:19:11,501 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-02 10:19:11,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-02 10:19:11,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-10-02 10:19:11,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-02 10:19:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-02 10:19:11,515 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2019-10-02 10:19:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:11,516 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-02 10:19:11,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 10:19:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-02 10:19:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-10-02 10:19:11,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:11,519 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:19:11,520 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:11,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1627910184, now seen corresponding path program 2 times [2019-10-02 10:19:11,521 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:11,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:11,523 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:11,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:11,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:11,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:11,769 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 10:19:11,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:11,769 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:11,811 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:19:11,871 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-10-02 10:19:11,872 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:19:11,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 23 conjunts are in the unsatisfiable core [2019-10-02 10:19:11,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:11,986 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:11,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 27 [2019-10-02 10:19:11,988 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,012 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:12,013 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,013 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-10-02 10:19:12,086 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 27 [2019-10-02 10:19:12,088 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,150 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:12,192 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 34 [2019-10-02 10:19:12,193 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,246 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:12,249 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,250 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:256, output treesize:130 [2019-10-02 10:19:12,369 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:12,370 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 137 [2019-10-02 10:19:12,377 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,389 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,405 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,409 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,425 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,426 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,432 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,434 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:12,445 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:19:12,505 INFO L567 ElimStorePlain]: treesize reduction 76, result has 45.7 percent of original size [2019-10-02 10:19:12,516 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2019-10-02 10:19:12,518 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,533 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:12,534 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,535 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:219, output treesize:13 [2019-10-02 10:19:12,565 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 9 [2019-10-02 10:19:12,566 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,582 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:12,582 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:12,583 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-02 10:19:12,611 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 10:19:12,616 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 10:19:12,616 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [5] total 9 [2019-10-02 10:19:12,618 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-02 10:19:12,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-02 10:19:12,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-10-02 10:19:12,622 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 9 states. [2019-10-02 10:19:12,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:12,999 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2019-10-02 10:19:12,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 10:19:12,999 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2019-10-02 10:19:13,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:13,000 INFO L225 Difference]: With dead ends: 40 [2019-10-02 10:19:13,001 INFO L226 Difference]: Without dead ends: 28 [2019-10-02 10:19:13,002 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2019-10-02 10:19:13,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-02 10:19:13,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-10-02 10:19:13,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-10-02 10:19:13,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2019-10-02 10:19:13,009 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2019-10-02 10:19:13,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:13,009 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2019-10-02 10:19:13,010 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-02 10:19:13,010 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2019-10-02 10:19:13,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-10-02 10:19:13,011 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:13,011 INFO L411 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-10-02 10:19:13,011 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:13,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:13,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1609672059, now seen corresponding path program 1 times [2019-10-02 10:19:13,012 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:13,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:13,014 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:13,014 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:19:13,015 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:13,135 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:19:13,136 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:13,136 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:13,181 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:13,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:13,227 INFO L256 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2019-10-02 10:19:13,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:13,250 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:19:13,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:19:13,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-10-02 10:19:13,256 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 10:19:13,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 10:19:13,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:19:13,257 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2019-10-02 10:19:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:13,309 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-10-02 10:19:13,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 10:19:13,311 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2019-10-02 10:19:13,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:13,313 INFO L225 Difference]: With dead ends: 44 [2019-10-02 10:19:13,313 INFO L226 Difference]: Without dead ends: 30 [2019-10-02 10:19:13,316 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-10-02 10:19:13,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-02 10:19:13,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2019-10-02 10:19:13,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-10-02 10:19:13,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 30 transitions. [2019-10-02 10:19:13,323 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 30 transitions. Word has length 26 [2019-10-02 10:19:13,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:13,324 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 30 transitions. [2019-10-02 10:19:13,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 10:19:13,324 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2019-10-02 10:19:13,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-02 10:19:13,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:13,326 INFO L411 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-10-02 10:19:13,326 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:13,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:13,327 INFO L82 PathProgramCache]: Analyzing trace with hash -338543225, now seen corresponding path program 2 times [2019-10-02 10:19:13,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:13,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:13,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 10:19:13,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:13,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:13,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:19:13,420 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:13,421 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:13,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-02 10:19:13,543 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-02 10:19:13,543 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:19:13,545 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-02 10:19:13,547 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:13,559 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:19:13,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:19:13,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-02 10:19:13,567 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 10:19:13,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 10:19:13,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:19:13,568 INFO L87 Difference]: Start difference. First operand 29 states and 30 transitions. Second operand 8 states. [2019-10-02 10:19:13,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:13,634 INFO L93 Difference]: Finished difference Result 46 states and 48 transitions. [2019-10-02 10:19:13,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 10:19:13,635 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 28 [2019-10-02 10:19:13,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:13,638 INFO L225 Difference]: With dead ends: 46 [2019-10-02 10:19:13,638 INFO L226 Difference]: Without dead ends: 32 [2019-10-02 10:19:13,639 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-02 10:19:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-10-02 10:19:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2019-10-02 10:19:13,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-10-02 10:19:13,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2019-10-02 10:19:13,653 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 28 [2019-10-02 10:19:13,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:13,654 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2019-10-02 10:19:13,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 10:19:13,654 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2019-10-02 10:19:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-02 10:19:13,655 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:13,655 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:19:13,656 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:13,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:13,656 INFO L82 PathProgramCache]: Analyzing trace with hash 1445554185, now seen corresponding path program 3 times [2019-10-02 10:19:13,656 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:13,657 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:13,659 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:19:13,659 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:13,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:13,832 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-02 10:19:13,833 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:13,833 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:13,868 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-02 10:19:13,943 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2019-10-02 10:19:13,943 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:19:13,945 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-02 10:19:13,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:13,971 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:13,971 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 23 treesize of output 27 [2019-10-02 10:19:13,972 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:13,993 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:13,993 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:13,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:23, output treesize:16 [2019-10-02 10:19:14,079 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 69 treesize of output 27 [2019-10-02 10:19:14,080 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:14,134 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:14,165 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 34 [2019-10-02 10:19:14,166 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:14,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:14,225 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:14,225 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:256, output treesize:130 [2019-10-02 10:19:14,340 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:14,341 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 216 treesize of output 137 [2019-10-02 10:19:14,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,351 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,356 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,357 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,363 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,365 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,366 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,369 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,371 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:14,375 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:19:14,432 INFO L567 ElimStorePlain]: treesize reduction 76, result has 45.7 percent of original size [2019-10-02 10:19:14,437 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 27 [2019-10-02 10:19:14,438 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:14,449 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:14,450 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:14,451 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:219, output treesize:13 [2019-10-02 10:19:14,499 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 17 treesize of output 9 [2019-10-02 10:19:14,499 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:14,503 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:14,504 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-02 10:19:14,504 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:20, output treesize:9 [2019-10-02 10:19:14,526 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-02 10:19:14,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 10:19:14,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-10-02 10:19:14,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-02 10:19:14,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-02 10:19:14,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2019-10-02 10:19:14,535 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand 13 states. [2019-10-02 10:19:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 10:19:15,114 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2019-10-02 10:19:15,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-02 10:19:15,116 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2019-10-02 10:19:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 10:19:15,117 INFO L225 Difference]: With dead ends: 50 [2019-10-02 10:19:15,117 INFO L226 Difference]: Without dead ends: 36 [2019-10-02 10:19:15,120 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=122, Invalid=430, Unknown=0, NotChecked=0, Total=552 [2019-10-02 10:19:15,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-10-02 10:19:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2019-10-02 10:19:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-10-02 10:19:15,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2019-10-02 10:19:15,138 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2019-10-02 10:19:15,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 10:19:15,138 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2019-10-02 10:19:15,138 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-02 10:19:15,139 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2019-10-02 10:19:15,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 10:19:15,140 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 10:19:15,140 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 10:19:15,143 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 10:19:15,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 10:19:15,144 INFO L82 PathProgramCache]: Analyzing trace with hash -695813082, now seen corresponding path program 4 times [2019-10-02 10:19:15,144 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 10:19:15,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 10:19:15,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:15,146 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-02 10:19:15,146 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 10:19:15,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 10:19:15,313 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-10-02 10:19:15,313 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 10:19:15,313 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:15,348 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-02 10:19:15,386 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-02 10:19:15,387 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-02 10:19:15,388 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2019-10-02 10:19:15,392 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 10:19:15,545 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 38 [2019-10-02 10:19:15,546 INFO L341 Elim1Store]: treesize reduction 28, result has 77.2 percent of original size [2019-10-02 10:19:15,546 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 69 treesize of output 102 [2019-10-02 10:19:15,547 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:15,728 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-10-02 10:19:15,729 INFO L567 ElimStorePlain]: treesize reduction 42, result has 84.6 percent of original size [2019-10-02 10:19:15,870 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2019-10-02 10:19:15,871 INFO L341 Elim1Store]: treesize reduction 28, result has 78.8 percent of original size [2019-10-02 10:19:15,871 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 91 treesize of output 113 [2019-10-02 10:19:15,872 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-02 10:19:16,037 WARN L191 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 63 [2019-10-02 10:19:16,038 INFO L567 ElimStorePlain]: treesize reduction 46, result has 81.7 percent of original size [2019-10-02 10:19:16,039 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:19:16,042 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,043 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,047 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,049 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-02 10:19:16,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,054 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,057 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,060 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,062 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,065 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,069 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,071 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,074 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,076 INFO L496 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2019-10-02 10:19:16,077 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:241, output treesize:1017 [2019-10-02 10:19:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,078 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,081 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,566 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 142 DAG size of output: 32 [2019-10-02 10:19:16,622 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:16,622 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 125 [2019-10-02 10:19:16,624 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,625 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,626 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,627 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,628 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,629 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,631 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,632 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,633 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,634 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,635 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,637 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-02 10:19:16,638 INFO L496 ElimStorePlain]: Start of recursive call 2: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-10-02 10:19:16,719 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-02 10:19:16,920 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 10:19:16,922 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: expected NNF at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive$TermWalker.walk(NonRecursive.java:139) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:195) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder.(ArrayOccurrenceAnalysis.java:181) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis.(ArrayOccurrenceAnalysis.java:74) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:275) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimOneRec(ElimStorePlain.java:253) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.eliminateOne(ElimStorePlain.java:553) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.doElimAllRec(ElimStorePlain.java:466) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.ElimStorePlain.startRecursiveElimination(ElimStorePlain.java:216) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.elim(PartialQuantifierElimination.java:306) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.PartialQuantifierElimination.tryToEliminate(PartialQuantifierElimination.java:102) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:245) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:227) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:189) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:166) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:233) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:465) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-10-02 10:19:16,930 INFO L168 Benchmark]: Toolchain (without parser) took 7530.51 ms. Allocated memory was 133.7 MB in the beginning and 307.2 MB in the end (delta: 173.5 MB). Free memory was 88.3 MB in the beginning and 272.9 MB in the end (delta: -184.5 MB). Peak memory consumption was 133.0 MB. Max. memory is 7.1 GB. [2019-10-02 10:19:16,930 INFO L168 Benchmark]: CDTParser took 0.30 ms. Allocated memory is still 133.7 MB. Free memory is still 106.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-10-02 10:19:16,931 INFO L168 Benchmark]: CACSL2BoogieTranslator took 428.47 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 176.2 MB in the end (delta: -87.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-10-02 10:19:16,932 INFO L168 Benchmark]: Boogie Preprocessor took 51.79 ms. Allocated memory is still 200.3 MB. Free memory was 176.2 MB in the beginning and 174.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-10-02 10:19:16,933 INFO L168 Benchmark]: RCFGBuilder took 526.96 ms. Allocated memory is still 200.3 MB. Free memory was 174.4 MB in the beginning and 155.0 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-10-02 10:19:16,933 INFO L168 Benchmark]: TraceAbstraction took 6515.61 ms. Allocated memory was 200.3 MB in the beginning and 307.2 MB in the end (delta: 107.0 MB). Free memory was 154.2 MB in the beginning and 272.9 MB in the end (delta: -118.7 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. [2019-10-02 10:19:16,938 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.30 ms. Allocated memory is still 133.7 MB. Free memory is still 106.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 428.47 ms. Allocated memory was 133.7 MB in the beginning and 200.3 MB in the end (delta: 66.6 MB). Free memory was 88.3 MB in the beginning and 176.2 MB in the end (delta: -87.9 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 51.79 ms. Allocated memory is still 200.3 MB. Free memory was 176.2 MB in the beginning and 174.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 526.96 ms. Allocated memory is still 200.3 MB. Free memory was 174.4 MB in the beginning and 155.0 MB in the end (delta: 19.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6515.61 ms. Allocated memory was 200.3 MB in the beginning and 307.2 MB in the end (delta: 107.0 MB). Free memory was 154.2 MB in the beginning and 272.9 MB in the end (delta: -118.7 MB). Peak memory consumption was 132.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: expected NNF de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: expected NNF: de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.arrays.ArrayOccurrenceAnalysis$ArrOccFinder$MyWalker.walk(ArrayOccurrenceAnalysis.java:236) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...