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_true-unreach-call_false-valid-memcleanup.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 12:53:11,889 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 12:53:11,891 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 12:53:11,908 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 12:53:11,908 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 12:53:11,910 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 12:53:11,912 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 12:53:11,916 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 12:53:11,918 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 12:53:11,921 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 12:53:11,922 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 12:53:11,923 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 12:53:11,923 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 12:53:11,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 12:53:11,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 12:53:11,931 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 12:53:11,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 12:53:11,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 12:53:11,947 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 12:53:11,953 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 12:53:11,954 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 12:53:11,955 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 12:53:11,961 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 12:53:11,961 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 12:53:11,961 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 12:53:11,963 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 12:53:11,964 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 12:53:11,968 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 12:53:11,969 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 12:53:11,971 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 12:53:11,972 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 12:53:11,973 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 12:53:11,973 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 12:53:11,973 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 12:53:11,974 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 12:53:11,977 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 12:53:11,977 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:53:12,009 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 12:53:12,009 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 12:53:12,011 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 12:53:12,011 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 12:53:12,012 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 12:53:12,012 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 12:53:12,012 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 12:53:12,013 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 12:53:12,013 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 12:53:12,013 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 12:53:12,013 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 12:53:12,013 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 12:53:12,014 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 12:53:12,014 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 12:53:12,014 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 12:53:12,014 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 12:53:12,014 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 12:53:12,014 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 12:53:12,016 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 12:53:12,016 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 12:53:12,016 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 12:53:12,016 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 12:53:12,017 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 12:53:12,017 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 12:53:12,017 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 12:53:12,017 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 12:53:12,018 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 12:53:12,018 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 12:53:12,018 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 12:53:12,018 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 12:53:12,018 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 12:53:12,086 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 12:53:12,102 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 12:53:12,107 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 12:53:12,109 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 12:53:12,109 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 12:53:12,110 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_search_true-unreach-call_false-valid-memcleanup.i [2018-11-23 12:53:12,171 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3650faf4d/11da9dc5e67a4c7082cd1c9090031d75/FLAGda3537812 [2018-11-23 12:53:12,713 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 12:53:12,714 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-properties/list_search_true-unreach-call_false-valid-memcleanup.i [2018-11-23 12:53:12,730 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3650faf4d/11da9dc5e67a4c7082cd1c9090031d75/FLAGda3537812 [2018-11-23 12:53:12,958 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3650faf4d/11da9dc5e67a4c7082cd1c9090031d75 [2018-11-23 12:53:12,969 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 12:53:12,971 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 12:53:12,972 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:12,972 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 12:53:12,976 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 12:53:12,978 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:12" (1/1) ... [2018-11-23 12:53:12,981 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54e05182 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:12, skipping insertion in model container [2018-11-23 12:53:12,982 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:53:12" (1/1) ... [2018-11-23 12:53:12,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 12:53:13,066 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 12:53:13,568 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:13,580 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 12:53:13,650 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 12:53:13,872 INFO L195 MainTranslator]: Completed translation [2018-11-23 12:53:13,873 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13 WrapperNode [2018-11-23 12:53:13,873 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 12:53:13,874 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:13,874 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 12:53:13,874 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 12:53:13,886 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:53:13" (1/1) ... [2018-11-23 12:53:13,920 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:53:13" (1/1) ... [2018-11-23 12:53:13,929 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 12:53:13,930 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 12:53:13,930 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 12:53:13,930 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 12:53:13,938 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (1/1) ... [2018-11-23 12:53:13,938 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (1/1) ... [2018-11-23 12:53:13,942 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (1/1) ... [2018-11-23 12:53:13,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (1/1) ... [2018-11-23 12:53:13,962 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (1/1) ... [2018-11-23 12:53:13,976 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (1/1) ... [2018-11-23 12:53:13,978 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (1/1) ... [2018-11-23 12:53:13,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 12:53:13,989 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 12:53:13,989 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 12:53:13,990 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 12:53:13,996 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (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:53:14,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 12:53:14,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 12:53:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 12:53:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 12:53:14,051 INFO L130 BoogieDeclarations]: Found specification of procedure search_list [2018-11-23 12:53:14,052 INFO L138 BoogieDeclarations]: Found implementation of procedure search_list [2018-11-23 12:53:14,052 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 12:53:14,052 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 12:53:14,052 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-23 12:53:14,052 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-23 12:53:14,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 12:53:14,053 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 12:53:14,053 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 12:53:14,053 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 12:53:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure delete_list [2018-11-23 12:53:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure delete_list [2018-11-23 12:53:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure insert_list [2018-11-23 12:53:14,054 INFO L138 BoogieDeclarations]: Found implementation of procedure insert_list [2018-11-23 12:53:14,054 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 12:53:14,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 12:53:15,095 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 12:53:15,096 INFO L280 CfgBuilder]: Removed 4 assue(true) statements. [2018-11-23 12:53:15,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:15 BoogieIcfgContainer [2018-11-23 12:53:15,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 12:53:15,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 12:53:15,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 12:53:15,100 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 12:53:15,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 12:53:12" (1/3) ... [2018-11-23 12:53:15,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebc78de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:15, skipping insertion in model container [2018-11-23 12:53:15,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:53:13" (2/3) ... [2018-11-23 12:53:15,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5ebc78de and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 12:53:15, skipping insertion in model container [2018-11-23 12:53:15,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:53:15" (3/3) ... [2018-11-23 12:53:15,104 INFO L112 eAbstractionObserver]: Analyzing ICFG list_search_true-unreach-call_false-valid-memcleanup.i [2018-11-23 12:53:15,114 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 12:53:15,125 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 12:53:15,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 12:53:15,172 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 12:53:15,173 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 12:53:15,173 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 12:53:15,173 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 12:53:15,173 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 12:53:15,173 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 12:53:15,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 12:53:15,174 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 12:53:15,174 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 12:53:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states. [2018-11-23 12:53:15,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-11-23 12:53:15,200 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:15,201 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, 1] [2018-11-23 12:53:15,204 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:15,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:15,211 INFO L82 PathProgramCache]: Analyzing trace with hash 1779994185, now seen corresponding path program 1 times [2018-11-23 12:53:15,213 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:15,214 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:15,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:15,269 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:15,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:15,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:15,669 INFO L256 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {55#true} is VALID [2018-11-23 12:53:15,674 INFO L273 TraceCheckUtils]: 1: Hoare triple {55#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {55#true} is VALID [2018-11-23 12:53:15,674 INFO L273 TraceCheckUtils]: 2: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:15,675 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55#true} {55#true} #125#return; {55#true} is VALID [2018-11-23 12:53:15,675 INFO L256 TraceCheckUtils]: 4: Hoare triple {55#true} call #t~ret45 := main(); {55#true} is VALID [2018-11-23 12:53:15,676 INFO L273 TraceCheckUtils]: 5: Hoare triple {55#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {55#true} is VALID [2018-11-23 12:53:15,676 INFO L256 TraceCheckUtils]: 6: Hoare triple {55#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {55#true} is VALID [2018-11-23 12:53:15,690 INFO L273 TraceCheckUtils]: 7: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {57#(not (= 0 insert_list_~l.base))} is VALID [2018-11-23 12:53:15,705 INFO L273 TraceCheckUtils]: 8: Hoare triple {57#(not (= 0 insert_list_~l.base))} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {57#(not (= 0 insert_list_~l.base))} is VALID [2018-11-23 12:53:15,714 INFO L273 TraceCheckUtils]: 9: Hoare triple {57#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {58#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:15,728 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#(not (= 0 ~head~0.base))} assume true; {58#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:15,741 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#(not (= 0 ~head~0.base))} {55#true} #111#return; {58#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:15,761 INFO L273 TraceCheckUtils]: 12: Hoare triple {58#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {58#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:15,771 INFO L256 TraceCheckUtils]: 13: Hoare triple {58#(not (= 0 ~head~0.base))} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {59#(= |old(~head~0.base)| ~head~0.base)} is VALID [2018-11-23 12:53:15,784 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#(= |old(~head~0.base)| ~head~0.base)} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {59#(= |old(~head~0.base)| ~head~0.base)} is VALID [2018-11-23 12:53:15,797 INFO L273 TraceCheckUtils]: 15: Hoare triple {59#(= |old(~head~0.base)| ~head~0.base)} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {60#(= 0 |old(~head~0.base)|)} is VALID [2018-11-23 12:53:15,811 INFO L273 TraceCheckUtils]: 16: Hoare triple {60#(= 0 |old(~head~0.base)|)} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {60#(= 0 |old(~head~0.base)|)} is VALID [2018-11-23 12:53:15,829 INFO L273 TraceCheckUtils]: 17: Hoare triple {60#(= 0 |old(~head~0.base)|)} assume true; {60#(= 0 |old(~head~0.base)|)} is VALID [2018-11-23 12:53:15,839 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {60#(= 0 |old(~head~0.base)|)} {58#(not (= 0 ~head~0.base))} #113#return; {56#false} is VALID [2018-11-23 12:53:15,840 INFO L273 TraceCheckUtils]: 19: Hoare triple {56#false} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {56#false} is VALID [2018-11-23 12:53:15,840 INFO L256 TraceCheckUtils]: 20: Hoare triple {56#false} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {55#true} is VALID [2018-11-23 12:53:15,841 INFO L273 TraceCheckUtils]: 21: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {55#true} is VALID [2018-11-23 12:53:15,841 INFO L273 TraceCheckUtils]: 22: Hoare triple {55#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {55#true} is VALID [2018-11-23 12:53:15,842 INFO L273 TraceCheckUtils]: 23: Hoare triple {55#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {55#true} is VALID [2018-11-23 12:53:15,842 INFO L273 TraceCheckUtils]: 24: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:15,842 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {55#true} {56#false} #115#return; {56#false} is VALID [2018-11-23 12:53:15,843 INFO L273 TraceCheckUtils]: 26: Hoare triple {56#false} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {56#false} is VALID [2018-11-23 12:53:15,843 INFO L256 TraceCheckUtils]: 27: Hoare triple {56#false} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {55#true} is VALID [2018-11-23 12:53:15,844 INFO L273 TraceCheckUtils]: 28: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {55#true} is VALID [2018-11-23 12:53:15,844 INFO L273 TraceCheckUtils]: 29: Hoare triple {55#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {55#true} is VALID [2018-11-23 12:53:15,844 INFO L273 TraceCheckUtils]: 30: Hoare triple {55#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {55#true} is VALID [2018-11-23 12:53:15,845 INFO L273 TraceCheckUtils]: 31: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:15,845 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {55#true} {56#false} #117#return; {56#false} is VALID [2018-11-23 12:53:15,846 INFO L273 TraceCheckUtils]: 33: Hoare triple {56#false} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {56#false} is VALID [2018-11-23 12:53:15,846 INFO L273 TraceCheckUtils]: 34: Hoare triple {56#false} assume !true; {56#false} is VALID [2018-11-23 12:53:15,846 INFO L256 TraceCheckUtils]: 35: Hoare triple {56#false} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {55#true} is VALID [2018-11-23 12:53:15,847 INFO L273 TraceCheckUtils]: 36: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {55#true} is VALID [2018-11-23 12:53:15,847 INFO L273 TraceCheckUtils]: 37: Hoare triple {55#true} assume !true; {55#true} is VALID [2018-11-23 12:53:15,848 INFO L273 TraceCheckUtils]: 38: Hoare triple {55#true} #res.base, #res.offset := ~l.base, ~l.offset; {55#true} is VALID [2018-11-23 12:53:15,848 INFO L273 TraceCheckUtils]: 39: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:15,849 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {55#true} {56#false} #119#return; {56#false} is VALID [2018-11-23 12:53:15,849 INFO L273 TraceCheckUtils]: 41: Hoare triple {56#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset, 4); {56#false} is VALID [2018-11-23 12:53:15,849 INFO L256 TraceCheckUtils]: 42: Hoare triple {56#false} call __VERIFIER_assert((if 2 == #t~mem42 then 1 else 0)); {56#false} is VALID [2018-11-23 12:53:15,850 INFO L273 TraceCheckUtils]: 43: Hoare triple {56#false} ~cond := #in~cond; {56#false} is VALID [2018-11-23 12:53:15,850 INFO L273 TraceCheckUtils]: 44: Hoare triple {56#false} assume 0 == ~cond; {56#false} is VALID [2018-11-23 12:53:15,851 INFO L273 TraceCheckUtils]: 45: Hoare triple {56#false} assume !false; {56#false} is VALID [2018-11-23 12:53:15,861 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:53:15,864 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:15,864 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:53:15,885 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:16,078 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:16,860 INFO L256 TraceCheckUtils]: 0: Hoare triple {55#true} call ULTIMATE.init(); {55#true} is VALID [2018-11-23 12:53:16,861 INFO L273 TraceCheckUtils]: 1: Hoare triple {55#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {55#true} is VALID [2018-11-23 12:53:16,861 INFO L273 TraceCheckUtils]: 2: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:16,861 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {55#true} {55#true} #125#return; {55#true} is VALID [2018-11-23 12:53:16,862 INFO L256 TraceCheckUtils]: 4: Hoare triple {55#true} call #t~ret45 := main(); {55#true} is VALID [2018-11-23 12:53:16,862 INFO L273 TraceCheckUtils]: 5: Hoare triple {55#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {55#true} is VALID [2018-11-23 12:53:16,862 INFO L256 TraceCheckUtils]: 6: Hoare triple {55#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {55#true} is VALID [2018-11-23 12:53:16,863 INFO L273 TraceCheckUtils]: 7: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {55#true} is VALID [2018-11-23 12:53:16,863 INFO L273 TraceCheckUtils]: 8: Hoare triple {55#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {55#true} is VALID [2018-11-23 12:53:16,864 INFO L273 TraceCheckUtils]: 9: Hoare triple {55#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {55#true} is VALID [2018-11-23 12:53:16,864 INFO L273 TraceCheckUtils]: 10: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:16,864 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {55#true} {55#true} #111#return; {55#true} is VALID [2018-11-23 12:53:16,865 INFO L273 TraceCheckUtils]: 12: Hoare triple {55#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {55#true} is VALID [2018-11-23 12:53:16,865 INFO L256 TraceCheckUtils]: 13: Hoare triple {55#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {55#true} is VALID [2018-11-23 12:53:16,865 INFO L273 TraceCheckUtils]: 14: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {55#true} is VALID [2018-11-23 12:53:16,866 INFO L273 TraceCheckUtils]: 15: Hoare triple {55#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {55#true} is VALID [2018-11-23 12:53:16,866 INFO L273 TraceCheckUtils]: 16: Hoare triple {55#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {55#true} is VALID [2018-11-23 12:53:16,866 INFO L273 TraceCheckUtils]: 17: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:16,867 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {55#true} {55#true} #113#return; {55#true} is VALID [2018-11-23 12:53:16,867 INFO L273 TraceCheckUtils]: 19: Hoare triple {55#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {55#true} is VALID [2018-11-23 12:53:16,868 INFO L256 TraceCheckUtils]: 20: Hoare triple {55#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {55#true} is VALID [2018-11-23 12:53:16,868 INFO L273 TraceCheckUtils]: 21: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {55#true} is VALID [2018-11-23 12:53:16,868 INFO L273 TraceCheckUtils]: 22: Hoare triple {55#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {55#true} is VALID [2018-11-23 12:53:16,869 INFO L273 TraceCheckUtils]: 23: Hoare triple {55#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {55#true} is VALID [2018-11-23 12:53:16,869 INFO L273 TraceCheckUtils]: 24: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:16,869 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {55#true} {55#true} #115#return; {55#true} is VALID [2018-11-23 12:53:16,870 INFO L273 TraceCheckUtils]: 26: Hoare triple {55#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {55#true} is VALID [2018-11-23 12:53:16,870 INFO L256 TraceCheckUtils]: 27: Hoare triple {55#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {55#true} is VALID [2018-11-23 12:53:16,870 INFO L273 TraceCheckUtils]: 28: Hoare triple {55#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {55#true} is VALID [2018-11-23 12:53:16,871 INFO L273 TraceCheckUtils]: 29: Hoare triple {55#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {55#true} is VALID [2018-11-23 12:53:16,871 INFO L273 TraceCheckUtils]: 30: Hoare triple {55#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {55#true} is VALID [2018-11-23 12:53:16,871 INFO L273 TraceCheckUtils]: 31: Hoare triple {55#true} assume true; {55#true} is VALID [2018-11-23 12:53:16,872 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {55#true} {55#true} #117#return; {55#true} is VALID [2018-11-23 12:53:16,872 INFO L273 TraceCheckUtils]: 33: Hoare triple {55#true} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {55#true} is VALID [2018-11-23 12:53:16,888 INFO L273 TraceCheckUtils]: 34: Hoare triple {55#true} assume !true; {56#false} is VALID [2018-11-23 12:53:16,888 INFO L256 TraceCheckUtils]: 35: Hoare triple {56#false} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {56#false} is VALID [2018-11-23 12:53:16,889 INFO L273 TraceCheckUtils]: 36: Hoare triple {56#false} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {56#false} is VALID [2018-11-23 12:53:16,889 INFO L273 TraceCheckUtils]: 37: Hoare triple {56#false} assume !true; {56#false} is VALID [2018-11-23 12:53:16,889 INFO L273 TraceCheckUtils]: 38: Hoare triple {56#false} #res.base, #res.offset := ~l.base, ~l.offset; {56#false} is VALID [2018-11-23 12:53:16,890 INFO L273 TraceCheckUtils]: 39: Hoare triple {56#false} assume true; {56#false} is VALID [2018-11-23 12:53:16,890 INFO L268 TraceCheckUtils]: 40: Hoare quadruple {56#false} {56#false} #119#return; {56#false} is VALID [2018-11-23 12:53:16,890 INFO L273 TraceCheckUtils]: 41: Hoare triple {56#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset, 4); {56#false} is VALID [2018-11-23 12:53:16,891 INFO L256 TraceCheckUtils]: 42: Hoare triple {56#false} call __VERIFIER_assert((if 2 == #t~mem42 then 1 else 0)); {56#false} is VALID [2018-11-23 12:53:16,891 INFO L273 TraceCheckUtils]: 43: Hoare triple {56#false} ~cond := #in~cond; {56#false} is VALID [2018-11-23 12:53:16,891 INFO L273 TraceCheckUtils]: 44: Hoare triple {56#false} assume 0 == ~cond; {56#false} is VALID [2018-11-23 12:53:16,892 INFO L273 TraceCheckUtils]: 45: Hoare triple {56#false} assume !false; {56#false} is VALID [2018-11-23 12:53:16,895 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:53:16,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 12:53:16,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [6] total 6 [2018-11-23 12:53:16,933 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 12:53:16,937 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:16,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2018-11-23 12:53:17,112 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:17,112 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 12:53:17,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 12:53:17,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-23 12:53:17,124 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 6 states. [2018-11-23 12:53:18,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:18,678 INFO L93 Difference]: Finished difference Result 134 states and 187 transitions. [2018-11-23 12:53:18,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:53:18,678 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-11-23 12:53:18,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:18,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:18,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2018-11-23 12:53:18,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-23 12:53:18,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 187 transitions. [2018-11-23 12:53:18,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 187 transitions. [2018-11-23 12:53:19,159 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:19,174 INFO L225 Difference]: With dead ends: 134 [2018-11-23 12:53:19,175 INFO L226 Difference]: Without dead ends: 51 [2018-11-23 12:53:19,179 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2018-11-23 12:53:19,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-11-23 12:53:19,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 39. [2018-11-23 12:53:19,278 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:19,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand 39 states. [2018-11-23 12:53:19,279 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 39 states. [2018-11-23 12:53:19,279 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 39 states. [2018-11-23 12:53:19,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:19,288 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 12:53:19,288 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 12:53:19,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:19,290 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:19,290 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand 51 states. [2018-11-23 12:53:19,290 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 51 states. [2018-11-23 12:53:19,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:19,296 INFO L93 Difference]: Finished difference Result 51 states and 62 transitions. [2018-11-23 12:53:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 62 transitions. [2018-11-23 12:53:19,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:19,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:19,298 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:19,299 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:19,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 12:53:19,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2018-11-23 12:53:19,304 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 46 [2018-11-23 12:53:19,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:19,305 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2018-11-23 12:53:19,305 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 12:53:19,305 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2018-11-23 12:53:19,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-11-23 12:53:19,307 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:19,307 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, 1] [2018-11-23 12:53:19,308 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:19,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:19,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1991162280, now seen corresponding path program 1 times [2018-11-23 12:53:19,308 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:19,308 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:19,310 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:19,311 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:19,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:19,509 INFO L256 TraceCheckUtils]: 0: Hoare triple {550#true} call ULTIMATE.init(); {550#true} is VALID [2018-11-23 12:53:19,510 INFO L273 TraceCheckUtils]: 1: Hoare triple {550#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {550#true} is VALID [2018-11-23 12:53:19,510 INFO L273 TraceCheckUtils]: 2: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:53:19,511 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {550#true} {550#true} #125#return; {550#true} is VALID [2018-11-23 12:53:19,511 INFO L256 TraceCheckUtils]: 4: Hoare triple {550#true} call #t~ret45 := main(); {550#true} is VALID [2018-11-23 12:53:19,511 INFO L273 TraceCheckUtils]: 5: Hoare triple {550#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {550#true} is VALID [2018-11-23 12:53:19,512 INFO L256 TraceCheckUtils]: 6: Hoare triple {550#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {550#true} is VALID [2018-11-23 12:53:19,512 INFO L273 TraceCheckUtils]: 7: Hoare triple {550#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {550#true} is VALID [2018-11-23 12:53:19,512 INFO L273 TraceCheckUtils]: 8: Hoare triple {550#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {550#true} is VALID [2018-11-23 12:53:19,512 INFO L273 TraceCheckUtils]: 9: Hoare triple {550#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {550#true} is VALID [2018-11-23 12:53:19,513 INFO L273 TraceCheckUtils]: 10: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:53:19,513 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {550#true} {550#true} #111#return; {550#true} is VALID [2018-11-23 12:53:19,513 INFO L273 TraceCheckUtils]: 12: Hoare triple {550#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {550#true} is VALID [2018-11-23 12:53:19,514 INFO L256 TraceCheckUtils]: 13: Hoare triple {550#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {550#true} is VALID [2018-11-23 12:53:19,514 INFO L273 TraceCheckUtils]: 14: Hoare triple {550#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {550#true} is VALID [2018-11-23 12:53:19,514 INFO L273 TraceCheckUtils]: 15: Hoare triple {550#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); {550#true} is VALID [2018-11-23 12:53:19,515 INFO L273 TraceCheckUtils]: 16: Hoare triple {550#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {550#true} is VALID [2018-11-23 12:53:19,515 INFO L273 TraceCheckUtils]: 17: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:53:19,515 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {550#true} {550#true} #113#return; {550#true} is VALID [2018-11-23 12:53:19,516 INFO L273 TraceCheckUtils]: 19: Hoare triple {550#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {550#true} is VALID [2018-11-23 12:53:19,516 INFO L256 TraceCheckUtils]: 20: Hoare triple {550#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {550#true} is VALID [2018-11-23 12:53:19,516 INFO L273 TraceCheckUtils]: 21: Hoare triple {550#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {550#true} is VALID [2018-11-23 12:53:19,516 INFO L273 TraceCheckUtils]: 22: Hoare triple {550#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); {550#true} is VALID [2018-11-23 12:53:19,517 INFO L273 TraceCheckUtils]: 23: Hoare triple {550#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {550#true} is VALID [2018-11-23 12:53:19,517 INFO L273 TraceCheckUtils]: 24: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:53:19,517 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {550#true} {550#true} #115#return; {550#true} is VALID [2018-11-23 12:53:19,518 INFO L273 TraceCheckUtils]: 26: Hoare triple {550#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {550#true} is VALID [2018-11-23 12:53:19,518 INFO L256 TraceCheckUtils]: 27: Hoare triple {550#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {550#true} is VALID [2018-11-23 12:53:19,520 INFO L273 TraceCheckUtils]: 28: Hoare triple {550#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {552#(not (= 0 insert_list_~l.base))} is VALID [2018-11-23 12:53:19,535 INFO L273 TraceCheckUtils]: 29: Hoare triple {552#(not (= 0 insert_list_~l.base))} 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); {552#(not (= 0 insert_list_~l.base))} is VALID [2018-11-23 12:53:19,536 INFO L273 TraceCheckUtils]: 30: Hoare triple {552#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {553#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:19,541 INFO L273 TraceCheckUtils]: 31: Hoare triple {553#(not (= 0 ~head~0.base))} assume true; {553#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:19,542 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {553#(not (= 0 ~head~0.base))} {550#true} #117#return; {553#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:19,543 INFO L273 TraceCheckUtils]: 33: Hoare triple {553#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {554#(not (= 0 main_~mylist~0.base))} is VALID [2018-11-23 12:53:19,543 INFO L273 TraceCheckUtils]: 34: Hoare triple {554#(not (= 0 main_~mylist~0.base))} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {551#false} is VALID [2018-11-23 12:53:19,544 INFO L256 TraceCheckUtils]: 35: Hoare triple {551#false} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {550#true} is VALID [2018-11-23 12:53:19,544 INFO L273 TraceCheckUtils]: 36: Hoare triple {550#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {550#true} is VALID [2018-11-23 12:53:19,544 INFO L273 TraceCheckUtils]: 37: Hoare triple {550#true} #t~short29 := ~l.base != 0 || ~l.offset != 0; {550#true} is VALID [2018-11-23 12:53:19,545 INFO L273 TraceCheckUtils]: 38: Hoare triple {550#true} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset, 4);#t~short29 := #t~mem28 != ~k; {550#true} is VALID [2018-11-23 12:53:19,545 INFO L273 TraceCheckUtils]: 39: Hoare triple {550#true} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {550#true} is VALID [2018-11-23 12:53:19,545 INFO L273 TraceCheckUtils]: 40: Hoare triple {550#true} #res.base, #res.offset := ~l.base, ~l.offset; {550#true} is VALID [2018-11-23 12:53:19,546 INFO L273 TraceCheckUtils]: 41: Hoare triple {550#true} assume true; {550#true} is VALID [2018-11-23 12:53:19,546 INFO L268 TraceCheckUtils]: 42: Hoare quadruple {550#true} {551#false} #119#return; {551#false} is VALID [2018-11-23 12:53:19,547 INFO L273 TraceCheckUtils]: 43: Hoare triple {551#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset, 4); {551#false} is VALID [2018-11-23 12:53:19,547 INFO L256 TraceCheckUtils]: 44: Hoare triple {551#false} call __VERIFIER_assert((if 2 == #t~mem42 then 1 else 0)); {551#false} is VALID [2018-11-23 12:53:19,547 INFO L273 TraceCheckUtils]: 45: Hoare triple {551#false} ~cond := #in~cond; {551#false} is VALID [2018-11-23 12:53:19,548 INFO L273 TraceCheckUtils]: 46: Hoare triple {551#false} assume 0 == ~cond; {551#false} is VALID [2018-11-23 12:53:19,548 INFO L273 TraceCheckUtils]: 47: Hoare triple {551#false} assume !false; {551#false} is VALID [2018-11-23 12:53:19,552 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:53:19,553 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:19,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 12:53:19,554 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:53:19,554 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:19,555 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 12:53:19,637 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:19,638 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 12:53:19,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 12:53:19,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 12:53:19,639 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand 5 states. [2018-11-23 12:53:19,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:19,989 INFO L93 Difference]: Finished difference Result 55 states and 63 transitions. [2018-11-23 12:53:19,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 12:53:19,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 48 [2018-11-23 12:53:19,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:19,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:19,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2018-11-23 12:53:19,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 12:53:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 60 transitions. [2018-11-23 12:53:19,998 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 60 transitions. [2018-11-23 12:53:20,131 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:20,135 INFO L225 Difference]: With dead ends: 55 [2018-11-23 12:53:20,135 INFO L226 Difference]: Without dead ends: 41 [2018-11-23 12:53:20,136 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:20,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-11-23 12:53:20,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-11-23 12:53:20,180 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:20,180 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand 40 states. [2018-11-23 12:53:20,180 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand 40 states. [2018-11-23 12:53:20,180 INFO L87 Difference]: Start difference. First operand 41 states. Second operand 40 states. [2018-11-23 12:53:20,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:20,185 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:53:20,186 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:53:20,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:20,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:20,187 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand 41 states. [2018-11-23 12:53:20,187 INFO L87 Difference]: Start difference. First operand 40 states. Second operand 41 states. [2018-11-23 12:53:20,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:20,191 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2018-11-23 12:53:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2018-11-23 12:53:20,192 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:20,192 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:20,192 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:20,192 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:20,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-11-23 12:53:20,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 46 transitions. [2018-11-23 12:53:20,196 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 46 transitions. Word has length 48 [2018-11-23 12:53:20,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:20,196 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 46 transitions. [2018-11-23 12:53:20,196 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 12:53:20,196 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 46 transitions. [2018-11-23 12:53:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:53:20,198 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:20,198 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, 1, 1] [2018-11-23 12:53:20,199 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:20,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:20,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1428115847, now seen corresponding path program 1 times [2018-11-23 12:53:20,199 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:20,199 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:20,201 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:20,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:20,202 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:20,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:20,697 INFO L256 TraceCheckUtils]: 0: Hoare triple {777#true} call ULTIMATE.init(); {777#true} is VALID [2018-11-23 12:53:20,697 INFO L273 TraceCheckUtils]: 1: Hoare triple {777#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {777#true} is VALID [2018-11-23 12:53:20,698 INFO L273 TraceCheckUtils]: 2: Hoare triple {777#true} assume true; {777#true} is VALID [2018-11-23 12:53:20,698 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {777#true} {777#true} #125#return; {777#true} is VALID [2018-11-23 12:53:20,698 INFO L256 TraceCheckUtils]: 4: Hoare triple {777#true} call #t~ret45 := main(); {777#true} is VALID [2018-11-23 12:53:20,699 INFO L273 TraceCheckUtils]: 5: Hoare triple {777#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {777#true} is VALID [2018-11-23 12:53:20,699 INFO L256 TraceCheckUtils]: 6: Hoare triple {777#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {777#true} is VALID [2018-11-23 12:53:20,699 INFO L273 TraceCheckUtils]: 7: Hoare triple {777#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {777#true} is VALID [2018-11-23 12:53:20,700 INFO L273 TraceCheckUtils]: 8: Hoare triple {777#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {777#true} is VALID [2018-11-23 12:53:20,700 INFO L273 TraceCheckUtils]: 9: Hoare triple {777#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {777#true} is VALID [2018-11-23 12:53:20,700 INFO L273 TraceCheckUtils]: 10: Hoare triple {777#true} assume true; {777#true} is VALID [2018-11-23 12:53:20,700 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {777#true} {777#true} #111#return; {777#true} is VALID [2018-11-23 12:53:20,701 INFO L273 TraceCheckUtils]: 12: Hoare triple {777#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {777#true} is VALID [2018-11-23 12:53:20,701 INFO L256 TraceCheckUtils]: 13: Hoare triple {777#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {777#true} is VALID [2018-11-23 12:53:20,701 INFO L273 TraceCheckUtils]: 14: Hoare triple {777#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {777#true} is VALID [2018-11-23 12:53:20,701 INFO L273 TraceCheckUtils]: 15: Hoare triple {777#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); {777#true} is VALID [2018-11-23 12:53:20,701 INFO L273 TraceCheckUtils]: 16: Hoare triple {777#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {777#true} is VALID [2018-11-23 12:53:20,702 INFO L273 TraceCheckUtils]: 17: Hoare triple {777#true} assume true; {777#true} is VALID [2018-11-23 12:53:20,702 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {777#true} {777#true} #113#return; {777#true} is VALID [2018-11-23 12:53:20,702 INFO L273 TraceCheckUtils]: 19: Hoare triple {777#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {777#true} is VALID [2018-11-23 12:53:20,703 INFO L256 TraceCheckUtils]: 20: Hoare triple {777#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {777#true} is VALID [2018-11-23 12:53:20,703 INFO L273 TraceCheckUtils]: 21: Hoare triple {777#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {777#true} is VALID [2018-11-23 12:53:20,703 INFO L273 TraceCheckUtils]: 22: Hoare triple {777#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); {777#true} is VALID [2018-11-23 12:53:20,703 INFO L273 TraceCheckUtils]: 23: Hoare triple {777#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {777#true} is VALID [2018-11-23 12:53:20,704 INFO L273 TraceCheckUtils]: 24: Hoare triple {777#true} assume true; {777#true} is VALID [2018-11-23 12:53:20,704 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {777#true} {777#true} #115#return; {777#true} is VALID [2018-11-23 12:53:20,704 INFO L273 TraceCheckUtils]: 26: Hoare triple {777#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {777#true} is VALID [2018-11-23 12:53:20,704 INFO L256 TraceCheckUtils]: 27: Hoare triple {777#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {777#true} is VALID [2018-11-23 12:53:20,706 INFO L273 TraceCheckUtils]: 28: Hoare triple {777#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {779#(<= |insert_list_#in~k| insert_list_~k)} is VALID [2018-11-23 12:53:20,708 INFO L273 TraceCheckUtils]: 29: Hoare triple {779#(<= |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); {780#(<= |insert_list_#in~k| (select (select |#memory_int| insert_list_~l.base) insert_list_~l.offset))} is VALID [2018-11-23 12:53:20,709 INFO L273 TraceCheckUtils]: 30: Hoare triple {780#(<= |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; {781#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:53:20,709 INFO L273 TraceCheckUtils]: 31: Hoare triple {781#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume true; {781#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:53:20,711 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {781#(<= |insert_list_#in~k| (select (select |#memory_int| ~head~0.base) ~head~0.offset))} {777#true} #117#return; {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:53:20,712 INFO L273 TraceCheckUtils]: 33: Hoare triple {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:53:20,713 INFO L273 TraceCheckUtils]: 34: Hoare triple {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, 4 + ~mylist~0.offset, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:53:20,714 INFO L273 TraceCheckUtils]: 35: Hoare triple {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} is VALID [2018-11-23 12:53:20,714 INFO L256 TraceCheckUtils]: 36: Hoare triple {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {777#true} is VALID [2018-11-23 12:53:20,715 INFO L273 TraceCheckUtils]: 37: Hoare triple {777#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {783#(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:53:20,716 INFO L273 TraceCheckUtils]: 38: Hoare triple {783#(and (<= search_list_~k |search_list_#in~k|) (= ~head~0.base search_list_~l.base) (= search_list_~l.offset ~head~0.offset))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {783#(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:53:20,719 INFO L273 TraceCheckUtils]: 39: Hoare triple {783#(and (<= search_list_~k |search_list_#in~k|) (= ~head~0.base search_list_~l.base) (= search_list_~l.offset ~head~0.offset))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset, 4);#t~short29 := #t~mem28 != ~k; {784#(or |search_list_#t~short29| (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:53:20,720 INFO L273 TraceCheckUtils]: 40: Hoare triple {784#(or |search_list_#t~short29| (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)))} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {785#(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:53:20,722 INFO L273 TraceCheckUtils]: 41: Hoare triple {785#(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; {786#(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:53:20,724 INFO L273 TraceCheckUtils]: 42: Hoare triple {786#(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; {786#(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:53:20,733 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {786#(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|))} {782#(<= 3 (select (select |#memory_int| ~head~0.base) ~head~0.offset))} #119#return; {778#false} is VALID [2018-11-23 12:53:20,734 INFO L273 TraceCheckUtils]: 44: Hoare triple {778#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset, 4); {778#false} is VALID [2018-11-23 12:53:20,734 INFO L256 TraceCheckUtils]: 45: Hoare triple {778#false} call __VERIFIER_assert((if 2 == #t~mem42 then 1 else 0)); {778#false} is VALID [2018-11-23 12:53:20,734 INFO L273 TraceCheckUtils]: 46: Hoare triple {778#false} ~cond := #in~cond; {778#false} is VALID [2018-11-23 12:53:20,734 INFO L273 TraceCheckUtils]: 47: Hoare triple {778#false} assume 0 == ~cond; {778#false} is VALID [2018-11-23 12:53:20,735 INFO L273 TraceCheckUtils]: 48: Hoare triple {778#false} assume !false; {778#false} is VALID [2018-11-23 12:53:20,741 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 12:53:20,742 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:20,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-11-23 12:53:20,742 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-11-23 12:53:20,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:20,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2018-11-23 12:53:20,832 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:20,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 12:53:20,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 12:53:20,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-11-23 12:53:20,834 INFO L87 Difference]: Start difference. First operand 40 states and 46 transitions. Second operand 10 states. [2018-11-23 12:53:22,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:22,277 INFO L93 Difference]: Finished difference Result 58 states and 66 transitions. [2018-11-23 12:53:22,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 12:53:22,278 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 49 [2018-11-23 12:53:22,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:22,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:53:22,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 12:53:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2018-11-23 12:53:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 60 transitions. [2018-11-23 12:53:22,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 60 transitions. [2018-11-23 12:53:22,448 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:22,451 INFO L225 Difference]: With dead ends: 58 [2018-11-23 12:53:22,451 INFO L226 Difference]: Without dead ends: 49 [2018-11-23 12:53:22,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=240, Unknown=0, NotChecked=0, Total=306 [2018-11-23 12:53:22,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-23 12:53:22,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 43. [2018-11-23 12:53:22,657 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:22,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand 43 states. [2018-11-23 12:53:22,657 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand 43 states. [2018-11-23 12:53:22,657 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 43 states. [2018-11-23 12:53:22,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:22,661 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 12:53:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 12:53:22,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:22,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:22,662 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 49 states. [2018-11-23 12:53:22,662 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 49 states. [2018-11-23 12:53:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:22,666 INFO L93 Difference]: Finished difference Result 49 states and 57 transitions. [2018-11-23 12:53:22,666 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 57 transitions. [2018-11-23 12:53:22,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:22,667 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:22,667 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:22,667 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:22,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:53:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 50 transitions. [2018-11-23 12:53:22,670 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 50 transitions. Word has length 49 [2018-11-23 12:53:22,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:22,670 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 50 transitions. [2018-11-23 12:53:22,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 12:53:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 50 transitions. [2018-11-23 12:53:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 12:53:22,674 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:22,674 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, 1, 1] [2018-11-23 12:53:22,677 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:22,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:22,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1035088837, now seen corresponding path program 1 times [2018-11-23 12:53:22,677 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:22,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:22,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:22,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:22,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:22,931 INFO L256 TraceCheckUtils]: 0: Hoare triple {1043#true} call ULTIMATE.init(); {1043#true} is VALID [2018-11-23 12:53:22,932 INFO L273 TraceCheckUtils]: 1: Hoare triple {1043#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {1043#true} is VALID [2018-11-23 12:53:22,932 INFO L273 TraceCheckUtils]: 2: Hoare triple {1043#true} assume true; {1043#true} is VALID [2018-11-23 12:53:22,932 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1043#true} {1043#true} #125#return; {1043#true} is VALID [2018-11-23 12:53:22,932 INFO L256 TraceCheckUtils]: 4: Hoare triple {1043#true} call #t~ret45 := main(); {1043#true} is VALID [2018-11-23 12:53:22,933 INFO L273 TraceCheckUtils]: 5: Hoare triple {1043#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {1043#true} is VALID [2018-11-23 12:53:22,933 INFO L256 TraceCheckUtils]: 6: Hoare triple {1043#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {1043#true} is VALID [2018-11-23 12:53:22,934 INFO L273 TraceCheckUtils]: 7: Hoare triple {1043#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1043#true} is VALID [2018-11-23 12:53:22,934 INFO L273 TraceCheckUtils]: 8: Hoare triple {1043#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1043#true} is VALID [2018-11-23 12:53:22,934 INFO L273 TraceCheckUtils]: 9: Hoare triple {1043#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1043#true} is VALID [2018-11-23 12:53:22,935 INFO L273 TraceCheckUtils]: 10: Hoare triple {1043#true} assume true; {1043#true} is VALID [2018-11-23 12:53:22,935 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1043#true} {1043#true} #111#return; {1043#true} is VALID [2018-11-23 12:53:22,935 INFO L273 TraceCheckUtils]: 12: Hoare triple {1043#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {1043#true} is VALID [2018-11-23 12:53:22,935 INFO L256 TraceCheckUtils]: 13: Hoare triple {1043#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {1043#true} is VALID [2018-11-23 12:53:22,935 INFO L273 TraceCheckUtils]: 14: Hoare triple {1043#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1043#true} is VALID [2018-11-23 12:53:22,936 INFO L273 TraceCheckUtils]: 15: Hoare triple {1043#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); {1043#true} is VALID [2018-11-23 12:53:22,936 INFO L273 TraceCheckUtils]: 16: Hoare triple {1043#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1043#true} is VALID [2018-11-23 12:53:22,936 INFO L273 TraceCheckUtils]: 17: Hoare triple {1043#true} assume true; {1043#true} is VALID [2018-11-23 12:53:22,936 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1043#true} {1043#true} #113#return; {1043#true} is VALID [2018-11-23 12:53:22,937 INFO L273 TraceCheckUtils]: 19: Hoare triple {1043#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {1043#true} is VALID [2018-11-23 12:53:22,937 INFO L256 TraceCheckUtils]: 20: Hoare triple {1043#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {1043#true} is VALID [2018-11-23 12:53:22,937 INFO L273 TraceCheckUtils]: 21: Hoare triple {1043#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1043#true} is VALID [2018-11-23 12:53:22,937 INFO L273 TraceCheckUtils]: 22: Hoare triple {1043#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); {1043#true} is VALID [2018-11-23 12:53:22,937 INFO L273 TraceCheckUtils]: 23: Hoare triple {1043#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1043#true} is VALID [2018-11-23 12:53:22,938 INFO L273 TraceCheckUtils]: 24: Hoare triple {1043#true} assume true; {1043#true} is VALID [2018-11-23 12:53:22,938 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1043#true} {1043#true} #115#return; {1043#true} is VALID [2018-11-23 12:53:22,938 INFO L273 TraceCheckUtils]: 26: Hoare triple {1043#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {1043#true} is VALID [2018-11-23 12:53:22,938 INFO L256 TraceCheckUtils]: 27: Hoare triple {1043#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {1043#true} is VALID [2018-11-23 12:53:22,941 INFO L273 TraceCheckUtils]: 28: Hoare triple {1043#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1045#(not (= 0 insert_list_~l.base))} is VALID [2018-11-23 12:53:22,947 INFO L273 TraceCheckUtils]: 29: Hoare triple {1045#(not (= 0 insert_list_~l.base))} 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); {1045#(not (= 0 insert_list_~l.base))} is VALID [2018-11-23 12:53:22,948 INFO L273 TraceCheckUtils]: 30: Hoare triple {1045#(not (= 0 insert_list_~l.base))} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1046#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:22,949 INFO L273 TraceCheckUtils]: 31: Hoare triple {1046#(not (= 0 ~head~0.base))} assume true; {1046#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:22,949 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1046#(not (= 0 ~head~0.base))} {1043#true} #117#return; {1046#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:22,950 INFO L273 TraceCheckUtils]: 33: Hoare triple {1046#(not (= 0 ~head~0.base))} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {1046#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:22,950 INFO L273 TraceCheckUtils]: 34: Hoare triple {1046#(not (= 0 ~head~0.base))} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, 4 + ~mylist~0.offset, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {1046#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:22,950 INFO L273 TraceCheckUtils]: 35: Hoare triple {1046#(not (= 0 ~head~0.base))} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {1046#(not (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:22,951 INFO L256 TraceCheckUtils]: 36: Hoare triple {1046#(not (= 0 ~head~0.base))} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {1043#true} is VALID [2018-11-23 12:53:22,953 INFO L273 TraceCheckUtils]: 37: Hoare triple {1043#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {1047#(= ~head~0.base search_list_~l.base)} is VALID [2018-11-23 12:53:22,954 INFO L273 TraceCheckUtils]: 38: Hoare triple {1047#(= ~head~0.base search_list_~l.base)} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1048#(or |search_list_#t~short29| (= 0 ~head~0.base))} is VALID [2018-11-23 12:53:22,955 INFO L273 TraceCheckUtils]: 39: Hoare triple {1048#(or |search_list_#t~short29| (= 0 ~head~0.base))} assume !#t~short29; {1049#(= 0 ~head~0.base)} is VALID [2018-11-23 12:53:22,955 INFO L273 TraceCheckUtils]: 40: Hoare triple {1049#(= 0 ~head~0.base)} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {1049#(= 0 ~head~0.base)} is VALID [2018-11-23 12:53:22,956 INFO L273 TraceCheckUtils]: 41: Hoare triple {1049#(= 0 ~head~0.base)} #res.base, #res.offset := ~l.base, ~l.offset; {1049#(= 0 ~head~0.base)} is VALID [2018-11-23 12:53:22,961 INFO L273 TraceCheckUtils]: 42: Hoare triple {1049#(= 0 ~head~0.base)} assume true; {1049#(= 0 ~head~0.base)} is VALID [2018-11-23 12:53:22,962 INFO L268 TraceCheckUtils]: 43: Hoare quadruple {1049#(= 0 ~head~0.base)} {1046#(not (= 0 ~head~0.base))} #119#return; {1044#false} is VALID [2018-11-23 12:53:22,962 INFO L273 TraceCheckUtils]: 44: Hoare triple {1044#false} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset, 4); {1044#false} is VALID [2018-11-23 12:53:22,962 INFO L256 TraceCheckUtils]: 45: Hoare triple {1044#false} call __VERIFIER_assert((if 2 == #t~mem42 then 1 else 0)); {1044#false} is VALID [2018-11-23 12:53:22,963 INFO L273 TraceCheckUtils]: 46: Hoare triple {1044#false} ~cond := #in~cond; {1044#false} is VALID [2018-11-23 12:53:22,963 INFO L273 TraceCheckUtils]: 47: Hoare triple {1044#false} assume 0 == ~cond; {1044#false} is VALID [2018-11-23 12:53:22,963 INFO L273 TraceCheckUtils]: 48: Hoare triple {1044#false} assume !false; {1044#false} is VALID [2018-11-23 12:53:22,965 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-23 12:53:22,965 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 12:53:22,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-23 12:53:22,966 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-23 12:53:22,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:22,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2018-11-23 12:53:23,038 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:23,038 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 12:53:23,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 12:53:23,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-11-23 12:53:23,039 INFO L87 Difference]: Start difference. First operand 43 states and 50 transitions. Second operand 7 states. [2018-11-23 12:53:23,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:23,672 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2018-11-23 12:53:23,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 12:53:23,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-11-23 12:53:23,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:23,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:53:23,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2018-11-23 12:53:23,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-23 12:53:23,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2018-11-23 12:53:23,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2018-11-23 12:53:23,799 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:23,801 INFO L225 Difference]: With dead ends: 56 [2018-11-23 12:53:23,802 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:53:23,803 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:53:23,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:53:23,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 12:53:23,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:23,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 12:53:23,856 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 12:53:23,856 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 12:53:23,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:23,859 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 12:53:23,860 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 12:53:23,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:23,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:23,861 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 12:53:23,861 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 12:53:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:23,863 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 12:53:23,863 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 12:53:23,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:23,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:23,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:23,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:23,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:53:23,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-23 12:53:23,867 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 49 [2018-11-23 12:53:23,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:23,868 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-23 12:53:23,868 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 12:53:23,868 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:53:23,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:53:23,869 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:23,869 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, 1, 1] [2018-11-23 12:53:23,870 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:23,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:23,870 INFO L82 PathProgramCache]: Analyzing trace with hash -794689477, now seen corresponding path program 1 times [2018-11-23 12:53:23,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:23,870 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:23,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:23,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:23,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:24,196 INFO L256 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2018-11-23 12:53:24,197 INFO L273 TraceCheckUtils]: 1: Hoare triple {1286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {1286#true} is VALID [2018-11-23 12:53:24,197 INFO L273 TraceCheckUtils]: 2: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:24,197 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1286#true} {1286#true} #125#return; {1286#true} is VALID [2018-11-23 12:53:24,198 INFO L256 TraceCheckUtils]: 4: Hoare triple {1286#true} call #t~ret45 := main(); {1286#true} is VALID [2018-11-23 12:53:24,198 INFO L273 TraceCheckUtils]: 5: Hoare triple {1286#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {1286#true} is VALID [2018-11-23 12:53:24,198 INFO L256 TraceCheckUtils]: 6: Hoare triple {1286#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {1286#true} is VALID [2018-11-23 12:53:24,201 INFO L273 TraceCheckUtils]: 7: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1288#(and (<= insert_list_~k |insert_list_#in~k|) (<= |insert_list_#in~k| insert_list_~k))} is VALID [2018-11-23 12:53:24,201 INFO L273 TraceCheckUtils]: 8: Hoare triple {1288#(and (<= insert_list_~k |insert_list_#in~k|) (<= |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$(0, 0, ~l.base, 4 + ~l.offset, 4); {1286#true} is VALID [2018-11-23 12:53:24,201 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:24,201 INFO L273 TraceCheckUtils]: 10: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:24,202 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1286#true} {1286#true} #111#return; {1286#true} is VALID [2018-11-23 12:53:24,202 INFO L273 TraceCheckUtils]: 12: Hoare triple {1286#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {1286#true} is VALID [2018-11-23 12:53:24,202 INFO L256 TraceCheckUtils]: 13: Hoare triple {1286#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {1286#true} is VALID [2018-11-23 12:53:24,202 INFO L273 TraceCheckUtils]: 14: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1286#true} is VALID [2018-11-23 12:53:24,203 INFO L273 TraceCheckUtils]: 15: Hoare triple {1286#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); {1286#true} is VALID [2018-11-23 12:53:24,203 INFO L273 TraceCheckUtils]: 16: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:24,204 INFO L273 TraceCheckUtils]: 17: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:24,204 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1286#true} {1286#true} #113#return; {1286#true} is VALID [2018-11-23 12:53:24,205 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {1286#true} is VALID [2018-11-23 12:53:24,205 INFO L256 TraceCheckUtils]: 20: Hoare triple {1286#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {1286#true} is VALID [2018-11-23 12:53:24,205 INFO L273 TraceCheckUtils]: 21: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1286#true} is VALID [2018-11-23 12:53:24,205 INFO L273 TraceCheckUtils]: 22: Hoare triple {1286#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); {1286#true} is VALID [2018-11-23 12:53:24,206 INFO L273 TraceCheckUtils]: 23: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:24,206 INFO L273 TraceCheckUtils]: 24: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:24,206 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1286#true} {1286#true} #115#return; {1286#true} is VALID [2018-11-23 12:53:24,206 INFO L273 TraceCheckUtils]: 26: Hoare triple {1286#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {1286#true} is VALID [2018-11-23 12:53:24,207 INFO L256 TraceCheckUtils]: 27: Hoare triple {1286#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {1286#true} is VALID [2018-11-23 12:53:24,207 INFO L273 TraceCheckUtils]: 28: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1286#true} is VALID [2018-11-23 12:53:24,207 INFO L273 TraceCheckUtils]: 29: Hoare triple {1286#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); {1286#true} is VALID [2018-11-23 12:53:24,207 INFO L273 TraceCheckUtils]: 30: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:24,208 INFO L273 TraceCheckUtils]: 31: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:24,208 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1286#true} {1286#true} #117#return; {1286#true} is VALID [2018-11-23 12:53:24,208 INFO L273 TraceCheckUtils]: 33: Hoare triple {1286#true} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {1286#true} is VALID [2018-11-23 12:53:24,208 INFO L273 TraceCheckUtils]: 34: Hoare triple {1286#true} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, 4 + ~mylist~0.offset, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {1286#true} is VALID [2018-11-23 12:53:24,209 INFO L273 TraceCheckUtils]: 35: Hoare triple {1286#true} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {1286#true} is VALID [2018-11-23 12:53:24,209 INFO L256 TraceCheckUtils]: 36: Hoare triple {1286#true} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {1286#true} is VALID [2018-11-23 12:53:24,228 INFO L273 TraceCheckUtils]: 37: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:24,242 INFO L273 TraceCheckUtils]: 38: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:24,250 INFO L273 TraceCheckUtils]: 39: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset, 4);#t~short29 := #t~mem28 != ~k; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:24,251 INFO L273 TraceCheckUtils]: 40: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume !!#t~short29;havoc #t~mem28;havoc #t~short29;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:24,251 INFO L273 TraceCheckUtils]: 41: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:24,252 INFO L273 TraceCheckUtils]: 42: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset, 4);#t~short29 := #t~mem28 != ~k; {1290#(or |search_list_#t~short29| (= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|))} is VALID [2018-11-23 12:53:24,253 INFO L273 TraceCheckUtils]: 43: Hoare triple {1290#(or |search_list_#t~short29| (= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|))} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {1291#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} is VALID [2018-11-23 12:53:24,258 INFO L273 TraceCheckUtils]: 44: Hoare triple {1291#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} #res.base, #res.offset := ~l.base, ~l.offset; {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-23 12:53:24,258 INFO L273 TraceCheckUtils]: 45: Hoare triple {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} assume true; {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-23 12:53:24,260 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} {1286#true} #119#return; {1293#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} is VALID [2018-11-23 12:53:24,260 INFO L273 TraceCheckUtils]: 47: Hoare triple {1293#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset, 4); {1294#(= 2 |main_#t~mem42|)} is VALID [2018-11-23 12:53:24,262 INFO L256 TraceCheckUtils]: 48: Hoare triple {1294#(= 2 |main_#t~mem42|)} call __VERIFIER_assert((if 2 == #t~mem42 then 1 else 0)); {1295#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:53:24,262 INFO L273 TraceCheckUtils]: 49: Hoare triple {1295#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1296#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:53:24,264 INFO L273 TraceCheckUtils]: 50: Hoare triple {1296#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1287#false} is VALID [2018-11-23 12:53:24,264 INFO L273 TraceCheckUtils]: 51: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2018-11-23 12:53:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2018-11-23 12:53:24,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 12:53:24,268 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:53:24,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:24,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:24,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:24,390 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 12:53:24,909 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2018-11-23 12:53:25,186 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:53:25,197 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:53:25,198 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 12:53:25,203 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:25,206 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 12:53:25,206 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-23 12:53:25,209 WARN L383 uantifierElimination]: Trying to double check SDD result, but SMT solver's response was UNKNOWN. [2018-11-23 12:53:25,209 WARN L384 uantifierElimination]: Input elimination task: ∃ [|#memory_int|, main_~temp~0.base, main_~temp~0.offset]. (let ((.cse0 (select (select |#memory_int| main_~temp~0.base) main_~temp~0.offset))) (and (= 2 .cse0) (= |main_#t~mem42| .cse0))) [2018-11-23 12:53:25,209 WARN L385 uantifierElimination]: ElimStorePlain result: ∃ []. (= |main_#t~mem42| 2) [2018-11-23 12:53:25,233 INFO L256 TraceCheckUtils]: 0: Hoare triple {1286#true} call ULTIMATE.init(); {1286#true} is VALID [2018-11-23 12:53:25,233 INFO L273 TraceCheckUtils]: 1: Hoare triple {1286#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~head~0.base, ~head~0.offset := 0, 0; {1286#true} is VALID [2018-11-23 12:53:25,234 INFO L273 TraceCheckUtils]: 2: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:25,234 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1286#true} {1286#true} #125#return; {1286#true} is VALID [2018-11-23 12:53:25,234 INFO L256 TraceCheckUtils]: 4: Hoare triple {1286#true} call #t~ret45 := main(); {1286#true} is VALID [2018-11-23 12:53:25,234 INFO L273 TraceCheckUtils]: 5: Hoare triple {1286#true} havoc ~i~0;~mylist~0.base, ~mylist~0.offset := 0, 0;havoc ~temp~0.base, ~temp~0.offset; {1286#true} is VALID [2018-11-23 12:53:25,234 INFO L256 TraceCheckUtils]: 6: Hoare triple {1286#true} call #t~ret36 := insert_list(~mylist~0.base, ~mylist~0.offset, 2); {1286#true} is VALID [2018-11-23 12:53:25,235 INFO L273 TraceCheckUtils]: 7: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1286#true} is VALID [2018-11-23 12:53:25,235 INFO L273 TraceCheckUtils]: 8: Hoare triple {1286#true} assume ~head~0.base == 0 && ~head~0.offset == 0;call write~int(~k, ~l.base, ~l.offset, 4);call write~$Pointer$(0, 0, ~l.base, 4 + ~l.offset, 4); {1286#true} is VALID [2018-11-23 12:53:25,235 INFO L273 TraceCheckUtils]: 9: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:25,235 INFO L273 TraceCheckUtils]: 10: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:25,235 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {1286#true} {1286#true} #111#return; {1286#true} is VALID [2018-11-23 12:53:25,235 INFO L273 TraceCheckUtils]: 12: Hoare triple {1286#true} assume -2147483648 <= #t~ret36 && #t~ret36 <= 2147483647;havoc #t~ret36; {1286#true} is VALID [2018-11-23 12:53:25,236 INFO L256 TraceCheckUtils]: 13: Hoare triple {1286#true} call #t~ret37 := insert_list(~mylist~0.base, ~mylist~0.offset, 5); {1286#true} is VALID [2018-11-23 12:53:25,236 INFO L273 TraceCheckUtils]: 14: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1286#true} is VALID [2018-11-23 12:53:25,236 INFO L273 TraceCheckUtils]: 15: Hoare triple {1286#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); {1286#true} is VALID [2018-11-23 12:53:25,236 INFO L273 TraceCheckUtils]: 16: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:25,236 INFO L273 TraceCheckUtils]: 17: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:25,237 INFO L268 TraceCheckUtils]: 18: Hoare quadruple {1286#true} {1286#true} #113#return; {1286#true} is VALID [2018-11-23 12:53:25,237 INFO L273 TraceCheckUtils]: 19: Hoare triple {1286#true} assume -2147483648 <= #t~ret37 && #t~ret37 <= 2147483647;havoc #t~ret37; {1286#true} is VALID [2018-11-23 12:53:25,237 INFO L256 TraceCheckUtils]: 20: Hoare triple {1286#true} call #t~ret38 := insert_list(~mylist~0.base, ~mylist~0.offset, 1); {1286#true} is VALID [2018-11-23 12:53:25,237 INFO L273 TraceCheckUtils]: 21: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1286#true} is VALID [2018-11-23 12:53:25,237 INFO L273 TraceCheckUtils]: 22: Hoare triple {1286#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); {1286#true} is VALID [2018-11-23 12:53:25,238 INFO L273 TraceCheckUtils]: 23: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:25,238 INFO L273 TraceCheckUtils]: 24: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:25,238 INFO L268 TraceCheckUtils]: 25: Hoare quadruple {1286#true} {1286#true} #115#return; {1286#true} is VALID [2018-11-23 12:53:25,239 INFO L273 TraceCheckUtils]: 26: Hoare triple {1286#true} assume -2147483648 <= #t~ret38 && #t~ret38 <= 2147483647;havoc #t~ret38; {1286#true} is VALID [2018-11-23 12:53:25,239 INFO L256 TraceCheckUtils]: 27: Hoare triple {1286#true} call #t~ret39 := insert_list(~mylist~0.base, ~mylist~0.offset, 3); {1286#true} is VALID [2018-11-23 12:53:25,239 INFO L273 TraceCheckUtils]: 28: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;call #t~malloc35.base, #t~malloc35.offset := #Ultimate.alloc(8);~l.base, ~l.offset := #t~malloc35.base, #t~malloc35.offset; {1286#true} is VALID [2018-11-23 12:53:25,239 INFO L273 TraceCheckUtils]: 29: Hoare triple {1286#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); {1286#true} is VALID [2018-11-23 12:53:25,240 INFO L273 TraceCheckUtils]: 30: Hoare triple {1286#true} ~head~0.base, ~head~0.offset := ~l.base, ~l.offset;#res := 0; {1286#true} is VALID [2018-11-23 12:53:25,240 INFO L273 TraceCheckUtils]: 31: Hoare triple {1286#true} assume true; {1286#true} is VALID [2018-11-23 12:53:25,240 INFO L268 TraceCheckUtils]: 32: Hoare quadruple {1286#true} {1286#true} #117#return; {1286#true} is VALID [2018-11-23 12:53:25,240 INFO L273 TraceCheckUtils]: 33: Hoare triple {1286#true} assume -2147483648 <= #t~ret39 && #t~ret39 <= 2147483647;havoc #t~ret39;~mylist~0.base, ~mylist~0.offset := ~head~0.base, ~head~0.offset; {1286#true} is VALID [2018-11-23 12:53:25,241 INFO L273 TraceCheckUtils]: 34: Hoare triple {1286#true} assume !!(~mylist~0.base != 0 || ~mylist~0.offset != 0);call #t~mem40.base, #t~mem40.offset := read~$Pointer$(~mylist~0.base, 4 + ~mylist~0.offset, 4);~mylist~0.base, ~mylist~0.offset := #t~mem40.base, #t~mem40.offset;havoc #t~mem40.base, #t~mem40.offset; {1286#true} is VALID [2018-11-23 12:53:25,241 INFO L273 TraceCheckUtils]: 35: Hoare triple {1286#true} assume !(~mylist~0.base != 0 || ~mylist~0.offset != 0); {1286#true} is VALID [2018-11-23 12:53:25,241 INFO L256 TraceCheckUtils]: 36: Hoare triple {1286#true} call #t~ret41.base, #t~ret41.offset := search_list(~mylist~0.base, ~mylist~0.offset, 2); {1286#true} is VALID [2018-11-23 12:53:25,242 INFO L273 TraceCheckUtils]: 37: Hoare triple {1286#true} ~l.base, ~l.offset := #in~l.base, #in~l.offset;~k := #in~k;~l.base, ~l.offset := ~head~0.base, ~head~0.offset; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:25,246 INFO L273 TraceCheckUtils]: 38: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:25,246 INFO L273 TraceCheckUtils]: 39: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset, 4);#t~short29 := #t~mem28 != ~k; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:25,249 INFO L273 TraceCheckUtils]: 40: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume !!#t~short29;havoc #t~mem28;havoc #t~short29;call #t~mem30.base, #t~mem30.offset := read~$Pointer$(~l.base, 4 + ~l.offset, 4);~l.base, ~l.offset := #t~mem30.base, #t~mem30.offset;havoc #t~mem30.base, #t~mem30.offset; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:25,249 INFO L273 TraceCheckUtils]: 41: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} #t~short29 := ~l.base != 0 || ~l.offset != 0; {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} is VALID [2018-11-23 12:53:25,255 INFO L273 TraceCheckUtils]: 42: Hoare triple {1289#(and (<= search_list_~k |search_list_#in~k|) (<= |search_list_#in~k| search_list_~k))} assume #t~short29;call #t~mem28 := read~int(~l.base, ~l.offset, 4);#t~short29 := #t~mem28 != ~k; {1426#(or (and (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (not |search_list_#t~short29|) (<= |search_list_#in~k| (select (select |#memory_int| search_list_~l.base) search_list_~l.offset))) (and |search_list_#t~short29| (or (<= (+ |search_list_#in~k| 1) (select (select |#memory_int| search_list_~l.base) search_list_~l.offset)) (<= (+ (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) 1) |search_list_#in~k|))))} is VALID [2018-11-23 12:53:25,255 INFO L273 TraceCheckUtils]: 43: Hoare triple {1426#(or (and (<= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|) (not |search_list_#t~short29|) (<= |search_list_#in~k| (select (select |#memory_int| search_list_~l.base) search_list_~l.offset))) (and |search_list_#t~short29| (or (<= (+ |search_list_#in~k| 1) (select (select |#memory_int| search_list_~l.base) search_list_~l.offset)) (<= (+ (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) 1) |search_list_#in~k|))))} assume !#t~short29;havoc #t~mem28;havoc #t~short29; {1291#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} is VALID [2018-11-23 12:53:25,256 INFO L273 TraceCheckUtils]: 44: Hoare triple {1291#(= (select (select |#memory_int| search_list_~l.base) search_list_~l.offset) |search_list_#in~k|)} #res.base, #res.offset := ~l.base, ~l.offset; {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-23 12:53:25,256 INFO L273 TraceCheckUtils]: 45: Hoare triple {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} assume true; {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} is VALID [2018-11-23 12:53:25,257 INFO L268 TraceCheckUtils]: 46: Hoare quadruple {1292#(= (select (select |#memory_int| |search_list_#res.base|) |search_list_#res.offset|) |search_list_#in~k|)} {1286#true} #119#return; {1293#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} is VALID [2018-11-23 12:53:25,258 INFO L273 TraceCheckUtils]: 47: Hoare triple {1293#(= 2 (select (select |#memory_int| |main_#t~ret41.base|) |main_#t~ret41.offset|))} ~temp~0.base, ~temp~0.offset := #t~ret41.base, #t~ret41.offset;havoc #t~ret41.base, #t~ret41.offset;call #t~mem42 := read~int(~temp~0.base, ~temp~0.offset, 4); {1294#(= 2 |main_#t~mem42|)} is VALID [2018-11-23 12:53:25,259 INFO L256 TraceCheckUtils]: 48: Hoare triple {1294#(= 2 |main_#t~mem42|)} call __VERIFIER_assert((if 2 == #t~mem42 then 1 else 0)); {1295#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2018-11-23 12:53:25,259 INFO L273 TraceCheckUtils]: 49: Hoare triple {1295#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1296#(= __VERIFIER_assert_~cond 1)} is VALID [2018-11-23 12:53:25,260 INFO L273 TraceCheckUtils]: 50: Hoare triple {1296#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1287#false} is VALID [2018-11-23 12:53:25,260 INFO L273 TraceCheckUtils]: 51: Hoare triple {1287#false} assume !false; {1287#false} is VALID [2018-11-23 12:53:25,265 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-11-23 12:53:25,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 12:53:25,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2018-11-23 12:53:25,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-23 12:53:25,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 12:53:25,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states. [2018-11-23 12:53:25,374 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:25,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 12:53:25,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 12:53:25,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-11-23 12:53:25,374 INFO L87 Difference]: Start difference. First operand 43 states and 49 transitions. Second operand 12 states. [2018-11-23 12:53:26,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:26,343 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2018-11-23 12:53:26,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 12:53:26,343 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-23 12:53:26,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 12:53:26,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:53:26,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2018-11-23 12:53:26,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 12:53:26,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 50 transitions. [2018-11-23 12:53:26,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 50 transitions. [2018-11-23 12:53:26,444 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 12:53:26,445 INFO L225 Difference]: With dead ends: 53 [2018-11-23 12:53:26,445 INFO L226 Difference]: Without dead ends: 44 [2018-11-23 12:53:26,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 48 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2018-11-23 12:53:26,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-11-23 12:53:26,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-11-23 12:53:26,502 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 12:53:26,502 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand 43 states. [2018-11-23 12:53:26,502 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 43 states. [2018-11-23 12:53:26,503 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 43 states. [2018-11-23 12:53:26,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:26,506 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 12:53:26,506 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 12:53:26,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:26,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:26,507 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 44 states. [2018-11-23 12:53:26,507 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 44 states. [2018-11-23 12:53:26,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 12:53:26,509 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2018-11-23 12:53:26,509 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2018-11-23 12:53:26,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 12:53:26,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 12:53:26,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 12:53:26,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 12:53:26,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 12:53:26,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 49 transitions. [2018-11-23 12:53:26,512 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 49 transitions. Word has length 52 [2018-11-23 12:53:26,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 12:53:26,513 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 49 transitions. [2018-11-23 12:53:26,513 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 12:53:26,513 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2018-11-23 12:53:26,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 12:53:26,514 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 12:53:26,514 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 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, 1, 1, 1, 1] [2018-11-23 12:53:26,514 INFO L423 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 12:53:26,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 12:53:26,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1187716487, now seen corresponding path program 1 times [2018-11-23 12:53:26,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 12:53:26,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 12:53:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:26,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 12:53:26,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 12:53:26,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 12:53:26,920 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:53:26,926 INFO L168 Benchmark]: Toolchain (without parser) took 13956.24 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 869.8 MB). Free memory was 1.4 GB in the beginning and 1.9 GB in the end (delta: -471.4 MB). Peak memory consumption was 398.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:26,927 INFO L168 Benchmark]: CDTParser took 0.22 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:53:26,928 INFO L168 Benchmark]: CACSL2BoogieTranslator took 901.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -779.3 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:26,929 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.41 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:26,930 INFO L168 Benchmark]: Boogie Preprocessor took 59.16 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:53:26,930 INFO L168 Benchmark]: RCFGBuilder took 1107.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:26,931 INFO L168 Benchmark]: TraceAbstraction took 11827.11 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 243.7 MB). Peak memory consumption was 381.6 MB. Max. memory is 7.1 GB. [2018-11-23 12:53:26,935 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.22 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 901.95 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 731.9 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -779.3 MB). Peak memory consumption was 40.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 55.41 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: 26.7 MB). Peak memory consumption was 26.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.16 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 1107.05 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 37.4 MB). Peak memory consumption was 37.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 11827.11 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 137.9 MB). Free memory was 2.1 GB in the beginning and 1.9 GB in the end (delta: 243.7 MB). Peak memory consumption was 381.6 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...