java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 20:11:51,338 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 20:11:51,341 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 20:11:51,353 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 20:11:51,354 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 20:11:51,355 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 20:11:51,356 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 20:11:51,358 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 20:11:51,360 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 20:11:51,361 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 20:11:51,362 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 20:11:51,365 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 20:11:51,365 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 20:11:51,369 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 20:11:51,370 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 20:11:51,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 20:11:51,377 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 20:11:51,378 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 20:11:51,380 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 20:11:51,386 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 20:11:51,388 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 20:11:51,394 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 20:11:51,395 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 20:11:51,398 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 20:11:51,400 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 20:11:51,401 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 20:11:51,401 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 20:11:51,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 20:11:51,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 20:11:51,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 20:11:51,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 20:11:51,410 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 20:11:51,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 20:11:51,413 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 20:11:51,416 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 20:11:51,416 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 20:11:51,418 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 20:11:51,418 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 20:11:51,418 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 20:11:51,420 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 20:11:51,423 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 20:11:51,424 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 20:11:51,451 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 20:11:51,451 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 20:11:51,454 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 20:11:51,454 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 20:11:51,454 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 20:11:51,454 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 20:11:51,455 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 20:11:51,455 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 20:11:51,455 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 20:11:51,455 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 20:11:51,456 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 20:11:51,457 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 20:11:51,457 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 20:11:51,457 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 20:11:51,457 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 20:11:51,458 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 20:11:51,458 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 20:11:51,458 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 20:11:51,458 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 20:11:51,458 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 20:11:51,459 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 20:11:51,459 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 20:11:51,459 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 20:11:51,460 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 20:11:51,460 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 20:11:51,460 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 20:11:51,460 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 20:11:51,460 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 20:11:51,460 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 20:11:51,744 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 20:11:51,758 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 20:11:51,761 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 20:11:51,763 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 20:11:51,763 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 20:11:51,764 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-13 20:11:51,825 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4c48414/03f319b76ad74b5384b972e9ebca1f95/FLAG160b7dfee [2019-10-13 20:11:52,349 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 20:11:52,351 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-circular-2.i [2019-10-13 20:11:52,378 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4c48414/03f319b76ad74b5384b972e9ebca1f95/FLAG160b7dfee [2019-10-13 20:11:52,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4c48414/03f319b76ad74b5384b972e9ebca1f95 [2019-10-13 20:11:52,682 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 20:11:52,683 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 20:11:52,684 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 20:11:52,684 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 20:11:52,688 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 20:11:52,689 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:11:52" (1/1) ... [2019-10-13 20:11:52,692 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5d2151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:52, skipping insertion in model container [2019-10-13 20:11:52,693 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 08:11:52" (1/1) ... [2019-10-13 20:11:52,701 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 20:11:52,764 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 20:11:53,377 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:11:53,389 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 20:11:53,466 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 20:11:53,526 INFO L192 MainTranslator]: Completed translation [2019-10-13 20:11:53,526 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53 WrapperNode [2019-10-13 20:11:53,527 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 20:11:53,528 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 20:11:53,528 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 20:11:53,528 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 20:11:53,543 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (1/1) ... [2019-10-13 20:11:53,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (1/1) ... [2019-10-13 20:11:53,557 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (1/1) ... [2019-10-13 20:11:53,557 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (1/1) ... [2019-10-13 20:11:53,574 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (1/1) ... [2019-10-13 20:11:53,581 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (1/1) ... [2019-10-13 20:11:53,584 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (1/1) ... [2019-10-13 20:11:53,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 20:11:53,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 20:11:53,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 20:11:53,591 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 20:11:53,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11: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 [2019-10-13 20:11:53,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 20:11:53,661 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 20:11:53,661 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 20:11:53,661 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-10-13 20:11:53,661 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-10-13 20:11:53,661 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-10-13 20:11:53,662 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-10-13 20:11:53,662 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-10-13 20:11:53,662 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-10-13 20:11:53,662 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-10-13 20:11:53,662 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-10-13 20:11:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-10-13 20:11:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-10-13 20:11:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-10-13 20:11:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-10-13 20:11:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-10-13 20:11:53,663 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-10-13 20:11:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-10-13 20:11:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-10-13 20:11:53,664 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-10-13 20:11:53,667 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-10-13 20:11:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-10-13 20:11:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-10-13 20:11:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-10-13 20:11:53,668 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-10-13 20:11:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-10-13 20:11:53,670 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-10-13 20:11:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-10-13 20:11:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-10-13 20:11:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-10-13 20:11:53,671 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-10-13 20:11:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-10-13 20:11:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-10-13 20:11:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-10-13 20:11:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-10-13 20:11:53,672 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-10-13 20:11:53,673 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-10-13 20:11:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-10-13 20:11:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-10-13 20:11:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-10-13 20:11:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-10-13 20:11:53,674 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-10-13 20:11:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-10-13 20:11:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-10-13 20:11:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-10-13 20:11:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-10-13 20:11:53,675 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-10-13 20:11:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-10-13 20:11:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-10-13 20:11:53,676 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-10-13 20:11:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-10-13 20:11:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-10-13 20:11:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-10-13 20:11:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 20:11:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-13 20:11:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-10-13 20:11:53,677 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 20:11:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-10-13 20:11:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-10-13 20:11:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-10-13 20:11:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-10-13 20:11:53,678 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-10-13 20:11:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-10-13 20:11:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-10-13 20:11:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-10-13 20:11:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-10-13 20:11:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 20:11:53,679 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-10-13 20:11:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-10-13 20:11:53,680 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-10-13 20:11:53,681 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-10-13 20:11:53,681 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-10-13 20:11:53,681 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-10-13 20:11:53,682 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-10-13 20:11:53,682 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-10-13 20:11:53,682 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-10-13 20:11:53,682 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-10-13 20:11:53,683 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-10-13 20:11:53,683 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-10-13 20:11:53,684 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-10-13 20:11:53,685 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-10-13 20:11:53,685 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-10-13 20:11:53,685 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-10-13 20:11:53,685 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-10-13 20:11:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-10-13 20:11:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-10-13 20:11:53,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-10-13 20:11:53,687 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-10-13 20:11:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-10-13 20:11:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-10-13 20:11:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-10-13 20:11:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-10-13 20:11:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-10-13 20:11:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-10-13 20:11:53,688 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-10-13 20:11:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-10-13 20:11:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-10-13 20:11:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-10-13 20:11:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-10-13 20:11:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-10-13 20:11:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-10-13 20:11:53,689 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-10-13 20:11:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-10-13 20:11:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-10-13 20:11:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-10-13 20:11:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-10-13 20:11:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 20:11:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 20:11:53,690 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 20:11:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 20:11:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 20:11:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 20:11:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 20:11:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 20:11:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 20:11:53,691 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 20:11:53,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 20:11:54,227 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 20:11:54,228 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-13 20:11:54,229 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:11:54 BoogieIcfgContainer [2019-10-13 20:11:54,229 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 20:11:54,230 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 20:11:54,230 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 20:11:54,233 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 20:11:54,234 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 08:11:52" (1/3) ... [2019-10-13 20:11:54,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fcb057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:11:54, skipping insertion in model container [2019-10-13 20:11:54,235 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 08:11:53" (2/3) ... [2019-10-13 20:11:54,235 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23fcb057 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 08:11:54, skipping insertion in model container [2019-10-13 20:11:54,236 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 08:11:54" (3/3) ... [2019-10-13 20:11:54,237 INFO L109 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2019-10-13 20:11:54,247 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 20:11:54,255 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-10-13 20:11:54,267 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-10-13 20:11:54,298 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 20:11:54,298 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 20:11:54,298 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 20:11:54,299 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 20:11:54,302 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 20:11:54,302 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 20:11:54,302 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 20:11:54,302 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 20:11:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-10-13 20:11:54,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-10-13 20:11:54,325 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:11:54,327 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:11:54,332 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:11:54,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:11:54,338 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-10-13 20:11:54,348 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:11:54,349 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128704472] [2019-10-13 20:11:54,349 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,350 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:11:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:11:54,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:11:54,506 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128704472] [2019-10-13 20:11:54,507 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:11:54,507 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-13 20:11:54,508 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139513581] [2019-10-13 20:11:54,512 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:11:54,514 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:11:54,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:11:54,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:11:54,533 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-10-13 20:11:54,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:11:54,559 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-10-13 20:11:54,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:11:54,560 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-10-13 20:11:54,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:11:54,571 INFO L225 Difference]: With dead ends: 70 [2019-10-13 20:11:54,571 INFO L226 Difference]: Without dead ends: 30 [2019-10-13 20:11:54,575 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:11:54,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-13 20:11:54,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-10-13 20:11:54,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-10-13 20:11:54,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-10-13 20:11:54,609 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-10-13 20:11:54,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:11:54,610 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-10-13 20:11:54,610 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:11:54,610 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-10-13 20:11:54,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-10-13 20:11:54,611 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:11:54,611 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:11:54,611 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:11:54,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:11:54,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-10-13 20:11:54,612 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:11:54,613 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851377739] [2019-10-13 20:11:54,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,613 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,613 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:11:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:11:54,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:11:54,762 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851377739] [2019-10-13 20:11:54,763 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:11:54,763 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 20:11:54,763 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830375767] [2019-10-13 20:11:54,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 20:11:54,765 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:11:54,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 20:11:54,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 20:11:54,766 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-10-13 20:11:54,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:11:54,879 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-10-13 20:11:54,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 20:11:54,880 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-10-13 20:11:54,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:11:54,881 INFO L225 Difference]: With dead ends: 46 [2019-10-13 20:11:54,881 INFO L226 Difference]: Without dead ends: 42 [2019-10-13 20:11:54,882 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:11:54,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-10-13 20:11:54,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-10-13 20:11:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-13 20:11:54,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-10-13 20:11:54,889 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-10-13 20:11:54,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:11:54,890 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-10-13 20:11:54,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 20:11:54,890 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-10-13 20:11:54,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-13 20:11:54,891 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:11:54,891 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:11:54,891 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:11:54,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:11:54,892 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-10-13 20:11:54,892 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:11:54,892 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985054423] [2019-10-13 20:11:54,892 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,893 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,893 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:11:54,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:11:54,947 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:11:54,947 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985054423] [2019-10-13 20:11:54,948 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:11:54,948 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:11:54,948 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068181814] [2019-10-13 20:11:54,949 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:11:54,949 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:11:54,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:11:54,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:11:54,950 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2019-10-13 20:11:54,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:11:54,979 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-10-13 20:11:54,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:11:54,980 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-10-13 20:11:54,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:11:54,983 INFO L225 Difference]: With dead ends: 75 [2019-10-13 20:11:54,984 INFO L226 Difference]: Without dead ends: 53 [2019-10-13 20:11:54,984 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:11:54,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-13 20:11:54,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-10-13 20:11:54,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-10-13 20:11:54,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-10-13 20:11:54,993 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-10-13 20:11:54,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:11:54,993 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-10-13 20:11:54,993 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:11:54,993 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-10-13 20:11:54,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 20:11:54,994 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:11:54,994 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:11:54,995 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:11:54,995 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:11:54,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-10-13 20:11:54,995 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:11:54,996 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333015045] [2019-10-13 20:11:54,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:54,996 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:11:55,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:11:55,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:11:55,044 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333015045] [2019-10-13 20:11:55,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:11:55,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 20:11:55,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959338942] [2019-10-13 20:11:55,049 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 20:11:55,049 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:11:55,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 20:11:55,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:11:55,050 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 3 states. [2019-10-13 20:11:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:11:55,069 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-10-13 20:11:55,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 20:11:55,071 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-10-13 20:11:55,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:11:55,072 INFO L225 Difference]: With dead ends: 42 [2019-10-13 20:11:55,072 INFO L226 Difference]: Without dead ends: 40 [2019-10-13 20:11:55,072 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 20:11:55,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-10-13 20:11:55,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-10-13 20:11:55,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-10-13 20:11:55,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-10-13 20:11:55,083 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-10-13 20:11:55,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:11:55,083 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-10-13 20:11:55,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 20:11:55,084 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-10-13 20:11:55,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 20:11:55,084 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:11:55,085 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:11:55,085 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:11:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:11:55,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-10-13 20:11:55,087 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:11:55,088 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250743280] [2019-10-13 20:11:55,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:55,088 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:55,088 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:11:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:11:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:11:55,329 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [250743280] [2019-10-13 20:11:55,330 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 20:11:55,330 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 20:11:55,330 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457504499] [2019-10-13 20:11:55,330 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 20:11:55,331 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 20:11:55,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 20:11:55,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 20:11:55,331 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-10-13 20:11:55,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:11:55,584 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-10-13 20:11:55,584 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 20:11:55,584 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-10-13 20:11:55,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:11:55,586 INFO L225 Difference]: With dead ends: 51 [2019-10-13 20:11:55,586 INFO L226 Difference]: Without dead ends: 38 [2019-10-13 20:11:55,589 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-10-13 20:11:55,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-13 20:11:55,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-13 20:11:55,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-13 20:11:55,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-10-13 20:11:55,603 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-10-13 20:11:55,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:11:55,604 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-10-13 20:11:55,604 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 20:11:55,606 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-10-13 20:11:55,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-13 20:11:55,606 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 20:11:55,607 INFO L380 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 20:11:55,607 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 20:11:55,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:11:55,608 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-10-13 20:11:55,608 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 20:11:55,608 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421485802] [2019-10-13 20:11:55,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:55,609 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 20:11:55,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 20:11:55,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:11:55,745 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:11:55,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421485802] [2019-10-13 20:11:55,746 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362894902] [2019-10-13 20:11:55,747 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:11:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 20:11:55,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-13 20:11:55,891 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 20:11:55,978 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-10-13 20:11:55,978 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:11:56,004 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:11:56,004 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:11:56,005 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-10-13 20:11:56,040 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:11:56,041 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 15 [2019-10-13 20:11:56,042 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:11:56,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:11:56,065 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-13 20:11:56,128 INFO L341 Elim1Store]: treesize reduction 30, result has 57.7 percent of original size [2019-10-13 20:11:56,129 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 51 [2019-10-13 20:11:56,130 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:11:56,165 INFO L567 ElimStorePlain]: treesize reduction 24, result has 59.3 percent of original size [2019-10-13 20:11:56,168 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:11:56,169 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:111, output treesize:32 [2019-10-13 20:11:58,233 WARN L191 SmtUtils]: Spent 2.03 s on a formula simplification that was a NOOP. DAG size: 23 [2019-10-13 20:11:58,284 INFO L341 Elim1Store]: treesize reduction 60, result has 29.4 percent of original size [2019-10-13 20:11:58,285 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 41 [2019-10-13 20:11:58,286 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:11:58,299 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:11:58,300 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:11:58,301 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:51, output treesize:23 [2019-10-13 20:12:00,361 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_22|]} [2019-10-13 20:12:00,378 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:00,395 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:00,412 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:00,413 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 55 [2019-10-13 20:12:00,415 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:00,416 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:00,425 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:00,440 INFO L567 ElimStorePlain]: treesize reduction 19, result has 32.1 percent of original size [2019-10-13 20:12:00,441 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-13 20:12:00,442 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-10-13 20:12:00,445 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:00,445 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 20:12:00,458 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:00,461 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:00,462 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:00,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-10-13 20:12:00,498 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-13 20:12:00,504 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-13 20:12:00,505 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-10-13 20:12:00,505 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-10-13 20:12:00,528 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6400 treesize of output 6368 [2019-10-13 20:12:00,543 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-13 20:12:01,086 WARN L191 SmtUtils]: Spent 542.00 ms on a formula simplification. DAG size of input: 151 DAG size of output: 40 [2019-10-13 20:12:01,086 INFO L567 ElimStorePlain]: treesize reduction 6265, result has 1.0 percent of original size [2019-10-13 20:12:01,087 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:01,088 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:01,089 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:01,090 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:01,098 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:01,102 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-10-13 20:12:01,103 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-13 20:12:01,109 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 5 dim-0 vars, and 2 xjuncts. [2019-10-13 20:12:01,109 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:143, output treesize:89 [2019-10-13 20:12:01,202 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-13 20:12:01,202 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1923166139] [2019-10-13 20:12:01,209 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-10-13 20:12:01,246 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-13 20:12:01,247 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-13 20:12:01,306 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-13 20:12:01,307 INFO L272 AbstractInterpreter]: Visited 6 different actions 6 times. Never merged. Never widened. Performed 19 root evaluator evaluations with a maximum evaluation depth of 0. Performed 19 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 33 variables. [2019-10-13 20:12:01,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 20:12:01,311 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-13 20:12:01,350 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-10-13 20:12:01,350 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-13 20:12:01,351 INFO L553 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-10-13 20:12:01,351 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-13 20:12:01,352 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-13 20:12:01,352 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 6, 5] total 9 [2019-10-13 20:12:01,353 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [737326733] [2019-10-13 20:12:01,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-13 20:12:01,354 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-13 20:12:01,354 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-13 20:12:01,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-13 20:12:01,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:01,355 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 2 states. [2019-10-13 20:12:01,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 20:12:01,368 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-10-13 20:12:01,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-13 20:12:01,369 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-10-13 20:12:01,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 20:12:01,369 INFO L225 Difference]: With dead ends: 38 [2019-10-13 20:12:01,370 INFO L226 Difference]: Without dead ends: 0 [2019-10-13 20:12:01,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-13 20:12:01,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-13 20:12:01,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-13 20:12:01,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-13 20:12:01,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-13 20:12:01,372 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-13 20:12:01,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 20:12:01,372 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-13 20:12:01,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-13 20:12:01,373 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-13 20:12:01,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-13 20:12:01,577 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 20:12:01,589 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-13 20:12:01,644 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:01,644 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:01,645 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:01,645 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-13 20:12:01,645 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-10-13 20:12:01,645 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-13 20:12:01,645 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-13 20:12:01,645 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 983 1039) no Hoare annotation was computed. [2019-10-13 20:12:01,645 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:01,645 INFO L443 ceAbstractionStarter]: For program point L1003(lines 1003 1011) no Hoare annotation was computed. [2019-10-13 20:12:01,646 INFO L443 ceAbstractionStarter]: For program point L1003-1(lines 1003 1011) no Hoare annotation was computed. [2019-10-13 20:12:01,646 INFO L443 ceAbstractionStarter]: For program point L995-1(lines 995 1016) no Hoare annotation was computed. [2019-10-13 20:12:01,646 INFO L443 ceAbstractionStarter]: For program point L995-3(lines 995 1016) no Hoare annotation was computed. [2019-10-13 20:12:01,646 INFO L443 ceAbstractionStarter]: For program point L1020-1(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:01,646 INFO L443 ceAbstractionStarter]: For program point L1020-3(line 1020) no Hoare annotation was computed. [2019-10-13 20:12:01,646 INFO L439 ceAbstractionStarter]: At program point L1020-4(line 1020) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (and (= main_~head~0.offset .cse0) (not (= 0 main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 .cse0) (= 1 main_~state~0) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 1))) [2019-10-13 20:12:01,647 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 983 1039) no Hoare annotation was computed. [2019-10-13 20:12:01,647 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 983 1039) the Hoare annotation is: true [2019-10-13 20:12:01,647 INFO L443 ceAbstractionStarter]: For program point L1005(lines 1005 1010) no Hoare annotation was computed. [2019-10-13 20:12:01,647 INFO L443 ceAbstractionStarter]: For program point L1030-1(lines 1030 1035) no Hoare annotation was computed. [2019-10-13 20:12:01,647 INFO L446 ceAbstractionStarter]: At program point L1030-3(lines 1030 1035) the Hoare annotation is: true [2019-10-13 20:12:01,647 INFO L443 ceAbstractionStarter]: For program point L1030-4(lines 1030 1035) no Hoare annotation was computed. [2019-10-13 20:12:01,647 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1015) no Hoare annotation was computed. [2019-10-13 20:12:01,648 INFO L443 ceAbstractionStarter]: For program point L1022(lines 1022 1026) no Hoare annotation was computed. [2019-10-13 20:12:01,648 INFO L443 ceAbstractionStarter]: For program point L1022-2(lines 984 1039) no Hoare annotation was computed. [2019-10-13 20:12:01,648 INFO L443 ceAbstractionStarter]: For program point L1022-3(lines 1022 1026) no Hoare annotation was computed. [2019-10-13 20:12:01,648 INFO L443 ceAbstractionStarter]: For program point L1015-1(line 1015) no Hoare annotation was computed. [2019-10-13 20:12:01,648 INFO L443 ceAbstractionStarter]: For program point L1015-3(line 1015) no Hoare annotation was computed. [2019-10-13 20:12:01,648 INFO L439 ceAbstractionStarter]: At program point L1015-4(line 1015) the Hoare annotation is: false [2019-10-13 20:12:01,648 INFO L439 ceAbstractionStarter]: At program point L1015-5(lines 995 1016) the Hoare annotation is: false [2019-10-13 20:12:01,648 INFO L443 ceAbstractionStarter]: For program point L1007(lines 1007 1010) no Hoare annotation was computed. [2019-10-13 20:12:01,648 INFO L443 ceAbstractionStarter]: For program point L1024-1(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:01,649 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:01,649 INFO L443 ceAbstractionStarter]: For program point L1024-3(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:01,649 INFO L443 ceAbstractionStarter]: For program point L1024-4(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:01,649 INFO L443 ceAbstractionStarter]: For program point L1024-6(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:01,649 INFO L439 ceAbstractionStarter]: At program point L1024-7(line 1024) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset))) (and (= main_~head~0.offset .cse0) (= main_~head~0.offset main_~x~0.offset) (= 0 .cse0) (= 1 main_~state~0) (= main_~head~0.base main_~x~0.base) (= (select (select |#memory_$Pointer$.base| main_~x~0.base) main_~head~0.offset) main_~head~0.base) (= (select (select |#memory_int| main_~x~0.base) (+ main_~x~0.offset 8)) 1))) [2019-10-13 20:12:01,649 INFO L443 ceAbstractionStarter]: For program point L1024-8(line 1024) no Hoare annotation was computed. [2019-10-13 20:12:01,656 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,657 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,657 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:01,663 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,663 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,664 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:01,666 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,666 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,667 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:01,668 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,669 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,669 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,670 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:01,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 08:12:01 BoogieIcfgContainer [2019-10-13 20:12:01,673 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-13 20:12:01,674 INFO L168 Benchmark]: Toolchain (without parser) took 8991.19 ms. Allocated memory was 145.8 MB in the beginning and 248.0 MB in the end (delta: 102.2 MB). Free memory was 101.2 MB in the beginning and 199.5 MB in the end (delta: -98.3 MB). Peak memory consumption was 4.0 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:01,675 INFO L168 Benchmark]: CDTParser took 0.26 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-13 20:12:01,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 843.58 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.0 MB in the beginning and 171.0 MB in the end (delta: -70.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:01,677 INFO L168 Benchmark]: Boogie Preprocessor took 62.48 ms. Allocated memory is still 204.5 MB. Free memory was 171.0 MB in the beginning and 167.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:01,677 INFO L168 Benchmark]: RCFGBuilder took 638.32 ms. Allocated memory is still 204.5 MB. Free memory was 167.7 MB in the beginning and 123.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. [2019-10-13 20:12:01,678 INFO L168 Benchmark]: TraceAbstraction took 7442.47 ms. Allocated memory was 204.5 MB in the beginning and 248.0 MB in the end (delta: 43.5 MB). Free memory was 122.8 MB in the beginning and 199.5 MB in the end (delta: -76.7 MB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-13 20:12:01,682 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26 ms. Allocated memory is still 145.8 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 843.58 ms. Allocated memory was 145.8 MB in the beginning and 204.5 MB in the end (delta: 58.7 MB). Free memory was 101.0 MB in the beginning and 171.0 MB in the end (delta: -70.0 MB). Peak memory consumption was 20.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 62.48 ms. Allocated memory is still 204.5 MB. Free memory was 171.0 MB in the beginning and 167.7 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 638.32 ms. Allocated memory is still 204.5 MB. Free memory was 167.7 MB in the beginning and 123.5 MB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7442.47 ms. Allocated memory was 204.5 MB in the beginning and 248.0 MB in the end (delta: 43.5 MB). Free memory was 122.8 MB in the beginning and 199.5 MB in the end (delta: -76.7 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.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$.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$.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$.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 * 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 #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1015]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1020]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1024]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 1024]: Loop Invariant [2019-10-13 20:12:01,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,691 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,692 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,692 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,692 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,693 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,693 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:01,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,693 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,694 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,694 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,694 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,694 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,695 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((((head == #memory_$Pointer$[x][head] && head == x) && 0 == #memory_$Pointer$[x][head]) && 1 == state) && head == x) && #memory_$Pointer$[x][head] == head) && unknown-#memory_int-unknown[x][x + 8] == 1 - InvariantResult [Line: 1015]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1030]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1020]: Loop Invariant [2019-10-13 20:12:01,695 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,696 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,696 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,696 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,696 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,697 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,697 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-13 20:12:01,697 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-13 20:12:01,698 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-13 20:12:01,698 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,698 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,698 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-13 20:12:01,699 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: ((((((head == #memory_$Pointer$[x][head] && !(0 == x)) && head == x) && 0 == #memory_$Pointer$[x][head]) && 1 == state) && head == x) && #memory_$Pointer$[x][head] == head) && unknown-#memory_int-unknown[x][x + 8] == 1 - InvariantResult [Line: 995]: Loop Invariant Derived loop invariant: 0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 3 error locations. Result: SAFE, OverallTime: 7.3s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 160 SDtfs, 55 SDslu, 150 SDs, 0 SdLazy, 84 SolverSat, 11 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=40occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 9 PreInvPairs, 12 NumberOfFragments, 91 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 11 QuantifiedInterpolants, 14322 SizeOfPredicates, 8 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 102, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.890625, AVG_VARS_REMOVED_DURING_WEAKENING: 1.0625, AVG_WEAKENED_CONJUNCTS: 0.375, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...