/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fb55353 [2019-11-06 22:59:09,247 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-06 22:59:09,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-06 22:59:09,267 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-06 22:59:09,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-06 22:59:09,269 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-06 22:59:09,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-06 22:59:09,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-06 22:59:09,282 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-06 22:59:09,285 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-06 22:59:09,286 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-06 22:59:09,288 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-06 22:59:09,288 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-06 22:59:09,290 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-06 22:59:09,291 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-06 22:59:09,293 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-06 22:59:09,295 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-06 22:59:09,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-06 22:59:09,298 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-06 22:59:09,303 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-06 22:59:09,307 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-06 22:59:09,310 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-06 22:59:09,312 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-06 22:59:09,312 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-06 22:59:09,314 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-06 22:59:09,315 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-06 22:59:09,315 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-06 22:59:09,316 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-06 22:59:09,317 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-06 22:59:09,319 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-06 22:59:09,319 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-06 22:59:09,320 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-06 22:59:09,320 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-06 22:59:09,321 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-06 22:59:09,322 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-06 22:59:09,322 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-06 22:59:09,323 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-06 22:59:09,323 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-06 22:59:09,323 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-06 22:59:09,324 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-06 22:59:09,325 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-06 22:59:09,326 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-06 22:59:09,354 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-06 22:59:09,354 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-06 22:59:09,355 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-06 22:59:09,356 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-06 22:59:09,356 INFO L138 SettingsManager]: * Use SBE=true [2019-11-06 22:59:09,356 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-06 22:59:09,356 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-06 22:59:09,356 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-06 22:59:09,357 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-06 22:59:09,357 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-06 22:59:09,357 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-06 22:59:09,357 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-06 22:59:09,357 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-06 22:59:09,358 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-06 22:59:09,358 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-06 22:59:09,358 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-06 22:59:09,358 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-06 22:59:09,358 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-06 22:59:09,359 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-06 22:59:09,359 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-06 22:59:09,359 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-06 22:59:09,359 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:09,359 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-06 22:59:09,360 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-06 22:59:09,360 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-06 22:59:09,360 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-06 22:59:09,360 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-06 22:59:09,360 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-06 22:59:09,361 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-11-06 22:59:09,663 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-06 22:59:09,676 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-06 22:59:09,680 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-06 22:59:09,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-06 22:59:09,682 INFO L275 PluginConnector]: CDTParser initialized [2019-11-06 22:59:09,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-11-06 22:59:09,759 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea034dfc0/7273f67cedce4fcd8b8f81e4c53032b9/FLAGfc638ed95 [2019-11-06 22:59:10,249 INFO L306 CDTParser]: Found 1 translation units. [2019-11-06 22:59:10,249 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-circular-1.i [2019-11-06 22:59:10,270 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea034dfc0/7273f67cedce4fcd8b8f81e4c53032b9/FLAGfc638ed95 [2019-11-06 22:59:10,558 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ea034dfc0/7273f67cedce4fcd8b8f81e4c53032b9 [2019-11-06 22:59:10,566 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-06 22:59:10,567 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-11-06 22:59:10,569 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:10,569 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-06 22:59:10,573 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-06 22:59:10,574 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:10" (1/1) ... [2019-11-06 22:59:10,577 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1058969a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:10, skipping insertion in model container [2019-11-06 22:59:10,577 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:59:10" (1/1) ... [2019-11-06 22:59:10,585 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-06 22:59:10,628 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-06 22:59:11,073 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:11,083 INFO L188 MainTranslator]: Completed pre-run [2019-11-06 22:59:11,125 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-06 22:59:11,182 INFO L192 MainTranslator]: Completed translation [2019-11-06 22:59:11,182 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11 WrapperNode [2019-11-06 22:59:11,183 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-06 22:59:11,183 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-06 22:59:11,183 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-06 22:59:11,184 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-06 22:59:11,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... [2019-11-06 22:59:11,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... [2019-11-06 22:59:11,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... [2019-11-06 22:59:11,225 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... [2019-11-06 22:59:11,243 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... [2019-11-06 22:59:11,250 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... [2019-11-06 22:59:11,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... [2019-11-06 22:59:11,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-06 22:59:11,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-06 22:59:11,260 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-06 22:59:11,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-06 22:59:11,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-06 22:59:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-11-06 22:59:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-06 22:59:11,320 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-11-06 22:59:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2019-11-06 22:59:11,320 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2019-11-06 22:59:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2019-11-06 22:59:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2019-11-06 22:59:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2019-11-06 22:59:11,321 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2019-11-06 22:59:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2019-11-06 22:59:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2019-11-06 22:59:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2019-11-06 22:59:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2019-11-06 22:59:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2019-11-06 22:59:11,322 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2019-11-06 22:59:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2019-11-06 22:59:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2019-11-06 22:59:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2019-11-06 22:59:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2019-11-06 22:59:11,323 INFO L130 BoogieDeclarations]: Found specification of procedure select [2019-11-06 22:59:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2019-11-06 22:59:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2019-11-06 22:59:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2019-11-06 22:59:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2019-11-06 22:59:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure random [2019-11-06 22:59:11,324 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2019-11-06 22:59:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2019-11-06 22:59:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2019-11-06 22:59:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2019-11-06 22:59:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2019-11-06 22:59:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2019-11-06 22:59:11,325 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2019-11-06 22:59:11,326 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2019-11-06 22:59:11,327 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-11-06 22:59:11,328 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-11-06 22:59:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2019-11-06 22:59:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-11-06 22:59:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2019-11-06 22:59:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2019-11-06 22:59:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2019-11-06 22:59:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2019-11-06 22:59:11,329 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2019-11-06 22:59:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2019-11-06 22:59:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2019-11-06 22:59:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-11-06 22:59:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2019-11-06 22:59:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2019-11-06 22:59:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2019-11-06 22:59:11,330 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2019-11-06 22:59:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2019-11-06 22:59:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2019-11-06 22:59:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2019-11-06 22:59:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2019-11-06 22:59:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2019-11-06 22:59:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2019-11-06 22:59:11,331 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2019-11-06 22:59:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure system [2019-11-06 22:59:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2019-11-06 22:59:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2019-11-06 22:59:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2019-11-06 22:59:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2019-11-06 22:59:11,332 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2019-11-06 22:59:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2019-11-06 22:59:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure div [2019-11-06 22:59:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2019-11-06 22:59:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2019-11-06 22:59:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2019-11-06 22:59:11,333 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2019-11-06 22:59:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2019-11-06 22:59:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2019-11-06 22:59:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2019-11-06 22:59:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2019-11-06 22:59:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2019-11-06 22:59:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2019-11-06 22:59:11,334 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2019-11-06 22:59:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2019-11-06 22:59:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2019-11-06 22:59:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2019-11-06 22:59:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2019-11-06 22:59:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2019-11-06 22:59:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2019-11-06 22:59:11,335 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2019-11-06 22:59:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2019-11-06 22:59:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2019-11-06 22:59:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-11-06 22:59:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-11-06 22:59:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-11-06 22:59:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-11-06 22:59:11,336 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-11-06 22:59:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-06 22:59:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-11-06 22:59:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-06 22:59:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-06 22:59:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-11-06 22:59:11,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-06 22:59:11,898 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-06 22:59:11,898 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-11-06 22:59:11,899 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:11 BoogieIcfgContainer [2019-11-06 22:59:11,899 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-06 22:59:11,900 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-06 22:59:11,901 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-06 22:59:11,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-06 22:59:11,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:59:10" (1/3) ... [2019-11-06 22:59:11,905 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729279aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:11, skipping insertion in model container [2019-11-06 22:59:11,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:59:11" (2/3) ... [2019-11-06 22:59:11,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@729279aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:59:11, skipping insertion in model container [2019-11-06 22:59:11,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:59:11" (3/3) ... [2019-11-06 22:59:11,908 INFO L109 eAbstractionObserver]: Analyzing ICFG sll-circular-1.i [2019-11-06 22:59:11,918 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-06 22:59:11,926 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2019-11-06 22:59:11,938 INFO L249 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2019-11-06 22:59:11,963 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-06 22:59:11,963 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-06 22:59:11,963 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-06 22:59:11,963 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-06 22:59:11,967 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-06 22:59:11,967 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-06 22:59:11,967 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-06 22:59:11,967 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-06 22:59:11,989 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2019-11-06 22:59:11,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-11-06 22:59:11,996 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:12,005 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:12,007 INFO L410 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:12,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:12,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1483997276, now seen corresponding path program 1 times [2019-11-06 22:59:12,020 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:12,021 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320642988] [2019-11-06 22:59:12,021 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:12,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:12,166 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:12,167 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320642988] [2019-11-06 22:59:12,168 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:12,168 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-06 22:59:12,169 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394282764] [2019-11-06 22:59:12,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:12,175 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:12,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-11-06 22:59:12,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-11-06 22:59:12,193 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 2 states. [2019-11-06 22:59:12,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:12,218 INFO L93 Difference]: Finished difference Result 70 states and 106 transitions. [2019-11-06 22:59:12,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:12,220 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2019-11-06 22:59:12,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:12,230 INFO L225 Difference]: With dead ends: 70 [2019-11-06 22:59:12,230 INFO L226 Difference]: Without dead ends: 30 [2019-11-06 22:59:12,234 INFO L630 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-11-06 22:59:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-11-06 22:59:12,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-11-06 22:59:12,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-11-06 22:59:12,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2019-11-06 22:59:12,268 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 10 [2019-11-06 22:59:12,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:12,268 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2019-11-06 22:59:12,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:12,269 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2019-11-06 22:59:12,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-11-06 22:59:12,269 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:12,270 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:12,270 INFO L410 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:12,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:12,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1199756337, now seen corresponding path program 1 times [2019-11-06 22:59:12,271 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:12,271 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409851717] [2019-11-06 22:59:12,271 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:12,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:12,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:12,438 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409851717] [2019-11-06 22:59:12,438 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:12,439 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-06 22:59:12,439 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606012118] [2019-11-06 22:59:12,441 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-06 22:59:12,441 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:12,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:12,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-06 22:59:12,442 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand 4 states. [2019-11-06 22:59:12,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:12,567 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2019-11-06 22:59:12,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-06 22:59:12,569 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-11-06 22:59:12,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:12,570 INFO L225 Difference]: With dead ends: 46 [2019-11-06 22:59:12,570 INFO L226 Difference]: Without dead ends: 42 [2019-11-06 22:59:12,571 INFO L630 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-11-06 22:59:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-11-06 22:59:12,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 32. [2019-11-06 22:59:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-11-06 22:59:12,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2019-11-06 22:59:12,585 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 11 [2019-11-06 22:59:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:12,585 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2019-11-06 22:59:12,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-06 22:59:12,586 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2019-11-06 22:59:12,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-11-06 22:59:12,588 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:12,588 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:12,589 INFO L410 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:12,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:12,589 INFO L82 PathProgramCache]: Analyzing trace with hash -97127833, now seen corresponding path program 1 times [2019-11-06 22:59:12,589 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:12,590 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336470919] [2019-11-06 22:59:12,590 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:12,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:12,687 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336470919] [2019-11-06 22:59:12,687 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:12,688 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:12,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419033192] [2019-11-06 22:59:12,689 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:12,689 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:12,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:12,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:12,690 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 3 states. [2019-11-06 22:59:12,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:12,727 INFO L93 Difference]: Finished difference Result 75 states and 90 transitions. [2019-11-06 22:59:12,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:12,728 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-11-06 22:59:12,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:12,731 INFO L225 Difference]: With dead ends: 75 [2019-11-06 22:59:12,731 INFO L226 Difference]: Without dead ends: 53 [2019-11-06 22:59:12,732 INFO L630 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-11-06 22:59:12,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-11-06 22:59:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 39. [2019-11-06 22:59:12,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-11-06 22:59:12,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2019-11-06 22:59:12,740 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 14 [2019-11-06 22:59:12,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:12,741 INFO L462 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2019-11-06 22:59:12,741 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:12,741 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2019-11-06 22:59:12,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 22:59:12,742 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:12,742 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:12,742 INFO L410 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:12,743 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:12,743 INFO L82 PathProgramCache]: Analyzing trace with hash 2075944349, now seen corresponding path program 1 times [2019-11-06 22:59:12,743 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:12,743 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617187413] [2019-11-06 22:59:12,744 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:12,783 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:12,784 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617187413] [2019-11-06 22:59:12,784 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:12,784 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-06 22:59:12,785 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428945438] [2019-11-06 22:59:12,785 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-06 22:59:12,785 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:12,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-06 22:59:12,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-06 22:59:12,786 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand 3 states. [2019-11-06 22:59:12,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:12,800 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2019-11-06 22:59:12,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-06 22:59:12,801 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2019-11-06 22:59:12,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:12,802 INFO L225 Difference]: With dead ends: 42 [2019-11-06 22:59:12,802 INFO L226 Difference]: Without dead ends: 40 [2019-11-06 22:59:12,803 INFO L630 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-11-06 22:59:12,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-11-06 22:59:12,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2019-11-06 22:59:12,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-11-06 22:59:12,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2019-11-06 22:59:12,809 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 17 [2019-11-06 22:59:12,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:12,810 INFO L462 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2019-11-06 22:59:12,810 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-06 22:59:12,810 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2019-11-06 22:59:12,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 22:59:12,811 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:12,811 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:12,811 INFO L410 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:12,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:12,812 INFO L82 PathProgramCache]: Analyzing trace with hash 2075946271, now seen corresponding path program 1 times [2019-11-06 22:59:12,812 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:12,812 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [16825193] [2019-11-06 22:59:12,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:13,026 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [16825193] [2019-11-06 22:59:13,026 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-06 22:59:13,026 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-06 22:59:13,026 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079894313] [2019-11-06 22:59:13,028 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-06 22:59:13,028 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:13,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-06 22:59:13,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-06 22:59:13,029 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand 5 states. [2019-11-06 22:59:13,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:13,231 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2019-11-06 22:59:13,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-06 22:59:13,232 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2019-11-06 22:59:13,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:13,233 INFO L225 Difference]: With dead ends: 51 [2019-11-06 22:59:13,234 INFO L226 Difference]: Without dead ends: 38 [2019-11-06 22:59:13,234 INFO L630 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-11-06 22:59:13,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-11-06 22:59:13,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-11-06 22:59:13,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-11-06 22:59:13,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2019-11-06 22:59:13,241 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 17 [2019-11-06 22:59:13,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:13,241 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2019-11-06 22:59:13,241 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-06 22:59:13,241 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2019-11-06 22:59:13,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-11-06 22:59:13,242 INFO L402 BasicCegarLoop]: Found error trace [2019-11-06 22:59:13,242 INFO L410 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-06 22:59:13,242 INFO L410 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-06 22:59:13,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:13,243 INFO L82 PathProgramCache]: Analyzing trace with hash -351040154, now seen corresponding path program 1 times [2019-11-06 22:59:13,243 INFO L161 FreeRefinementEngine]: Executing refinement strategy TAIPAN [2019-11-06 22:59:13,243 INFO L337 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914379216] [2019-11-06 22:59:13,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-06 22:59:13,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:13,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:13,323 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914379216] [2019-11-06 22:59:13,323 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992569837] [2019-11-06 22:59:13,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:13,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-06 22:59:13,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 19 conjunts are in the unsatisfiable core [2019-11-06 22:59:13,445 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-06 22:59:13,505 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-11-06 22:59:13,506 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,517 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,518 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,519 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-11-06 22:59:13,548 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,549 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-11-06 22:59:13,549 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,559 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,565 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 0 case distinctions, treesize of input 27 treesize of output 15 [2019-11-06 22:59:13,565 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,579 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,579 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,580 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:42, output treesize:23 [2019-11-06 22:59:13,634 INFO L341 Elim1Store]: treesize reduction 27, result has 20.6 percent of original size [2019-11-06 22:59:13,634 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 21 [2019-11-06 22:59:13,635 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,656 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,657 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,657 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:42, output treesize:23 [2019-11-06 22:59:13,680 INFO L392 ElimStorePlain]: Different costs {2=[|#memory_$Pointer$.base|], 6=[|v_#memory_$Pointer$.base_20|]} [2019-11-06 22:59:13,687 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:13,700 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,720 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,721 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-11-06 22:59:13,723 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:13,729 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,741 INFO L567 ElimStorePlain]: treesize reduction 23, result has 28.1 percent of original size [2019-11-06 22:59:13,742 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,743 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:66, output treesize:4 [2019-11-06 22:59:13,746 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:13,746 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-11-06 22:59:13,760 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:13,765 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,766 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-11-06 22:59:13,767 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:29, output treesize:18 [2019-11-06 22:59:13,815 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-06 22:59:13,828 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-06 22:59:13,829 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-11-06 22:59:13,829 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:39, output treesize:18 [2019-11-06 22:59:13,848 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 178 treesize of output 174 [2019-11-06 22:59:13,853 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-11-06 22:59:14,010 WARN L191 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 32 [2019-11-06 22:59:14,011 INFO L567 ElimStorePlain]: treesize reduction 127, result has 28.7 percent of original size [2019-11-06 22:59:14,011 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:14,016 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:14,017 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:14,022 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-06 22:59:14,031 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2019-11-06 22:59:14,032 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:47, output treesize:43 [2019-11-06 22:59:14,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-06 22:59:14,134 INFO L337 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [1555075915] [2019-11-06 22:59:14,140 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 18 [2019-11-06 22:59:14,180 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-11-06 22:59:14,180 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-11-06 22:59:14,257 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-11-06 22:59:14,258 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 31 variables. [2019-11-06 22:59:14,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-06 22:59:14,263 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-11-06 22:59:14,297 INFO L227 lantSequenceWeakener]: Weakened 4 states. On average, predicates are now at 100% of their original sizes. [2019-11-06 22:59:14,297 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-11-06 22:59:14,299 INFO L553 sIntCurrentIteration]: We unified 16 AI predicates to 16 [2019-11-06 22:59:14,299 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-11-06 22:59:14,300 INFO L218 FreeRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-11-06 22:59:14,300 INFO L231 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5, 5, 5] total 8 [2019-11-06 22:59:14,301 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070755078] [2019-11-06 22:59:14,301 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-11-06 22:59:14,301 INFO L141 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-11-06 22:59:14,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-06 22:59:14,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:59:14,302 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand 2 states. [2019-11-06 22:59:14,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-06 22:59:14,304 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2019-11-06 22:59:14,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-11-06 22:59:14,304 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 17 [2019-11-06 22:59:14,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-06 22:59:14,305 INFO L225 Difference]: With dead ends: 38 [2019-11-06 22:59:14,305 INFO L226 Difference]: Without dead ends: 0 [2019-11-06 22:59:14,305 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-11-06 22:59:14,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-11-06 22:59:14,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-11-06 22:59:14,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-11-06 22:59:14,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-11-06 22:59:14,306 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-11-06 22:59:14,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-06 22:59:14,307 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-06 22:59:14,307 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-11-06 22:59:14,307 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-11-06 22:59:14,307 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-11-06 22:59:14,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-06 22:59:14,515 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-11-06 22:59:14,576 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:14,576 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:14,576 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:14,576 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-11-06 22:59:14,577 INFO L446 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2019-11-06 22:59:14,577 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-11-06 22:59:14,577 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-11-06 22:59:14,577 INFO L443 ceAbstractionStarter]: For program point L993-1(lines 993 1013) no Hoare annotation was computed. [2019-11-06 22:59:14,577 INFO L443 ceAbstractionStarter]: For program point L993-3(lines 993 1013) no Hoare annotation was computed. [2019-11-06 22:59:14,577 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 982 1036) no Hoare annotation was computed. [2019-11-06 22:59:14,577 INFO L443 ceAbstractionStarter]: For program point L1002(lines 1002 1007) no Hoare annotation was computed. [2019-11-06 22:59:14,577 INFO L443 ceAbstractionStarter]: For program point L1027-1(lines 1027 1032) no Hoare annotation was computed. [2019-11-06 22:59:14,577 INFO L446 ceAbstractionStarter]: At program point L1027-3(lines 1027 1032) the Hoare annotation is: true [2019-11-06 22:59:14,578 INFO L443 ceAbstractionStarter]: For program point L1027-4(lines 1027 1032) no Hoare annotation was computed. [2019-11-06 22:59:14,578 INFO L443 ceAbstractionStarter]: For program point L1019(lines 1019 1023) no Hoare annotation was computed. [2019-11-06 22:59:14,578 INFO L443 ceAbstractionStarter]: For program point L1019-2(lines 983 1036) no Hoare annotation was computed. [2019-11-06 22:59:14,578 INFO L443 ceAbstractionStarter]: For program point L1019-3(lines 1019 1023) no Hoare annotation was computed. [2019-11-06 22:59:14,578 INFO L443 ceAbstractionStarter]: For program point L1012-1(line 1012) no Hoare annotation was computed. [2019-11-06 22:59:14,578 INFO L443 ceAbstractionStarter]: For program point L1012-3(line 1012) no Hoare annotation was computed. [2019-11-06 22:59:14,578 INFO L439 ceAbstractionStarter]: At program point L1012-4(line 1012) the Hoare annotation is: false [2019-11-06 22:59:14,579 INFO L439 ceAbstractionStarter]: At program point L1012-5(lines 993 1013) the Hoare annotation is: false [2019-11-06 22:59:14,579 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 982 1036) no Hoare annotation was computed. [2019-11-06 22:59:14,579 INFO L443 ceAbstractionStarter]: For program point L1004(lines 1004 1007) no Hoare annotation was computed. [2019-11-06 22:59:14,579 INFO L446 ceAbstractionStarter]: At program point mainENTRY(lines 982 1036) the Hoare annotation is: true [2019-11-06 22:59:14,579 INFO L443 ceAbstractionStarter]: For program point L1021-1(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:14,579 INFO L443 ceAbstractionStarter]: For program point L1021-3(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:14,579 INFO L443 ceAbstractionStarter]: For program point L1021-4(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:14,579 INFO L443 ceAbstractionStarter]: For program point L1021-6(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:14,580 INFO L439 ceAbstractionStarter]: At program point L1021-7(line 1021) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (.cse1 (select |#memory_$Pointer$.base| main_~x~0.base))) (and (= main_~head~0.offset .cse0) (= main_~head~0.offset main_~x~0.offset) (= 0 .cse0) (= (select (select |#memory_int| (select .cse1 main_~x~0.offset)) 4) 1) (= 1 main_~state~0) (= main_~head~0.base main_~x~0.base) (= (select .cse1 main_~head~0.offset) main_~head~0.base))) [2019-11-06 22:59:14,580 INFO L443 ceAbstractionStarter]: For program point L1021-8(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:14,580 INFO L443 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 1021) no Hoare annotation was computed. [2019-11-06 22:59:14,580 INFO L443 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 1012) no Hoare annotation was computed. [2019-11-06 22:59:14,580 INFO L443 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:14,581 INFO L443 ceAbstractionStarter]: For program point L1000(lines 1000 1008) no Hoare annotation was computed. [2019-11-06 22:59:14,581 INFO L443 ceAbstractionStarter]: For program point L1000-1(lines 1000 1008) no Hoare annotation was computed. [2019-11-06 22:59:14,581 INFO L443 ceAbstractionStarter]: For program point L1017-1(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:14,581 INFO L443 ceAbstractionStarter]: For program point L1017-3(line 1017) no Hoare annotation was computed. [2019-11-06 22:59:14,581 INFO L439 ceAbstractionStarter]: At program point L1017-4(line 1017) the Hoare annotation is: (let ((.cse0 (select (select |#memory_$Pointer$.offset| main_~x~0.base) main_~head~0.offset)) (.cse1 (select |#memory_$Pointer$.base| main_~x~0.base))) (and (= main_~head~0.offset .cse0) (not (= 0 main_~x~0.base)) (= main_~head~0.offset main_~x~0.offset) (= 0 .cse0) (= (select (select |#memory_int| (select .cse1 main_~x~0.offset)) 4) 1) (= 1 main_~state~0) (= main_~head~0.base main_~x~0.base) (= (select .cse1 main_~head~0.offset) main_~head~0.base))) [2019-11-06 22:59:14,590 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,591 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,592 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,593 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,594 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,595 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,596 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,597 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,597 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,598 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,598 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,599 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,599 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,599 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,600 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,601 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,602 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,602 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,603 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,605 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 10:59:14 BoogieIcfgContainer [2019-11-06 22:59:14,606 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-06 22:59:14,608 INFO L168 Benchmark]: Toolchain (without parser) took 4040.29 ms. Allocated memory was 143.7 MB in the beginning and 250.6 MB in the end (delta: 107.0 MB). Free memory was 100.1 MB in the beginning and 160.5 MB in the end (delta: -60.4 MB). Peak memory consumption was 46.5 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:14,609 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-11-06 22:59:14,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 614.34 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 169.2 MB in the end (delta: -69.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:14,610 INFO L168 Benchmark]: Boogie Preprocessor took 76.58 ms. Allocated memory is still 202.4 MB. Free memory was 169.2 MB in the beginning and 166.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:14,611 INFO L168 Benchmark]: RCFGBuilder took 639.18 ms. Allocated memory is still 202.4 MB. Free memory was 166.4 MB in the beginning and 122.7 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:14,612 INFO L168 Benchmark]: TraceAbstraction took 2705.39 ms. Allocated memory was 202.4 MB in the beginning and 250.6 MB in the end (delta: 48.2 MB). Free memory was 122.0 MB in the beginning and 160.5 MB in the end (delta: -38.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2019-11-06 22:59:14,616 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.22 ms. Allocated memory is still 143.7 MB. Free memory was 120.0 MB in the beginning and 119.8 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 614.34 ms. Allocated memory was 143.7 MB in the beginning and 202.4 MB in the end (delta: 58.7 MB). Free memory was 99.9 MB in the beginning and 169.2 MB in the end (delta: -69.3 MB). Peak memory consumption was 21.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 76.58 ms. Allocated memory is still 202.4 MB. Free memory was 169.2 MB in the beginning and 166.4 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 639.18 ms. Allocated memory is still 202.4 MB. Free memory was 166.4 MB in the beginning and 122.7 MB in the end (delta: 43.7 MB). Peak memory consumption was 43.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2705.39 ms. Allocated memory was 202.4 MB in the beginning and 250.6 MB in the end (delta: 48.2 MB). Free memory was 122.0 MB in the beginning and 160.5 MB in the end (delta: -38.5 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * 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_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1017]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1012]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 1021]: 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: 1012]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1027]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 1017]: Loop Invariant [2019-11-06 22:59:14,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,636 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,637 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,639 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,639 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,640 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,641 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,645 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,646 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,646 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,646 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,646 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((head == #memory_$Pointer$[x][head] && !(0 == x)) && head == x) && 0 == #memory_$Pointer$[x][head]) && unknown-#memory_int-unknown[#memory_$Pointer$[x][x]][4] == 1) && 1 == state) && head == x) && #memory_$Pointer$[x][head] == head - InvariantResult [Line: 993]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 1021]: Loop Invariant [2019-11-06 22:59:14,647 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,647 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,647 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,648 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,648 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,649 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,649 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,649 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-11-06 22:59:14,650 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,650 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-11-06 22:59:14,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,650 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-06 22:59:14,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-11-06 22:59:14,651 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((head == #memory_$Pointer$[x][head] && head == x) && 0 == #memory_$Pointer$[x][head]) && unknown-#memory_int-unknown[#memory_$Pointer$[x][x]][4] == 1) && 1 == state) && head == x) && #memory_$Pointer$[x][head] == head - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 38 locations, 3 error locations. Result: SAFE, OverallTime: 2.6s, OverallIterations: 6, TraceHistogramMax: 2, AutomataDifference: 0.4s, 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, 60 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s 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, 95 HoareAnnotationTreeSize, 9 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.1s InterpolantComputationTime, 103 NumberOfCodeBlocks, 103 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 112 ConstructedInterpolants, 9 QuantifiedInterpolants, 14002 SizeOfPredicates, 7 NumberOfNonLiveVariables, 97 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 8 InterpolantComputations, 5 PerfectInterpolantSequences, 0/6 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 123, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.890625, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9375, 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...