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-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-61f4311 [2018-11-23 13:00:08,795 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 13:00:08,797 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 13:00:08,811 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 13:00:08,812 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 13:00:08,813 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 13:00:08,814 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 13:00:08,816 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 13:00:08,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 13:00:08,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 13:00:08,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 13:00:08,820 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 13:00:08,821 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 13:00:08,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 13:00:08,823 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 13:00:08,824 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 13:00:08,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 13:00:08,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 13:00:08,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 13:00:08,830 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 13:00:08,831 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 13:00:08,833 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 13:00:08,835 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 13:00:08,836 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 13:00:08,836 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 13:00:08,837 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 13:00:08,838 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 13:00:08,839 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 13:00:08,839 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 13:00:08,841 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 13:00:08,841 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 13:00:08,842 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 13:00:08,842 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 13:00:08,842 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 13:00:08,843 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 13:00:08,844 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 13:00:08,845 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 13:00:08,860 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 13:00:08,860 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 13:00:08,861 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 13:00:08,862 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 13:00:08,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 13:00:08,862 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 13:00:08,863 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 13:00:08,863 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 13:00:08,863 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-23 13:00:08,863 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 13:00:08,863 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-23 13:00:08,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 13:00:08,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 13:00:08,864 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 13:00:08,864 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 13:00:08,864 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-23 13:00:08,865 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 13:00:08,865 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 13:00:08,865 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 13:00:08,865 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 13:00:08,865 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 13:00:08,865 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 13:00:08,866 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 13:00:08,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 13:00:08,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 13:00:08,866 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 13:00:08,866 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 13:00:08,867 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 13:00:08,867 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 13:00:08,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 13:00:08,867 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 13:00:08,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 13:00:08,931 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 13:00:08,937 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 13:00:08,938 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 13:00:08,939 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 13:00:08,939 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:00:09,001 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e47af60/ea8f9c8b50a44ad78066e02e71858e9d/FLAG74c535050 [2018-11-23 13:00:09,518 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 13:00:09,519 INFO L161 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:00:09,534 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e47af60/ea8f9c8b50a44ad78066e02e71858e9d/FLAG74c535050 [2018-11-23 13:00:09,798 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31e47af60/ea8f9c8b50a44ad78066e02e71858e9d [2018-11-23 13:00:09,807 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 13:00:09,808 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 13:00:09,810 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:09,810 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 13:00:09,814 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 13:00:09,815 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:09" (1/1) ... [2018-11-23 13:00:09,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@11617381 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:09, skipping insertion in model container [2018-11-23 13:00:09,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 01:00:09" (1/1) ... [2018-11-23 13:00:09,830 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 13:00:09,879 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 13:00:10,350 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:10,363 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 13:00:10,420 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 13:00:10,561 INFO L195 MainTranslator]: Completed translation [2018-11-23 13:00:10,562 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10 WrapperNode [2018-11-23 13:00:10,562 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 13:00:10,563 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:10,563 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 13:00:10,563 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 13:00:10,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,591 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 13:00:10,601 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 13:00:10,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 13:00:10,602 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 13:00:10,612 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,612 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,633 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,641 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (1/1) ... [2018-11-23 13:00:10,647 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 13:00:10,648 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 13:00:10,648 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 13:00:10,648 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 13:00:10,649 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (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 13:00:10,707 INFO L130 BoogieDeclarations]: Found specification of procedure sll_update_at [2018-11-23 13:00:10,708 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_update_at [2018-11-23 13:00:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure sll_destroy [2018-11-23 13:00:10,708 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_destroy [2018-11-23 13:00:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 13:00:10,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 13:00:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure sll_get_data_at [2018-11-23 13:00:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_get_data_at [2018-11-23 13:00:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2018-11-23 13:00:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure exit [2018-11-23 13:00:10,709 INFO L130 BoogieDeclarations]: Found specification of procedure sll_create [2018-11-23 13:00:10,709 INFO L138 BoogieDeclarations]: Found implementation of procedure sll_create [2018-11-23 13:00:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 13:00:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2018-11-23 13:00:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2018-11-23 13:00:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 13:00:10,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 13:00:10,710 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 13:00:10,711 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 13:00:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 13:00:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 13:00:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-23 13:00:10,711 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 13:00:10,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 13:00:11,750 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 13:00:11,750 INFO L280 CfgBuilder]: Removed 6 assue(true) statements. [2018-11-23 13:00:11,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:11 BoogieIcfgContainer [2018-11-23 13:00:11,751 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 13:00:11,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 13:00:11,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 13:00:11,756 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 13:00:11,756 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 01:00:09" (1/3) ... [2018-11-23 13:00:11,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56974152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:11, skipping insertion in model container [2018-11-23 13:00:11,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 01:00:10" (2/3) ... [2018-11-23 13:00:11,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56974152 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 01:00:11, skipping insertion in model container [2018-11-23 13:00:11,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 01:00:11" (3/3) ... [2018-11-23 13:00:11,759 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2n_update_all_reverse_true-unreach-call_true-valid-memsafety.i [2018-11-23 13:00:11,770 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 13:00:11,778 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-23 13:00:11,796 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-23 13:00:11,829 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 13:00:11,830 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 13:00:11,830 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 13:00:11,831 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 13:00:11,831 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 13:00:11,831 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 13:00:11,831 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 13:00:11,831 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 13:00:11,832 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 13:00:11,850 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states. [2018-11-23 13:00:11,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-11-23 13:00:11,858 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:11,859 INFO L402 BasicCegarLoop]: trace histogram [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 13:00:11,862 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:11,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:11,868 INFO L82 PathProgramCache]: Analyzing trace with hash -43549588, now seen corresponding path program 1 times [2018-11-23 13:00:11,870 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:11,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:11,926 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:11,927 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:11,927 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:11,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:12,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {58#true} call ULTIMATE.init(); {58#true} is VALID [2018-11-23 13:00:12,157 INFO L273 TraceCheckUtils]: 1: Hoare triple {58#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {58#true} is VALID [2018-11-23 13:00:12,157 INFO L273 TraceCheckUtils]: 2: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-23 13:00:12,158 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {58#true} {58#true} #136#return; {58#true} is VALID [2018-11-23 13:00:12,158 INFO L256 TraceCheckUtils]: 4: Hoare triple {58#true} call #t~ret15 := main(); {58#true} is VALID [2018-11-23 13:00:12,171 INFO L273 TraceCheckUtils]: 5: Hoare triple {58#true} ~len~0 := 2;~data~0 := 1; {60#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:12,172 INFO L256 TraceCheckUtils]: 6: Hoare triple {60#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {58#true} is VALID [2018-11-23 13:00:12,172 INFO L273 TraceCheckUtils]: 7: Hoare triple {58#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {58#true} is VALID [2018-11-23 13:00:12,173 INFO L273 TraceCheckUtils]: 8: Hoare triple {58#true} assume !(~len > 0); {58#true} is VALID [2018-11-23 13:00:12,173 INFO L273 TraceCheckUtils]: 9: Hoare triple {58#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {58#true} is VALID [2018-11-23 13:00:12,174 INFO L273 TraceCheckUtils]: 10: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-23 13:00:12,189 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {58#true} {60#(<= 2 main_~len~0)} #126#return; {60#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:12,198 INFO L273 TraceCheckUtils]: 12: Hoare triple {60#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {61#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:12,211 INFO L273 TraceCheckUtils]: 13: Hoare triple {61#(<= 1 main_~i~0)} assume !(~i~0 >= 0); {59#false} is VALID [2018-11-23 13:00:12,212 INFO L273 TraceCheckUtils]: 14: Hoare triple {59#false} ~i~0 := ~len~0 - 1; {59#false} is VALID [2018-11-23 13:00:12,212 INFO L273 TraceCheckUtils]: 15: Hoare triple {59#false} assume !!(~i~0 >= 0);~expected~0 := ~i~0 + ~len~0; {59#false} is VALID [2018-11-23 13:00:12,212 INFO L256 TraceCheckUtils]: 16: Hoare triple {59#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {58#true} is VALID [2018-11-23 13:00:12,213 INFO L273 TraceCheckUtils]: 17: Hoare triple {58#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {58#true} is VALID [2018-11-23 13:00:12,213 INFO L273 TraceCheckUtils]: 18: Hoare triple {58#true} assume !(~index > 0); {58#true} is VALID [2018-11-23 13:00:12,213 INFO L273 TraceCheckUtils]: 19: Hoare triple {58#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {58#true} is VALID [2018-11-23 13:00:12,214 INFO L273 TraceCheckUtils]: 20: Hoare triple {58#true} assume true; {58#true} is VALID [2018-11-23 13:00:12,214 INFO L268 TraceCheckUtils]: 21: Hoare quadruple {58#true} {59#false} #130#return; {59#false} is VALID [2018-11-23 13:00:12,214 INFO L273 TraceCheckUtils]: 22: Hoare triple {59#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {59#false} is VALID [2018-11-23 13:00:12,215 INFO L273 TraceCheckUtils]: 23: Hoare triple {59#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {59#false} is VALID [2018-11-23 13:00:12,215 INFO L273 TraceCheckUtils]: 24: Hoare triple {59#false} assume !false; {59#false} is VALID [2018-11-23 13:00:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 13:00:12,223 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:12,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-23 13:00:12,229 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 13:00:12,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:12,236 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2018-11-23 13:00:12,371 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:12,371 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 13:00:12,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 13:00:12,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-23 13:00:12,384 INFO L87 Difference]: Start difference. First operand 55 states. Second operand 4 states. [2018-11-23 13:00:13,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:13,406 INFO L93 Difference]: Finished difference Result 100 states and 135 transitions. [2018-11-23 13:00:13,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 13:00:13,406 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-11-23 13:00:13,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:13,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:13,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2018-11-23 13:00:13,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-23 13:00:13,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 135 transitions. [2018-11-23 13:00:13,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 135 transitions. [2018-11-23 13:00:13,776 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:13,792 INFO L225 Difference]: With dead ends: 100 [2018-11-23 13:00:13,793 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 13:00:13,797 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:13,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 13:00:14,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 43. [2018-11-23 13:00:14,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:14,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand 43 states. [2018-11-23 13:00:14,113 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand 43 states. [2018-11-23 13:00:14,113 INFO L87 Difference]: Start difference. First operand 52 states. Second operand 43 states. [2018-11-23 13:00:14,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:14,120 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 13:00:14,120 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 13:00:14,121 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:14,122 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:14,122 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand 52 states. [2018-11-23 13:00:14,122 INFO L87 Difference]: Start difference. First operand 43 states. Second operand 52 states. [2018-11-23 13:00:14,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:14,128 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2018-11-23 13:00:14,128 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 58 transitions. [2018-11-23 13:00:14,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:14,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:14,130 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:14,130 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:14,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-11-23 13:00:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 47 transitions. [2018-11-23 13:00:14,136 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 47 transitions. Word has length 25 [2018-11-23 13:00:14,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:14,136 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 47 transitions. [2018-11-23 13:00:14,137 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 13:00:14,137 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 47 transitions. [2018-11-23 13:00:14,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-11-23 13:00:14,138 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:14,139 INFO L402 BasicCegarLoop]: trace histogram [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 13:00:14,139 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:14,139 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:14,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1490311690, now seen corresponding path program 1 times [2018-11-23 13:00:14,140 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:14,140 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:14,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:14,142 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:14,142 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:14,327 INFO L256 TraceCheckUtils]: 0: Hoare triple {373#true} call ULTIMATE.init(); {373#true} is VALID [2018-11-23 13:00:14,328 INFO L273 TraceCheckUtils]: 1: Hoare triple {373#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {373#true} is VALID [2018-11-23 13:00:14,328 INFO L273 TraceCheckUtils]: 2: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 13:00:14,329 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {373#true} {373#true} #136#return; {373#true} is VALID [2018-11-23 13:00:14,329 INFO L256 TraceCheckUtils]: 4: Hoare triple {373#true} call #t~ret15 := main(); {373#true} is VALID [2018-11-23 13:00:14,330 INFO L273 TraceCheckUtils]: 5: Hoare triple {373#true} ~len~0 := 2;~data~0 := 1; {375#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:14,330 INFO L256 TraceCheckUtils]: 6: Hoare triple {375#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {373#true} is VALID [2018-11-23 13:00:14,334 INFO L273 TraceCheckUtils]: 7: Hoare triple {373#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {376#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:14,334 INFO L273 TraceCheckUtils]: 8: Hoare triple {376#(<= |sll_create_#in~len| sll_create_~len)} assume !(~len > 0); {377#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:14,336 INFO L273 TraceCheckUtils]: 9: Hoare triple {377#(<= |sll_create_#in~len| 0)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {377#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:14,336 INFO L273 TraceCheckUtils]: 10: Hoare triple {377#(<= |sll_create_#in~len| 0)} assume true; {377#(<= |sll_create_#in~len| 0)} is VALID [2018-11-23 13:00:14,343 INFO L268 TraceCheckUtils]: 11: Hoare quadruple {377#(<= |sll_create_#in~len| 0)} {375#(<= 2 main_~len~0)} #126#return; {374#false} is VALID [2018-11-23 13:00:14,343 INFO L273 TraceCheckUtils]: 12: Hoare triple {374#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {374#false} is VALID [2018-11-23 13:00:14,343 INFO L273 TraceCheckUtils]: 13: Hoare triple {374#false} assume !!(~i~0 >= 0);~new_data~0 := ~i~0 + ~len~0; {374#false} is VALID [2018-11-23 13:00:14,344 INFO L256 TraceCheckUtils]: 14: Hoare triple {374#false} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {373#true} is VALID [2018-11-23 13:00:14,344 INFO L273 TraceCheckUtils]: 15: Hoare triple {373#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {373#true} is VALID [2018-11-23 13:00:14,344 INFO L273 TraceCheckUtils]: 16: Hoare triple {373#true} assume !(~index > 0); {373#true} is VALID [2018-11-23 13:00:14,345 INFO L273 TraceCheckUtils]: 17: Hoare triple {373#true} call write~int(~data, ~head.base, ~head.offset, 4); {373#true} is VALID [2018-11-23 13:00:14,345 INFO L273 TraceCheckUtils]: 18: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 13:00:14,345 INFO L268 TraceCheckUtils]: 19: Hoare quadruple {373#true} {374#false} #128#return; {374#false} is VALID [2018-11-23 13:00:14,346 INFO L273 TraceCheckUtils]: 20: Hoare triple {374#false} #t~post12 := ~i~0;~i~0 := #t~post12 - 1;havoc #t~post12; {374#false} is VALID [2018-11-23 13:00:14,346 INFO L273 TraceCheckUtils]: 21: Hoare triple {374#false} assume !(~i~0 >= 0); {374#false} is VALID [2018-11-23 13:00:14,346 INFO L273 TraceCheckUtils]: 22: Hoare triple {374#false} ~i~0 := ~len~0 - 1; {374#false} is VALID [2018-11-23 13:00:14,347 INFO L273 TraceCheckUtils]: 23: Hoare triple {374#false} assume !!(~i~0 >= 0);~expected~0 := ~i~0 + ~len~0; {374#false} is VALID [2018-11-23 13:00:14,347 INFO L256 TraceCheckUtils]: 24: Hoare triple {374#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {373#true} is VALID [2018-11-23 13:00:14,347 INFO L273 TraceCheckUtils]: 25: Hoare triple {373#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {373#true} is VALID [2018-11-23 13:00:14,348 INFO L273 TraceCheckUtils]: 26: Hoare triple {373#true} assume !(~index > 0); {373#true} is VALID [2018-11-23 13:00:14,348 INFO L273 TraceCheckUtils]: 27: Hoare triple {373#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {373#true} is VALID [2018-11-23 13:00:14,348 INFO L273 TraceCheckUtils]: 28: Hoare triple {373#true} assume true; {373#true} is VALID [2018-11-23 13:00:14,348 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {373#true} {374#false} #130#return; {374#false} is VALID [2018-11-23 13:00:14,349 INFO L273 TraceCheckUtils]: 30: Hoare triple {374#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {374#false} is VALID [2018-11-23 13:00:14,349 INFO L273 TraceCheckUtils]: 31: Hoare triple {374#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {374#false} is VALID [2018-11-23 13:00:14,349 INFO L273 TraceCheckUtils]: 32: Hoare triple {374#false} assume !false; {374#false} is VALID [2018-11-23 13:00:14,352 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:14,352 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 13:00:14,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-23 13:00:14,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 13:00:14,355 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:14,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2018-11-23 13:00:14,416 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:14,416 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 13:00:14,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 13:00:14,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-23 13:00:14,417 INFO L87 Difference]: Start difference. First operand 43 states and 47 transitions. Second operand 5 states. [2018-11-23 13:00:14,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:14,762 INFO L93 Difference]: Finished difference Result 73 states and 82 transitions. [2018-11-23 13:00:14,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 13:00:14,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2018-11-23 13:00:14,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:14,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:14,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 13:00:14,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-23 13:00:14,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2018-11-23 13:00:14,773 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2018-11-23 13:00:14,935 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:14,939 INFO L225 Difference]: With dead ends: 73 [2018-11-23 13:00:14,939 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 13:00:14,942 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-23 13:00:14,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 13:00:14,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-11-23 13:00:14,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:14,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand 44 states. [2018-11-23 13:00:14,973 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand 44 states. [2018-11-23 13:00:14,973 INFO L87 Difference]: Start difference. First operand 47 states. Second operand 44 states. [2018-11-23 13:00:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:14,978 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 13:00:14,979 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 13:00:14,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:14,980 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:14,980 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand 47 states. [2018-11-23 13:00:14,980 INFO L87 Difference]: Start difference. First operand 44 states. Second operand 47 states. [2018-11-23 13:00:14,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:14,984 INFO L93 Difference]: Finished difference Result 47 states and 52 transitions. [2018-11-23 13:00:14,984 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 52 transitions. [2018-11-23 13:00:14,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:14,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:14,985 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:14,985 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:14,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 13:00:14,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2018-11-23 13:00:14,988 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 33 [2018-11-23 13:00:14,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:14,989 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2018-11-23 13:00:14,989 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 13:00:14,989 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2018-11-23 13:00:14,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 13:00:14,991 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:14,991 INFO L402 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 13:00:14,991 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:14,992 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:14,992 INFO L82 PathProgramCache]: Analyzing trace with hash 247580725, now seen corresponding path program 1 times [2018-11-23 13:00:14,992 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:14,992 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:14,994 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:14,994 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:15,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:15,145 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-23 13:00:15,146 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {644#true} is VALID [2018-11-23 13:00:15,146 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 13:00:15,146 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #136#return; {644#true} is VALID [2018-11-23 13:00:15,147 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret15 := main(); {644#true} is VALID [2018-11-23 13:00:15,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#true} ~len~0 := 2;~data~0 := 1; {646#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:15,155 INFO L256 TraceCheckUtils]: 6: Hoare triple {646#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {644#true} is VALID [2018-11-23 13:00:15,155 INFO L273 TraceCheckUtils]: 7: Hoare triple {644#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {644#true} is VALID [2018-11-23 13:00:15,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {644#true} assume !!(~len > 0); {644#true} is VALID [2018-11-23 13:00:15,156 INFO L256 TraceCheckUtils]: 9: Hoare triple {644#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {644#true} is VALID [2018-11-23 13:00:15,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {644#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {644#true} is VALID [2018-11-23 13:00:15,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {644#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {644#true} is VALID [2018-11-23 13:00:15,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {644#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {644#true} is VALID [2018-11-23 13:00:15,158 INFO L273 TraceCheckUtils]: 13: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 13:00:15,158 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {644#true} {644#true} #134#return; {644#true} is VALID [2018-11-23 13:00:15,158 INFO L273 TraceCheckUtils]: 15: Hoare triple {644#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {644#true} is VALID [2018-11-23 13:00:15,159 INFO L273 TraceCheckUtils]: 16: Hoare triple {644#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {644#true} is VALID [2018-11-23 13:00:15,159 INFO L273 TraceCheckUtils]: 17: Hoare triple {644#true} assume !(~len > 0); {644#true} is VALID [2018-11-23 13:00:15,159 INFO L273 TraceCheckUtils]: 18: Hoare triple {644#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {644#true} is VALID [2018-11-23 13:00:15,160 INFO L273 TraceCheckUtils]: 19: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 13:00:15,163 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {644#true} {646#(<= 2 main_~len~0)} #126#return; {646#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:15,172 INFO L273 TraceCheckUtils]: 21: Hoare triple {646#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {647#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:15,174 INFO L273 TraceCheckUtils]: 22: Hoare triple {647#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);~new_data~0 := ~i~0 + ~len~0; {647#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:15,174 INFO L256 TraceCheckUtils]: 23: Hoare triple {647#(<= 1 main_~i~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {644#true} is VALID [2018-11-23 13:00:15,174 INFO L273 TraceCheckUtils]: 24: Hoare triple {644#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {644#true} is VALID [2018-11-23 13:00:15,175 INFO L273 TraceCheckUtils]: 25: Hoare triple {644#true} assume !(~index > 0); {644#true} is VALID [2018-11-23 13:00:15,175 INFO L273 TraceCheckUtils]: 26: Hoare triple {644#true} call write~int(~data, ~head.base, ~head.offset, 4); {644#true} is VALID [2018-11-23 13:00:15,175 INFO L273 TraceCheckUtils]: 27: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 13:00:15,179 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {644#true} {647#(<= 1 main_~i~0)} #128#return; {647#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:15,180 INFO L273 TraceCheckUtils]: 29: Hoare triple {647#(<= 1 main_~i~0)} #t~post12 := ~i~0;~i~0 := #t~post12 - 1;havoc #t~post12; {648#(<= 0 main_~i~0)} is VALID [2018-11-23 13:00:15,183 INFO L273 TraceCheckUtils]: 30: Hoare triple {648#(<= 0 main_~i~0)} assume !(~i~0 >= 0); {645#false} is VALID [2018-11-23 13:00:15,183 INFO L273 TraceCheckUtils]: 31: Hoare triple {645#false} ~i~0 := ~len~0 - 1; {645#false} is VALID [2018-11-23 13:00:15,183 INFO L273 TraceCheckUtils]: 32: Hoare triple {645#false} assume !!(~i~0 >= 0);~expected~0 := ~i~0 + ~len~0; {645#false} is VALID [2018-11-23 13:00:15,184 INFO L256 TraceCheckUtils]: 33: Hoare triple {645#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {644#true} is VALID [2018-11-23 13:00:15,184 INFO L273 TraceCheckUtils]: 34: Hoare triple {644#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {644#true} is VALID [2018-11-23 13:00:15,184 INFO L273 TraceCheckUtils]: 35: Hoare triple {644#true} assume !(~index > 0); {644#true} is VALID [2018-11-23 13:00:15,184 INFO L273 TraceCheckUtils]: 36: Hoare triple {644#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {644#true} is VALID [2018-11-23 13:00:15,185 INFO L273 TraceCheckUtils]: 37: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 13:00:15,185 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {644#true} {645#false} #130#return; {645#false} is VALID [2018-11-23 13:00:15,185 INFO L273 TraceCheckUtils]: 39: Hoare triple {645#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {645#false} is VALID [2018-11-23 13:00:15,185 INFO L273 TraceCheckUtils]: 40: Hoare triple {645#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {645#false} is VALID [2018-11-23 13:00:15,186 INFO L273 TraceCheckUtils]: 41: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-23 13:00:15,188 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:15,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:15,189 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 13:00:15,199 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:15,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:15,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:15,274 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:15,615 INFO L256 TraceCheckUtils]: 0: Hoare triple {644#true} call ULTIMATE.init(); {644#true} is VALID [2018-11-23 13:00:15,616 INFO L273 TraceCheckUtils]: 1: Hoare triple {644#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {644#true} is VALID [2018-11-23 13:00:15,616 INFO L273 TraceCheckUtils]: 2: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 13:00:15,617 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {644#true} {644#true} #136#return; {644#true} is VALID [2018-11-23 13:00:15,617 INFO L256 TraceCheckUtils]: 4: Hoare triple {644#true} call #t~ret15 := main(); {644#true} is VALID [2018-11-23 13:00:15,624 INFO L273 TraceCheckUtils]: 5: Hoare triple {644#true} ~len~0 := 2;~data~0 := 1; {646#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:15,624 INFO L256 TraceCheckUtils]: 6: Hoare triple {646#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {644#true} is VALID [2018-11-23 13:00:15,625 INFO L273 TraceCheckUtils]: 7: Hoare triple {644#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {673#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:15,625 INFO L273 TraceCheckUtils]: 8: Hoare triple {673#(<= |sll_create_#in~len| sll_create_~len)} assume !!(~len > 0); {673#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:15,625 INFO L256 TraceCheckUtils]: 9: Hoare triple {673#(<= |sll_create_#in~len| sll_create_~len)} call #t~ret4.base, #t~ret4.offset := node_create(~data); {644#true} is VALID [2018-11-23 13:00:15,626 INFO L273 TraceCheckUtils]: 10: Hoare triple {644#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {644#true} is VALID [2018-11-23 13:00:15,626 INFO L273 TraceCheckUtils]: 11: Hoare triple {644#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {644#true} is VALID [2018-11-23 13:00:15,626 INFO L273 TraceCheckUtils]: 12: Hoare triple {644#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {644#true} is VALID [2018-11-23 13:00:15,626 INFO L273 TraceCheckUtils]: 13: Hoare triple {644#true} assume true; {644#true} is VALID [2018-11-23 13:00:15,627 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {644#true} {673#(<= |sll_create_#in~len| sll_create_~len)} #134#return; {673#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:15,629 INFO L273 TraceCheckUtils]: 15: Hoare triple {673#(<= |sll_create_#in~len| sll_create_~len)} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {673#(<= |sll_create_#in~len| sll_create_~len)} is VALID [2018-11-23 13:00:15,629 INFO L273 TraceCheckUtils]: 16: Hoare triple {673#(<= |sll_create_#in~len| sll_create_~len)} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {701#(<= |sll_create_#in~len| (+ sll_create_~len 1))} is VALID [2018-11-23 13:00:15,631 INFO L273 TraceCheckUtils]: 17: Hoare triple {701#(<= |sll_create_#in~len| (+ sll_create_~len 1))} assume !(~len > 0); {705#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:15,632 INFO L273 TraceCheckUtils]: 18: Hoare triple {705#(<= |sll_create_#in~len| 1)} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {705#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:15,633 INFO L273 TraceCheckUtils]: 19: Hoare triple {705#(<= |sll_create_#in~len| 1)} assume true; {705#(<= |sll_create_#in~len| 1)} is VALID [2018-11-23 13:00:15,635 INFO L268 TraceCheckUtils]: 20: Hoare quadruple {705#(<= |sll_create_#in~len| 1)} {646#(<= 2 main_~len~0)} #126#return; {645#false} is VALID [2018-11-23 13:00:15,635 INFO L273 TraceCheckUtils]: 21: Hoare triple {645#false} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {645#false} is VALID [2018-11-23 13:00:15,636 INFO L273 TraceCheckUtils]: 22: Hoare triple {645#false} assume !!(~i~0 >= 0);~new_data~0 := ~i~0 + ~len~0; {645#false} is VALID [2018-11-23 13:00:15,636 INFO L256 TraceCheckUtils]: 23: Hoare triple {645#false} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {645#false} is VALID [2018-11-23 13:00:15,637 INFO L273 TraceCheckUtils]: 24: Hoare triple {645#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {645#false} is VALID [2018-11-23 13:00:15,637 INFO L273 TraceCheckUtils]: 25: Hoare triple {645#false} assume !(~index > 0); {645#false} is VALID [2018-11-23 13:00:15,637 INFO L273 TraceCheckUtils]: 26: Hoare triple {645#false} call write~int(~data, ~head.base, ~head.offset, 4); {645#false} is VALID [2018-11-23 13:00:15,638 INFO L273 TraceCheckUtils]: 27: Hoare triple {645#false} assume true; {645#false} is VALID [2018-11-23 13:00:15,638 INFO L268 TraceCheckUtils]: 28: Hoare quadruple {645#false} {645#false} #128#return; {645#false} is VALID [2018-11-23 13:00:15,638 INFO L273 TraceCheckUtils]: 29: Hoare triple {645#false} #t~post12 := ~i~0;~i~0 := #t~post12 - 1;havoc #t~post12; {645#false} is VALID [2018-11-23 13:00:15,639 INFO L273 TraceCheckUtils]: 30: Hoare triple {645#false} assume !(~i~0 >= 0); {645#false} is VALID [2018-11-23 13:00:15,639 INFO L273 TraceCheckUtils]: 31: Hoare triple {645#false} ~i~0 := ~len~0 - 1; {645#false} is VALID [2018-11-23 13:00:15,639 INFO L273 TraceCheckUtils]: 32: Hoare triple {645#false} assume !!(~i~0 >= 0);~expected~0 := ~i~0 + ~len~0; {645#false} is VALID [2018-11-23 13:00:15,640 INFO L256 TraceCheckUtils]: 33: Hoare triple {645#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {645#false} is VALID [2018-11-23 13:00:15,640 INFO L273 TraceCheckUtils]: 34: Hoare triple {645#false} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {645#false} is VALID [2018-11-23 13:00:15,640 INFO L273 TraceCheckUtils]: 35: Hoare triple {645#false} assume !(~index > 0); {645#false} is VALID [2018-11-23 13:00:15,640 INFO L273 TraceCheckUtils]: 36: Hoare triple {645#false} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {645#false} is VALID [2018-11-23 13:00:15,641 INFO L273 TraceCheckUtils]: 37: Hoare triple {645#false} assume true; {645#false} is VALID [2018-11-23 13:00:15,641 INFO L268 TraceCheckUtils]: 38: Hoare quadruple {645#false} {645#false} #130#return; {645#false} is VALID [2018-11-23 13:00:15,641 INFO L273 TraceCheckUtils]: 39: Hoare triple {645#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {645#false} is VALID [2018-11-23 13:00:15,642 INFO L273 TraceCheckUtils]: 40: Hoare triple {645#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {645#false} is VALID [2018-11-23 13:00:15,642 INFO L273 TraceCheckUtils]: 41: Hoare triple {645#false} assume !false; {645#false} is VALID [2018-11-23 13:00:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-23 13:00:15,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 13:00:15,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6] total 8 [2018-11-23 13:00:15,689 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 13:00:15,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:15,689 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:00:15,823 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:15,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:00:15,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:00:15,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:15,825 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand 8 states. [2018-11-23 13:00:16,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:16,680 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2018-11-23 13:00:16,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:00:16,680 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 42 [2018-11-23 13:00:16,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:16,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:00:16,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-23 13:00:16,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:00:16,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 100 transitions. [2018-11-23 13:00:16,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 100 transitions. [2018-11-23 13:00:16,864 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:16,868 INFO L225 Difference]: With dead ends: 88 [2018-11-23 13:00:16,868 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 13:00:16,869 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:00:16,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 13:00:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 51. [2018-11-23 13:00:16,939 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:16,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 62 states. Second operand 51 states. [2018-11-23 13:00:16,939 INFO L74 IsIncluded]: Start isIncluded. First operand 62 states. Second operand 51 states. [2018-11-23 13:00:16,940 INFO L87 Difference]: Start difference. First operand 62 states. Second operand 51 states. [2018-11-23 13:00:16,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:16,944 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 13:00:16,944 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 13:00:16,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:16,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:16,946 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand 62 states. [2018-11-23 13:00:16,946 INFO L87 Difference]: Start difference. First operand 51 states. Second operand 62 states. [2018-11-23 13:00:16,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:16,950 INFO L93 Difference]: Finished difference Result 62 states and 70 transitions. [2018-11-23 13:00:16,951 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2018-11-23 13:00:16,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:16,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:16,952 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:16,952 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:16,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 13:00:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 57 transitions. [2018-11-23 13:00:16,956 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 57 transitions. Word has length 42 [2018-11-23 13:00:16,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:16,956 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 57 transitions. [2018-11-23 13:00:16,956 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:00:16,956 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 57 transitions. [2018-11-23 13:00:16,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 13:00:16,958 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:16,959 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 13:00:16,959 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:16,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:16,960 INFO L82 PathProgramCache]: Analyzing trace with hash -337716128, now seen corresponding path program 2 times [2018-11-23 13:00:16,960 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:16,960 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:16,961 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:16,962 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 13:00:16,962 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:17,152 INFO L256 TraceCheckUtils]: 0: Hoare triple {1109#true} call ULTIMATE.init(); {1109#true} is VALID [2018-11-23 13:00:17,153 INFO L273 TraceCheckUtils]: 1: Hoare triple {1109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1109#true} is VALID [2018-11-23 13:00:17,153 INFO L273 TraceCheckUtils]: 2: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,154 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1109#true} {1109#true} #136#return; {1109#true} is VALID [2018-11-23 13:00:17,154 INFO L256 TraceCheckUtils]: 4: Hoare triple {1109#true} call #t~ret15 := main(); {1109#true} is VALID [2018-11-23 13:00:17,155 INFO L273 TraceCheckUtils]: 5: Hoare triple {1109#true} ~len~0 := 2;~data~0 := 1; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,155 INFO L256 TraceCheckUtils]: 6: Hoare triple {1111#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1109#true} is VALID [2018-11-23 13:00:17,156 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1109#true} is VALID [2018-11-23 13:00:17,156 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#true} assume !!(~len > 0); {1109#true} is VALID [2018-11-23 13:00:17,156 INFO L256 TraceCheckUtils]: 9: Hoare triple {1109#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1109#true} is VALID [2018-11-23 13:00:17,156 INFO L273 TraceCheckUtils]: 10: Hoare triple {1109#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1109#true} is VALID [2018-11-23 13:00:17,157 INFO L273 TraceCheckUtils]: 11: Hoare triple {1109#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1109#true} is VALID [2018-11-23 13:00:17,157 INFO L273 TraceCheckUtils]: 12: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,157 INFO L273 TraceCheckUtils]: 13: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,157 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1109#true} {1109#true} #134#return; {1109#true} is VALID [2018-11-23 13:00:17,157 INFO L273 TraceCheckUtils]: 15: Hoare triple {1109#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,158 INFO L273 TraceCheckUtils]: 16: Hoare triple {1109#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1109#true} is VALID [2018-11-23 13:00:17,158 INFO L273 TraceCheckUtils]: 17: Hoare triple {1109#true} assume !!(~len > 0); {1109#true} is VALID [2018-11-23 13:00:17,158 INFO L256 TraceCheckUtils]: 18: Hoare triple {1109#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1109#true} is VALID [2018-11-23 13:00:17,158 INFO L273 TraceCheckUtils]: 19: Hoare triple {1109#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1109#true} is VALID [2018-11-23 13:00:17,158 INFO L273 TraceCheckUtils]: 20: Hoare triple {1109#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1109#true} is VALID [2018-11-23 13:00:17,159 INFO L273 TraceCheckUtils]: 21: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,159 INFO L273 TraceCheckUtils]: 22: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,159 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1109#true} {1109#true} #134#return; {1109#true} is VALID [2018-11-23 13:00:17,159 INFO L273 TraceCheckUtils]: 24: Hoare triple {1109#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,159 INFO L273 TraceCheckUtils]: 25: Hoare triple {1109#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1109#true} is VALID [2018-11-23 13:00:17,160 INFO L273 TraceCheckUtils]: 26: Hoare triple {1109#true} assume !(~len > 0); {1109#true} is VALID [2018-11-23 13:00:17,160 INFO L273 TraceCheckUtils]: 27: Hoare triple {1109#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,160 INFO L273 TraceCheckUtils]: 28: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,161 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1109#true} {1111#(<= 2 main_~len~0)} #126#return; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,162 INFO L273 TraceCheckUtils]: 30: Hoare triple {1111#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1112#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:17,162 INFO L273 TraceCheckUtils]: 31: Hoare triple {1112#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);~new_data~0 := ~i~0 + ~len~0; {1112#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:17,163 INFO L256 TraceCheckUtils]: 32: Hoare triple {1112#(<= 1 main_~i~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1109#true} is VALID [2018-11-23 13:00:17,163 INFO L273 TraceCheckUtils]: 33: Hoare triple {1109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1113#(<= |sll_update_at_#in~index| sll_update_at_~index)} is VALID [2018-11-23 13:00:17,164 INFO L273 TraceCheckUtils]: 34: Hoare triple {1113#(<= |sll_update_at_#in~index| sll_update_at_~index)} assume !(~index > 0); {1114#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:17,164 INFO L273 TraceCheckUtils]: 35: Hoare triple {1114#(<= |sll_update_at_#in~index| 0)} call write~int(~data, ~head.base, ~head.offset, 4); {1114#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:17,167 INFO L273 TraceCheckUtils]: 36: Hoare triple {1114#(<= |sll_update_at_#in~index| 0)} assume true; {1114#(<= |sll_update_at_#in~index| 0)} is VALID [2018-11-23 13:00:17,169 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1114#(<= |sll_update_at_#in~index| 0)} {1112#(<= 1 main_~i~0)} #128#return; {1110#false} is VALID [2018-11-23 13:00:17,169 INFO L273 TraceCheckUtils]: 38: Hoare triple {1110#false} #t~post12 := ~i~0;~i~0 := #t~post12 - 1;havoc #t~post12; {1110#false} is VALID [2018-11-23 13:00:17,169 INFO L273 TraceCheckUtils]: 39: Hoare triple {1110#false} assume !!(~i~0 >= 0);~new_data~0 := ~i~0 + ~len~0; {1110#false} is VALID [2018-11-23 13:00:17,169 INFO L256 TraceCheckUtils]: 40: Hoare triple {1110#false} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1109#true} is VALID [2018-11-23 13:00:17,170 INFO L273 TraceCheckUtils]: 41: Hoare triple {1109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1109#true} is VALID [2018-11-23 13:00:17,170 INFO L273 TraceCheckUtils]: 42: Hoare triple {1109#true} assume !(~index > 0); {1109#true} is VALID [2018-11-23 13:00:17,170 INFO L273 TraceCheckUtils]: 43: Hoare triple {1109#true} call write~int(~data, ~head.base, ~head.offset, 4); {1109#true} is VALID [2018-11-23 13:00:17,170 INFO L273 TraceCheckUtils]: 44: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,170 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1109#true} {1110#false} #128#return; {1110#false} is VALID [2018-11-23 13:00:17,171 INFO L273 TraceCheckUtils]: 46: Hoare triple {1110#false} #t~post12 := ~i~0;~i~0 := #t~post12 - 1;havoc #t~post12; {1110#false} is VALID [2018-11-23 13:00:17,171 INFO L273 TraceCheckUtils]: 47: Hoare triple {1110#false} assume !(~i~0 >= 0); {1110#false} is VALID [2018-11-23 13:00:17,171 INFO L273 TraceCheckUtils]: 48: Hoare triple {1110#false} ~i~0 := ~len~0 - 1; {1110#false} is VALID [2018-11-23 13:00:17,171 INFO L273 TraceCheckUtils]: 49: Hoare triple {1110#false} assume !!(~i~0 >= 0);~expected~0 := ~i~0 + ~len~0; {1110#false} is VALID [2018-11-23 13:00:17,172 INFO L256 TraceCheckUtils]: 50: Hoare triple {1110#false} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1109#true} is VALID [2018-11-23 13:00:17,172 INFO L273 TraceCheckUtils]: 51: Hoare triple {1109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1109#true} is VALID [2018-11-23 13:00:17,173 INFO L273 TraceCheckUtils]: 52: Hoare triple {1109#true} assume !(~index > 0); {1109#true} is VALID [2018-11-23 13:00:17,173 INFO L273 TraceCheckUtils]: 53: Hoare triple {1109#true} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1109#true} is VALID [2018-11-23 13:00:17,173 INFO L273 TraceCheckUtils]: 54: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,174 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1109#true} {1110#false} #130#return; {1110#false} is VALID [2018-11-23 13:00:17,174 INFO L273 TraceCheckUtils]: 56: Hoare triple {1110#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1110#false} is VALID [2018-11-23 13:00:17,174 INFO L273 TraceCheckUtils]: 57: Hoare triple {1110#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1110#false} is VALID [2018-11-23 13:00:17,174 INFO L273 TraceCheckUtils]: 58: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2018-11-23 13:00:17,179 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-23 13:00:17,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 13:00:17,180 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 13:00:17,199 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-23 13:00:17,234 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-11-23 13:00:17,234 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 13:00:17,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:17,262 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 13:00:17,395 INFO L256 TraceCheckUtils]: 0: Hoare triple {1109#true} call ULTIMATE.init(); {1109#true} is VALID [2018-11-23 13:00:17,396 INFO L273 TraceCheckUtils]: 1: Hoare triple {1109#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; {1109#true} is VALID [2018-11-23 13:00:17,396 INFO L273 TraceCheckUtils]: 2: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,396 INFO L268 TraceCheckUtils]: 3: Hoare quadruple {1109#true} {1109#true} #136#return; {1109#true} is VALID [2018-11-23 13:00:17,397 INFO L256 TraceCheckUtils]: 4: Hoare triple {1109#true} call #t~ret15 := main(); {1109#true} is VALID [2018-11-23 13:00:17,398 INFO L273 TraceCheckUtils]: 5: Hoare triple {1109#true} ~len~0 := 2;~data~0 := 1; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,398 INFO L256 TraceCheckUtils]: 6: Hoare triple {1111#(<= 2 main_~len~0)} call #t~ret11.base, #t~ret11.offset := sll_create(~len~0, ~data~0); {1109#true} is VALID [2018-11-23 13:00:17,398 INFO L273 TraceCheckUtils]: 7: Hoare triple {1109#true} ~len := #in~len;~data := #in~data;~head~0.base, ~head~0.offset := 0, 0; {1109#true} is VALID [2018-11-23 13:00:17,398 INFO L273 TraceCheckUtils]: 8: Hoare triple {1109#true} assume !!(~len > 0); {1109#true} is VALID [2018-11-23 13:00:17,398 INFO L256 TraceCheckUtils]: 9: Hoare triple {1109#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1109#true} is VALID [2018-11-23 13:00:17,399 INFO L273 TraceCheckUtils]: 10: Hoare triple {1109#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1109#true} is VALID [2018-11-23 13:00:17,399 INFO L273 TraceCheckUtils]: 11: Hoare triple {1109#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1109#true} is VALID [2018-11-23 13:00:17,399 INFO L273 TraceCheckUtils]: 12: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,399 INFO L273 TraceCheckUtils]: 13: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,400 INFO L268 TraceCheckUtils]: 14: Hoare quadruple {1109#true} {1109#true} #134#return; {1109#true} is VALID [2018-11-23 13:00:17,400 INFO L273 TraceCheckUtils]: 15: Hoare triple {1109#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,400 INFO L273 TraceCheckUtils]: 16: Hoare triple {1109#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1109#true} is VALID [2018-11-23 13:00:17,401 INFO L273 TraceCheckUtils]: 17: Hoare triple {1109#true} assume !!(~len > 0); {1109#true} is VALID [2018-11-23 13:00:17,401 INFO L256 TraceCheckUtils]: 18: Hoare triple {1109#true} call #t~ret4.base, #t~ret4.offset := node_create(~data); {1109#true} is VALID [2018-11-23 13:00:17,401 INFO L273 TraceCheckUtils]: 19: Hoare triple {1109#true} ~data := #in~data;call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(8);~temp~0.base, ~temp~0.offset := #t~malloc2.base, #t~malloc2.offset; {1109#true} is VALID [2018-11-23 13:00:17,402 INFO L273 TraceCheckUtils]: 20: Hoare triple {1109#true} assume !(0 == ~temp~0.base && 0 == ~temp~0.offset); {1109#true} is VALID [2018-11-23 13:00:17,402 INFO L273 TraceCheckUtils]: 21: Hoare triple {1109#true} call write~$Pointer$(0, 0, ~temp~0.base, 4 + ~temp~0.offset, 4);call write~int(~data, ~temp~0.base, ~temp~0.offset, 4);#res.base, #res.offset := ~temp~0.base, ~temp~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,402 INFO L273 TraceCheckUtils]: 22: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,402 INFO L268 TraceCheckUtils]: 23: Hoare quadruple {1109#true} {1109#true} #134#return; {1109#true} is VALID [2018-11-23 13:00:17,403 INFO L273 TraceCheckUtils]: 24: Hoare triple {1109#true} ~new_head~0.base, ~new_head~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;call write~$Pointer$(~head~0.base, ~head~0.offset, ~new_head~0.base, 4 + ~new_head~0.offset, 4);~head~0.base, ~head~0.offset := ~new_head~0.base, ~new_head~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,403 INFO L273 TraceCheckUtils]: 25: Hoare triple {1109#true} #t~post3 := ~len;~len := #t~post3 - 1;havoc #t~post3; {1109#true} is VALID [2018-11-23 13:00:17,403 INFO L273 TraceCheckUtils]: 26: Hoare triple {1109#true} assume !(~len > 0); {1109#true} is VALID [2018-11-23 13:00:17,403 INFO L273 TraceCheckUtils]: 27: Hoare triple {1109#true} #res.base, #res.offset := ~head~0.base, ~head~0.offset; {1109#true} is VALID [2018-11-23 13:00:17,404 INFO L273 TraceCheckUtils]: 28: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,405 INFO L268 TraceCheckUtils]: 29: Hoare quadruple {1109#true} {1111#(<= 2 main_~len~0)} #126#return; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,406 INFO L273 TraceCheckUtils]: 30: Hoare triple {1111#(<= 2 main_~len~0)} ~s~0.base, ~s~0.offset := #t~ret11.base, #t~ret11.offset;havoc #t~ret11.base, #t~ret11.offset;havoc ~i~0;~i~0 := ~len~0 - 1; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,406 INFO L273 TraceCheckUtils]: 31: Hoare triple {1111#(<= 2 main_~len~0)} assume !!(~i~0 >= 0);~new_data~0 := ~i~0 + ~len~0; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,406 INFO L256 TraceCheckUtils]: 32: Hoare triple {1111#(<= 2 main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1109#true} is VALID [2018-11-23 13:00:17,407 INFO L273 TraceCheckUtils]: 33: Hoare triple {1109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1109#true} is VALID [2018-11-23 13:00:17,407 INFO L273 TraceCheckUtils]: 34: Hoare triple {1109#true} assume !(~index > 0); {1109#true} is VALID [2018-11-23 13:00:17,407 INFO L273 TraceCheckUtils]: 35: Hoare triple {1109#true} call write~int(~data, ~head.base, ~head.offset, 4); {1109#true} is VALID [2018-11-23 13:00:17,407 INFO L273 TraceCheckUtils]: 36: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,409 INFO L268 TraceCheckUtils]: 37: Hoare quadruple {1109#true} {1111#(<= 2 main_~len~0)} #128#return; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,410 INFO L273 TraceCheckUtils]: 38: Hoare triple {1111#(<= 2 main_~len~0)} #t~post12 := ~i~0;~i~0 := #t~post12 - 1;havoc #t~post12; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,410 INFO L273 TraceCheckUtils]: 39: Hoare triple {1111#(<= 2 main_~len~0)} assume !!(~i~0 >= 0);~new_data~0 := ~i~0 + ~len~0; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,411 INFO L256 TraceCheckUtils]: 40: Hoare triple {1111#(<= 2 main_~len~0)} call sll_update_at(~s~0.base, ~s~0.offset, ~new_data~0, ~i~0); {1109#true} is VALID [2018-11-23 13:00:17,411 INFO L273 TraceCheckUtils]: 41: Hoare triple {1109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~data := #in~data;~index := #in~index; {1109#true} is VALID [2018-11-23 13:00:17,411 INFO L273 TraceCheckUtils]: 42: Hoare triple {1109#true} assume !(~index > 0); {1109#true} is VALID [2018-11-23 13:00:17,412 INFO L273 TraceCheckUtils]: 43: Hoare triple {1109#true} call write~int(~data, ~head.base, ~head.offset, 4); {1109#true} is VALID [2018-11-23 13:00:17,412 INFO L273 TraceCheckUtils]: 44: Hoare triple {1109#true} assume true; {1109#true} is VALID [2018-11-23 13:00:17,414 INFO L268 TraceCheckUtils]: 45: Hoare quadruple {1109#true} {1111#(<= 2 main_~len~0)} #128#return; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,415 INFO L273 TraceCheckUtils]: 46: Hoare triple {1111#(<= 2 main_~len~0)} #t~post12 := ~i~0;~i~0 := #t~post12 - 1;havoc #t~post12; {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,415 INFO L273 TraceCheckUtils]: 47: Hoare triple {1111#(<= 2 main_~len~0)} assume !(~i~0 >= 0); {1111#(<= 2 main_~len~0)} is VALID [2018-11-23 13:00:17,417 INFO L273 TraceCheckUtils]: 48: Hoare triple {1111#(<= 2 main_~len~0)} ~i~0 := ~len~0 - 1; {1112#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:17,417 INFO L273 TraceCheckUtils]: 49: Hoare triple {1112#(<= 1 main_~i~0)} assume !!(~i~0 >= 0);~expected~0 := ~i~0 + ~len~0; {1112#(<= 1 main_~i~0)} is VALID [2018-11-23 13:00:17,418 INFO L256 TraceCheckUtils]: 50: Hoare triple {1112#(<= 1 main_~i~0)} call #t~ret14 := sll_get_data_at(~s~0.base, ~s~0.offset, ~i~0); {1109#true} is VALID [2018-11-23 13:00:17,423 INFO L273 TraceCheckUtils]: 51: Hoare triple {1109#true} ~head.base, ~head.offset := #in~head.base, #in~head.offset;~index := #in~index; {1271#(<= |sll_get_data_at_#in~index| sll_get_data_at_~index)} is VALID [2018-11-23 13:00:17,425 INFO L273 TraceCheckUtils]: 52: Hoare triple {1271#(<= |sll_get_data_at_#in~index| sll_get_data_at_~index)} assume !(~index > 0); {1275#(<= |sll_get_data_at_#in~index| 0)} is VALID [2018-11-23 13:00:17,427 INFO L273 TraceCheckUtils]: 53: Hoare triple {1275#(<= |sll_get_data_at_#in~index| 0)} call #t~mem8 := read~int(~head.base, ~head.offset, 4);#res := #t~mem8;havoc #t~mem8; {1275#(<= |sll_get_data_at_#in~index| 0)} is VALID [2018-11-23 13:00:17,431 INFO L273 TraceCheckUtils]: 54: Hoare triple {1275#(<= |sll_get_data_at_#in~index| 0)} assume true; {1275#(<= |sll_get_data_at_#in~index| 0)} is VALID [2018-11-23 13:00:17,436 INFO L268 TraceCheckUtils]: 55: Hoare quadruple {1275#(<= |sll_get_data_at_#in~index| 0)} {1112#(<= 1 main_~i~0)} #130#return; {1110#false} is VALID [2018-11-23 13:00:17,436 INFO L273 TraceCheckUtils]: 56: Hoare triple {1110#false} assume -2147483648 <= #t~ret14 && #t~ret14 <= 2147483647; {1110#false} is VALID [2018-11-23 13:00:17,437 INFO L273 TraceCheckUtils]: 57: Hoare triple {1110#false} assume ~expected~0 != #t~ret14;havoc #t~ret14; {1110#false} is VALID [2018-11-23 13:00:17,437 INFO L273 TraceCheckUtils]: 58: Hoare triple {1110#false} assume !false; {1110#false} is VALID [2018-11-23 13:00:17,443 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-23 13:00:17,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-11-23 13:00:17,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 8 [2018-11-23 13:00:17,472 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 13:00:17,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2018-11-23 13:00:17,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states. [2018-11-23 13:00:17,556 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:17,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 13:00:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 13:00:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-11-23 13:00:17,557 INFO L87 Difference]: Start difference. First operand 51 states and 57 transitions. Second operand 8 states. [2018-11-23 13:00:18,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:18,185 INFO L93 Difference]: Finished difference Result 89 states and 103 transitions. [2018-11-23 13:00:18,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 13:00:18,185 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 59 [2018-11-23 13:00:18,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 13:00:18,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:00:18,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-23 13:00:18,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-23 13:00:18,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 94 transitions. [2018-11-23 13:00:18,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 94 transitions. [2018-11-23 13:00:18,341 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2018-11-23 13:00:18,345 INFO L225 Difference]: With dead ends: 89 [2018-11-23 13:00:18,346 INFO L226 Difference]: Without dead ends: 66 [2018-11-23 13:00:18,346 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-11-23 13:00:18,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-11-23 13:00:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 61. [2018-11-23 13:00:18,432 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2018-11-23 13:00:18,432 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand 61 states. [2018-11-23 13:00:18,432 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand 61 states. [2018-11-23 13:00:18,433 INFO L87 Difference]: Start difference. First operand 66 states. Second operand 61 states. [2018-11-23 13:00:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:18,437 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-23 13:00:18,438 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-23 13:00:18,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:18,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:18,439 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand 66 states. [2018-11-23 13:00:18,439 INFO L87 Difference]: Start difference. First operand 61 states. Second operand 66 states. [2018-11-23 13:00:18,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 13:00:18,444 INFO L93 Difference]: Finished difference Result 66 states and 75 transitions. [2018-11-23 13:00:18,444 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2018-11-23 13:00:18,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-23 13:00:18,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2018-11-23 13:00:18,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2018-11-23 13:00:18,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2018-11-23 13:00:18,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 13:00:18,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 70 transitions. [2018-11-23 13:00:18,449 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 70 transitions. Word has length 59 [2018-11-23 13:00:18,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 13:00:18,449 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 70 transitions. [2018-11-23 13:00:18,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 13:00:18,449 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2018-11-23 13:00:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-11-23 13:00:18,451 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 13:00:18,452 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-11-23 13:00:18,452 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-23 13:00:18,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 13:00:18,452 INFO L82 PathProgramCache]: Analyzing trace with hash 569673156, now seen corresponding path program 1 times [2018-11-23 13:00:18,452 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 13:00:18,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 13:00:18,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:18,454 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 13:00:18,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 13:00:18,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 13:00:19,820 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 13:00:19,826 INFO L168 Benchmark]: Toolchain (without parser) took 10018.29 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 870.8 MB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -906.0 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:19,827 INFO L168 Benchmark]: CDTParser took 0.27 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 13:00:19,828 INFO L168 Benchmark]: CACSL2BoogieTranslator took 752.76 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.0 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:19,829 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.15 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:19,829 INFO L168 Benchmark]: Boogie Preprocessor took 46.24 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:19,830 INFO L168 Benchmark]: RCFGBuilder took 1103.27 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2018-11-23 13:00:19,831 INFO L168 Benchmark]: TraceAbstraction took 8072.10 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.8 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -183.5 MB). There was no memory consumed. Max. memory is 7.1 GB. [2018-11-23 13:00:19,835 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.27 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 752.76 ms. Allocated memory was 1.5 GB in the beginning and 2.2 GB in the end (delta: 724.0 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -772.0 MB). Peak memory consumption was 49.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.15 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 46.24 ms. Allocated memory is still 2.2 GB. Free memory is still 2.2 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1103.27 ms. Allocated memory is still 2.2 GB. Free memory was 2.2 GB in the beginning and 2.1 GB in the end (delta: 49.5 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 8072.10 ms. Allocated memory was 2.2 GB in the beginning and 2.4 GB in the end (delta: 146.8 MB). Free memory was 2.1 GB in the beginning and 2.3 GB in the end (delta: -183.5 MB). There was no memory consumed. 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...