/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.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/array-lopstr16/flag_loopdep.i -------------------------------------------------------------------------------- This is Ultimate 0.2.0-7d8eed3 [2020-11-06 22:43:51,440 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-06 22:43:51,443 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-06 22:43:51,502 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-06 22:43:51,503 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-06 22:43:51,507 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-06 22:43:51,510 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-06 22:43:51,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-06 22:43:51,522 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-06 22:43:51,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-06 22:43:51,530 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-06 22:43:51,531 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-06 22:43:51,531 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-06 22:43:51,535 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-06 22:43:51,537 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-06 22:43:51,540 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-06 22:43:51,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-06 22:43:51,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-06 22:43:51,567 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-06 22:43:51,575 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-06 22:43:51,578 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-06 22:43:51,580 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-06 22:43:51,581 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-06 22:43:51,584 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-06 22:43:51,593 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-06 22:43:51,593 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-06 22:43:51,594 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-06 22:43:51,596 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-06 22:43:51,597 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-06 22:43:51,598 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-06 22:43:51,599 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-06 22:43:51,600 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-06 22:43:51,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-06 22:43:51,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-06 22:43:51,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-06 22:43:51,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-06 22:43:51,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-06 22:43:51,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-06 22:43:51,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-06 22:43:51,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-06 22:43:51,608 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-06 22:43:51,609 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 [2020-11-06 22:43:51,666 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-06 22:43:51,667 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-06 22:43:51,668 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-06 22:43:51,669 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-06 22:43:51,669 INFO L138 SettingsManager]: * Use SBE=true [2020-11-06 22:43:51,669 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-06 22:43:51,670 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-06 22:43:51,670 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-06 22:43:51,670 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-06 22:43:51,670 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-06 22:43:51,670 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-06 22:43:51,671 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-06 22:43:51,671 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-06 22:43:51,671 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-06 22:43:51,671 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-06 22:43:51,672 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-06 22:43:51,672 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-06 22:43:51,672 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-06 22:43:51,672 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-06 22:43:51,672 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-06 22:43:51,673 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-06 22:43:51,673 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-06 22:43:51,673 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-06 22:43:51,673 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-06 22:43:51,674 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-06 22:43:51,674 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-06 22:43:51,674 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-06 22:43:51,674 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-06 22:43:51,674 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-06 22:43:51,675 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release [2020-11-06 22:43:52,100 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-06 22:43:52,146 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-06 22:43:52,150 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-06 22:43:52,151 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-06 22:43:52,154 INFO L275 PluginConnector]: CDTParser initialized [2020-11-06 22:43:52,155 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-11-06 22:43:52,255 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2522b37/10de4e959fae4dbb867f2946f514e082/FLAG9e7266fe8 [2020-11-06 22:43:52,994 INFO L306 CDTParser]: Found 1 translation units. [2020-11-06 22:43:52,995 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-lopstr16/flag_loopdep.i [2020-11-06 22:43:53,003 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2522b37/10de4e959fae4dbb867f2946f514e082/FLAG9e7266fe8 [2020-11-06 22:43:53,363 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6f2522b37/10de4e959fae4dbb867f2946f514e082 [2020-11-06 22:43:53,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-06 22:43:53,373 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-11-06 22:43:53,375 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-06 22:43:53,376 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-06 22:43:53,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-06 22:43:53,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,385 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6930cad6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53, skipping insertion in model container [2020-11-06 22:43:53,385 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-06 22:43:53,421 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-06 22:43:53,611 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:43:53,620 INFO L203 MainTranslator]: Completed pre-run [2020-11-06 22:43:53,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-06 22:43:53,660 INFO L208 MainTranslator]: Completed translation [2020-11-06 22:43:53,661 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53 WrapperNode [2020-11-06 22:43:53,661 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-06 22:43:53,663 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-06 22:43:53,663 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-06 22:43:53,663 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-06 22:43:53,676 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,685 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,685 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,700 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,701 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (1/1) ... [2020-11-06 22:43:53,704 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-06 22:43:53,705 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-06 22:43:53,705 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-06 22:43:53,705 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-06 22:43:53,706 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (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 [2020-11-06 22:43:53,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-11-06 22:43:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-06 22:43:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2020-11-06 22:43:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-11-06 22:43:53,787 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2020-11-06 22:43:53,788 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-11-06 22:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-11-06 22:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2020-11-06 22:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2020-11-06 22:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2020-11-06 22:43:53,788 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2020-11-06 22:43:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-06 22:43:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-11-06 22:43:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2020-11-06 22:43:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure nondet_pointer [2020-11-06 22:43:53,789 INFO L130 BoogieDeclarations]: Found specification of procedure init [2020-11-06 22:43:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-11-06 22:43:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-11-06 22:43:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-11-06 22:43:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-11-06 22:43:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-11-06 22:43:53,790 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-11-06 22:43:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-06 22:43:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-06 22:43:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-11-06 22:43:53,791 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-11-06 22:43:54,217 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-06 22:43:54,217 INFO L298 CfgBuilder]: Removed 3 assume(true) statements. [2020-11-06 22:43:54,219 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:54 BoogieIcfgContainer [2020-11-06 22:43:54,219 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-06 22:43:54,221 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-06 22:43:54,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-06 22:43:54,225 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-06 22:43:54,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:43:53" (1/3) ... [2020-11-06 22:43:54,227 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e545fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:54, skipping insertion in model container [2020-11-06 22:43:54,227 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:43:53" (2/3) ... [2020-11-06 22:43:54,228 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51e545fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:43:54, skipping insertion in model container [2020-11-06 22:43:54,228 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:43:54" (3/3) ... [2020-11-06 22:43:54,230 INFO L111 eAbstractionObserver]: Analyzing ICFG flag_loopdep.i [2020-11-06 22:43:54,249 INFO L179 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-06 22:43:54,254 INFO L191 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-11-06 22:43:54,269 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-11-06 22:43:54,300 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-06 22:43:54,300 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-06 22:43:54,301 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-06 22:43:54,301 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-06 22:43:54,301 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-06 22:43:54,301 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-06 22:43:54,301 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-06 22:43:54,302 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-06 22:43:54,323 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2020-11-06 22:43:54,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:43:54,330 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:54,331 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:54,332 INFO L429 AbstractCegarLoop]: === Iteration 1 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:54,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1917384497, now seen corresponding path program 1 times [2020-11-06 22:43:54,349 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:54,350 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862836988] [2020-11-06 22:43:54,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:54,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:54,633 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:54,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:54,725 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:54,738 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:54,739 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862836988] [2020-11-06 22:43:54,741 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:43:54,741 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-06 22:43:54,742 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520288700] [2020-11-06 22:43:54,747 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:43:54,748 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:54,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:43:54,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-06 22:43:54,766 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 4 states. [2020-11-06 22:43:55,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:55,007 INFO L93 Difference]: Finished difference Result 66 states and 86 transitions. [2020-11-06 22:43:55,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:43:55,009 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2020-11-06 22:43:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:55,019 INFO L225 Difference]: With dead ends: 66 [2020-11-06 22:43:55,019 INFO L226 Difference]: Without dead ends: 33 [2020-11-06 22:43:55,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:43:55,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-06 22:43:55,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2020-11-06 22:43:55,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2020-11-06 22:43:55,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2020-11-06 22:43:55,068 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 22 [2020-11-06 22:43:55,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:55,069 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2020-11-06 22:43:55,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:43:55,069 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2020-11-06 22:43:55,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2020-11-06 22:43:55,070 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:55,071 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:55,071 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-06 22:43:55,072 INFO L429 AbstractCegarLoop]: === Iteration 2 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:55,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:55,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1115967253, now seen corresponding path program 1 times [2020-11-06 22:43:55,073 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:55,073 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398175954] [2020-11-06 22:43:55,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,187 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,234 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:55,244 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398175954] [2020-11-06 22:43:55,244 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-06 22:43:55,244 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-06 22:43:55,244 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693056030] [2020-11-06 22:43:55,246 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-06 22:43:55,246 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:55,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-06 22:43:55,248 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-06 22:43:55,248 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand 5 states. [2020-11-06 22:43:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:55,532 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2020-11-06 22:43:55,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:43:55,534 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2020-11-06 22:43:55,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:55,536 INFO L225 Difference]: With dead ends: 55 [2020-11-06 22:43:55,537 INFO L226 Difference]: Without dead ends: 41 [2020-11-06 22:43:55,538 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-11-06 22:43:55,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2020-11-06 22:43:55,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 31. [2020-11-06 22:43:55,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-06 22:43:55,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2020-11-06 22:43:55,552 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 22 [2020-11-06 22:43:55,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:55,553 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2020-11-06 22:43:55,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-06 22:43:55,553 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2020-11-06 22:43:55,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:43:55,554 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:55,555 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:55,555 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-06 22:43:55,555 INFO L429 AbstractCegarLoop]: === Iteration 3 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:55,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:55,556 INFO L82 PathProgramCache]: Analyzing trace with hash 1542699897, now seen corresponding path program 1 times [2020-11-06 22:43:55,556 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:55,556 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491715803] [2020-11-06 22:43:55,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:55,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,687 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:55,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,782 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:55,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,805 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:55,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491715803] [2020-11-06 22:43:55,806 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [679924590] [2020-11-06 22:43:55,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:55,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:55,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 2 conjunts are in the unsatisfiable core [2020-11-06 22:43:55,937 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:56,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:56,014 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:43:56,014 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2020-11-06 22:43:56,014 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336577288] [2020-11-06 22:43:56,015 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-06 22:43:56,015 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:56,016 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-06 22:43:56,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:43:56,016 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2020-11-06 22:43:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:56,039 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2020-11-06 22:43:56,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-06 22:43:56,040 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 25 [2020-11-06 22:43:56,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:56,042 INFO L225 Difference]: With dead ends: 51 [2020-11-06 22:43:56,042 INFO L226 Difference]: Without dead ends: 31 [2020-11-06 22:43:56,043 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-11-06 22:43:56,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2020-11-06 22:43:56,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2020-11-06 22:43:56,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2020-11-06 22:43:56,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 34 transitions. [2020-11-06 22:43:56,052 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 34 transitions. Word has length 25 [2020-11-06 22:43:56,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:56,052 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 34 transitions. [2020-11-06 22:43:56,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-06 22:43:56,052 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 34 transitions. [2020-11-06 22:43:56,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2020-11-06 22:43:56,053 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:56,053 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:56,266 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-11-06 22:43:56,267 INFO L429 AbstractCegarLoop]: === Iteration 4 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:56,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:56,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1800865335, now seen corresponding path program 1 times [2020-11-06 22:43:56,267 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:56,268 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45239319] [2020-11-06 22:43:56,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:56,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:56,393 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:56,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:56,449 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:56,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:56,464 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-06 22:43:56,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45239319] [2020-11-06 22:43:56,465 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355491328] [2020-11-06 22:43:56,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-11-06 22:43:56,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:56,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-06 22:43:56,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:56,625 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:43:56,625 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2020-11-06 22:43:56,626 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2020-11-06 22:43:56,626 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236020519] [2020-11-06 22:43:56,626 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-06 22:43:56,627 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:56,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-06 22:43:56,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:43:56,628 INFO L87 Difference]: Start difference. First operand 31 states and 34 transitions. Second operand 4 states. [2020-11-06 22:43:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:56,681 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2020-11-06 22:43:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-06 22:43:56,682 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2020-11-06 22:43:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:56,683 INFO L225 Difference]: With dead ends: 54 [2020-11-06 22:43:56,683 INFO L226 Difference]: Without dead ends: 33 [2020-11-06 22:43:56,684 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:43:56,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2020-11-06 22:43:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2020-11-06 22:43:56,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2020-11-06 22:43:56,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 35 transitions. [2020-11-06 22:43:56,692 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 35 transitions. Word has length 25 [2020-11-06 22:43:56,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:56,693 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 35 transitions. [2020-11-06 22:43:56,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-06 22:43:56,693 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2020-11-06 22:43:56,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2020-11-06 22:43:56,694 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:56,694 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:56,908 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:56,909 INFO L429 AbstractCegarLoop]: === Iteration 5 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:56,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:56,910 INFO L82 PathProgramCache]: Analyzing trace with hash 1385738581, now seen corresponding path program 1 times [2020-11-06 22:43:56,910 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:56,911 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1395194857] [2020-11-06 22:43:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:56,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,034 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:57,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,043 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:43:57,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1395194857] [2020-11-06 22:43:57,044 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220742431] [2020-11-06 22:43:57,044 INFO L95 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 [2020-11-06 22:43:57,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 5 conjunts are in the unsatisfiable core [2020-11-06 22:43:57,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:57,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-11-06 22:43:57,232 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:57,232 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 9 [2020-11-06 22:43:57,233 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260126674] [2020-11-06 22:43:57,233 INFO L461 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-11-06 22:43:57,234 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:57,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-11-06 22:43:57,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:43:57,235 INFO L87 Difference]: Start difference. First operand 32 states and 35 transitions. Second operand 9 states. [2020-11-06 22:43:57,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:57,636 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-11-06 22:43:57,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:43:57,637 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 27 [2020-11-06 22:43:57,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:57,638 INFO L225 Difference]: With dead ends: 71 [2020-11-06 22:43:57,638 INFO L226 Difference]: Without dead ends: 50 [2020-11-06 22:43:57,639 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:43:57,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-11-06 22:43:57,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 37. [2020-11-06 22:43:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2020-11-06 22:43:57,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2020-11-06 22:43:57,649 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 27 [2020-11-06 22:43:57,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:57,650 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2020-11-06 22:43:57,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-11-06 22:43:57,650 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2020-11-06 22:43:57,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2020-11-06 22:43:57,651 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:57,651 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:57,865 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:57,866 INFO L429 AbstractCegarLoop]: === Iteration 6 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:57,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:57,867 INFO L82 PathProgramCache]: Analyzing trace with hash 414127001, now seen corresponding path program 2 times [2020-11-06 22:43:57,868 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:57,868 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264976059] [2020-11-06 22:43:57,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:57,986 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,024 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:43:58,024 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264976059] [2020-11-06 22:43:58,025 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056886489] [2020-11-06 22:43:58,025 INFO L93 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 [2020-11-06 22:43:58,100 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-11-06 22:43:58,100 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:58,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 4 conjunts are in the unsatisfiable core [2020-11-06 22:43:58,105 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:58,136 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:43:58,136 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:58,137 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5] total 8 [2020-11-06 22:43:58,137 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053217090] [2020-11-06 22:43:58,137 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2020-11-06 22:43:58,139 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:58,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2020-11-06 22:43:58,140 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2020-11-06 22:43:58,140 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 8 states. [2020-11-06 22:43:58,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:58,337 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2020-11-06 22:43:58,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-06 22:43:58,338 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2020-11-06 22:43:58,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:58,340 INFO L225 Difference]: With dead ends: 71 [2020-11-06 22:43:58,340 INFO L226 Difference]: Without dead ends: 57 [2020-11-06 22:43:58,340 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-11-06 22:43:58,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2020-11-06 22:43:58,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 40. [2020-11-06 22:43:58,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2020-11-06 22:43:58,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 43 transitions. [2020-11-06 22:43:58,349 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 43 transitions. Word has length 32 [2020-11-06 22:43:58,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:58,349 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 43 transitions. [2020-11-06 22:43:58,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2020-11-06 22:43:58,349 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 43 transitions. [2020-11-06 22:43:58,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2020-11-06 22:43:58,350 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:58,351 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:58,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:43:58,566 INFO L429 AbstractCegarLoop]: === Iteration 7 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:58,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:58,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1178714931, now seen corresponding path program 3 times [2020-11-06 22:43:58,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:58,568 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088629126] [2020-11-06 22:43:58,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:58,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,659 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,683 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:58,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-11-06 22:43:58,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088629126] [2020-11-06 22:43:58,692 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [902211791] [2020-11-06 22:43:58,693 INFO L93 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 [2020-11-06 22:43:58,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2020-11-06 22:43:58,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:58,776 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 6 conjunts are in the unsatisfiable core [2020-11-06 22:43:58,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:58,884 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-11-06 22:43:58,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:58,885 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6] total 12 [2020-11-06 22:43:58,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041022939] [2020-11-06 22:43:58,885 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2020-11-06 22:43:58,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:58,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2020-11-06 22:43:58,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:43:58,887 INFO L87 Difference]: Start difference. First operand 40 states and 43 transitions. Second operand 12 states. [2020-11-06 22:43:59,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:43:59,203 INFO L93 Difference]: Finished difference Result 95 states and 110 transitions. [2020-11-06 22:43:59,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-11-06 22:43:59,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 35 [2020-11-06 22:43:59,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:43:59,207 INFO L225 Difference]: With dead ends: 95 [2020-11-06 22:43:59,207 INFO L226 Difference]: Without dead ends: 68 [2020-11-06 22:43:59,208 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2020-11-06 22:43:59,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2020-11-06 22:43:59,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 45. [2020-11-06 22:43:59,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2020-11-06 22:43:59,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 48 transitions. [2020-11-06 22:43:59,221 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 48 transitions. Word has length 35 [2020-11-06 22:43:59,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:43:59,221 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 48 transitions. [2020-11-06 22:43:59,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2020-11-06 22:43:59,221 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 48 transitions. [2020-11-06 22:43:59,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-11-06 22:43:59,222 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:43:59,223 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:43:59,435 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2020-11-06 22:43:59,436 INFO L429 AbstractCegarLoop]: === Iteration 8 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:43:59,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:43:59,438 INFO L82 PathProgramCache]: Analyzing trace with hash -280196357, now seen corresponding path program 4 times [2020-11-06 22:43:59,438 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:43:59,438 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564706249] [2020-11-06 22:43:59,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:43:59,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:59,589 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:43:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:59,612 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:43:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:43:59,624 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2020-11-06 22:43:59,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1564706249] [2020-11-06 22:43:59,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240442365] [2020-11-06 22:43:59,625 INFO L93 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 [2020-11-06 22:43:59,707 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2020-11-06 22:43:59,707 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:43:59,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:43:59,711 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:43:59,832 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2020-11-06 22:43:59,832 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:43:59,832 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7] total 14 [2020-11-06 22:43:59,833 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337418110] [2020-11-06 22:43:59,833 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2020-11-06 22:43:59,833 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:43:59,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2020-11-06 22:43:59,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2020-11-06 22:43:59,835 INFO L87 Difference]: Start difference. First operand 45 states and 48 transitions. Second operand 14 states. [2020-11-06 22:44:00,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:44:00,236 INFO L93 Difference]: Finished difference Result 108 states and 125 transitions. [2020-11-06 22:44:00,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2020-11-06 22:44:00,237 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 40 [2020-11-06 22:44:00,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:44:00,239 INFO L225 Difference]: With dead ends: 108 [2020-11-06 22:44:00,239 INFO L226 Difference]: Without dead ends: 78 [2020-11-06 22:44:00,240 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=214, Unknown=0, NotChecked=0, Total=272 [2020-11-06 22:44:00,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2020-11-06 22:44:00,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 50. [2020-11-06 22:44:00,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-11-06 22:44:00,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2020-11-06 22:44:00,249 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 40 [2020-11-06 22:44:00,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:44:00,249 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2020-11-06 22:44:00,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2020-11-06 22:44:00,250 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2020-11-06 22:44:00,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2020-11-06 22:44:00,251 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:44:00,251 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:44:00,464 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:44:00,465 INFO L429 AbstractCegarLoop]: === Iteration 9 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:44:00,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:44:00,466 INFO L82 PathProgramCache]: Analyzing trace with hash 655218735, now seen corresponding path program 5 times [2020-11-06 22:44:00,466 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:44:00,467 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451470686] [2020-11-06 22:44:00,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:44:00,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:44:00,577 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:44:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:44:00,602 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:44:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:44:00,614 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:44:00,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451470686] [2020-11-06 22:44:00,615 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [783060752] [2020-11-06 22:44:00,615 INFO L93 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 [2020-11-06 22:44:00,735 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2020-11-06 22:44:00,735 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:44:00,737 INFO L263 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 7 conjunts are in the unsatisfiable core [2020-11-06 22:44:00,740 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:44:00,781 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:44:00,782 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:44:00,782 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 11 [2020-11-06 22:44:00,782 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378443904] [2020-11-06 22:44:00,786 INFO L461 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-11-06 22:44:00,786 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:44:00,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-11-06 22:44:00,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2020-11-06 22:44:00,787 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 11 states. [2020-11-06 22:44:01,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:44:01,074 INFO L93 Difference]: Finished difference Result 99 states and 116 transitions. [2020-11-06 22:44:01,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-06 22:44:01,074 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 45 [2020-11-06 22:44:01,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:44:01,076 INFO L225 Difference]: With dead ends: 99 [2020-11-06 22:44:01,076 INFO L226 Difference]: Without dead ends: 85 [2020-11-06 22:44:01,078 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2020-11-06 22:44:01,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2020-11-06 22:44:01,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 53. [2020-11-06 22:44:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2020-11-06 22:44:01,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2020-11-06 22:44:01,089 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 45 [2020-11-06 22:44:01,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:44:01,089 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2020-11-06 22:44:01,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-11-06 22:44:01,089 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2020-11-06 22:44:01,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-06 22:44:01,090 INFO L414 BasicCegarLoop]: Found error trace [2020-11-06 22:44:01,090 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-06 22:44:01,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-06 22:44:01,294 INFO L429 AbstractCegarLoop]: === Iteration 10 === [reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-06 22:44:01,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-06 22:44:01,295 INFO L82 PathProgramCache]: Analyzing trace with hash -1937723683, now seen corresponding path program 6 times [2020-11-06 22:44:01,295 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-06 22:44:01,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128971631] [2020-11-06 22:44:01,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-06 22:44:01,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:44:01,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-11-06 22:44:01,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:44:01,480 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2020-11-06 22:44:01,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-06 22:44:01,491 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2020-11-06 22:44:01,491 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128971631] [2020-11-06 22:44:01,492 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [814974332] [2020-11-06 22:44:01,492 INFO L93 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 [2020-11-06 22:44:01,573 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2020-11-06 22:44:01,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2020-11-06 22:44:01,575 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 24 conjunts are in the unsatisfiable core [2020-11-06 22:44:01,578 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-06 22:44:01,647 INFO L382 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 [2020-11-06 22:44:01,648 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2020-11-06 22:44:01,659 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:44:01,660 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:44:01,661 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:26, output treesize:19 [2020-11-06 22:44:01,945 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:44:01,945 INFO L382 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 24 treesize of output 24 [2020-11-06 22:44:01,947 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-11-06 22:44:01,951 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2020-11-06 22:44:01,967 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2020-11-06 22:44:01,969 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-11-06 22:44:01,973 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2020-11-06 22:44:01,973 INFO L244 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:33, output treesize:15 [2020-11-06 22:44:02,092 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2020-11-06 22:44:02,093 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-06 22:44:02,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2020-11-06 22:44:02,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973404474] [2020-11-06 22:44:02,094 INFO L461 AbstractCegarLoop]: Interpolant automaton has 19 states [2020-11-06 22:44:02,094 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-06 22:44:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2020-11-06 22:44:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=261, Unknown=0, NotChecked=0, Total=342 [2020-11-06 22:44:02,095 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 19 states. [2020-11-06 22:44:02,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-06 22:44:02,898 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2020-11-06 22:44:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-11-06 22:44:02,898 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 48 [2020-11-06 22:44:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-06 22:44:02,899 INFO L225 Difference]: With dead ends: 60 [2020-11-06 22:44:02,899 INFO L226 Difference]: Without dead ends: 0 [2020-11-06 22:44:02,901 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=237, Invalid=885, Unknown=0, NotChecked=0, Total=1122 [2020-11-06 22:44:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-11-06 22:44:02,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-11-06 22:44:02,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-11-06 22:44:02,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-11-06 22:44:02,902 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 48 [2020-11-06 22:44:02,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-06 22:44:02,902 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-11-06 22:44:02,902 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2020-11-06 22:44:02,902 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-11-06 22:44:02,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-11-06 22:44:03,111 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2020-11-06 22:44:03,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-11-06 22:44:03,305 WARN L194 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2020-11-06 22:44:03,475 INFO L266 CegarLoopResult]: For program point reach_errorEXIT(line 12) no Hoare annotation was computed. [2020-11-06 22:44:03,476 INFO L269 CegarLoopResult]: At program point reach_errorENTRY(line 12) the Hoare annotation is: true [2020-11-06 22:44:03,476 INFO L266 CegarLoopResult]: For program point L12-1(line 12) no Hoare annotation was computed. [2020-11-06 22:44:03,476 INFO L266 CegarLoopResult]: For program point L12-2(line 12) no Hoare annotation was computed. [2020-11-06 22:44:03,476 INFO L266 CegarLoopResult]: For program point reach_errorErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2020-11-06 22:44:03,476 INFO L266 CegarLoopResult]: For program point L23-2(lines 23 26) no Hoare annotation was computed. [2020-11-06 22:44:03,477 INFO L262 CegarLoopResult]: At program point L23-3(lines 23 26) the Hoare annotation is: (let ((.cse0 (= init_~a.offset |init_#in~a.offset|)) (.cse1 (= init_~a.base |init_#in~a.base|)) (.cse2 (= |init_#in~size| init_~size))) (or (and (exists ((v_init_~i~0_13 Int)) (and (< v_init_~i~0_13 init_~size) (not (= (select (select |#memory_$Pointer$.base| |init_#in~a.base|) (+ (* v_init_~i~0_13 4) |init_#in~a.offset|)) 0)) (<= init_~i~0 (+ v_init_~i~0_13 1)))) .cse0 .cse1 .cse2) (and .cse0 (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) .cse1 (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|) (<= init_~i~0 0) .cse2))) [2020-11-06 22:44:03,477 INFO L266 CegarLoopResult]: For program point L23-4(lines 20 27) no Hoare annotation was computed. [2020-11-06 22:44:03,477 INFO L262 CegarLoopResult]: At program point initENTRY(lines 20 27) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:44:03,477 INFO L266 CegarLoopResult]: For program point initEXIT(lines 20 27) no Hoare annotation was computed. [2020-11-06 22:44:03,477 INFO L266 CegarLoopResult]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:44:03,477 INFO L262 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |old(#t~string1.offset)| |#t~string1.offset|) (= |#t~string0.offset| |old(#t~string0.offset)|) (= |old(#length)| |#length|) (= |#t~string1.base| |old(#t~string1.base)|) (= |#t~string0.base| |old(#t~string0.base)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:44:03,478 INFO L266 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:44:03,478 INFO L266 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-11-06 22:44:03,478 INFO L269 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-11-06 22:44:03,478 INFO L269 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-11-06 22:44:03,478 INFO L266 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-11-06 22:44:03,478 INFO L266 CegarLoopResult]: For program point L35-2(lines 35 41) no Hoare annotation was computed. [2020-11-06 22:44:03,478 INFO L262 CegarLoopResult]: At program point L35-3(lines 35 41) the Hoare annotation is: (or (<= 1 main_~flag~0) (and (exists ((v_init_~i~0_13 Int)) (and (< v_init_~i~0_13 1000000) (not (= (select (select |#memory_$Pointer$.base| |main_~#a~0.base|) (+ (* v_init_~i~0_13 4) |main_~#a~0.offset|)) 0)) (<= 999999 v_init_~i~0_13))) (< main_~i~1 1000000))) [2020-11-06 22:44:03,478 INFO L266 CegarLoopResult]: For program point L35-4(lines 35 41) no Hoare annotation was computed. [2020-11-06 22:44:03,479 INFO L266 CegarLoopResult]: For program point mainEXIT(lines 28 48) no Hoare annotation was computed. [2020-11-06 22:44:03,479 INFO L266 CegarLoopResult]: For program point mainFINAL(lines 28 48) no Hoare annotation was computed. [2020-11-06 22:44:03,479 INFO L266 CegarLoopResult]: For program point L44(lines 44 45) no Hoare annotation was computed. [2020-11-06 22:44:03,479 INFO L266 CegarLoopResult]: For program point L42-2(lines 42 46) no Hoare annotation was computed. [2020-11-06 22:44:03,479 INFO L262 CegarLoopResult]: At program point L42-3(lines 42 46) the Hoare annotation is: (<= 1 main_~flag~0) [2020-11-06 22:44:03,479 INFO L266 CegarLoopResult]: For program point L42-4(lines 42 46) no Hoare annotation was computed. [2020-11-06 22:44:03,479 INFO L269 CegarLoopResult]: At program point L34(line 34) the Hoare annotation is: true [2020-11-06 22:44:03,479 INFO L266 CegarLoopResult]: For program point L34-1(line 34) no Hoare annotation was computed. [2020-11-06 22:44:03,480 INFO L262 CegarLoopResult]: At program point mainENTRY(lines 28 48) the Hoare annotation is: (and (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |old(#valid)| |#valid|)) [2020-11-06 22:44:03,480 INFO L262 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: false [2020-11-06 22:44:03,480 INFO L266 CegarLoopResult]: For program point L45-1(line 45) no Hoare annotation was computed. [2020-11-06 22:44:03,480 INFO L266 CegarLoopResult]: For program point L37(lines 37 40) no Hoare annotation was computed. [2020-11-06 22:44:03,480 INFO L269 CegarLoopResult]: At program point __VERIFIER_assertENTRY(line 13) the Hoare annotation is: true [2020-11-06 22:44:03,480 INFO L266 CegarLoopResult]: For program point L13(line 13) no Hoare annotation was computed. [2020-11-06 22:44:03,480 INFO L269 CegarLoopResult]: At program point L13-1(line 13) the Hoare annotation is: true [2020-11-06 22:44:03,481 INFO L266 CegarLoopResult]: For program point L13-2(line 13) no Hoare annotation was computed. [2020-11-06 22:44:03,481 INFO L266 CegarLoopResult]: For program point __VERIFIER_assertEXIT(line 13) no Hoare annotation was computed. [2020-11-06 22:44:03,481 INFO L266 CegarLoopResult]: For program point L13-4(line 13) no Hoare annotation was computed. [2020-11-06 22:44:03,495 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,499 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,500 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,501 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,503 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,504 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,504 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,506 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,507 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,508 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,514 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,515 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,515 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,517 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,519 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,521 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,521 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,522 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,522 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,522 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,523 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,525 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:44:03 BoogieIcfgContainer [2020-11-06 22:44:03,525 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-06 22:44:03,527 INFO L168 Benchmark]: Toolchain (without parser) took 10157.90 ms. Allocated memory was 151.0 MB in the beginning and 248.5 MB in the end (delta: 97.5 MB). Free memory was 126.3 MB in the beginning and 146.0 MB in the end (delta: -19.7 MB). Peak memory consumption was 79.2 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:03,529 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. [2020-11-06 22:44:03,530 INFO L168 Benchmark]: CACSL2BoogieTranslator took 286.30 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 115.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:03,533 INFO L168 Benchmark]: Boogie Preprocessor took 41.58 ms. Allocated memory is still 151.0 MB. Free memory was 115.2 MB in the beginning and 113.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:03,542 INFO L168 Benchmark]: RCFGBuilder took 514.55 ms. Allocated memory is still 151.0 MB. Free memory was 113.6 MB in the beginning and 130.1 MB in the end (delta: -16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:03,542 INFO L168 Benchmark]: TraceAbstraction took 9303.87 ms. Allocated memory was 151.0 MB in the beginning and 248.5 MB in the end (delta: 97.5 MB). Free memory was 129.5 MB in the beginning and 146.0 MB in the end (delta: -16.5 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. [2020-11-06 22:44:03,549 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 151.0 MB. Free memory was 123.7 MB in the beginning and 123.6 MB in the end (delta: 80.2 kB). There was no memory consumed. Max. memory is 8.0 GB. * CACSL2BoogieTranslator took 286.30 ms. Allocated memory is still 151.0 MB. Free memory was 125.6 MB in the beginning and 115.2 MB in the end (delta: 10.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 8.0 GB. * Boogie Preprocessor took 41.58 ms. Allocated memory is still 151.0 MB. Free memory was 115.2 MB in the beginning and 113.6 MB in the end (delta: 1.6 MB). Peak memory consumption was 1.0 MB. Max. memory is 8.0 GB. * RCFGBuilder took 514.55 ms. Allocated memory is still 151.0 MB. Free memory was 113.6 MB in the beginning and 130.1 MB in the end (delta: -16.5 MB). Peak memory consumption was 16.5 MB. Max. memory is 8.0 GB. * TraceAbstraction took 9303.87 ms. Allocated memory was 151.0 MB in the beginning and 248.5 MB in the end (delta: 97.5 MB). Free memory was 129.5 MB in the beginning and 146.0 MB in the end (delta: -16.5 MB). Peak memory consumption was 81.6 MB. Max. memory is 8.0 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - 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$.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 Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] * 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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - 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_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 12]: 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: 23]: Loop Invariant [2020-11-06 22:44:03,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,563 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,563 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,564 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,567 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,568 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,569 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,570 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,572 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,573 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,577 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,578 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,578 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2020-11-06 22:44:03,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,579 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #length [2020-11-06 22:44:03,579 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2020-11-06 22:44:03,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,580 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((\exists v_init_~i~0_13 : int :: (v_init_~i~0_13 < size && !(#memory_$Pointer$[a][v_init_~i~0_13 * 4 + a] == 0)) && i <= v_init_~i~0_13 + 1) && a == a) && a == a) && \old(size) == size) || ((((((((a == a && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(unknown-#length-unknown) == unknown-#length-unknown) && unknown-#memory_int-unknown == \old(unknown-#memory_int-unknown)) && a == a) && #memory_$Pointer$ == \old(#memory_$Pointer$)) && \old(\valid) == \valid) && i <= 0) && \old(size) == size) - InvariantResult [Line: 42]: Loop Invariant Derived loop invariant: 1 <= flag - InvariantResult [Line: 35]: Loop Invariant [2020-11-06 22:44:03,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,581 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,581 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,582 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2020-11-06 22:44:03,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,582 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2020-11-06 22:44:03,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,582 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_init_~i~0_13,QUANTIFIED] [2020-11-06 22:44:03,583 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: 1 <= flag || ((\exists v_init_~i~0_13 : int :: (v_init_~i~0_13 < 1000000 && !(#memory_$Pointer$[a][v_init_~i~0_13 * 4 + a] == 0)) && 999999 <= v_init_~i~0_13) && i < 1000000) - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 38 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 8.8s, OverallIterations: 10, TraceHistogramMax: 6, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.3s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 277 SDtfs, 300 SDslu, 702 SDs, 0 SdLazy, 957 SolverSat, 162 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 398 GetRequests, 292 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=53occurred 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.1s AutomataMinimizationTime, 10 MinimizatonAttempts, 127 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 40 PreInvPairs, 55 NumberOfFragments, 156 HoareAnnotationTreeSize, 40 FomulaSimplifications, 114 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 258 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 598 NumberOfCodeBlocks, 585 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 580 ConstructedInterpolants, 20 QuantifiedInterpolants, 66875 SizeOfPredicates, 19 NumberOfNonLiveVariables, 1447 ConjunctsInSsa, 59 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 151/356 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...