java -ea -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_true-unreach-call.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-370d6ab [2018-11-14 17:25:00,406 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-14 17:25:00,409 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-14 17:25:00,426 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-14 17:25:00,426 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-14 17:25:00,427 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-14 17:25:00,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-14 17:25:00,432 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-14 17:25:00,434 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-14 17:25:00,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-14 17:25:00,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-14 17:25:00,442 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-14 17:25:00,443 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-14 17:25:00,447 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-14 17:25:00,450 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-14 17:25:00,451 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-14 17:25:00,452 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-14 17:25:00,455 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-14 17:25:00,460 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-14 17:25:00,465 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-14 17:25:00,466 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-14 17:25:00,468 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-14 17:25:00,470 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-14 17:25:00,470 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-14 17:25:00,470 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-14 17:25:00,471 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-14 17:25:00,472 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-14 17:25:00,474 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-14 17:25:00,475 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-14 17:25:00,476 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-14 17:25:00,476 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-14 17:25:00,477 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-14 17:25:00,477 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-14 17:25:00,479 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-14 17:25:00,480 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-14 17:25:00,481 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-14 17:25:00,482 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2018-11-14 17:25:00,504 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-14 17:25:00,504 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-14 17:25:00,505 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-14 17:25:00,505 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-11-14 17:25:00,506 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-14 17:25:00,506 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-14 17:25:00,506 INFO L133 SettingsManager]: * Use SBE=true [2018-11-14 17:25:00,506 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-14 17:25:00,509 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-14 17:25:00,509 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-14 17:25:00,509 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-14 17:25:00,509 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-14 17:25:00,509 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-14 17:25:00,510 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-14 17:25:00,510 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-14 17:25:00,510 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-14 17:25:00,510 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-14 17:25:00,510 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-14 17:25:00,511 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-14 17:25:00,511 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-14 17:25:00,511 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-14 17:25:00,511 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-14 17:25:00,511 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-14 17:25:00,511 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-14 17:25:00,512 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-14 17:25:00,512 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-14 17:25:00,512 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-14 17:25:00,512 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-14 17:25:00,512 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-14 17:25:00,513 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-14 17:25:00,559 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-14 17:25:00,572 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-14 17:25:00,576 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-14 17:25:00,578 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-14 17:25:00,578 INFO L276 PluginConnector]: CDTParser initialized [2018-11-14 17:25:00,579 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-14 17:25:00,642 INFO L218 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099e0dbf3/9eefa9096a4f484494079ebf5bfc0d46/FLAGd5f3ea8c7 [2018-11-14 17:25:01,237 INFO L298 CDTParser]: Found 1 translation units. [2018-11-14 17:25:01,237 INFO L158 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-14 17:25:01,263 INFO L346 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099e0dbf3/9eefa9096a4f484494079ebf5bfc0d46/FLAGd5f3ea8c7 [2018-11-14 17:25:01,277 INFO L354 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/099e0dbf3/9eefa9096a4f484494079ebf5bfc0d46 [2018-11-14 17:25:01,287 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-14 17:25:01,289 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-11-14 17:25:01,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-14 17:25:01,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-14 17:25:01,294 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-14 17:25:01,296 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:01" (1/1) ... [2018-11-14 17:25:01,299 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24aacce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:01, skipping insertion in model container [2018-11-14 17:25:01,299 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.11 05:25:01" (1/1) ... [2018-11-14 17:25:01,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-14 17:25:01,371 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-14 17:25:01,804 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:25:01,817 INFO L191 MainTranslator]: Completed pre-run [2018-11-14 17:25:01,915 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-14 17:25:02,062 INFO L195 MainTranslator]: Completed translation [2018-11-14 17:25:02,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02 WrapperNode [2018-11-14 17:25:02,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-14 17:25:02,063 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-14 17:25:02,063 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-14 17:25:02,064 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-14 17:25:02,078 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (1/1) ... [2018-11-14 17:25:02,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (1/1) ... [2018-11-14 17:25:02,100 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (1/1) ... [2018-11-14 17:25:02,102 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (1/1) ... [2018-11-14 17:25:02,158 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (1/1) ... [2018-11-14 17:25:02,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (1/1) ... [2018-11-14 17:25:02,172 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (1/1) ... [2018-11-14 17:25:02,180 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-14 17:25:02,184 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-14 17:25:02,184 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-14 17:25:02,184 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-14 17:25:02,185 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (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 [2018-11-14 17:25:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-14 17:25:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-14 17:25:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_32 [2018-11-14 17:25:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __bswap_64 [2018-11-14 17:25:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-14 17:25:02,247 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_or_die [2018-11-14 17:25:02,248 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2018-11-14 17:25:02,248 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2018-11-14 17:25:02,248 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2018-11-14 17:25:02,249 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-14 17:25:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-11-14 17:25:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-11-14 17:25:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure __ctype_get_mb_cur_max [2018-11-14 17:25:02,249 INFO L130 BoogieDeclarations]: Found specification of procedure atof [2018-11-14 17:25:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure atoi [2018-11-14 17:25:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure atol [2018-11-14 17:25:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure atoll [2018-11-14 17:25:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtod [2018-11-14 17:25:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtof [2018-11-14 17:25:02,250 INFO L130 BoogieDeclarations]: Found specification of procedure strtold [2018-11-14 17:25:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtol [2018-11-14 17:25:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtoul [2018-11-14 17:25:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtoq [2018-11-14 17:25:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtouq [2018-11-14 17:25:02,251 INFO L130 BoogieDeclarations]: Found specification of procedure strtoll [2018-11-14 17:25:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure strtoull [2018-11-14 17:25:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure l64a [2018-11-14 17:25:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure a64l [2018-11-14 17:25:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_32 [2018-11-14 17:25:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure __bswap_64 [2018-11-14 17:25:02,252 INFO L130 BoogieDeclarations]: Found specification of procedure select [2018-11-14 17:25:02,253 INFO L130 BoogieDeclarations]: Found specification of procedure pselect [2018-11-14 17:25:02,253 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_major [2018-11-14 17:25:02,253 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_minor [2018-11-14 17:25:02,253 INFO L130 BoogieDeclarations]: Found specification of procedure gnu_dev_makedev [2018-11-14 17:25:02,253 INFO L130 BoogieDeclarations]: Found specification of procedure random [2018-11-14 17:25:02,253 INFO L130 BoogieDeclarations]: Found specification of procedure srandom [2018-11-14 17:25:02,253 INFO L130 BoogieDeclarations]: Found specification of procedure initstate [2018-11-14 17:25:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure setstate [2018-11-14 17:25:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure random_r [2018-11-14 17:25:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure srandom_r [2018-11-14 17:25:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure initstate_r [2018-11-14 17:25:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure setstate_r [2018-11-14 17:25:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure rand [2018-11-14 17:25:02,254 INFO L130 BoogieDeclarations]: Found specification of procedure srand [2018-11-14 17:25:02,255 INFO L130 BoogieDeclarations]: Found specification of procedure rand_r [2018-11-14 17:25:02,255 INFO L130 BoogieDeclarations]: Found specification of procedure drand48 [2018-11-14 17:25:02,255 INFO L130 BoogieDeclarations]: Found specification of procedure erand48 [2018-11-14 17:25:02,255 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48 [2018-11-14 17:25:02,255 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48 [2018-11-14 17:25:02,255 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48 [2018-11-14 17:25:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48 [2018-11-14 17:25:02,256 INFO L130 BoogieDeclarations]: Found specification of procedure srand48 [2018-11-14 17:25:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure seed48 [2018-11-14 17:25:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48 [2018-11-14 17:25:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure drand48_r [2018-11-14 17:25:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure erand48_r [2018-11-14 17:25:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure lrand48_r [2018-11-14 17:25:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure nrand48_r [2018-11-14 17:25:02,257 INFO L130 BoogieDeclarations]: Found specification of procedure mrand48_r [2018-11-14 17:25:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure jrand48_r [2018-11-14 17:25:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure srand48_r [2018-11-14 17:25:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure seed48_r [2018-11-14 17:25:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure lcong48_r [2018-11-14 17:25:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2018-11-14 17:25:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2018-11-14 17:25:02,258 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2018-11-14 17:25:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure free [2018-11-14 17:25:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure cfree [2018-11-14 17:25:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2018-11-14 17:25:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure valloc [2018-11-14 17:25:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure posix_memalign [2018-11-14 17:25:02,259 INFO L130 BoogieDeclarations]: Found specification of procedure aligned_alloc [2018-11-14 17:25:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2018-11-14 17:25:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure atexit [2018-11-14 17:25:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure at_quick_exit [2018-11-14 17:25:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure on_exit [2018-11-14 17:25:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-14 17:25:02,260 INFO L130 BoogieDeclarations]: Found specification of procedure quick_exit [2018-11-14 17:25:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure _Exit [2018-11-14 17:25:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure getenv [2018-11-14 17:25:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure putenv [2018-11-14 17:25:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure setenv [2018-11-14 17:25:02,261 INFO L130 BoogieDeclarations]: Found specification of procedure unsetenv [2018-11-14 17:25:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure clearenv [2018-11-14 17:25:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure mktemp [2018-11-14 17:25:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemp [2018-11-14 17:25:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkstemps [2018-11-14 17:25:02,262 INFO L130 BoogieDeclarations]: Found specification of procedure mkdtemp [2018-11-14 17:25:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure system [2018-11-14 17:25:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure realpath [2018-11-14 17:25:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure bsearch [2018-11-14 17:25:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure qsort [2018-11-14 17:25:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure abs [2018-11-14 17:25:02,263 INFO L130 BoogieDeclarations]: Found specification of procedure labs [2018-11-14 17:25:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure llabs [2018-11-14 17:25:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure div [2018-11-14 17:25:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldiv [2018-11-14 17:25:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure lldiv [2018-11-14 17:25:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt [2018-11-14 17:25:02,264 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt [2018-11-14 17:25:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure gcvt [2018-11-14 17:25:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt [2018-11-14 17:25:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt [2018-11-14 17:25:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure qgcvt [2018-11-14 17:25:02,265 INFO L130 BoogieDeclarations]: Found specification of procedure ecvt_r [2018-11-14 17:25:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure fcvt_r [2018-11-14 17:25:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure qecvt_r [2018-11-14 17:25:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure qfcvt_r [2018-11-14 17:25:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure mblen [2018-11-14 17:25:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure mbtowc [2018-11-14 17:25:02,266 INFO L130 BoogieDeclarations]: Found specification of procedure wctomb [2018-11-14 17:25:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure mbstowcs [2018-11-14 17:25:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure wcstombs [2018-11-14 17:25:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure rpmatch [2018-11-14 17:25:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure getsubopt [2018-11-14 17:25:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure getloadavg [2018-11-14 17:25:02,267 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_or_die [2018-11-14 17:25:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-14 17:25:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2018-11-14 17:25:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-14 17:25:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-14 17:25:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2018-11-14 17:25:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2018-11-14 17:25:02,268 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-14 17:25:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-14 17:25:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-14 17:25:02,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-14 17:25:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-14 17:25:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-14 17:25:02,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2018-11-14 17:25:03,969 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-14 17:25:03,969 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:03 BoogieIcfgContainer [2018-11-14 17:25:03,970 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-14 17:25:03,971 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-14 17:25:03,972 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-14 17:25:03,975 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-14 17:25:03,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.11 05:25:01" (1/3) ... [2018-11-14 17:25:03,976 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2e386a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:03, skipping insertion in model container [2018-11-14 17:25:03,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.11 05:25:02" (2/3) ... [2018-11-14 17:25:03,977 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a2e386a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.11 05:25:03, skipping insertion in model container [2018-11-14 17:25:03,977 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.11 05:25:03" (3/3) ... [2018-11-14 17:25:03,979 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-14 17:25:03,989 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-14 17:25:04,002 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-14 17:25:04,022 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-14 17:25:04,062 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-14 17:25:04,063 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-14 17:25:04,063 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-14 17:25:04,063 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-14 17:25:04,063 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-14 17:25:04,065 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-14 17:25:04,065 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-14 17:25:04,065 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-14 17:25:04,065 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-14 17:25:04,091 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states. [2018-11-14 17:25:04,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-14 17:25:04,098 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:04,099 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:04,102 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:04,107 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:04,107 INFO L82 PathProgramCache]: Analyzing trace with hash 840514556, now seen corresponding path program 1 times [2018-11-14 17:25:04,110 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:04,110 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:04,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:04,169 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:04,169 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:04,336 INFO L256 TraceCheckUtils]: 0: Hoare triple {63#true} call ULTIMATE.init(); {63#true} is VALID [2018-11-14 17:25:04,341 INFO L273 TraceCheckUtils]: 1: Hoare triple {63#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {63#true} is VALID [2018-11-14 17:25:04,342 INFO L273 TraceCheckUtils]: 2: Hoare triple {63#true} assume true; {63#true} is VALID [2018-11-14 17:25:04,343 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {63#true} {63#true} #170#return; {63#true} is VALID [2018-11-14 17:25:04,343 INFO L256 TraceCheckUtils]: 4: Hoare triple {63#true} call #t~ret38 := main(); {63#true} is VALID [2018-11-14 17:25:04,345 INFO L273 TraceCheckUtils]: 5: Hoare triple {63#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {63#true} is VALID [2018-11-14 17:25:04,345 INFO L273 TraceCheckUtils]: 6: Hoare triple {63#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {63#true} is VALID [2018-11-14 17:25:04,346 INFO L273 TraceCheckUtils]: 7: Hoare triple {63#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {63#true} is VALID [2018-11-14 17:25:04,356 INFO L273 TraceCheckUtils]: 8: Hoare triple {63#true} assume !true; {64#false} is VALID [2018-11-14 17:25:04,357 INFO L273 TraceCheckUtils]: 9: Hoare triple {64#false} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {64#false} is VALID [2018-11-14 17:25:04,357 INFO L273 TraceCheckUtils]: 10: Hoare triple {64#false} assume true; {64#false} is VALID [2018-11-14 17:25:04,358 INFO L273 TraceCheckUtils]: 11: Hoare triple {64#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {64#false} is VALID [2018-11-14 17:25:04,358 INFO L273 TraceCheckUtils]: 12: Hoare triple {64#false} assume #t~mem34 != 1;havoc #t~mem34; {64#false} is VALID [2018-11-14 17:25:04,360 INFO L273 TraceCheckUtils]: 13: Hoare triple {64#false} assume !false; {64#false} is VALID [2018-11-14 17:25:04,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:04,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:04,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-14 17:25:04,374 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:25:04,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:04,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-14 17:25:04,603 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:04,603 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-14 17:25:04,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-14 17:25:04,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-14 17:25:04,617 INFO L87 Difference]: Start difference. First operand 60 states. Second operand 2 states. [2018-11-14 17:25:04,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:04,853 INFO L93 Difference]: Finished difference Result 103 states and 134 transitions. [2018-11-14 17:25:04,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-14 17:25:04,854 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-11-14 17:25:04,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:04,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:25:04,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 134 transitions. [2018-11-14 17:25:04,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-14 17:25:04,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 134 transitions. [2018-11-14 17:25:04,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 134 transitions. [2018-11-14 17:25:05,226 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:05,236 INFO L225 Difference]: With dead ends: 103 [2018-11-14 17:25:05,236 INFO L226 Difference]: Without dead ends: 20 [2018-11-14 17:25:05,240 INFO L604 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 [2018-11-14 17:25:05,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-14 17:25:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-11-14 17:25:05,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:05,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand 20 states. [2018-11-14 17:25:05,284 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:25:05,284 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:25:05,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:05,287 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 17:25:05,288 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:25:05,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:05,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:05,289 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 20 states. [2018-11-14 17:25:05,289 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 20 states. [2018-11-14 17:25:05,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:05,292 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2018-11-14 17:25:05,292 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:25:05,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:05,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:05,293 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:05,293 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:05,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-14 17:25:05,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-14 17:25:05,297 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2018-11-14 17:25:05,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:05,297 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-14 17:25:05,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-14 17:25:05,298 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-14 17:25:05,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-11-14 17:25:05,298 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:05,299 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:05,299 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:05,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:05,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2009858230, now seen corresponding path program 1 times [2018-11-14 17:25:05,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:05,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:05,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:05,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:05,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:05,485 INFO L256 TraceCheckUtils]: 0: Hoare triple {266#true} call ULTIMATE.init(); {266#true} is VALID [2018-11-14 17:25:05,485 INFO L273 TraceCheckUtils]: 1: Hoare triple {266#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {266#true} is VALID [2018-11-14 17:25:05,485 INFO L273 TraceCheckUtils]: 2: Hoare triple {266#true} assume true; {266#true} is VALID [2018-11-14 17:25:05,486 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {266#true} {266#true} #170#return; {266#true} is VALID [2018-11-14 17:25:05,486 INFO L256 TraceCheckUtils]: 4: Hoare triple {266#true} call #t~ret38 := main(); {266#true} is VALID [2018-11-14 17:25:05,486 INFO L273 TraceCheckUtils]: 5: Hoare triple {266#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {266#true} is VALID [2018-11-14 17:25:05,486 INFO L273 TraceCheckUtils]: 6: Hoare triple {266#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {266#true} is VALID [2018-11-14 17:25:05,487 INFO L273 TraceCheckUtils]: 7: Hoare triple {266#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:05,491 INFO L273 TraceCheckUtils]: 8: Hoare triple {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:05,492 INFO L273 TraceCheckUtils]: 9: Hoare triple {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:05,495 INFO L273 TraceCheckUtils]: 10: Hoare triple {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet31 != 0);havoc #t~nondet31; {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:05,496 INFO L273 TraceCheckUtils]: 11: Hoare triple {268#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {269#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:25:05,497 INFO L273 TraceCheckUtils]: 12: Hoare triple {269#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {269#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:25:05,498 INFO L273 TraceCheckUtils]: 13: Hoare triple {269#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {270#(= 1 |main_#t~mem34|)} is VALID [2018-11-14 17:25:05,499 INFO L273 TraceCheckUtils]: 14: Hoare triple {270#(= 1 |main_#t~mem34|)} assume #t~mem34 != 1;havoc #t~mem34; {267#false} is VALID [2018-11-14 17:25:05,500 INFO L273 TraceCheckUtils]: 15: Hoare triple {267#false} assume !false; {267#false} is VALID [2018-11-14 17:25:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:05,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-14 17:25:05,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-14 17:25:05,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:25:05,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:05,505 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-14 17:25:05,582 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:05,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-14 17:25:05,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-14 17:25:05,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-14 17:25:05,584 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2018-11-14 17:25:05,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:05,927 INFO L93 Difference]: Finished difference Result 38 states and 40 transitions. [2018-11-14 17:25:05,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:25:05,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2018-11-14 17:25:05,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:05,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:25:05,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-14 17:25:05,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-14 17:25:05,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 40 transitions. [2018-11-14 17:25:05,932 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 40 transitions. [2018-11-14 17:25:05,989 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:05,992 INFO L225 Difference]: With dead ends: 38 [2018-11-14 17:25:05,993 INFO L226 Difference]: Without dead ends: 36 [2018-11-14 17:25:05,994 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-11-14 17:25:05,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-11-14 17:25:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 27. [2018-11-14 17:25:06,008 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:06,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand 27 states. [2018-11-14 17:25:06,009 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand 27 states. [2018-11-14 17:25:06,009 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 27 states. [2018-11-14 17:25:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:06,012 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:25:06,013 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:25:06,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:06,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:06,014 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 36 states. [2018-11-14 17:25:06,014 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 36 states. [2018-11-14 17:25:06,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:06,017 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2018-11-14 17:25:06,017 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2018-11-14 17:25:06,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:06,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:06,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:06,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:06,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-14 17:25:06,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-14 17:25:06,020 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 16 [2018-11-14 17:25:06,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:06,021 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-14 17:25:06,021 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-14 17:25:06,021 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-14 17:25:06,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-14 17:25:06,022 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:06,022 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:06,023 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:06,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:06,023 INFO L82 PathProgramCache]: Analyzing trace with hash 1294582226, now seen corresponding path program 1 times [2018-11-14 17:25:06,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:06,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:06,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:06,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:06,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:06,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:06,315 INFO L256 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {431#true} is VALID [2018-11-14 17:25:06,315 INFO L273 TraceCheckUtils]: 1: Hoare triple {431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {431#true} is VALID [2018-11-14 17:25:06,315 INFO L273 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2018-11-14 17:25:06,316 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {431#true} {431#true} #170#return; {431#true} is VALID [2018-11-14 17:25:06,316 INFO L256 TraceCheckUtils]: 4: Hoare triple {431#true} call #t~ret38 := main(); {431#true} is VALID [2018-11-14 17:25:06,317 INFO L273 TraceCheckUtils]: 5: Hoare triple {431#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {433#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:25:06,317 INFO L273 TraceCheckUtils]: 6: Hoare triple {433#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {433#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:25:06,318 INFO L273 TraceCheckUtils]: 7: Hoare triple {433#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,319 INFO L273 TraceCheckUtils]: 8: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume true; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,320 INFO L273 TraceCheckUtils]: 9: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,321 INFO L273 TraceCheckUtils]: 10: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet31 != 0);havoc #t~nondet31; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,322 INFO L273 TraceCheckUtils]: 11: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,324 INFO L273 TraceCheckUtils]: 12: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume true; {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,325 INFO L273 TraceCheckUtils]: 13: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,326 INFO L273 TraceCheckUtils]: 14: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(#t~mem34 != 1);havoc #t~mem34; {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,327 INFO L273 TraceCheckUtils]: 15: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:25:06,329 INFO L273 TraceCheckUtils]: 16: Hoare triple {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:25:06,330 INFO L273 TraceCheckUtils]: 17: Hoare triple {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {432#false} is VALID [2018-11-14 17:25:06,330 INFO L273 TraceCheckUtils]: 18: Hoare triple {432#false} assume #t~mem34 != 1;havoc #t~mem34; {432#false} is VALID [2018-11-14 17:25:06,331 INFO L273 TraceCheckUtils]: 19: Hoare triple {432#false} assume !false; {432#false} is VALID [2018-11-14 17:25:06,334 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:06,334 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:25:06,335 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:25:06,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:06,386 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:25:06,524 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-14 17:25:06,532 INFO L477 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 8 treesize of output 7 [2018-11-14 17:25:06,535 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,539 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-11-14 17:25:06,558 INFO L477 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 8 treesize of output 7 [2018-11-14 17:25:06,561 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,563 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,578 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-14 17:25:06,719 INFO L477 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 15 treesize of output 11 [2018-11-14 17:25:06,727 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:25:06,728 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,734 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,744 INFO L477 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 15 treesize of output 11 [2018-11-14 17:25:06,753 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:25:06,755 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,757 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,763 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:06,763 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-14 17:25:06,767 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:25:06,772 INFO L256 TraceCheckUtils]: 0: Hoare triple {431#true} call ULTIMATE.init(); {431#true} is VALID [2018-11-14 17:25:06,773 INFO L273 TraceCheckUtils]: 1: Hoare triple {431#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {431#true} is VALID [2018-11-14 17:25:06,774 INFO L273 TraceCheckUtils]: 2: Hoare triple {431#true} assume true; {431#true} is VALID [2018-11-14 17:25:06,774 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {431#true} {431#true} #170#return; {431#true} is VALID [2018-11-14 17:25:06,775 INFO L256 TraceCheckUtils]: 4: Hoare triple {431#true} call #t~ret38 := main(); {431#true} is VALID [2018-11-14 17:25:06,781 INFO L273 TraceCheckUtils]: 5: Hoare triple {431#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {433#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:25:06,782 INFO L273 TraceCheckUtils]: 6: Hoare triple {433#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {433#(= 0 main_~a~0.offset)} is VALID [2018-11-14 17:25:06,783 INFO L273 TraceCheckUtils]: 7: Hoare triple {433#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,785 INFO L273 TraceCheckUtils]: 8: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume true; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,787 INFO L273 TraceCheckUtils]: 9: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,787 INFO L273 TraceCheckUtils]: 10: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(#t~nondet31 != 0);havoc #t~nondet31; {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:06,789 INFO L273 TraceCheckUtils]: 11: Hoare triple {434#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,795 INFO L273 TraceCheckUtils]: 12: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume true; {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,797 INFO L273 TraceCheckUtils]: 13: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,797 INFO L273 TraceCheckUtils]: 14: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} assume !(#t~mem34 != 1);havoc #t~mem34; {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} is VALID [2018-11-14 17:25:06,799 INFO L273 TraceCheckUtils]: 15: Hoare triple {435#(and (= 0 (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))) (= main_~p~0.offset 0) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))} call #t~mem35.base, #t~mem35.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:25:06,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume true; {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-14 17:25:06,801 INFO L273 TraceCheckUtils]: 17: Hoare triple {436#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {432#false} is VALID [2018-11-14 17:25:06,802 INFO L273 TraceCheckUtils]: 18: Hoare triple {432#false} assume #t~mem34 != 1;havoc #t~mem34; {432#false} is VALID [2018-11-14 17:25:06,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {432#false} assume !false; {432#false} is VALID [2018-11-14 17:25:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:06,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:25:06,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-14 17:25:06,831 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:25:06,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:06,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-14 17:25:06,912 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:06,912 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-14 17:25:06,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-14 17:25:06,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-14 17:25:06,913 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 6 states. [2018-11-14 17:25:07,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:07,250 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2018-11-14 17:25:07,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-14 17:25:07,250 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-11-14 17:25:07,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:25:07,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-14 17:25:07,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-14 17:25:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 46 transitions. [2018-11-14 17:25:07,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 46 transitions. [2018-11-14 17:25:07,318 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:07,321 INFO L225 Difference]: With dead ends: 44 [2018-11-14 17:25:07,321 INFO L226 Difference]: Without dead ends: 31 [2018-11-14 17:25:07,322 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 4 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-11-14 17:25:07,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-14 17:25:07,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-14 17:25:07,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:07,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-14 17:25:07,344 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-14 17:25:07,344 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-14 17:25:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:07,346 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 17:25:07,346 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-14 17:25:07,347 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:07,347 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:07,347 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-14 17:25:07,348 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-14 17:25:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:07,350 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-14 17:25:07,350 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2018-11-14 17:25:07,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:07,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:07,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:07,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:07,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-14 17:25:07,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2018-11-14 17:25:07,353 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 20 [2018-11-14 17:25:07,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:07,353 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2018-11-14 17:25:07,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-14 17:25:07,353 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2018-11-14 17:25:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-14 17:25:07,354 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:07,355 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:07,355 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:07,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash -339761261, now seen corresponding path program 1 times [2018-11-14 17:25:07,355 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:07,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:07,357 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:07,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:07,574 INFO L256 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {647#true} is VALID [2018-11-14 17:25:07,575 INFO L273 TraceCheckUtils]: 1: Hoare triple {647#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {647#true} is VALID [2018-11-14 17:25:07,575 INFO L273 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2018-11-14 17:25:07,576 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #170#return; {647#true} is VALID [2018-11-14 17:25:07,576 INFO L256 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret38 := main(); {647#true} is VALID [2018-11-14 17:25:07,577 INFO L273 TraceCheckUtils]: 5: Hoare triple {647#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {649#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:25:07,578 INFO L273 TraceCheckUtils]: 6: Hoare triple {649#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {649#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:25:07,579 INFO L273 TraceCheckUtils]: 7: Hoare triple {649#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:07,580 INFO L273 TraceCheckUtils]: 8: Hoare triple {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:07,582 INFO L273 TraceCheckUtils]: 9: Hoare triple {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:07,583 INFO L273 TraceCheckUtils]: 10: Hoare triple {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet31 != 0);havoc #t~nondet31;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:07,585 INFO L273 TraceCheckUtils]: 11: Hoare triple {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:07,587 INFO L273 TraceCheckUtils]: 12: Hoare triple {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:25:07,588 INFO L273 TraceCheckUtils]: 13: Hoare triple {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} assume true; {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:25:07,588 INFO L273 TraceCheckUtils]: 14: Hoare triple {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:25:07,589 INFO L273 TraceCheckUtils]: 15: Hoare triple {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} assume !(#t~nondet31 != 0);havoc #t~nondet31; {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} is VALID [2018-11-14 17:25:07,591 INFO L273 TraceCheckUtils]: 16: Hoare triple {652#(= 1 (select (select (store |#memory_int| main_~p~0.base (store (select |#memory_int| main_~p~0.base) main_~p~0.offset 1)) main_~a~0.base) main_~a~0.offset))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {653#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:25:07,592 INFO L273 TraceCheckUtils]: 17: Hoare triple {653#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume true; {653#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-14 17:25:07,593 INFO L273 TraceCheckUtils]: 18: Hoare triple {653#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {654#(= 1 |main_#t~mem34|)} is VALID [2018-11-14 17:25:07,594 INFO L273 TraceCheckUtils]: 19: Hoare triple {654#(= 1 |main_#t~mem34|)} assume #t~mem34 != 1;havoc #t~mem34; {648#false} is VALID [2018-11-14 17:25:07,595 INFO L273 TraceCheckUtils]: 20: Hoare triple {648#false} assume !false; {648#false} is VALID [2018-11-14 17:25:07,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:07,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-14 17:25:07,599 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-14 17:25:07,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:07,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:07,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:07,674 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-14 17:25:07,762 INFO L477 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 [2018-11-14 17:25:07,787 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:07,820 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:07,820 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-11-14 17:25:07,837 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:25:07,944 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:25:07,945 INFO L700 Elim1Store]: detected not equals via solver [2018-11-14 17:25:07,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-14 17:25:07,950 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,001 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-11-14 17:25:08,007 INFO L477 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 8 treesize of output 7 [2018-11-14 17:25:08,011 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,013 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,023 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:28, output treesize:18 [2018-11-14 17:25:08,027 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:25:08,178 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-14 17:25:08,182 INFO L477 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 8 treesize of output 7 [2018-11-14 17:25:08,184 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,211 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-14 17:25:08,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:23, output treesize:19 [2018-11-14 17:25:08,226 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:25:08,353 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 22 treesize of output 20 [2018-11-14 17:25:08,360 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-11-14 17:25:08,362 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-11-14 17:25:08,372 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,375 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-14 17:25:08,381 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:26, output treesize:3 [2018-11-14 17:25:08,384 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-14 17:25:08,391 INFO L256 TraceCheckUtils]: 0: Hoare triple {647#true} call ULTIMATE.init(); {647#true} is VALID [2018-11-14 17:25:08,391 INFO L273 TraceCheckUtils]: 1: Hoare triple {647#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {647#true} is VALID [2018-11-14 17:25:08,391 INFO L273 TraceCheckUtils]: 2: Hoare triple {647#true} assume true; {647#true} is VALID [2018-11-14 17:25:08,392 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {647#true} {647#true} #170#return; {647#true} is VALID [2018-11-14 17:25:08,392 INFO L256 TraceCheckUtils]: 4: Hoare triple {647#true} call #t~ret38 := main(); {647#true} is VALID [2018-11-14 17:25:08,394 INFO L273 TraceCheckUtils]: 5: Hoare triple {647#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {649#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:25:08,394 INFO L273 TraceCheckUtils]: 6: Hoare triple {649#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {649#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-14 17:25:08,395 INFO L273 TraceCheckUtils]: 7: Hoare triple {649#(= (select |#valid| main_~a~0.base) 1)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:08,396 INFO L273 TraceCheckUtils]: 8: Hoare triple {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume true; {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:08,396 INFO L273 TraceCheckUtils]: 9: Hoare triple {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:08,398 INFO L273 TraceCheckUtils]: 10: Hoare triple {650#(and (= (select |#valid| main_~p~0.base) 1) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !!(#t~nondet31 != 0);havoc #t~nondet31;call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:08,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-14 17:25:08,401 INFO L273 TraceCheckUtils]: 12: Hoare triple {651#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (not (= main_~p~0.base main_~t~0.base)) (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, ~p~0.offset + 4, 4);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:25:08,402 INFO L273 TraceCheckUtils]: 13: Hoare triple {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume true; {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:25:08,405 INFO L273 TraceCheckUtils]: 14: Hoare triple {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:25:08,412 INFO L273 TraceCheckUtils]: 15: Hoare triple {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(#t~nondet31 != 0);havoc #t~nondet31; {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-14 17:25:08,413 INFO L273 TraceCheckUtils]: 16: Hoare triple {694#(and (not (= main_~a~0.base main_~p~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(1, ~p~0.base, ~p~0.offset + 0, 4);call write~$Pointer$(0, 0, ~p~0.base, ~p~0.offset + 4, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {707#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} is VALID [2018-11-14 17:25:08,414 INFO L273 TraceCheckUtils]: 17: Hoare triple {707#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} assume true; {707#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} is VALID [2018-11-14 17:25:08,415 INFO L273 TraceCheckUtils]: 18: Hoare triple {707#(and (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (exists ((v_main_~p~0.base_14 Int) (v_main_~p~0.offset_14 Int)) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (not (= v_main_~p~0.base_14 main_~p~0.base)))))} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset + 0, 4); {654#(= 1 |main_#t~mem34|)} is VALID [2018-11-14 17:25:08,415 INFO L273 TraceCheckUtils]: 19: Hoare triple {654#(= 1 |main_#t~mem34|)} assume #t~mem34 != 1;havoc #t~mem34; {648#false} is VALID [2018-11-14 17:25:08,415 INFO L273 TraceCheckUtils]: 20: Hoare triple {648#false} assume !false; {648#false} is VALID [2018-11-14 17:25:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-14 17:25:08,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-14 17:25:08,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2018-11-14 17:25:08,440 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-14 17:25:08,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-14 17:25:08,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-14 17:25:08,536 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:08,536 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-14 17:25:08,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-14 17:25:08,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-11-14 17:25:08,537 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 10 states. [2018-11-14 17:25:09,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:09,743 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2018-11-14 17:25:09,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-14 17:25:09,744 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-11-14 17:25:09,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-14 17:25:09,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:25:09,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2018-11-14 17:25:09,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-14 17:25:09,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 50 transitions. [2018-11-14 17:25:09,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 50 transitions. [2018-11-14 17:25:09,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-14 17:25:09,866 INFO L225 Difference]: With dead ends: 47 [2018-11-14 17:25:09,866 INFO L226 Difference]: Without dead ends: 45 [2018-11-14 17:25:09,867 INFO L604 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2018-11-14 17:25:09,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-14 17:25:09,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 26. [2018-11-14 17:25:09,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-14 17:25:09,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand 26 states. [2018-11-14 17:25:09,932 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand 26 states. [2018-11-14 17:25:09,932 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 26 states. [2018-11-14 17:25:09,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:09,935 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-14 17:25:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-14 17:25:09,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:09,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:09,937 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 45 states. [2018-11-14 17:25:09,937 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 45 states. [2018-11-14 17:25:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-14 17:25:09,939 INFO L93 Difference]: Finished difference Result 45 states and 47 transitions. [2018-11-14 17:25:09,939 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2018-11-14 17:25:09,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-14 17:25:09,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-14 17:25:09,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-14 17:25:09,941 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-14 17:25:09,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-14 17:25:09,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2018-11-14 17:25:09,942 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 21 [2018-11-14 17:25:09,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-14 17:25:09,942 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2018-11-14 17:25:09,943 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-14 17:25:09,943 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2018-11-14 17:25:09,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-14 17:25:09,944 INFO L367 BasicCegarLoop]: Found error trace [2018-11-14 17:25:09,944 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-14 17:25:09,944 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-14 17:25:09,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-14 17:25:09,945 INFO L82 PathProgramCache]: Analyzing trace with hash 916856219, now seen corresponding path program 1 times [2018-11-14 17:25:09,945 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-14 17:25:09,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-14 17:25:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:09,946 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-14 17:25:09,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-14 17:25:09,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-14 17:25:10,220 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: zero is neutral element of plus operator at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:128) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:151) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker$MyWalker.walk(SubtermPropertyChecker.java:63) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.SubtermPropertyChecker.isPropertySatisfied(SubtermPropertyChecker.java:121) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.respectsUltimateNormalForm(UltimateNormalFormUtils.java:152) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.BasicPredicateFactory.newPredicate(BasicPredicateFactory.java:103) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.constructNewPredicate(PredicateUnifier.java:375) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:361) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computePredicates(NestedInterpolantsBuilder.java:592) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:434) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:376) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:312) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:123) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-11-14 17:25:10,227 INFO L168 Benchmark]: Toolchain (without parser) took 8938.82 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -216.9 MB). Peak memory consumption was 520.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:10,228 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-14 17:25:10,229 INFO L168 Benchmark]: CACSL2BoogieTranslator took 773.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.5 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:10,230 INFO L168 Benchmark]: Boogie Preprocessor took 117.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:10,231 INFO L168 Benchmark]: RCFGBuilder took 1786.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:10,231 INFO L168 Benchmark]: TraceAbstraction took 6253.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 486.8 MB). Peak memory consumption was 486.8 MB. Max. memory is 7.1 GB. [2018-11-14 17:25:10,235 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 773.01 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 737.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -798.5 MB). Peak memory consumption was 39.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 117.12 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 13.4 MB). Peak memory consumption was 13.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1786.09 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 81.3 MB). Peak memory consumption was 81.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6253.95 ms. Allocated memory is still 2.3 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 486.8 MB). Peak memory consumption was 486.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: zero is neutral element of plus operator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: zero is neutral element of plus operator: de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:83) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...