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/AutomizerCInline_WitnessPrinter.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-61f4311 [2018-11-23 12:55:54,491 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:55:54,494 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:55:54,510 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:55:54,510 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:55:54,511 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:55:54,512 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:55:54,514 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:55:54,516 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:55:54,517 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:55:54,518 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:55:54,518 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:55:54,519 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:55:54,520 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:55:54,522 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:55:54,522 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:55:54,523 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:55:54,527 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:55:54,534 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:55:54,536 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:55:54,541 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:55:54,547 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:55:54,549 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:55:54,549 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:55:54,552 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:55:54,553 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:55:54,554 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:55:54,554 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:55:54,556 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:55:54,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:55:54,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:55:54,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:55:54,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:55:54,559 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:55:54,560 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:55:54,562 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:55:54,562 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-23 12:55:54,582 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:55:54,582 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:55:54,583 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:55:54,583 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:55:54,584 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:55:54,584 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:55:54,584 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:55:54,584 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:55:54,585 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:55:54,585 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:55:54,585 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:55:54,585 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:55:54,585 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:55:54,586 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:55:54,586 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:55:54,586 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:55:54,586 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:55:54,586 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:55:54,586 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:55:54,587 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:55:54,587 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:55:54,587 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:55:54,587 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:55:54,588 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:55:54,588 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:55:54,588 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:55:54,588 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:55:54,588 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:55:54,589 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:55:54,589 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:55:54,589 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:55:54,632 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:55:54,647 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:55:54,650 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:55:54,652 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:55:54,652 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:55:54,653 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-23 12:55:54,715 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde71e590/2e1adb5fd33f46baa4d4f7db19395555/FLAG8d5d59ae2 [2018-11-23 12:55:55,203 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:55:55,203 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext2-properties/simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-23 12:55:55,217 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde71e590/2e1adb5fd33f46baa4d4f7db19395555/FLAG8d5d59ae2 [2018-11-23 12:55:55,500 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fde71e590/2e1adb5fd33f46baa4d4f7db19395555 [2018-11-23 12:55:55,509 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:55:55,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:55:55,512 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:55,512 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:55:55,516 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:55:55,520 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:55,523 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b948a02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:55, skipping insertion in model container [2018-11-23 12:55:55,524 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:55:55" (1/1) ... [2018-11-23 12:55:55,535 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:55:55,601 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:55:56,098 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:56,116 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:55:56,183 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:55:56,266 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:55:56,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56 WrapperNode [2018-11-23 12:55:56,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:55:56,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:56,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:55:56,269 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:55:56,353 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,371 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:55:56,386 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:55:56,386 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:55:56,386 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:55:56,396 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,396 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,401 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,401 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,439 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,449 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,451 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (1/1) ... [2018-11-23 12:55:56,455 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:55:56,456 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:55:56,456 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:55:56,456 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:55:56,457 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (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-23 12:55:56,525 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:55:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:55:56,526 INFO L130 BoogieDeclarations]: Found specification of procedure sl_random_insert [2018-11-23 12:55:56,526 INFO L138 BoogieDeclarations]: Found implementation of procedure sl_random_insert [2018-11-23 12:55:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 12:55:56,527 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 12:55:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:55:56,527 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:55:56,527 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:55:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:55:56,528 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:55:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:55:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:55:56,528 INFO L130 BoogieDeclarations]: Found specification of procedure create_sl_with_head_and_tail [2018-11-23 12:55:56,529 INFO L138 BoogieDeclarations]: Found implementation of procedure create_sl_with_head_and_tail [2018-11-23 12:55:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_sl [2018-11-23 12:55:56,529 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_sl [2018-11-23 12:55:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:55:56,529 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:55:56,530 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:55:57,951 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:55:57,951 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 12:55:57,951 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:57 BoogieIcfgContainer [2018-11-23 12:55:57,952 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:55:57,953 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:55:57,953 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:55:57,956 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:55:57,956 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:55:55" (1/3) ... [2018-11-23 12:55:57,957 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbf2857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:57, skipping insertion in model container [2018-11-23 12:55:57,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:55:56" (2/3) ... [2018-11-23 12:55:57,958 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3dbf2857 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:55:57, skipping insertion in model container [2018-11-23 12:55:57,958 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:55:57" (3/3) ... [2018-11-23 12:55:57,960 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_and_skiplist_2lvl_true-unreach-call.i [2018-11-23 12:55:57,971 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:55:57,981 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:55:58,001 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:55:58,034 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:55:58,035 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:55:58,035 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:55:58,036 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:55:58,036 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:55:58,036 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:55:58,036 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:55:58,036 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:55:58,036 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:55:58,055 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states. [2018-11-23 12:55:58,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-23 12:55:58,061 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:58,062 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:58,064 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:58,070 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:58,070 INFO L82 PathProgramCache]: Analyzing trace with hash 39487780, now seen corresponding path program 1 times [2018-11-23 12:55:58,072 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:58,073 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,118 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:58,118 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:58,217 INFO L256 TraceCheckUtils]: 0: Hoare triple {57#true} call ULTIMATE.init(); {57#true} is VALID [2018-11-23 12:55:58,221 INFO L273 TraceCheckUtils]: 1: Hoare triple {57#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {57#true} is VALID [2018-11-23 12:55:58,222 INFO L273 TraceCheckUtils]: 2: Hoare triple {57#true} assume true; {57#true} is VALID [2018-11-23 12:55:58,222 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {57#true} {57#true} #159#return; {57#true} is VALID [2018-11-23 12:55:58,223 INFO L256 TraceCheckUtils]: 4: Hoare triple {57#true} call #t~ret38 := main(); {57#true} is VALID [2018-11-23 12:55:58,223 INFO L273 TraceCheckUtils]: 5: Hoare triple {57#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {57#true} is VALID [2018-11-23 12:55:58,223 INFO L273 TraceCheckUtils]: 6: Hoare triple {57#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {57#true} is VALID [2018-11-23 12:55:58,224 INFO L273 TraceCheckUtils]: 7: Hoare triple {57#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {57#true} is VALID [2018-11-23 12:55:58,226 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#true} assume !true; {58#false} is VALID [2018-11-23 12:55:58,226 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#false} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {58#false} is VALID [2018-11-23 12:55:58,227 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#false} assume !!(~p~0.base != 0 || ~p~0.offset != 0);call #t~mem34 := read~int(~p~0.base, ~p~0.offset, 4); {58#false} is VALID [2018-11-23 12:55:58,227 INFO L273 TraceCheckUtils]: 11: Hoare triple {58#false} assume 1 != #t~mem34;havoc #t~mem34; {58#false} is VALID [2018-11-23 12:55:58,227 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#false} assume !false; {58#false} is VALID [2018-11-23 12:55:58,231 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-23 12:55:58,234 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:58,234 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 12:55:58,239 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:55:58,242 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:58,246 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2018-11-23 12:55:58,419 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:58,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-23 12:55:58,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-23 12:55:58,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-23 12:55:58,433 INFO L87 Difference]: Start difference. First operand 54 states. Second operand 2 states. [2018-11-23 12:55:58,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:58,969 INFO L93 Difference]: Finished difference Result 92 states and 124 transitions. [2018-11-23 12:55:58,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-23 12:55:58,969 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-11-23 12:55:58,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:55:58,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:58,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2018-11-23 12:55:58,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2018-11-23 12:55:58,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 124 transitions. [2018-11-23 12:55:58,992 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 124 transitions. [2018-11-23 12:55:59,628 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:55:59,639 INFO L225 Difference]: With dead ends: 92 [2018-11-23 12:55:59,639 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 12:55:59,643 INFO L631 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-23 12:55:59,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 12:55:59,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-23 12:55:59,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:55:59,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,680 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,680 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,684 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:55:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:55:59,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,685 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,685 INFO L87 Difference]: Start difference. First operand 18 states. Second operand 18 states. [2018-11-23 12:55:59,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:55:59,688 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-11-23 12:55:59,689 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:55:59,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:55:59,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:55:59,690 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:55:59,690 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:55:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-23 12:55:59,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2018-11-23 12:55:59,693 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2018-11-23 12:55:59,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:55:59,694 INFO L480 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2018-11-23 12:55:59,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-23 12:55:59,694 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2018-11-23 12:55:59,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 12:55:59,695 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:55:59,695 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:55:59,696 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:55:59,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:55:59,696 INFO L82 PathProgramCache]: Analyzing trace with hash 781483651, now seen corresponding path program 1 times [2018-11-23 12:55:59,696 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:55:59,696 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:55:59,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:55:59,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:55:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:55:59,909 INFO L256 TraceCheckUtils]: 0: Hoare triple {244#true} call ULTIMATE.init(); {244#true} is VALID [2018-11-23 12:55:59,910 INFO L273 TraceCheckUtils]: 1: Hoare triple {244#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {244#true} is VALID [2018-11-23 12:55:59,910 INFO L273 TraceCheckUtils]: 2: Hoare triple {244#true} assume true; {244#true} is VALID [2018-11-23 12:55:59,911 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {244#true} {244#true} #159#return; {244#true} is VALID [2018-11-23 12:55:59,911 INFO L256 TraceCheckUtils]: 4: Hoare triple {244#true} call #t~ret38 := main(); {244#true} is VALID [2018-11-23 12:55:59,912 INFO L273 TraceCheckUtils]: 5: Hoare triple {244#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {244#true} is VALID [2018-11-23 12:55:59,913 INFO L273 TraceCheckUtils]: 6: Hoare triple {244#true} assume !(~a~0.base == 0 && ~a~0.offset == 0); {244#true} is VALID [2018-11-23 12:55:59,925 INFO L273 TraceCheckUtils]: 7: Hoare triple {244#true} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,941 INFO L273 TraceCheckUtils]: 8: Hoare triple {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,948 INFO L273 TraceCheckUtils]: 9: Hoare triple {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {246#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:55:59,950 INFO L273 TraceCheckUtils]: 10: Hoare triple {246#(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, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {247#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:55:59,952 INFO L273 TraceCheckUtils]: 11: Hoare triple {247#(= 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, 4); {248#(= 1 |main_#t~mem34|)} is VALID [2018-11-23 12:55:59,955 INFO L273 TraceCheckUtils]: 12: Hoare triple {248#(= 1 |main_#t~mem34|)} assume 1 != #t~mem34;havoc #t~mem34; {245#false} is VALID [2018-11-23 12:55:59,955 INFO L273 TraceCheckUtils]: 13: Hoare triple {245#false} assume !false; {245#false} is VALID [2018-11-23 12:55:59,957 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-23 12:55:59,957 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:55:59,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:55:59,959 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:55:59,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:55:59,960 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:56:00,014 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-23 12:56:00,014 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:56:00,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:56:00,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:56:00,015 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 5 states. [2018-11-23 12:56:00,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,406 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-11-23 12:56:00,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:56:00,407 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-23 12:56:00,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:00,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:00,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:56:00,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:56:00,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-23 12:56:00,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 35 transitions. [2018-11-23 12:56:00,506 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:00,511 INFO L225 Difference]: With dead ends: 33 [2018-11-23 12:56:00,512 INFO L226 Difference]: Without dead ends: 31 [2018-11-23 12:56:00,513 INFO L631 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-23 12:56:00,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-11-23 12:56:00,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2018-11-23 12:56:00,531 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:00,531 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand 23 states. [2018-11-23 12:56:00,531 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand 23 states. [2018-11-23 12:56:00,531 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 23 states. [2018-11-23 12:56:00,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,534 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:56:00,535 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:56:00,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:00,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:00,536 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 31 states. [2018-11-23 12:56:00,536 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 31 states. [2018-11-23 12:56:00,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:00,538 INFO L93 Difference]: Finished difference Result 31 states and 33 transitions. [2018-11-23 12:56:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2018-11-23 12:56:00,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:00,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:00,540 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:00,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:00,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-11-23 12:56:00,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2018-11-23 12:56:00,542 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 14 [2018-11-23 12:56:00,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:00,542 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2018-11-23 12:56:00,542 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:56:00,543 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2018-11-23 12:56:00,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 12:56:00,544 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:00,544 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:00,544 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:00,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:00,545 INFO L82 PathProgramCache]: Analyzing trace with hash -1833409640, now seen corresponding path program 1 times [2018-11-23 12:56:00,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:00,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:00,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:00,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:00,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:00,799 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 12:56:00,800 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {390#true} is VALID [2018-11-23 12:56:00,800 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 12:56:00,801 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #159#return; {390#true} is VALID [2018-11-23 12:56:00,801 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret38 := main(); {390#true} is VALID [2018-11-23 12:56:00,802 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:00,803 INFO L273 TraceCheckUtils]: 6: Hoare triple {392#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:00,803 INFO L273 TraceCheckUtils]: 7: Hoare triple {392#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,804 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(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; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,804 INFO L273 TraceCheckUtils]: 9: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:00,807 INFO L273 TraceCheckUtils]: 10: Hoare triple {393#(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, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {394#(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-23 12:56:00,808 INFO L273 TraceCheckUtils]: 11: Hoare triple {394#(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, 4); {394#(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-23 12:56:00,809 INFO L273 TraceCheckUtils]: 12: Hoare triple {394#(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 !(1 != #t~mem34);havoc #t~mem34; {394#(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-23 12:56:00,811 INFO L273 TraceCheckUtils]: 13: Hoare triple {394#(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, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {395#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:56:00,812 INFO L273 TraceCheckUtils]: 14: Hoare triple {395#(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, 4); {391#false} is VALID [2018-11-23 12:56:00,813 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 1 != #t~mem34;havoc #t~mem34; {391#false} is VALID [2018-11-23 12:56:00,813 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 12:56:00,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:00,817 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:00,817 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-23 12:56:00,839 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:00,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:00,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:00,881 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:01,062 INFO L478 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-23 12:56:01,071 INFO L478 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-23 12:56:01,073 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,076 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,095 INFO L478 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-23 12:56:01,104 INFO L478 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-23 12:56:01,105 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,108 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,117 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 12:56:01,320 INFO L478 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-23 12:56:01,330 INFO L478 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-23 12:56:01,334 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,343 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,352 INFO L478 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-23 12:56:01,368 INFO L478 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-23 12:56:01,369 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,374 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:01,383 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-23 12:56:01,383 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 12:56:01,387 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:01,387 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_$Pointer$.base|, v_main_~p~0.base_12, |#memory_$Pointer$.offset|]. (let ((.cse1 (select (select |#memory_$Pointer$.base| v_main_~p~0.base_12) 4)) (.cse0 (select (select |#memory_$Pointer$.offset| v_main_~p~0.base_12) 4))) (and (= .cse0 0) (= 0 .cse1) (= main_~p~0.base .cse1) (= .cse0 main_~p~0.offset))) [2018-11-23 12:56:01,388 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 0 main_~p~0.base) (= main_~p~0.offset 0)) [2018-11-23 12:56:01,427 INFO L256 TraceCheckUtils]: 0: Hoare triple {390#true} call ULTIMATE.init(); {390#true} is VALID [2018-11-23 12:56:01,427 INFO L273 TraceCheckUtils]: 1: Hoare triple {390#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {390#true} is VALID [2018-11-23 12:56:01,428 INFO L273 TraceCheckUtils]: 2: Hoare triple {390#true} assume true; {390#true} is VALID [2018-11-23 12:56:01,428 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {390#true} {390#true} #159#return; {390#true} is VALID [2018-11-23 12:56:01,428 INFO L256 TraceCheckUtils]: 4: Hoare triple {390#true} call #t~ret38 := main(); {390#true} is VALID [2018-11-23 12:56:01,438 INFO L273 TraceCheckUtils]: 5: Hoare triple {390#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:01,440 INFO L273 TraceCheckUtils]: 6: Hoare triple {392#(= 0 main_~a~0.offset)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {392#(= 0 main_~a~0.offset)} is VALID [2018-11-23 12:56:01,443 INFO L273 TraceCheckUtils]: 7: Hoare triple {392#(= 0 main_~a~0.offset)} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,444 INFO L273 TraceCheckUtils]: 8: Hoare triple {393#(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; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,451 INFO L273 TraceCheckUtils]: 9: Hoare triple {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} assume !(0 != #t~nondet31);havoc #t~nondet31; {393#(and (= 0 main_~a~0.offset) (= main_~p~0.offset 0) (= main_~p~0.base main_~a~0.base))} is VALID [2018-11-23 12:56:01,453 INFO L273 TraceCheckUtils]: 10: Hoare triple {393#(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, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {394#(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-23 12:56:01,454 INFO L273 TraceCheckUtils]: 11: Hoare triple {394#(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, 4); {394#(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-23 12:56:01,455 INFO L273 TraceCheckUtils]: 12: Hoare triple {394#(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 !(1 != #t~mem34);havoc #t~mem34; {394#(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-23 12:56:01,455 INFO L273 TraceCheckUtils]: 13: Hoare triple {394#(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, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem35.base, #t~mem35.offset;havoc #t~mem35.base, #t~mem35.offset; {395#(and (= 0 main_~p~0.base) (= main_~p~0.offset 0))} is VALID [2018-11-23 12:56:01,456 INFO L273 TraceCheckUtils]: 14: Hoare triple {395#(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, 4); {391#false} is VALID [2018-11-23 12:56:01,457 INFO L273 TraceCheckUtils]: 15: Hoare triple {391#false} assume 1 != #t~mem34;havoc #t~mem34; {391#false} is VALID [2018-11-23 12:56:01,457 INFO L273 TraceCheckUtils]: 16: Hoare triple {391#false} assume !false; {391#false} is VALID [2018-11-23 12:56:01,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:01,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:01,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2018-11-23 12:56:01,480 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:56:01,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:01,480 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:56:01,521 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,521 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:56:01,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:56:01,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:56:01,522 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand 6 states. [2018-11-23 12:56:01,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:01,926 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:56:01,926 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:56:01,926 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-11-23 12:56:01,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:01,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:56:01,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:56:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:56:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2018-11-23 12:56:01,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2018-11-23 12:56:01,994 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:01,996 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:56:01,997 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 12:56:01,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 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-23 12:56:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 12:56:02,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 20. [2018-11-23 12:56:02,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:02,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 20 states. [2018-11-23 12:56:02,019 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 20 states. [2018-11-23 12:56:02,019 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 20 states. [2018-11-23 12:56:02,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,022 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:56:02,023 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:56:02,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:02,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:02,024 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand 27 states. [2018-11-23 12:56:02,024 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 27 states. [2018-11-23 12:56:02,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:02,026 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2018-11-23 12:56:02,026 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-11-23 12:56:02,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:02,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:02,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:02,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:02,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-11-23 12:56:02,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-11-23 12:56:02,029 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 17 [2018-11-23 12:56:02,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:02,029 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-11-23 12:56:02,030 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:56:02,030 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-11-23 12:56:02,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-11-23 12:56:02,031 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:02,031 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:02,031 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:02,031 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:02,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1844777302, now seen corresponding path program 1 times [2018-11-23 12:56:02,032 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:02,032 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:02,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:02,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:02,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:02,246 INFO L256 TraceCheckUtils]: 0: Hoare triple {579#true} call ULTIMATE.init(); {579#true} is VALID [2018-11-23 12:56:02,247 INFO L273 TraceCheckUtils]: 1: Hoare triple {579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {579#true} is VALID [2018-11-23 12:56:02,247 INFO L273 TraceCheckUtils]: 2: Hoare triple {579#true} assume true; {579#true} is VALID [2018-11-23 12:56:02,248 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {579#true} {579#true} #159#return; {579#true} is VALID [2018-11-23 12:56:02,248 INFO L256 TraceCheckUtils]: 4: Hoare triple {579#true} call #t~ret38 := main(); {579#true} is VALID [2018-11-23 12:56:02,250 INFO L273 TraceCheckUtils]: 5: Hoare triple {579#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {581#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:02,251 INFO L273 TraceCheckUtils]: 6: Hoare triple {581#(= (select |#valid| main_~a~0.base) 1)} assume !(~a~0.base == 0 && ~a~0.offset == 0); {581#(= (select |#valid| main_~a~0.base) 1)} is VALID [2018-11-23 12:56:02,252 INFO L273 TraceCheckUtils]: 7: Hoare triple {581#(= (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; {582#(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-23 12:56:02,252 INFO L273 TraceCheckUtils]: 8: Hoare triple {582#(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; {582#(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-23 12:56:02,254 INFO L273 TraceCheckUtils]: 9: Hoare triple {582#(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 !!(0 != #t~nondet31);havoc #t~nondet31;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {583#(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-23 12:56:02,255 INFO L273 TraceCheckUtils]: 10: Hoare triple {583#(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); {583#(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-23 12:56:02,257 INFO L273 TraceCheckUtils]: 11: Hoare triple {583#(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, 4 + ~p~0.offset, 4);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {584#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:02,258 INFO L273 TraceCheckUtils]: 12: Hoare triple {584#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {584#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:02,260 INFO L273 TraceCheckUtils]: 13: Hoare triple {584#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet31);havoc #t~nondet31; {584#(and (not (= main_~p~0.base main_~a~0.base)) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:02,262 INFO L273 TraceCheckUtils]: 14: Hoare triple {584#(and (not (= main_~p~0.base main_~a~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, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {585#(= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset))} is VALID [2018-11-23 12:56:02,263 INFO L273 TraceCheckUtils]: 15: Hoare triple {585#(= 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, 4); {586#(= 1 |main_#t~mem34|)} is VALID [2018-11-23 12:56:02,264 INFO L273 TraceCheckUtils]: 16: Hoare triple {586#(= 1 |main_#t~mem34|)} assume 1 != #t~mem34;havoc #t~mem34; {580#false} is VALID [2018-11-23 12:56:02,264 INFO L273 TraceCheckUtils]: 17: Hoare triple {580#false} assume !false; {580#false} is VALID [2018-11-23 12:56:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:02,267 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:56:02,267 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-23 12:56:02,285 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:02,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:02,320 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:56:02,350 INFO L478 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-23 12:56:02,353 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,360 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,361 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-11-23 12:56:02,366 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:02,366 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#valid_27|]. (and (= |#valid| (store |v_#valid_27| main_~a~0.base 1)) (= main_~a~0.offset 0)) [2018-11-23 12:56:02,367 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0)) [2018-11-23 12:56:02,587 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:02,588 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:02,589 INFO L478 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-23 12:56:02,590 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,617 INFO L478 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-23 12:56:02,623 INFO L478 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-23 12:56:02,624 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,627 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,638 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-23 12:56:02,639 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 2 variables, input treesize:31, output treesize:21 [2018-11-23 12:56:02,642 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:02,642 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_39|, |v_#valid_28|]. (and (= main_~a~0.base main_~p~0.base) (= 1 (select |v_#valid_28| main_~a~0.base)) (= 0 (select |v_#valid_28| main_~t~0.base)) (= (store |v_#memory_int_39| main_~p~0.base (store (select |v_#memory_int_39| main_~p~0.base) main_~p~0.offset 1)) |#memory_int|) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset)) [2018-11-23 12:56:02,643 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset main_~p~0.offset)) [2018-11-23 12:56:02,726 INFO L478 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 27 treesize of output 22 [2018-11-23 12:56:02,732 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:02,737 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:56:02,764 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,846 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,912 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:02,912 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:34, output treesize:15 [2018-11-23 12:56:03,058 INFO L478 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 30 treesize of output 31 [2018-11-23 12:56:03,065 INFO L478 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-11-23 12:56:03,083 INFO L701 Elim1Store]: detected not equals via solver [2018-11-23 12:56:03,086 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 14 [2018-11-23 12:56:03,092 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,104 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,114 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,127 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-23 12:56:03,127 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 3 variables, input treesize:37, output treesize:22 [2018-11-23 12:56:03,132 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,132 WARN L384 uantifierElimination]: Input elimination task: ∃ [|v_#memory_int_41|, v_main_~p~0.base_14, v_main_~p~0.offset_14]. (and (= (store |v_#memory_int_41| v_main_~p~0.base_14 (let ((.cse0 (+ v_main_~p~0.offset_14 4))) (store (store (select |v_#memory_int_41| v_main_~p~0.base_14) v_main_~p~0.offset_14 1) .cse0 (select (select |#memory_int| v_main_~p~0.base_14) .cse0)))) |#memory_int|) (not (= v_main_~p~0.base_14 main_~p~0.base)) (= 1 (select (select |v_#memory_int_41| main_~p~0.base) 0)) (= main_~p~0.offset 0)) [2018-11-23 12:56:03,132 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ [v_main_~p~0.base_14, v_main_~p~0.offset_14]. (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (not (= v_main_~p~0.base_14 main_~p~0.base)) (= main_~p~0.offset 0)) [2018-11-23 12:56:03,339 INFO L478 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-23 12:56:03,399 INFO L478 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-23 12:56:03,408 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,415 INFO L478 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-23 12:56:03,416 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,418 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,423 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:56:03,424 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 4 variables, input treesize:26, output treesize:3 [2018-11-23 12:56:03,427 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:56:03,427 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, v_main_~p~0.base_14, v_main_~p~0.offset_14, main_~p~0.base]. (let ((.cse0 (select (select |#memory_int| main_~p~0.base) 0))) (and (= (select (select |#memory_int| v_main_~p~0.base_14) v_main_~p~0.offset_14) 1) (= 1 .cse0) (not (= v_main_~p~0.base_14 main_~p~0.base)) (= |main_#t~mem34| .cse0))) [2018-11-23 12:56:03,427 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem34| 1) [2018-11-23 12:56:03,451 INFO L256 TraceCheckUtils]: 0: Hoare triple {579#true} call ULTIMATE.init(); {579#true} is VALID [2018-11-23 12:56:03,451 INFO L273 TraceCheckUtils]: 1: Hoare triple {579#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {579#true} is VALID [2018-11-23 12:56:03,451 INFO L273 TraceCheckUtils]: 2: Hoare triple {579#true} assume true; {579#true} is VALID [2018-11-23 12:56:03,452 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {579#true} {579#true} #159#return; {579#true} is VALID [2018-11-23 12:56:03,452 INFO L256 TraceCheckUtils]: 4: Hoare triple {579#true} call #t~ret38 := main(); {579#true} is VALID [2018-11-23 12:56:03,453 INFO L273 TraceCheckUtils]: 5: Hoare triple {579#true} call #t~malloc30.base, #t~malloc30.offset := #Ultimate.alloc(8);~a~0.base, ~a~0.offset := #t~malloc30.base, #t~malloc30.offset; {605#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} is VALID [2018-11-23 12:56:03,453 INFO L273 TraceCheckUtils]: 6: Hoare triple {605#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} assume !(~a~0.base == 0 && ~a~0.offset == 0); {605#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} is VALID [2018-11-23 12:56:03,454 INFO L273 TraceCheckUtils]: 7: Hoare triple {605#(and (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0))} havoc ~t~0.base, ~t~0.offset;~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {612#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:56:03,457 INFO L273 TraceCheckUtils]: 8: Hoare triple {612#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {612#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:56:03,458 INFO L273 TraceCheckUtils]: 9: Hoare triple {612#(and (= main_~a~0.base main_~p~0.base) (= 1 (select |#valid| main_~a~0.base)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume !!(0 != #t~nondet31);havoc #t~nondet31;call write~int(1, ~p~0.base, ~p~0.offset, 4);call #t~malloc32.base, #t~malloc32.offset := #Ultimate.alloc(8);~t~0.base, ~t~0.offset := #t~malloc32.base, #t~malloc32.offset; {619#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:56:03,460 INFO L273 TraceCheckUtils]: 10: Hoare triple {619#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} assume !(~t~0.base == 0 && ~t~0.offset == 0); {619#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} is VALID [2018-11-23 12:56:03,462 INFO L273 TraceCheckUtils]: 11: Hoare triple {619#(and (not (= main_~t~0.base main_~a~0.base)) (= main_~a~0.base main_~p~0.base) (= 1 (select (select |#memory_int| main_~p~0.base) main_~p~0.offset)) (= main_~a~0.offset 0) (= main_~a~0.offset main_~p~0.offset))} call write~$Pointer$(~t~0.base, ~t~0.offset, ~p~0.base, 4 + ~p~0.offset, 4);call #t~mem33.base, #t~mem33.offset := read~$Pointer$(~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := #t~mem33.base, #t~mem33.offset;havoc #t~mem33.base, #t~mem33.offset; {626#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:03,463 INFO L273 TraceCheckUtils]: 12: Hoare triple {626#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume -2147483648 <= #t~nondet31 && #t~nondet31 <= 2147483647; {626#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:03,464 INFO L273 TraceCheckUtils]: 13: Hoare triple {626#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} assume !(0 != #t~nondet31);havoc #t~nondet31; {626#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} is VALID [2018-11-23 12:56:03,466 INFO L273 TraceCheckUtils]: 14: Hoare triple {626#(and (not (= main_~a~0.base main_~p~0.base)) (= main_~a~0.offset 0) (= 1 (select (select |#memory_int| main_~a~0.base) main_~a~0.offset)))} call write~int(1, ~p~0.base, ~p~0.offset, 4);call write~$Pointer$(0, 0, ~p~0.base, 4 + ~p~0.offset, 4);~p~0.base, ~p~0.offset := ~a~0.base, ~a~0.offset; {636#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= main_~p~0.offset 0) (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-23 12:56:03,468 INFO L273 TraceCheckUtils]: 15: Hoare triple {636#(and (= 1 (select (select |#memory_int| main_~p~0.base) 0)) (= main_~p~0.offset 0) (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, 4); {586#(= 1 |main_#t~mem34|)} is VALID [2018-11-23 12:56:03,469 INFO L273 TraceCheckUtils]: 16: Hoare triple {586#(= 1 |main_#t~mem34|)} assume 1 != #t~mem34;havoc #t~mem34; {580#false} is VALID [2018-11-23 12:56:03,469 INFO L273 TraceCheckUtils]: 17: Hoare triple {580#false} assume !false; {580#false} is VALID [2018-11-23 12:56:03,471 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 12:56:03,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:56:03,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2018-11-23 12:56:03,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-11-23 12:56:03,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:56:03,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states. [2018-11-23 12:56:03,537 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:03,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 12:56:03,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 12:56:03,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:56:03,538 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 13 states. [2018-11-23 12:56:04,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:04,492 INFO L93 Difference]: Finished difference Result 37 states and 39 transitions. [2018-11-23 12:56:04,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:56:04,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 18 [2018-11-23 12:56:04,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:56:04,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:56:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:56:04,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-23 12:56:04,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 39 transitions. [2018-11-23 12:56:04,498 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 39 transitions. [2018-11-23 12:56:04,557 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:56:04,560 INFO L225 Difference]: With dead ends: 37 [2018-11-23 12:56:04,560 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 12:56:04,561 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2018-11-23 12:56:04,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 12:56:04,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 27. [2018-11-23 12:56:04,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:56:04,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 27 states. [2018-11-23 12:56:04,590 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 27 states. [2018-11-23 12:56:04,590 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 27 states. [2018-11-23 12:56:04,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:04,594 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 12:56:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 12:56:04,595 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:04,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:04,595 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 35 states. [2018-11-23 12:56:04,595 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 35 states. [2018-11-23 12:56:04,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:56:04,598 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-11-23 12:56:04,598 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 37 transitions. [2018-11-23 12:56:04,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:56:04,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:56:04,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:56:04,599 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:56:04,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-23 12:56:04,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2018-11-23 12:56:04,601 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 18 [2018-11-23 12:56:04,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:56:04,601 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2018-11-23 12:56:04,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 12:56:04,601 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2018-11-23 12:56:04,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-23 12:56:04,602 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:56:04,602 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:56:04,603 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:56:04,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:56:04,603 INFO L82 PathProgramCache]: Analyzing trace with hash 645770769, now seen corresponding path program 1 times [2018-11-23 12:56:04,604 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:56:04,604 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:56:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:04,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:56:04,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:56:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:56:04,821 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:87) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.rootRespectsUltimateNormalForm(UltimateNormalFormUtils.java:131) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.UltimateNormalFormUtils.lambda$0(UltimateNormalFormUtils.java:154) 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:155) 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:456) 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:334) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:174) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:126) 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-23 12:56:04,828 INFO L168 Benchmark]: Toolchain (without parser) took 9317.75 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -212.8 MB). Peak memory consumption was 501.8 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:04,830 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:04,830 INFO L168 Benchmark]: CACSL2BoogieTranslator took 755.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:04,831 INFO L168 Benchmark]: Boogie Procedure Inliner took 117.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:04,832 INFO L168 Benchmark]: Boogie Preprocessor took 69.36 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:56:04,832 INFO L168 Benchmark]: RCFGBuilder took 1496.11 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:04,833 INFO L168 Benchmark]: TraceAbstraction took 6873.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 486.7 MB). Peak memory consumption was 486.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:56:04,838 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.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 755.83 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 117.80 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 714.6 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -795.4 MB). Peak memory consumption was 16.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 69.36 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1496.11 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 64.1 MB). Peak memory consumption was 64.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 6873.33 ms. Allocated memory is still 2.2 GB. Free memory was 2.1 GB in the beginning and 1.6 GB in the end (delta: 486.7 MB). Peak memory consumption was 486.7 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:87) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...