./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/forester-heap/dll-circular-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:50:49,051 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:50:49,053 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:50:49,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:50:49,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:50:49,086 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:50:49,087 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:50:49,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:50:49,089 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:50:49,090 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:50:49,091 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:50:49,092 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:50:49,092 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:50:49,093 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:50:49,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:50:49,094 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:50:49,095 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:50:49,096 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:50:49,098 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:50:49,100 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:50:49,101 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:50:49,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:50:49,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:50:49,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:50:49,110 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:50:49,115 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:50:49,115 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:50:49,116 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:50:49,116 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:50:49,118 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:50:49,118 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:50:49,119 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:50:49,120 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:50:49,121 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:50:49,121 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:50:49,122 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:50:49,123 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:50:49,123 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:50:49,123 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:50:49,124 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:50:49,124 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:50:49,125 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:50:49,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:50:49,141 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:50:49,142 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:50:49,142 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:50:49,143 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:50:49,143 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:50:49,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:50:49,144 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:50:49,144 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:50:49,144 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:50:49,145 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:50:49,145 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:50:49,145 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:50:49,145 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:50:49,145 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:50:49,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:50:49,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:50:49,146 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:50:49,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:50:49,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:50:49,146 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:50:49,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:50:49,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:50:49,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:50:49,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:49,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:50:49,147 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:50:49,147 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:50:49,147 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:50:49,147 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:50:49,148 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:50:49,148 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:50:49,148 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:50:49,148 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b74df92940ca0e86c8c02c3eca1e89fb6c9c9c1248a25cd764acf39f7727180 [2022-02-20 16:50:49,345 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:50:49,362 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:50:49,365 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:50:49,366 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:50:49,366 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:50:49,368 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-02-20 16:50:49,414 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a3fc60a/bd14d745e139461b8fea645eb70779fa/FLAG0a0e27c46 [2022-02-20 16:50:49,792 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:50:49,792 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i [2022-02-20 16:50:49,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a3fc60a/bd14d745e139461b8fea645eb70779fa/FLAG0a0e27c46 [2022-02-20 16:50:49,809 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/31a3fc60a/bd14d745e139461b8fea645eb70779fa [2022-02-20 16:50:49,811 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:50:49,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:50:49,815 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:49,815 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:50:49,817 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:50:49,818 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:49" (1/1) ... [2022-02-20 16:50:49,819 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6197a52c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:49, skipping insertion in model container [2022-02-20 16:50:49,819 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:49" (1/1) ... [2022-02-20 16:50:49,824 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:50:49,861 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:50:50,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2022-02-20 16:50:50,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2022-02-20 16:50:50,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2022-02-20 16:50:50,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:50,049 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:50:50,080 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22365,22378] [2022-02-20 16:50:50,086 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22471,22484] [2022-02-20 16:50:50,088 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-1.i[22595,22608] [2022-02-20 16:50:50,089 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:50,106 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:50:50,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50 WrapperNode [2022-02-20 16:50:50,107 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:50,108 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:50,108 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:50:50,108 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:50:50,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,120 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,140 INFO L137 Inliner]: procedures = 119, calls = 30, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 116 [2022-02-20 16:50:50,140 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:50,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:50:50,141 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:50:50,141 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:50:50,151 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,151 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,155 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,156 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,162 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,167 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,168 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,170 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:50:50,170 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:50:50,170 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:50:50,171 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:50:50,171 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:50,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:50,198 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:50:50,203 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:50:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:50:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:50:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:50:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:50:50,221 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:50:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:50:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:50:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:50:50,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:50:50,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:50:50,283 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:50:50,284 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:50:50,536 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:50:50,541 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:50:50,541 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 16:50:50,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:50 BoogieIcfgContainer [2022-02-20 16:50:50,542 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:50:50,543 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:50:50,543 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:50:50,545 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:50:50,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:50:49" (1/3) ... [2022-02-20 16:50:50,546 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a77302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:50, skipping insertion in model container [2022-02-20 16:50:50,546 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (2/3) ... [2022-02-20 16:50:50,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17a77302 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:50, skipping insertion in model container [2022-02-20 16:50:50,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:50" (3/3) ... [2022-02-20 16:50:50,548 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-1.i [2022-02-20 16:50:50,551 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:50:50,551 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 16:50:50,595 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:50:50,599 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 16:50:50,599 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 16:50:50,613 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:50:50,616 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:50,616 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:50:50,616 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:50,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:50,620 INFO L85 PathProgramCache]: Analyzing trace with hash 890892102, now seen corresponding path program 1 times [2022-02-20 16:50:50,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:50,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69290491] [2022-02-20 16:50:50,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:50,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:50,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:50,737 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {36#true} is VALID [2022-02-20 16:50:50,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {36#true} is VALID [2022-02-20 16:50:50,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-02-20 16:50:50,739 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {37#false} is VALID [2022-02-20 16:50:50,739 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {37#false} is VALID [2022-02-20 16:50:50,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:50:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:50,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:50,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69290491] [2022-02-20 16:50:50,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69290491] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:50,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:50,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:50:50,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449125740] [2022-02-20 16:50:50,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:50,747 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 16:50:50,748 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:50,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:50,761 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:50:50,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:50,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:50:50,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:50:50,786 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:50,839 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-02-20 16:50:50,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:50:50,839 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 16:50:50,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:50,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-02-20 16:50:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-02-20 16:50:50,852 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-02-20 16:50:50,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:50,950 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:50:50,951 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:50:50,953 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:50:50,956 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:50,957 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:50,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:50:50,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:50:50,976 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:50,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,977 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,978 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:50,980 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:50:50,980 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:50:50,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:50,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:50,982 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:50:50,982 INFO L87 Difference]: Start difference. First operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:50:50,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:50,983 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:50:50,983 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:50:50,984 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:50,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:50,984 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:50,984 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:50,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-20 16:50:50,988 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2022-02-20 16:50:50,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:50,988 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-20 16:50:50,989 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:50,989 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:50:50,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:50:50,989 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:50,990 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:50,990 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:50:50,992 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:50,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:50,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1806883023, now seen corresponding path program 1 times [2022-02-20 16:50:50,994 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:50,995 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49313861] [2022-02-20 16:50:50,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:50,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:51,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {198#true} is VALID [2022-02-20 16:50:51,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 16:50:51,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 16:50:51,158 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 16:50:51,159 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {201#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 16:50:51,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {199#false} is VALID [2022-02-20 16:50:51,159 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-02-20 16:50:51,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:51,160 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:51,160 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49313861] [2022-02-20 16:50:51,160 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49313861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:51,160 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:51,160 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:50:51,160 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539468693] [2022-02-20 16:50:51,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:51,161 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:50:51,161 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:51,161 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:51,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:50:51,168 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:51,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:50:51,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:50:51,169 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,296 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 16:50:51,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:50:51,296 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:50:51,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:51,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:50:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:50:51,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-02-20 16:50:51,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:51,348 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:50:51,348 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:50:51,350 INFO L932 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 [2022-02-20 16:50:51,352 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:51,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:51,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:50:51,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-02-20 16:50:51,358 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:51,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,360 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,360 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,363 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:50:51,363 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:50:51,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:51,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:51,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:50:51,364 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:50:51,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,369 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:50:51,369 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:50:51,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:51,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:51,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:51,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:51,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-20 16:50:51,372 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2022-02-20 16:50:51,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:51,372 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-20 16:50:51,373 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,373 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:50:51,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:50:51,374 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:51,375 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:51,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:50:51,375 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:51,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:51,375 INFO L85 PathProgramCache]: Analyzing trace with hash 706691337, now seen corresponding path program 1 times [2022-02-20 16:50:51,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:51,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1289268382] [2022-02-20 16:50:51,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:51,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:51,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {365#true} is VALID [2022-02-20 16:50:51,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:51,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:51,454 INFO L290 TraceCheckUtils]: 3: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:51,455 INFO L290 TraceCheckUtils]: 4: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:51,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume !(1 == main_~state~0#1); {366#false} is VALID [2022-02-20 16:50:51,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#false} assume !(2 == main_~state~0#1); {366#false} is VALID [2022-02-20 16:50:51,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#false} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {366#false} is VALID [2022-02-20 16:50:51,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {366#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {366#false} is VALID [2022-02-20 16:50:51,456 INFO L290 TraceCheckUtils]: 9: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 16:50:51,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:51,456 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:51,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1289268382] [2022-02-20 16:50:51,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1289268382] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:51,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:51,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:50:51,457 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132893903] [2022-02-20 16:50:51,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:51,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:50:51,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:51,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:51,465 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:50:51,465 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:51,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:50:51,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:51,466 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,515 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 16:50:51,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:50:51,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:50:51,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:51,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 16:50:51,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 16:50:51,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 16:50:51,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:51,577 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:50:51,577 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 16:50:51,582 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:51,584 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:51,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 16:50:51,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-02-20 16:50:51,592 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:51,592 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,592 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,592 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,595 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-02-20 16:50:51,596 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-02-20 16:50:51,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:51,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:51,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 16:50:51,596 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 16:50:51,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,600 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-02-20 16:50:51,600 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-02-20 16:50:51,603 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:51,603 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:51,603 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:51,603 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:51,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-02-20 16:50:51,604 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2022-02-20 16:50:51,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:51,604 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-02-20 16:50:51,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,604 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-20 16:50:51,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:50:51,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:51,605 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:51,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:50:51,605 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:51,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:51,605 INFO L85 PathProgramCache]: Analyzing trace with hash -84804677, now seen corresponding path program 1 times [2022-02-20 16:50:51,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:51,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720243278] [2022-02-20 16:50:51,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:51,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:51,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:50:51,638 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:50:51,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:50:51,665 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:50:51,668 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:50:51,669 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 16:50:51,670 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 16:50:51,671 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-02-20 16:50:51,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:50:51,673 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 16:50:51,675 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:50:51,703 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1025-5 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1025-5 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1005-3 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1005-1 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1030-4 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1013 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1013 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2022-02-20 16:50:51,704 WARN L170 areAnnotationChecker]: L1032-2 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1030-1 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1030-3 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1015 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1032-3 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1032 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1017 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1025-4 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1025-4 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1025-4 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1040-3 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1040-3 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1034-7 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1034-7 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1025-1 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1025-1 has no Hoare annotation [2022-02-20 16:50:51,705 WARN L170 areAnnotationChecker]: L1025-3 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1025-3 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1040-4 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-1 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-8 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1048 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-3 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-3 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-4 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-4 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-6 has no Hoare annotation [2022-02-20 16:50:51,706 WARN L170 areAnnotationChecker]: L1034-6 has no Hoare annotation [2022-02-20 16:50:51,706 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 16:50:51,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:50:51 BoogieIcfgContainer [2022-02-20 16:50:51,707 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:50:51,707 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:50:51,707 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:50:51,707 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:50:51,708 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:50" (3/4) ... [2022-02-20 16:50:51,709 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 16:50:51,730 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:50:51,731 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:50:51,731 INFO L158 Benchmark]: Toolchain (without parser) took 1918.52ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 59.3MB in the beginning and 49.5MB in the end (delta: 9.8MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2022-02-20 16:50:51,732 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:50:51,732 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.98ms. Allocated memory is still 94.4MB. Free memory was 59.1MB in the beginning and 62.0MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 16:50:51,732 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.44ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 59.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:50:51,732 INFO L158 Benchmark]: Boogie Preprocessor took 29.40ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 57.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:50:51,733 INFO L158 Benchmark]: RCFGBuilder took 371.96ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 40.4MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-20 16:50:51,733 INFO L158 Benchmark]: TraceAbstraction took 1163.43ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 39.7MB in the beginning and 52.4MB in the end (delta: -12.8MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 16:50:51,733 INFO L158 Benchmark]: Witness Printer took 23.54ms. Allocated memory is still 113.2MB. Free memory was 52.4MB in the beginning and 49.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:50:51,734 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 65.5MB in the end (delta: 26.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.98ms. Allocated memory is still 94.4MB. Free memory was 59.1MB in the beginning and 62.0MB in the end (delta: -2.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.44ms. Allocated memory is still 94.4MB. Free memory was 62.0MB in the beginning and 59.6MB in the end (delta: 2.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.40ms. Allocated memory is still 94.4MB. Free memory was 59.6MB in the beginning and 57.8MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 371.96ms. Allocated memory is still 94.4MB. Free memory was 57.8MB in the beginning and 40.4MB in the end (delta: 17.5MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1163.43ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 39.7MB in the beginning and 52.4MB in the end (delta: -12.8MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Witness Printer took 23.54ms. Allocated memory is still 113.2MB. Free memory was 52.4MB in the beginning and 49.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1034]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L997] SLL* head = malloc(sizeof(SLL)); [L998] head->next = head [L999] head->data = 0 [L1001] SLL* x = head; [L1002] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1005] COND FALSE !(__VERIFIER_nondet_int()) [L1027] x->data = state [L1029] EXPR head->next [L1029] x = head->next [L1030] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1032] COND TRUE x->data != 0 [L1034] EXPR x->next [L1034] EXPR x->next->data [L1034] EXPR x->next->data != 0 && x->data > x->next->data [L1034] EXPR x->data [L1034] EXPR x->next [L1034] EXPR x->next->data [L1034] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1034] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1034] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - UnprovableResult [Line: 1025]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1030]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 33 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 44 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 44 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 49 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 85 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 24 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 20 ConstructedInterpolants, 0 QuantifiedInterpolants, 82 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-02-20 16:50:51,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE