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-properties/list_search_false-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:52:46,072 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:52:46,075 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:52:46,092 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:52:46,092 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:52:46,094 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:52:46,095 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:52:46,097 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:52:46,098 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:52:46,099 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:52:46,100 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:52:46,100 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:52:46,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:52:46,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:52:46,103 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:52:46,104 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:52:46,105 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:52:46,107 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:52:46,109 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:52:46,110 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:52:46,111 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:52:46,112 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:52:46,115 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:52:46,115 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:52:46,116 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:52:46,117 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:52:46,118 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:52:46,123 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:52:46,124 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:52:46,127 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:52:46,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:52:46,128 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:52:46,129 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:52:46,129 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:52:46,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:52:46,134 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:52:46,134 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:52:46,165 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:52:46,166 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:52:46,166 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:52:46,170 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:52:46,171 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:52:46,171 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:52:46,171 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:52:46,171 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:52:46,171 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:52:46,172 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:52:46,172 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:52:46,172 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:52:46,172 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:52:46,172 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:52:46,172 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:52:46,175 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:52:46,175 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:52:46,175 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:52:46,176 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:52:46,176 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:52:46,176 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:52:46,176 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:52:46,176 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:52:46,177 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:52:46,178 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:52:46,179 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:52:46,179 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:52:46,179 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:52:46,179 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:52:46,179 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:52:46,179 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:52:46,242 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:52:46,261 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:52:46,266 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:52:46,268 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:52:46,268 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:52:46,269 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:46,327 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f197bd32a/cba9551752de4ad198282512edc98687/FLAGf941454c7 [2018-11-23 12:52:46,951 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:52:46,952 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:46,972 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f197bd32a/cba9551752de4ad198282512edc98687/FLAGf941454c7 [2018-11-23 12:52:47,188 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f197bd32a/cba9551752de4ad198282512edc98687 [2018-11-23 12:52:47,197 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:52:47,199 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:52:47,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:47,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:52:47,204 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:52:47,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:47,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@292b7cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47, skipping insertion in model container [2018-11-23 12:52:47,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:47,222 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:52:47,285 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:52:47,746 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:47,760 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:52:47,839 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:52:47,905 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:52:47,906 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47 WrapperNode [2018-11-23 12:52:47,906 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:52:47,907 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:47,908 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:52:47,908 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:52:47,988 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:52:47" (1/1) ... [2018-11-23 12:52:48,005 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:52:47" (1/1) ... [2018-11-23 12:52:48,014 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:52:48,015 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:52:48,015 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:52:48,015 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:52:48,026 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:48,026 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:48,029 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:48,030 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:48,044 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:48,049 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:48,054 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (1/1) ... [2018-11-23 12:52:48,057 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:52:48,058 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:52:48,058 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:52:48,058 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:52:48,059 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (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:52:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-23 12:52:48,124 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-23 12:52:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:52:48,124 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:52:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:52:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:52:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:52:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:52:48,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:52:48,125 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:52:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:52:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:52:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:52:48,126 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-23 12:52:48,126 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-23 12:52:48,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:52:48,127 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:52:48,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:52:49,012 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:52:49,013 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-11-23 12:52:49,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:49 BoogieIcfgContainer [2018-11-23 12:52:49,014 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:52:49,015 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:52:49,015 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:52:49,019 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:52:49,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:52:47" (1/3) ... [2018-11-23 12:52:49,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e3793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:49, skipping insertion in model container [2018-11-23 12:52:49,020 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:52:47" (2/3) ... [2018-11-23 12:52:49,021 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79e3793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:52:49, skipping insertion in model container [2018-11-23 12:52:49,021 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:52:49" (3/3) ... [2018-11-23 12:52:49,023 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_false-unreach-call_false-valid-memcleanup.i [2018-11-23 12:52:49,035 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:52:49,047 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:52:49,067 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:52:49,103 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:52:49,104 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:52:49,104 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:52:49,104 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:52:49,105 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:52:49,105 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:52:49,106 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:52:49,106 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:52:49,107 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:52:49,127 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states. [2018-11-23 12:52:49,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-11-23 12:52:49,136 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:49,137 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:49,140 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:49,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:49,147 INFO L82 PathProgramCache]: Analyzing trace with hash -658334123, now seen corresponding path program 1 times [2018-11-23 12:52:49,149 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:49,149 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:49,203 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:49,203 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:49,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:49,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:49,630 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-23 12:52:49,634 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2018-11-23 12:52:49,634 INFO L273 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:49,635 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #74#return; {44#true} is VALID [2018-11-23 12:52:49,635 INFO L256 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret11 := main(); {44#true} is VALID [2018-11-23 12:52:49,635 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {44#true} is VALID [2018-11-23 12:52:49,636 INFO L256 TraceCheckUtils]: 6: Hoare triple {44#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {44#true} is VALID [2018-11-23 12:52:49,638 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {46#(not (= insert_list_~l.base 0))} is VALID [2018-11-23 12:52:49,638 INFO L273 TraceCheckUtils]: 8: Hoare triple {46#(not (= insert_list_~l.base 0))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {46#(not (= insert_list_~l.base 0))} is VALID [2018-11-23 12:52:49,639 INFO L273 TraceCheckUtils]: 9: Hoare triple {46#(not (= insert_list_~l.base 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {47#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:49,640 INFO L273 TraceCheckUtils]: 10: Hoare triple {47#(not (= ~head~0.base 0))} assume true; {47#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:49,643 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {47#(not (= ~head~0.base 0))} {44#true} #78#return; {47#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:49,644 INFO L273 TraceCheckUtils]: 12: Hoare triple {47#(not (= ~head~0.base 0))} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {47#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:49,649 INFO L256 TraceCheckUtils]: 13: Hoare triple {47#(not (= ~head~0.base 0))} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {48#(= ~head~0.base |old(~head~0.base)|)} is VALID [2018-11-23 12:52:49,668 INFO L273 TraceCheckUtils]: 14: Hoare triple {48#(= ~head~0.base |old(~head~0.base)|)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {48#(= ~head~0.base |old(~head~0.base)|)} is VALID [2018-11-23 12:52:49,670 INFO L273 TraceCheckUtils]: 15: Hoare triple {48#(= ~head~0.base |old(~head~0.base)|)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {49#(= 0 |old(~head~0.base)|)} is VALID [2018-11-23 12:52:49,672 INFO L273 TraceCheckUtils]: 16: Hoare triple {49#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {49#(= 0 |old(~head~0.base)|)} is VALID [2018-11-23 12:52:49,673 INFO L273 TraceCheckUtils]: 17: Hoare triple {49#(= 0 |old(~head~0.base)|)} assume true; {49#(= 0 |old(~head~0.base)|)} is VALID [2018-11-23 12:52:49,690 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {49#(= 0 |old(~head~0.base)|)} {47#(not (= ~head~0.base 0))} #80#return; {45#false} is VALID [2018-11-23 12:52:49,691 INFO L273 TraceCheckUtils]: 19: Hoare triple {45#false} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {45#false} is VALID [2018-11-23 12:52:49,691 INFO L256 TraceCheckUtils]: 20: Hoare triple {45#false} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {44#true} is VALID [2018-11-23 12:52:49,691 INFO L273 TraceCheckUtils]: 21: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:49,692 INFO L273 TraceCheckUtils]: 22: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:49,692 INFO L273 TraceCheckUtils]: 23: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2018-11-23 12:52:49,692 INFO L273 TraceCheckUtils]: 24: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:49,693 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {44#true} {45#false} #82#return; {45#false} is VALID [2018-11-23 12:52:49,693 INFO L273 TraceCheckUtils]: 26: Hoare triple {45#false} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {45#false} is VALID [2018-11-23 12:52:49,693 INFO L256 TraceCheckUtils]: 27: Hoare triple {45#false} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {44#true} is VALID [2018-11-23 12:52:49,694 INFO L273 TraceCheckUtils]: 28: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:49,694 INFO L273 TraceCheckUtils]: 29: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:49,694 INFO L273 TraceCheckUtils]: 30: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2018-11-23 12:52:49,694 INFO L273 TraceCheckUtils]: 31: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:49,695 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {44#true} {45#false} #84#return; {45#false} is VALID [2018-11-23 12:52:49,695 INFO L273 TraceCheckUtils]: 33: Hoare triple {45#false} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {45#false} is VALID [2018-11-23 12:52:49,696 INFO L256 TraceCheckUtils]: 34: Hoare triple {45#false} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {44#true} is VALID [2018-11-23 12:52:49,696 INFO L273 TraceCheckUtils]: 35: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID [2018-11-23 12:52:49,696 INFO L273 TraceCheckUtils]: 36: Hoare triple {44#true} assume !true; {44#true} is VALID [2018-11-23 12:52:49,697 INFO L273 TraceCheckUtils]: 37: Hoare triple {44#true} #res.base, #res.offset := ~l.base, ~l.offset; {44#true} is VALID [2018-11-23 12:52:49,697 INFO L273 TraceCheckUtils]: 38: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:49,697 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {44#true} {45#false} #86#return; {45#false} is VALID [2018-11-23 12:52:49,698 INFO L273 TraceCheckUtils]: 40: Hoare triple {45#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); {45#false} is VALID [2018-11-23 12:52:49,698 INFO L256 TraceCheckUtils]: 41: Hoare triple {45#false} call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); {45#false} is VALID [2018-11-23 12:52:49,698 INFO L273 TraceCheckUtils]: 42: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID [2018-11-23 12:52:49,699 INFO L273 TraceCheckUtils]: 43: Hoare triple {45#false} assume 0 == ~cond; {45#false} is VALID [2018-11-23 12:52:49,699 INFO L273 TraceCheckUtils]: 44: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-23 12:52:49,708 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-11-23 12:52:49,711 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:52:49,711 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:52:49,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:49,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:49,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:49,911 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:52:50,172 INFO L256 TraceCheckUtils]: 0: Hoare triple {44#true} call ULTIMATE.init(); {44#true} is VALID [2018-11-23 12:52:50,172 INFO L273 TraceCheckUtils]: 1: Hoare triple {44#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {44#true} is VALID [2018-11-23 12:52:50,173 INFO L273 TraceCheckUtils]: 2: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:50,173 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {44#true} {44#true} #74#return; {44#true} is VALID [2018-11-23 12:52:50,173 INFO L256 TraceCheckUtils]: 4: Hoare triple {44#true} call #t~ret11 := main(); {44#true} is VALID [2018-11-23 12:52:50,174 INFO L273 TraceCheckUtils]: 5: Hoare triple {44#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {44#true} is VALID [2018-11-23 12:52:50,174 INFO L256 TraceCheckUtils]: 6: Hoare triple {44#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {44#true} is VALID [2018-11-23 12:52:50,175 INFO L273 TraceCheckUtils]: 7: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,176 INFO L273 TraceCheckUtils]: 8: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,176 INFO L273 TraceCheckUtils]: 9: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2018-11-23 12:52:50,176 INFO L273 TraceCheckUtils]: 10: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:50,177 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {44#true} {44#true} #78#return; {44#true} is VALID [2018-11-23 12:52:50,177 INFO L273 TraceCheckUtils]: 12: Hoare triple {44#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {44#true} is VALID [2018-11-23 12:52:50,178 INFO L256 TraceCheckUtils]: 13: Hoare triple {44#true} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {44#true} is VALID [2018-11-23 12:52:50,178 INFO L273 TraceCheckUtils]: 14: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,178 INFO L273 TraceCheckUtils]: 15: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,179 INFO L273 TraceCheckUtils]: 16: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2018-11-23 12:52:50,179 INFO L273 TraceCheckUtils]: 17: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:50,179 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {44#true} {44#true} #80#return; {44#true} is VALID [2018-11-23 12:52:50,183 INFO L273 TraceCheckUtils]: 19: Hoare triple {44#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {44#true} is VALID [2018-11-23 12:52:50,183 INFO L256 TraceCheckUtils]: 20: Hoare triple {44#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {44#true} is VALID [2018-11-23 12:52:50,184 INFO L273 TraceCheckUtils]: 21: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,184 INFO L273 TraceCheckUtils]: 22: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,184 INFO L273 TraceCheckUtils]: 23: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2018-11-23 12:52:50,185 INFO L273 TraceCheckUtils]: 24: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:50,185 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {44#true} {44#true} #82#return; {44#true} is VALID [2018-11-23 12:52:50,185 INFO L273 TraceCheckUtils]: 26: Hoare triple {44#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {44#true} is VALID [2018-11-23 12:52:50,187 INFO L256 TraceCheckUtils]: 27: Hoare triple {44#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {44#true} is VALID [2018-11-23 12:52:50,187 INFO L273 TraceCheckUtils]: 28: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,187 INFO L273 TraceCheckUtils]: 29: Hoare triple {44#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {44#true} is VALID [2018-11-23 12:52:50,188 INFO L273 TraceCheckUtils]: 30: Hoare triple {44#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {44#true} is VALID [2018-11-23 12:52:50,188 INFO L273 TraceCheckUtils]: 31: Hoare triple {44#true} assume true; {44#true} is VALID [2018-11-23 12:52:50,189 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {44#true} {44#true} #84#return; {44#true} is VALID [2018-11-23 12:52:50,195 INFO L273 TraceCheckUtils]: 33: Hoare triple {44#true} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {44#true} is VALID [2018-11-23 12:52:50,195 INFO L256 TraceCheckUtils]: 34: Hoare triple {44#true} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {44#true} is VALID [2018-11-23 12:52:50,196 INFO L273 TraceCheckUtils]: 35: Hoare triple {44#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {44#true} is VALID [2018-11-23 12:52:50,206 INFO L273 TraceCheckUtils]: 36: Hoare triple {44#true} assume !true; {45#false} is VALID [2018-11-23 12:52:50,206 INFO L273 TraceCheckUtils]: 37: Hoare triple {45#false} #res.base, #res.offset := ~l.base, ~l.offset; {45#false} is VALID [2018-11-23 12:52:50,206 INFO L273 TraceCheckUtils]: 38: Hoare triple {45#false} assume true; {45#false} is VALID [2018-11-23 12:52:50,207 INFO L268 TraceCheckUtils]: 39: Hoare quadruple {45#false} {44#true} #86#return; {45#false} is VALID [2018-11-23 12:52:50,207 INFO L273 TraceCheckUtils]: 40: Hoare triple {45#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); {45#false} is VALID [2018-11-23 12:52:50,208 INFO L256 TraceCheckUtils]: 41: Hoare triple {45#false} call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); {45#false} is VALID [2018-11-23 12:52:50,209 INFO L273 TraceCheckUtils]: 42: Hoare triple {45#false} ~cond := #in~cond; {45#false} is VALID [2018-11-23 12:52:50,209 INFO L273 TraceCheckUtils]: 43: Hoare triple {45#false} assume 0 == ~cond; {45#false} is VALID [2018-11-23 12:52:50,209 INFO L273 TraceCheckUtils]: 44: Hoare triple {45#false} assume !false; {45#false} is VALID [2018-11-23 12:52:50,215 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:52:50,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:52:50,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-23 12:52:50,288 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-23 12:52:50,294 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:50,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:52:50,644 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:50,645 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:52:50,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:52:50,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:52:50,656 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 6 states. [2018-11-23 12:52:51,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:51,912 INFO L93 Difference]: Finished difference Result 95 states and 133 transitions. [2018-11-23 12:52:51,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 12:52:51,913 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-11-23 12:52:51,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:51,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:52:51,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2018-11-23 12:52:51,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:52:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 133 transitions. [2018-11-23 12:52:51,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 133 transitions. [2018-11-23 12:52:52,194 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:52,209 INFO L225 Difference]: With dead ends: 95 [2018-11-23 12:52:52,209 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:52:52,213 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2018-11-23 12:52:52,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:52:52,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 38. [2018-11-23 12:52:52,294 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:52,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 38 states. [2018-11-23 12:52:52,295 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 38 states. [2018-11-23 12:52:52,295 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 38 states. [2018-11-23 12:52:52,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:52,303 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:52:52,304 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:52:52,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:52,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:52,305 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand 49 states. [2018-11-23 12:52:52,306 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 49 states. [2018-11-23 12:52:52,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:52,312 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2018-11-23 12:52:52,313 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-11-23 12:52:52,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:52,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:52,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:52,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:52,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-11-23 12:52:52,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2018-11-23 12:52:52,320 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 45 [2018-11-23 12:52:52,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:52,321 INFO L480 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2018-11-23 12:52:52,321 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:52:52,321 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2018-11-23 12:52:52,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:52:52,323 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:52,323 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:52,324 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:52,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:52,324 INFO L82 PathProgramCache]: Analyzing trace with hash 369290796, now seen corresponding path program 1 times [2018-11-23 12:52:52,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:52,325 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:52,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:52,326 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:52,326 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:52,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:52,788 INFO L256 TraceCheckUtils]: 0: Hoare triple {483#true} call ULTIMATE.init(); {483#true} is VALID [2018-11-23 12:52:52,789 INFO L273 TraceCheckUtils]: 1: Hoare triple {483#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {483#true} is VALID [2018-11-23 12:52:52,789 INFO L273 TraceCheckUtils]: 2: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 12:52:52,789 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {483#true} {483#true} #74#return; {483#true} is VALID [2018-11-23 12:52:52,790 INFO L256 TraceCheckUtils]: 4: Hoare triple {483#true} call #t~ret11 := main(); {483#true} is VALID [2018-11-23 12:52:52,790 INFO L273 TraceCheckUtils]: 5: Hoare triple {483#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {483#true} is VALID [2018-11-23 12:52:52,790 INFO L256 TraceCheckUtils]: 6: Hoare triple {483#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {483#true} is VALID [2018-11-23 12:52:52,790 INFO L273 TraceCheckUtils]: 7: Hoare triple {483#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {483#true} is VALID [2018-11-23 12:52:52,791 INFO L273 TraceCheckUtils]: 8: Hoare triple {483#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {483#true} is VALID [2018-11-23 12:52:52,791 INFO L273 TraceCheckUtils]: 9: Hoare triple {483#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {483#true} is VALID [2018-11-23 12:52:52,791 INFO L273 TraceCheckUtils]: 10: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 12:52:52,792 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {483#true} {483#true} #78#return; {483#true} is VALID [2018-11-23 12:52:52,792 INFO L273 TraceCheckUtils]: 12: Hoare triple {483#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {483#true} is VALID [2018-11-23 12:52:52,792 INFO L256 TraceCheckUtils]: 13: Hoare triple {483#true} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {483#true} is VALID [2018-11-23 12:52:52,793 INFO L273 TraceCheckUtils]: 14: Hoare triple {483#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {483#true} is VALID [2018-11-23 12:52:52,793 INFO L273 TraceCheckUtils]: 15: Hoare triple {483#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); {483#true} is VALID [2018-11-23 12:52:52,793 INFO L273 TraceCheckUtils]: 16: Hoare triple {483#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {483#true} is VALID [2018-11-23 12:52:52,794 INFO L273 TraceCheckUtils]: 17: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 12:52:52,794 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {483#true} {483#true} #80#return; {483#true} is VALID [2018-11-23 12:52:52,794 INFO L273 TraceCheckUtils]: 19: Hoare triple {483#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {483#true} is VALID [2018-11-23 12:52:52,794 INFO L256 TraceCheckUtils]: 20: Hoare triple {483#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {483#true} is VALID [2018-11-23 12:52:52,795 INFO L273 TraceCheckUtils]: 21: Hoare triple {483#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {483#true} is VALID [2018-11-23 12:52:52,795 INFO L273 TraceCheckUtils]: 22: Hoare triple {483#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); {483#true} is VALID [2018-11-23 12:52:52,795 INFO L273 TraceCheckUtils]: 23: Hoare triple {483#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {483#true} is VALID [2018-11-23 12:52:52,795 INFO L273 TraceCheckUtils]: 24: Hoare triple {483#true} assume true; {483#true} is VALID [2018-11-23 12:52:52,796 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {483#true} {483#true} #82#return; {483#true} is VALID [2018-11-23 12:52:52,796 INFO L273 TraceCheckUtils]: 26: Hoare triple {483#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {483#true} is VALID [2018-11-23 12:52:52,796 INFO L256 TraceCheckUtils]: 27: Hoare triple {483#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {483#true} is VALID [2018-11-23 12:52:52,798 INFO L273 TraceCheckUtils]: 28: Hoare triple {483#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {485#(<= |insert_list_#in~k| insert_list_~k)} is VALID [2018-11-23 12:52:52,800 INFO L273 TraceCheckUtils]: 29: Hoare triple {485#(<= |insert_list_#in~k| insert_list_~k)} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); {486#(<= |insert_list_#in~k| (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset))} is VALID [2018-11-23 12:52:52,801 INFO L273 TraceCheckUtils]: 30: Hoare triple {486#(<= |insert_list_#in~k| (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {487#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:52:52,817 INFO L273 TraceCheckUtils]: 31: Hoare triple {487#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume true; {487#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:52:52,819 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {487#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} {483#true} #84#return; {488#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:52:52,819 INFO L273 TraceCheckUtils]: 33: Hoare triple {488#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {488#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:52:52,820 INFO L256 TraceCheckUtils]: 34: Hoare triple {488#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {483#true} is VALID [2018-11-23 12:52:52,825 INFO L273 TraceCheckUtils]: 35: Hoare triple {483#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {489#(and (<= search_list_~k |search_list_#in~k|) (= ~head~0.base search_list_~l.base) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-23 12:52:52,826 INFO L273 TraceCheckUtils]: 36: Hoare triple {489#(and (<= search_list_~k |search_list_#in~k|) (= ~head~0.base search_list_~l.base) (= search_list_~l.offset ~head~0.offset))} #t~short1 := ~l.base != 0 || ~l.offset != 0; {489#(and (<= search_list_~k |search_list_#in~k|) (= ~head~0.base search_list_~l.base) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-23 12:52:52,827 INFO L273 TraceCheckUtils]: 37: Hoare triple {489#(and (<= search_list_~k |search_list_#in~k|) (= ~head~0.base search_list_~l.base) (= search_list_~l.offset ~head~0.offset))} assume #t~short1;call #t~mem0 := read~int(~l.base, ~l.offset, 4);#t~short1 := #t~mem0 != ~k; {490#(and (= ~head~0.base search_list_~l.base) (or (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) |search_list_#t~short1|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-23 12:52:52,831 INFO L273 TraceCheckUtils]: 38: Hoare triple {490#(and (= ~head~0.base search_list_~l.base) (or (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) |search_list_#t~short1|) (= search_list_~l.offset ~head~0.offset))} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {491#(and (= ~head~0.base search_list_~l.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} is VALID [2018-11-23 12:52:52,835 INFO L273 TraceCheckUtils]: 39: Hoare triple {491#(and (= ~head~0.base search_list_~l.base) (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (= search_list_~l.offset ~head~0.offset))} #res.base, #res.offset := ~l.base, ~l.offset; {492#(and (= |search_list_#res.offset| ~head~0.offset) (<= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|) (= ~head~0.base |search_list_#res.base|))} is VALID [2018-11-23 12:52:52,838 INFO L273 TraceCheckUtils]: 40: Hoare triple {492#(and (= |search_list_#res.offset| ~head~0.offset) (<= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|) (= ~head~0.base |search_list_#res.base|))} assume true; {492#(and (= |search_list_#res.offset| ~head~0.offset) (<= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|) (= ~head~0.base |search_list_#res.base|))} is VALID [2018-11-23 12:52:52,839 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {492#(and (= |search_list_#res.offset| ~head~0.offset) (<= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|) (= ~head~0.base |search_list_#res.base|))} {488#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} #86#return; {484#false} is VALID [2018-11-23 12:52:52,839 INFO L273 TraceCheckUtils]: 42: Hoare triple {484#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); {484#false} is VALID [2018-11-23 12:52:52,840 INFO L256 TraceCheckUtils]: 43: Hoare triple {484#false} call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); {484#false} is VALID [2018-11-23 12:52:52,840 INFO L273 TraceCheckUtils]: 44: Hoare triple {484#false} ~cond := #in~cond; {484#false} is VALID [2018-11-23 12:52:52,840 INFO L273 TraceCheckUtils]: 45: Hoare triple {484#false} assume 0 == ~cond; {484#false} is VALID [2018-11-23 12:52:52,840 INFO L273 TraceCheckUtils]: 46: Hoare triple {484#false} assume !false; {484#false} is VALID [2018-11-23 12:52:52,846 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:52:52,847 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:52,847 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:52:52,848 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 12:52:52,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:52,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:52:52,981 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:52,981 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:52:52,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:52:52,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:52:52,982 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand 10 states. [2018-11-23 12:52:54,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:54,441 INFO L93 Difference]: Finished difference Result 56 states and 63 transitions. [2018-11-23 12:52:54,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 12:52:54,442 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-11-23 12:52:54,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:54,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:52:54,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2018-11-23 12:52:54,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:52:54,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 58 transitions. [2018-11-23 12:52:54,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 58 transitions. [2018-11-23 12:52:54,546 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:54,549 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:52:54,550 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 12:52:54,552 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=212, Unknown=0, NotChecked=0, Total=272 [2018-11-23 12:52:54,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 12:52:54,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 41. [2018-11-23 12:52:54,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:54,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 41 states. [2018-11-23 12:52:54,611 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 41 states. [2018-11-23 12:52:54,612 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 41 states. [2018-11-23 12:52:54,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:54,617 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 12:52:54,617 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 12:52:54,618 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:54,618 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:54,618 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 47 states. [2018-11-23 12:52:54,619 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 47 states. [2018-11-23 12:52:54,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:54,623 INFO L93 Difference]: Finished difference Result 47 states and 54 transitions. [2018-11-23 12:52:54,623 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 54 transitions. [2018-11-23 12:52:54,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:54,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:54,624 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:54,624 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:54,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:52:54,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2018-11-23 12:52:54,628 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 47 [2018-11-23 12:52:54,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:54,628 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2018-11-23 12:52:54,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:52:54,628 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:52:54,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 12:52:54,630 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:54,631 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:54,631 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:54,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:54,631 INFO L82 PathProgramCache]: Analyzing trace with hash -23736214, now seen corresponding path program 1 times [2018-11-23 12:52:54,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:54,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:54,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:54,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:54,797 INFO L256 TraceCheckUtils]: 0: Hoare triple {735#true} call ULTIMATE.init(); {735#true} is VALID [2018-11-23 12:52:54,797 INFO L273 TraceCheckUtils]: 1: Hoare triple {735#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {735#true} is VALID [2018-11-23 12:52:54,798 INFO L273 TraceCheckUtils]: 2: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 12:52:54,798 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {735#true} {735#true} #74#return; {735#true} is VALID [2018-11-23 12:52:54,799 INFO L256 TraceCheckUtils]: 4: Hoare triple {735#true} call #t~ret11 := main(); {735#true} is VALID [2018-11-23 12:52:54,799 INFO L273 TraceCheckUtils]: 5: Hoare triple {735#true} havoc ~i~0;havoc ~mylist~0.base, ~mylist~0.offset;havoc ~temp~0.base, ~temp~0.offset; {735#true} is VALID [2018-11-23 12:52:54,799 INFO L256 TraceCheckUtils]: 6: Hoare triple {735#true} call #t~ret4 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {735#true} is VALID [2018-11-23 12:52:54,800 INFO L273 TraceCheckUtils]: 7: Hoare triple {735#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {735#true} is VALID [2018-11-23 12:52:54,800 INFO L273 TraceCheckUtils]: 8: Hoare triple {735#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {735#true} is VALID [2018-11-23 12:52:54,800 INFO L273 TraceCheckUtils]: 9: Hoare triple {735#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {735#true} is VALID [2018-11-23 12:52:54,800 INFO L273 TraceCheckUtils]: 10: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 12:52:54,800 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {735#true} {735#true} #78#return; {735#true} is VALID [2018-11-23 12:52:54,801 INFO L273 TraceCheckUtils]: 12: Hoare triple {735#true} assume -2147483648 <= #t~ret4 && #t~ret4 <= 2147483647;havoc #t~ret4; {735#true} is VALID [2018-11-23 12:52:54,801 INFO L256 TraceCheckUtils]: 13: Hoare triple {735#true} call #t~ret5 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {735#true} is VALID [2018-11-23 12:52:54,801 INFO L273 TraceCheckUtils]: 14: Hoare triple {735#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {735#true} is VALID [2018-11-23 12:52:54,801 INFO L273 TraceCheckUtils]: 15: Hoare triple {735#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); {735#true} is VALID [2018-11-23 12:52:54,801 INFO L273 TraceCheckUtils]: 16: Hoare triple {735#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {735#true} is VALID [2018-11-23 12:52:54,802 INFO L273 TraceCheckUtils]: 17: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 12:52:54,802 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {735#true} {735#true} #80#return; {735#true} is VALID [2018-11-23 12:52:54,802 INFO L273 TraceCheckUtils]: 19: Hoare triple {735#true} assume -2147483648 <= #t~ret5 && #t~ret5 <= 2147483647;havoc #t~ret5; {735#true} is VALID [2018-11-23 12:52:54,802 INFO L256 TraceCheckUtils]: 20: Hoare triple {735#true} call #t~ret6 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {735#true} is VALID [2018-11-23 12:52:54,802 INFO L273 TraceCheckUtils]: 21: Hoare triple {735#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {735#true} is VALID [2018-11-23 12:52:54,802 INFO L273 TraceCheckUtils]: 22: Hoare triple {735#true} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); {735#true} is VALID [2018-11-23 12:52:54,803 INFO L273 TraceCheckUtils]: 23: Hoare triple {735#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {735#true} is VALID [2018-11-23 12:52:54,803 INFO L273 TraceCheckUtils]: 24: Hoare triple {735#true} assume true; {735#true} is VALID [2018-11-23 12:52:54,803 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {735#true} {735#true} #82#return; {735#true} is VALID [2018-11-23 12:52:54,803 INFO L273 TraceCheckUtils]: 26: Hoare triple {735#true} assume -2147483648 <= #t~ret6 && #t~ret6 <= 2147483647;havoc #t~ret6; {735#true} is VALID [2018-11-23 12:52:54,803 INFO L256 TraceCheckUtils]: 27: Hoare triple {735#true} call #t~ret7 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {735#true} is VALID [2018-11-23 12:52:54,804 INFO L273 TraceCheckUtils]: 28: Hoare triple {735#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc3.base, #t~malloc3.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc3.base, #t~malloc3.offset;call write~int(~k, ~l.base, ~l.offset, 4); {737#(not (= insert_list_~l.base 0))} is VALID [2018-11-23 12:52:54,805 INFO L273 TraceCheckUtils]: 29: Hoare triple {737#(not (= insert_list_~l.base 0))} assume !(~head~0.base == 0 && ~head~0.offset == 0);call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(~head~0.base, ~head~0.offset, ~l.base, 4 + ~l.offset, 4); {737#(not (= insert_list_~l.base 0))} is VALID [2018-11-23 12:52:54,807 INFO L273 TraceCheckUtils]: 30: Hoare triple {737#(not (= insert_list_~l.base 0))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {738#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:54,810 INFO L273 TraceCheckUtils]: 31: Hoare triple {738#(not (= ~head~0.base 0))} assume true; {738#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:54,811 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {738#(not (= ~head~0.base 0))} {735#true} #84#return; {738#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:54,813 INFO L273 TraceCheckUtils]: 33: Hoare triple {738#(not (= ~head~0.base 0))} assume -2147483648 <= #t~ret7 && #t~ret7 <= 2147483647;havoc #t~ret7; {738#(not (= ~head~0.base 0))} is VALID [2018-11-23 12:52:54,813 INFO L256 TraceCheckUtils]: 34: Hoare triple {738#(not (= ~head~0.base 0))} call #t~ret8.base, #t~ret8.offset := search_list(~head~0.base, ~head~0.offset, 2); {735#true} is VALID [2018-11-23 12:52:54,813 INFO L273 TraceCheckUtils]: 35: Hoare triple {735#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {739#(= search_list_~l.base ~head~0.base)} is VALID [2018-11-23 12:52:54,815 INFO L273 TraceCheckUtils]: 36: Hoare triple {739#(= search_list_~l.base ~head~0.base)} #t~short1 := ~l.base != 0 || ~l.offset != 0; {740#(or (= 0 ~head~0.base) |search_list_#t~short1|)} is VALID [2018-11-23 12:52:54,815 INFO L273 TraceCheckUtils]: 37: Hoare triple {740#(or (= 0 ~head~0.base) |search_list_#t~short1|)} assume !#t~short1; {741#(= 0 ~head~0.base)} is VALID [2018-11-23 12:52:54,817 INFO L273 TraceCheckUtils]: 38: Hoare triple {741#(= 0 ~head~0.base)} assume !#t~short1;havoc #t~mem0;havoc #t~short1; {741#(= 0 ~head~0.base)} is VALID [2018-11-23 12:52:54,817 INFO L273 TraceCheckUtils]: 39: Hoare triple {741#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {741#(= 0 ~head~0.base)} is VALID [2018-11-23 12:52:54,817 INFO L273 TraceCheckUtils]: 40: Hoare triple {741#(= 0 ~head~0.base)} assume true; {741#(= 0 ~head~0.base)} is VALID [2018-11-23 12:52:54,818 INFO L268 TraceCheckUtils]: 41: Hoare quadruple {741#(= 0 ~head~0.base)} {738#(not (= ~head~0.base 0))} #86#return; {736#false} is VALID [2018-11-23 12:52:54,819 INFO L273 TraceCheckUtils]: 42: Hoare triple {736#false} ~temp~0.base, ~temp~0.offset := #t~ret8.base, #t~ret8.offset;havoc #t~ret8.base, #t~ret8.offset;call #t~mem9 := read~int(~temp~0.base, ~temp~0.offset, 4); {736#false} is VALID [2018-11-23 12:52:54,819 INFO L256 TraceCheckUtils]: 43: Hoare triple {736#false} call __VERIFIER_assert((if 1 == #t~mem9 then 1 else 0)); {736#false} is VALID [2018-11-23 12:52:54,819 INFO L273 TraceCheckUtils]: 44: Hoare triple {736#false} ~cond := #in~cond; {736#false} is VALID [2018-11-23 12:52:54,819 INFO L273 TraceCheckUtils]: 45: Hoare triple {736#false} assume 0 == ~cond; {736#false} is VALID [2018-11-23 12:52:54,819 INFO L273 TraceCheckUtils]: 46: Hoare triple {736#false} assume !false; {736#false} is VALID [2018-11-23 12:52:54,822 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2018-11-23 12:52:54,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:52:54,822 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:52:54,822 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 12:52:54,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:52:54,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:52:54,906 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:54,906 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:52:54,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:52:54,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:52:54,907 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand 7 states. [2018-11-23 12:52:55,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:55,483 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-23 12:52:55,484 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:52:55,484 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 47 [2018-11-23 12:52:55,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:52:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:52:55,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:52:55,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:52:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 58 transitions. [2018-11-23 12:52:55,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 58 transitions. [2018-11-23 12:52:55,639 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:52:55,643 INFO L225 Difference]: With dead ends: 54 [2018-11-23 12:52:55,643 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 12:52:55,649 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-11-23 12:52:55,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 12:52:55,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 12:52:55,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:52:55,810 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand 41 states. [2018-11-23 12:52:55,810 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand 41 states. [2018-11-23 12:52:55,810 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 41 states. [2018-11-23 12:52:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:55,814 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:52:55,814 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:52:55,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:55,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:55,816 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 42 states. [2018-11-23 12:52:55,816 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 42 states. [2018-11-23 12:52:55,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:52:55,822 INFO L93 Difference]: Finished difference Result 42 states and 47 transitions. [2018-11-23 12:52:55,822 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2018-11-23 12:52:55,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:52:55,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:52:55,823 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:52:55,823 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:52:55,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 12:52:55,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 46 transitions. [2018-11-23 12:52:55,826 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 46 transitions. Word has length 47 [2018-11-23 12:52:55,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:52:55,827 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 46 transitions. [2018-11-23 12:52:55,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:52:55,827 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 46 transitions. [2018-11-23 12:52:55,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-11-23 12:52:55,829 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:52:55,829 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 12:52:55,829 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:52:55,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:52:55,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1979191460, now seen corresponding path program 1 times [2018-11-23 12:52:55,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:52:55,830 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:52:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:55,831 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:52:55,831 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:52:55,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:52:56,507 WARN L180 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 19 [2018-11-23 12:52:56,797 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:52:56,802 INFO L168 Benchmark]: Toolchain (without parser) took 9604.34 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 857.7 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -873.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:56,804 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:56,804 INFO L168 Benchmark]: CACSL2BoogieTranslator took 707.19 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:56,805 INFO L168 Benchmark]: Boogie Procedure Inliner took 107.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:56,806 INFO L168 Benchmark]: Boogie Preprocessor took 42.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 12:52:56,806 INFO L168 Benchmark]: RCFGBuilder took 956.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:56,807 INFO L168 Benchmark]: TraceAbstraction took 7785.47 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -126.5 MB). Peak memory consumption was 7.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:52:56,813 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.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 707.19 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: 34.4 MB). Peak memory consumption was 34.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 107.17 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 723.5 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -815.8 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.50 ms. Allocated memory is still 2.3 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 956.51 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 34.9 MB). Peak memory consumption was 34.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 7785.47 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 134.2 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -126.5 MB). Peak memory consumption was 7.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...