./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.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-rb-cnstr_1-2.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 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:50:55,747 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:50:55,749 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:50:55,781 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:50:55,782 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:50:55,785 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:50:55,786 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:50:55,788 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:50:55,789 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:50:55,793 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:50:55,793 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:50:55,794 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:50:55,794 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:50:55,796 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:50:55,797 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:50:55,800 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:50:55,800 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:50:55,801 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:50:55,802 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:50:55,806 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:50:55,807 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:50:55,808 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:50:55,809 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:50:55,810 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:50:55,815 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:50:55,815 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:50:55,815 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:50:55,817 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:50:55,817 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:50:55,817 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:50:55,818 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:50:55,818 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:50:55,819 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:50:55,820 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:50:55,821 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:50:55,821 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:50:55,822 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:50:55,822 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:50:55,822 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:50:55,823 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:50:55,823 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:50:55,824 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:55,843 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:50:55,844 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:50:55,844 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:50:55,844 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:50:55,845 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:50:55,845 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:50:55,846 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:50:55,846 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:50:55,846 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:50:55,846 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:50:55,847 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:50:55,847 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:50:55,847 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:50:55,847 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:50:55,847 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:50:55,848 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:50:55,848 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:50:55,848 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:50:55,848 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:50:55,848 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:50:55,848 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:50:55,849 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:50:55,849 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:50:55,849 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:50:55,849 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:55,849 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:50:55,849 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:50:55,849 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:50:55,850 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:50:55,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:50:55,850 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:50:55,850 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:50:55,850 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:50:55,851 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 -> 0209a5ecd1f90a7dc207e0462366045d25daa538d59f8499c5199765a86166a3 [2022-02-20 16:50:56,126 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:50:56,149 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:50:56,151 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:50:56,152 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:50:56,153 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:50:56,154 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-02-20 16:50:56,200 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001ae10dd/ceeb5faba4474f1c808f7aad73efb85d/FLAG02a0a198b [2022-02-20 16:50:56,583 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:50:56,583 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-rb-cnstr_1-2.i [2022-02-20 16:50:56,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001ae10dd/ceeb5faba4474f1c808f7aad73efb85d/FLAG02a0a198b [2022-02-20 16:50:56,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/001ae10dd/ceeb5faba4474f1c808f7aad73efb85d [2022-02-20 16:50:56,988 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:50:56,989 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:50:56,991 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:56,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:50:56,994 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:50:56,995 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:56" (1/1) ... [2022-02-20 16:50:56,995 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4785a151 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:56, skipping insertion in model container [2022-02-20 16:50:56,996 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:56" (1/1) ... [2022-02-20 16:50:57,001 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:50:57,039 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:50:57,281 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-rb-cnstr_1-2.i[22575,22588] [2022-02-20 16:50:57,286 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-rb-cnstr_1-2.i[22647,22660] [2022-02-20 16:50:57,289 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-rb-cnstr_1-2.i[22815,22828] [2022-02-20 16:50:57,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:57,305 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:50:57,352 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-rb-cnstr_1-2.i[22575,22588] [2022-02-20 16:50:57,353 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-rb-cnstr_1-2.i[22647,22660] [2022-02-20 16:50:57,354 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-rb-cnstr_1-2.i[22815,22828] [2022-02-20 16:50:57,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:57,375 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:50:57,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:57 WrapperNode [2022-02-20 16:50:57,375 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:57,376 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:57,376 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:50:57,377 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:50:57,382 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:57" (1/1) ... [2022-02-20 16:50:57,399 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:57" (1/1) ... [2022-02-20 16:50:57,425 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-02-20 16:50:57,427 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:57,428 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:50:57,428 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:50:57,429 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:50:57,434 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:57" (1/1) ... [2022-02-20 16:50:57,435 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:57" (1/1) ... [2022-02-20 16:50:57,439 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:57" (1/1) ... [2022-02-20 16:50:57,440 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:57" (1/1) ... [2022-02-20 16:50:57,447 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:57" (1/1) ... [2022-02-20 16:50:57,451 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:57" (1/1) ... [2022-02-20 16:50:57,452 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:57" (1/1) ... [2022-02-20 16:50:57,454 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:50:57,455 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:50:57,455 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:50:57,455 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:50:57,456 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:57" (1/1) ... [2022-02-20 16:50:57,465 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:57,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:57,483 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:57,490 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:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:50:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:50:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:50:57,517 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:50:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:50:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:50:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:50:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:50:57,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:50:57,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:50:57,581 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:50:57,582 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:50:57,873 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:50:57,878 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:50:57,878 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 16:50:57,880 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:57 BoogieIcfgContainer [2022-02-20 16:50:57,880 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:50:57,882 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:50:57,882 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:50:57,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:50:57,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:50:56" (1/3) ... [2022-02-20 16:50:57,885 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c236c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:57, skipping insertion in model container [2022-02-20 16:50:57,885 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:57" (2/3) ... [2022-02-20 16:50:57,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c236c61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:57, skipping insertion in model container [2022-02-20 16:50:57,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:57" (3/3) ... [2022-02-20 16:50:57,887 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-rb-cnstr_1-2.i [2022-02-20 16:50:57,890 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:50:57,890 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 16:50:57,924 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:50:57,928 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:57,929 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 16:50:57,940 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.84) internal successors, (46), 28 states have internal predecessors, (46), 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:57,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:50:57,943 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:57,943 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:50:57,944 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 889968582, now seen corresponding path program 1 times [2022-02-20 16:50:57,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:57,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412879257] [2022-02-20 16:50:57,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:57,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:58,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#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(19, 2); {32#true} is VALID [2022-02-20 16:50:58,098 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~nondet2#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~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$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {32#true} is VALID [2022-02-20 16:50:58,099 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume !true; {33#false} is VALID [2022-02-20 16:50:58,099 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#false} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {33#false} is VALID [2022-02-20 16:50:58,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#false} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {33#false} is VALID [2022-02-20 16:50:58,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-02-20 16:50:58,101 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:58,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:58,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412879257] [2022-02-20 16:50:58,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412879257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:58,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:58,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:50:58,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526705346] [2022-02-20 16:50:58,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:58,108 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:58,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:58,111 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:58,118 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:58,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:50:58,119 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:58,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:50:58,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:50:58,135 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.84) internal successors, (46), 28 states have internal predecessors, (46), 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:58,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,187 INFO L93 Difference]: Finished difference Result 53 states and 84 transitions. [2022-02-20 16:50:58,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:50:58,187 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:58,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:58,189 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:58,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 16:50:58,194 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:58,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 84 transitions. [2022-02-20 16:50:58,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 84 transitions. [2022-02-20 16:50:58,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:58,287 INFO L225 Difference]: With dead ends: 53 [2022-02-20 16:50:58,287 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 16:50:58,289 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:58,291 INFO L933 BasicCegarLoop]: 34 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, 34 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:58,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 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:58,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 16:50:58,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 16:50:58,310 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:58,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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:58,312 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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:58,312 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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:58,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,314 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:50:58,314 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:50:58,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,315 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 23 states. [2022-02-20 16:50:58,315 INFO L87 Difference]: Start difference. First operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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 23 states. [2022-02-20 16:50:58,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,317 INFO L93 Difference]: Finished difference Result 23 states and 26 transitions. [2022-02-20 16:50:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:50:58,317 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,318 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,318 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:58,318 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:58,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 20 states have (on average 1.3) internal successors, (26), 22 states have internal predecessors, (26), 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:58,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-02-20 16:50:58,320 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 6 [2022-02-20 16:50:58,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:58,321 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-02-20 16:50:58,321 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:58,321 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 16:50:58,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:50:58,322 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:58,322 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:58,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:50:58,322 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:58,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:58,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1806853233, now seen corresponding path program 1 times [2022-02-20 16:50:58,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:58,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1166295105] [2022-02-20 16:50:58,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:58,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:58,378 INFO L290 TraceCheckUtils]: 0: Hoare triple {165#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(19, 2); {165#true} is VALID [2022-02-20 16:50:58,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {165#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~nondet2#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~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$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:50:58,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:50:58,380 INFO L290 TraceCheckUtils]: 3: Hoare triple {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} is VALID [2022-02-20 16:50:58,380 INFO L290 TraceCheckUtils]: 4: Hoare triple {167#(not (= |ULTIMATE.start_main_~list~0#1.base| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {168#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} is VALID [2022-02-20 16:50:58,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {168#(not (= |ULTIMATE.start_main_~end~0#1.base| 0))} assume !(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {166#false} is VALID [2022-02-20 16:50:58,381 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#false} assume !false; {166#false} is VALID [2022-02-20 16:50:58,381 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:58,381 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:58,381 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1166295105] [2022-02-20 16:50:58,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1166295105] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:58,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:58,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:50:58,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597439856] [2022-02-20 16:50:58,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:58,383 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:58,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:58,384 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:58,390 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:58,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:50:58,390 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:58,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:50:58,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:50:58,392 INFO L87 Difference]: Start difference. First operand 23 states and 26 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:58,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,482 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 16:50:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:50:58,483 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:58,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:58,483 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:58,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-02-20 16:50:58,484 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:58,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2022-02-20 16:50:58,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2022-02-20 16:50:58,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:58,520 INFO L225 Difference]: With dead ends: 31 [2022-02-20 16:50:58,520 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:50:58,521 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:58,522 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:58,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:58,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:50:58,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 21. [2022-02-20 16:50:58,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:58,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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:58,525 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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:58,526 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,527 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:50:58,527 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:50:58,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 29 states. [2022-02-20 16:50:58,528 INFO L87 Difference]: Start difference. First operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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 29 states. [2022-02-20 16:50:58,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,529 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-02-20 16:50:58,529 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-02-20 16:50:58,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:58,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:58,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 19 states have (on average 1.263157894736842) internal successors, (24), 20 states have internal predecessors, (24), 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:58,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 16:50:58,531 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 7 [2022-02-20 16:50:58,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:58,532 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 16:50:58,532 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:58,532 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:50:58,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:50:58,532 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:58,533 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:58,533 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:50:58,533 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:58,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:58,534 INFO L85 PathProgramCache]: Analyzing trace with hash -856511048, now seen corresponding path program 1 times [2022-02-20 16:50:58,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:58,534 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079868097] [2022-02-20 16:50:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:58,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:58,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:58,650 INFO L290 TraceCheckUtils]: 0: Hoare triple {287#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(19, 2); {287#true} is VALID [2022-02-20 16:50:58,652 INFO L290 TraceCheckUtils]: 1: Hoare triple {287#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~nondet2#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~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$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:58,652 INFO L290 TraceCheckUtils]: 2: Hoare triple {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:58,653 INFO L290 TraceCheckUtils]: 3: Hoare triple {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:58,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {289#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:58,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:58,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:58,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {291#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 16:50:58,656 INFO L290 TraceCheckUtils]: 8: Hoare triple {291#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {288#false} is VALID [2022-02-20 16:50:58,657 INFO L290 TraceCheckUtils]: 9: Hoare triple {288#false} assume !false; {288#false} is VALID [2022-02-20 16:50:58,657 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:58,657 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:58,657 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079868097] [2022-02-20 16:50:58,658 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079868097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:58,658 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:58,658 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:50:58,659 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589933117] [2022-02-20 16:50:58,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:58,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:58,659 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:58,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:58,667 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:58,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:50:58,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:58,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:50:58,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:50:58,669 INFO L87 Difference]: Start difference. First operand 21 states and 24 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:58,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,909 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-02-20 16:50:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:50:58,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:58,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:58,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:58,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 16:50:58,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 53 transitions. [2022-02-20 16:50:58,912 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 53 transitions. [2022-02-20 16:50:58,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:58,963 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:50:58,963 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 16:50:58,963 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:50:58,964 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:58,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 67 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:50:58,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 16:50:58,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 28. [2022-02-20 16:50:58,967 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:58,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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:58,968 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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:58,968 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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:58,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,971 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 16:50:58,971 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 16:50:58,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,972 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 45 states. [2022-02-20 16:50:58,972 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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 45 states. [2022-02-20 16:50:58,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:58,973 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2022-02-20 16:50:58,973 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 51 transitions. [2022-02-20 16:50:58,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:58,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:58,974 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:58,974 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:58,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 27 states have internal predecessors, (32), 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:58,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-02-20 16:50:58,975 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 10 [2022-02-20 16:50:58,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:58,975 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-02-20 16:50:58,976 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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:58,976 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-02-20 16:50:58,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:50:58,976 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:58,976 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:58,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:50:58,977 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:58,977 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:58,977 INFO L85 PathProgramCache]: Analyzing trace with hash 1594081566, now seen corresponding path program 1 times [2022-02-20 16:50:58,978 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:58,978 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030496689] [2022-02-20 16:50:58,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:58,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:59,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:59,253 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#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(19, 2); {471#true} is VALID [2022-02-20 16:50:59,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~nondet2#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~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$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,257 INFO L290 TraceCheckUtils]: 3: Hoare triple {473#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)) ~unnamed1~0~BLACK) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~list~0#1.offset| 8) |ULTIMATE.start_main_~end~0#1.offset|)))} 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_~end~0#1.base, main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~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$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {474#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} is VALID [2022-02-20 16:50:59,259 INFO L290 TraceCheckUtils]: 4: Hoare triple {474#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,259 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,260 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:50:59,260 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,261 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,261 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:50:59,262 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 16:50:59,262 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {472#false} is VALID [2022-02-20 16:50:59,262 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-02-20 16:50:59,263 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:59,263 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:59,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030496689] [2022-02-20 16:50:59,263 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030496689] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:50:59,263 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [774727381] [2022-02-20 16:50:59,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:59,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:50:59,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:59,265 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 16:50:59,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 16:50:59,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:59,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 16:50:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:59,417 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:50:59,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 16:50:59,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 16:50:59,705 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:59,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 29 [2022-02-20 16:50:59,734 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:59,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:59,736 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:50:59,737 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 16:50:59,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 18 [2022-02-20 16:50:59,785 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2022-02-20 16:50:59,801 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-02-20 16:50:59,827 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 16:50:59,828 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 16:51:00,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:00,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:51:00,055 INFO L356 Elim1Store]: treesize reduction 137, result has 7.4 percent of original size [2022-02-20 16:51:00,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 38 [2022-02-20 16:51:00,095 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-02-20 16:51:00,096 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 16:51:00,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:51:00,199 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#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(19, 2); {471#true} is VALID [2022-02-20 16:51:00,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~nondet2#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~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$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,202 INFO L290 TraceCheckUtils]: 3: Hoare triple {484#(and (<= |ULTIMATE.start_main_~end~0#1.offset| |ULTIMATE.start_main_~list~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} 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_~end~0#1.base, main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~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$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {491#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,204 INFO L290 TraceCheckUtils]: 4: Hoare triple {491#(and (= (select |#valid| |ULTIMATE.start_main_~list~0#1.base|) 1) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= (select |#valid| |ULTIMATE.start_main_~end~0#1.base|) 1) (not (= |ULTIMATE.start_main_~end~0#1.base| |ULTIMATE.start_main_~list~0#1.base|)) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {495#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,205 INFO L290 TraceCheckUtils]: 5: Hoare triple {495#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {495#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,205 INFO L290 TraceCheckUtils]: 6: Hoare triple {495#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {495#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} is VALID [2022-02-20 16:51:00,205 INFO L290 TraceCheckUtils]: 7: Hoare triple {495#(and (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (= |ULTIMATE.start_main_~list~0#1.offset| 0))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 16:51:00,206 INFO L290 TraceCheckUtils]: 8: Hoare triple {505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 16:51:00,206 INFO L290 TraceCheckUtils]: 9: Hoare triple {505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} goto; {505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} is VALID [2022-02-20 16:51:00,207 INFO L290 TraceCheckUtils]: 10: Hoare triple {505#(and (= |ULTIMATE.start_main_~end~0#1.offset| 0) (= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|))))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 16:51:00,207 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {472#false} is VALID [2022-02-20 16:51:00,207 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-02-20 16:51:00,208 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:51:00,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:51:00,302 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:00,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-02-20 16:51:00,314 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 51 [2022-02-20 16:51:00,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-02-20 16:51:00,753 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:51:00,753 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 101 [2022-02-20 16:51:00,768 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 178 [2022-02-20 16:51:00,782 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2022-02-20 16:51:16,136 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_297 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_302 (Array Int Int)) (v_arrayElimCell_12 Int)) (let ((.cse3 (= |c_ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14)) (.cse4 (= v_arrayElimCell_15 v_arrayElimCell_12))) (or (let ((.cse0 (not .cse3))) (and (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297))) (.cse2 (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8))) (or (and .cse0 (= (select (select (store (store .cse1 v_arrayElimCell_14 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2) ~unnamed1~0~BLACK)) (and (= ~unnamed1~0~BLACK (select (select (store (store (store .cse1 v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |c_ULTIMATE.start_main_~list~0#1.base|) .cse2)) .cse3))) (or .cse0 (not .cse4)))) (not (= (select (store |c_#valid| v_arrayElimCell_14 1) v_arrayElimCell_12) 0)) (not (= (select |c_#valid| v_arrayElimCell_14) 0)) (and (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimCell_13 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~end~0#1.base|) |c_ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_303) v_arrayElimCell_13 v_ArrVal_308) |c_ULTIMATE.start_main_~list~0#1.base|) (+ |c_ULTIMATE.start_main_~list~0#1.offset| 8)))) .cse3 .cse4)))) is different from false [2022-02-20 16:51:28,326 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:51:28,328 INFO L356 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2022-02-20 16:51:28,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 109 treesize of output 1 [2022-02-20 16:51:28,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {472#false} assume !false; {472#false} is VALID [2022-02-20 16:51:28,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} assume !(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {472#false} is VALID [2022-02-20 16:51:28,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {477#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 16:51:28,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:28,332 INFO L290 TraceCheckUtils]: 8: Hoare triple {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:28,332 INFO L290 TraceCheckUtils]: 7: Hoare triple {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {476#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:28,333 INFO L290 TraceCheckUtils]: 6: Hoare triple {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:28,333 INFO L290 TraceCheckUtils]: 5: Hoare triple {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is VALID [2022-02-20 16:51:28,547 WARN L290 TraceCheckUtils]: 4: Hoare triple {545#(forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_arrayElimCell_12 Int)) (or (and (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimCell_13 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_303) v_arrayElimCell_13 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_12)) (and (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_12)) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (not (= (select |#valid| v_arrayElimCell_12) 0))))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call write~int(~unnamed1~0~RED, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4);call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~end~0#1.base, main_~end~0#1.offset, 4);havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, main_#t~mem8#1.base, 4 + main_#t~mem8#1.offset, 4);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset;call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;call write~$Pointer$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {475#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))} is UNKNOWN [2022-02-20 16:51:28,557 WARN L290 TraceCheckUtils]: 3: Hoare triple {549#(forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_297 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_302 (Array Int Int)) (v_arrayElimCell_12 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_14 1) v_arrayElimCell_12) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))) (or (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_15 v_arrayElimCell_12)))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimCell_13 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_303) v_arrayElimCell_13 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= v_arrayElimCell_15 v_arrayElimCell_12)) (not (= (select |#valid| v_arrayElimCell_14) 0))))} 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_~end~0#1.base, main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4);call write~$Pointer$(main_~end~0#1.base, main_~end~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_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~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$(0, 0, main_~end~0#1.base, main_~end~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {545#(forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_arrayElimCell_12 Int)) (or (and (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimCell_13 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_303) v_arrayElimCell_13 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_12)) (and (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_12)) (= ~unnamed1~0~BLACK (select (select (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (not (= (select |#valid| v_arrayElimCell_12) 0))))} is UNKNOWN [2022-02-20 16:51:28,561 WARN L290 TraceCheckUtils]: 2: Hoare triple {549#(forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_297 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_302 (Array Int Int)) (v_arrayElimCell_12 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_14 1) v_arrayElimCell_12) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))) (or (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_15 v_arrayElimCell_12)))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimCell_13 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_303) v_arrayElimCell_13 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= v_arrayElimCell_15 v_arrayElimCell_12)) (not (= (select |#valid| v_arrayElimCell_14) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {549#(forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_297 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_302 (Array Int Int)) (v_arrayElimCell_12 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_14 1) v_arrayElimCell_12) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))) (or (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_15 v_arrayElimCell_12)))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimCell_13 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_303) v_arrayElimCell_13 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= v_arrayElimCell_15 v_arrayElimCell_12)) (not (= (select |#valid| v_arrayElimCell_14) 0))))} is UNKNOWN [2022-02-20 16:51:28,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~nondet2#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~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$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {549#(forall ((v_ArrVal_305 (Array Int Int)) (v_ArrVal_308 (Array Int Int)) (v_ArrVal_297 Int) (v_arrayElimCell_14 Int) (v_arrayElimCell_15 Int) (v_ArrVal_302 (Array Int Int)) (v_arrayElimCell_12 Int)) (or (not (= (select (store |#valid| v_arrayElimCell_14 1) v_arrayElimCell_12) 0)) (and (or (and (= ~unnamed1~0~BLACK (select (select (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))) (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (= ~unnamed1~0~BLACK (select (select (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8))))) (or (not (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14)) (not (= v_arrayElimCell_15 v_arrayElimCell_12)))) (and (= |ULTIMATE.start_main_~end~0#1.base| v_arrayElimCell_14) (forall ((v_ArrVal_303 (Array Int Int)) (v_arrayElimCell_13 Int)) (= ~unnamed1~0~BLACK (select (select (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~end~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) |ULTIMATE.start_main_~end~0#1.offset| v_ArrVal_297)) v_arrayElimCell_14 v_ArrVal_302) v_arrayElimCell_15 v_ArrVal_305) v_arrayElimCell_12 v_ArrVal_303) v_arrayElimCell_13 v_ArrVal_308) |ULTIMATE.start_main_~list~0#1.base|) (+ |ULTIMATE.start_main_~list~0#1.offset| 8)))) (= v_arrayElimCell_15 v_arrayElimCell_12)) (not (= (select |#valid| v_arrayElimCell_14) 0))))} is VALID [2022-02-20 16:51:28,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#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(19, 2); {471#true} is VALID [2022-02-20 16:51:28,564 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-02-20 16:51:28,564 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [774727381] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:51:28,564 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:51:28,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 16:51:28,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932643770] [2022-02-20 16:51:28,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:51:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 13 [2022-02-20 16:51:28,565 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:28,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:51:29,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 24 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:29,243 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 16:51:29,246 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:29,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 16:51:29,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=100, Unknown=1, NotChecked=20, Total=156 [2022-02-20 16:51:29,247 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:51:29,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:29,698 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-20 16:51:29,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:51:29,698 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 13 [2022-02-20 16:51:29,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:51:29,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 16:51:29,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:51:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 41 transitions. [2022-02-20 16:51:29,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 41 transitions. [2022-02-20 16:51:29,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:29,736 INFO L225 Difference]: With dead ends: 39 [2022-02-20 16:51:29,736 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 16:51:29,736 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=171, Unknown=2, NotChecked=28, Total=272 [2022-02-20 16:51:29,737 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 65 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:29,737 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 80 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 75 Invalid, 0 Unknown, 57 Unchecked, 0.2s Time] [2022-02-20 16:51:29,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 16:51:29,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 19. [2022-02-20 16:51:29,739 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:29,739 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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:51:29,739 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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:51:29,739 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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:51:29,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:29,741 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 16:51:29,741 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 16:51:29,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:29,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:29,741 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 37 states. [2022-02-20 16:51:29,741 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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 37 states. [2022-02-20 16:51:29,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:29,743 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 16:51:29,743 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 16:51:29,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:29,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:29,743 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:29,743 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:29,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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:51:29,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2022-02-20 16:51:29,744 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 13 [2022-02-20 16:51:29,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:29,744 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2022-02-20 16:51:29,745 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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:51:29,745 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2022-02-20 16:51:29,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:51:29,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:29,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:29,764 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:51:29,959 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:51:29,959 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:51:29,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:29,959 INFO L85 PathProgramCache]: Analyzing trace with hash -839217458, now seen corresponding path program 1 times [2022-02-20 16:51:29,959 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:29,960 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068879760] [2022-02-20 16:51:29,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:29,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:29,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:51:30,027 INFO L290 TraceCheckUtils]: 0: Hoare triple {706#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(19, 2); {706#true} is VALID [2022-02-20 16:51:30,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {706#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~nondet2#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~list~0#1.base, main_~list~0#1.offset, main_~end~0#1.base, main_~end~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~list~0#1.base, main_~list~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$(0, 0, main_~list~0#1.base, main_~list~0#1.offset, 4);call write~$Pointer$(0, 0, main_~list~0#1.base, 4 + main_~list~0#1.offset, 4);call write~int(~unnamed1~0~BLACK, main_~list~0#1.base, 8 + main_~list~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {706#true} is VALID [2022-02-20 16:51:30,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {706#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {706#true} is VALID [2022-02-20 16:51:30,028 INFO L290 TraceCheckUtils]: 3: Hoare triple {706#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {706#true} is VALID [2022-02-20 16:51:30,028 INFO L290 TraceCheckUtils]: 4: Hoare triple {706#true} main_~end~0#1.base, main_~end~0#1.offset := 0, 0;main_~end~0#1.base, main_~end~0#1.offset := main_~list~0#1.base, main_~list~0#1.offset; {706#true} is VALID [2022-02-20 16:51:30,028 INFO L290 TraceCheckUtils]: 5: Hoare triple {706#true} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset); {706#true} is VALID [2022-02-20 16:51:30,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {706#true} goto; {706#true} is VALID [2022-02-20 16:51:30,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {706#true} call main_#t~mem10#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {708#(= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem10#1|)} is VALID [2022-02-20 16:51:30,029 INFO L290 TraceCheckUtils]: 8: Hoare triple {708#(= (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)) |ULTIMATE.start_main_#t~mem10#1|)} assume !!(~unnamed1~0~BLACK == main_#t~mem10#1);havoc main_#t~mem10#1; {709#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:30,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} goto; {709#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} is VALID [2022-02-20 16:51:30,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#(= ~unnamed1~0~BLACK (select (select |#memory_int| |ULTIMATE.start_main_~end~0#1.base|) (+ 8 |ULTIMATE.start_main_~end~0#1.offset|)))} assume !!(0 != main_~end~0#1.base || 0 != main_~end~0#1.offset);call main_#t~mem11#1 := read~int(main_~end~0#1.base, 8 + main_~end~0#1.offset, 4); {710#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem11#1|)} is VALID [2022-02-20 16:51:30,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {710#(= ~unnamed1~0~BLACK |ULTIMATE.start_main_#t~mem11#1|)} assume ~unnamed1~0~RED == main_#t~mem11#1;havoc main_#t~mem11#1;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4);main_~end~0#1.base, main_~end~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {707#false} is VALID [2022-02-20 16:51:30,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {707#false} call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~end~0#1.base, main_~end~0#1.offset, 4); {707#false} is VALID [2022-02-20 16:51:30,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {707#false} assume main_#t~mem14#1.base == 0 && main_#t~mem14#1.offset == 0;havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {707#false} is VALID [2022-02-20 16:51:30,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {707#false} assume !false; {707#false} is VALID [2022-02-20 16:51:30,031 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:51:30,031 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:51:30,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068879760] [2022-02-20 16:51:30,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068879760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:51:30,032 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:51:30,032 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:51:30,032 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404731220] [2022-02-20 16:51:30,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:51:30,032 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:51:30,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:51:30,033 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:51:30,045 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:30,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:51:30,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:51:30,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:51:30,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:51:30,047 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:51:30,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:30,194 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2022-02-20 16:51:30,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:51:30,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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 15 [2022-02-20 16:51:30,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:51:30,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:51:30,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:51:30,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:51:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:51:30,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-02-20 16:51:30,248 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:51:30,249 INFO L225 Difference]: With dead ends: 35 [2022-02-20 16:51:30,249 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 16:51:30,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:51:30,254 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:51:30,254 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 44 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:51:30,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 16:51:30,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 21. [2022-02-20 16:51:30,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:51:30,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:51:30,257 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:51:30,257 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:51:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:30,258 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 16:51:30,258 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 16:51:30,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:30,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:30,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 27 states. [2022-02-20 16:51:30,260 INFO L87 Difference]: Start difference. First operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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 27 states. [2022-02-20 16:51:30,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:51:30,262 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-02-20 16:51:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-02-20 16:51:30,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:51:30,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:51:30,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:51:30,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:51:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.2) internal successors, (24), 20 states have internal predecessors, (24), 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:51:30,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 24 transitions. [2022-02-20 16:51:30,269 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 24 transitions. Word has length 15 [2022-02-20 16:51:30,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:51:30,269 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 24 transitions. [2022-02-20 16:51:30,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 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:51:30,270 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 24 transitions. [2022-02-20 16:51:30,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 16:51:30,270 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:51:30,270 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:51:30,270 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:51:30,270 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:51:30,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:51:30,271 INFO L85 PathProgramCache]: Analyzing trace with hash -839157876, now seen corresponding path program 1 times [2022-02-20 16:51:30,271 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:51:30,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096342862] [2022-02-20 16:51:30,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:51:30,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:51:30,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:51:30,303 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:51:30,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:51:30,330 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:51:30,339 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:51:30,340 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 3 remaining) [2022-02-20 16:51:30,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 3 remaining) [2022-02-20 16:51:30,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 3 remaining) [2022-02-20 16:51:30,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:51:30,344 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2022-02-20 16:51:30,346 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:51:30,386 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 16:51:30,386 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 16:51:30,386 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2022-02-20 16:51:30,386 WARN L170 areAnnotationChecker]: L1021-2 has no Hoare annotation [2022-02-20 16:51:30,386 WARN L170 areAnnotationChecker]: L1013-3 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1013-1 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1040-4 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1040-4 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1040-4 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1021 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1041-4 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1041-4 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2022-02-20 16:51:30,387 WARN L170 areAnnotationChecker]: L1040-1 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1040-3 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1040-3 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1041 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1041 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1043-1 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1043-1 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1043-1 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1041-1 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1041-1 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1041-3 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1041-3 has no Hoare annotation [2022-02-20 16:51:30,388 WARN L170 areAnnotationChecker]: L1058-2 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1058-2 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1058-2 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1045 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1056-1 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1058 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1058 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1051-4 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1051-4 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1073 has no Hoare annotation [2022-02-20 16:51:30,389 WARN L170 areAnnotationChecker]: L1051 has no Hoare annotation [2022-02-20 16:51:30,390 WARN L170 areAnnotationChecker]: L1051 has no Hoare annotation [2022-02-20 16:51:30,390 WARN L170 areAnnotationChecker]: L1051-5 has no Hoare annotation [2022-02-20 16:51:30,390 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 16:51:30,390 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2022-02-20 16:51:30,390 WARN L170 areAnnotationChecker]: L1051-1 has no Hoare annotation [2022-02-20 16:51:30,390 WARN L170 areAnnotationChecker]: L1051-3 has no Hoare annotation [2022-02-20 16:51:30,390 WARN L170 areAnnotationChecker]: L1051-3 has no Hoare annotation [2022-02-20 16:51:30,390 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:51:30,391 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 04:51:30 BoogieIcfgContainer [2022-02-20 16:51:30,391 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 16:51:30,391 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 16:51:30,391 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 16:51:30,392 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 16:51:30,392 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:57" (3/4) ... [2022-02-20 16:51:30,394 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 16:51:30,416 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 16:51:30,416 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 16:51:30,417 INFO L158 Benchmark]: Toolchain (without parser) took 33427.81ms. Allocated memory was 109.1MB in the beginning and 377.5MB in the end (delta: 268.4MB). Free memory was 76.7MB in the beginning and 238.9MB in the end (delta: -162.2MB). Peak memory consumption was 105.9MB. Max. memory is 16.1GB. [2022-02-20 16:51:30,417 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 109.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:51:30,417 INFO L158 Benchmark]: CACSL2BoogieTranslator took 384.23ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 76.4MB in the beginning and 104.6MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 16:51:30,418 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.30ms. Allocated memory is still 138.4MB. Free memory was 104.6MB in the beginning and 101.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:30,418 INFO L158 Benchmark]: Boogie Preprocessor took 26.04ms. Allocated memory is still 138.4MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:30,418 INFO L158 Benchmark]: RCFGBuilder took 425.30ms. Allocated memory is still 138.4MB. Free memory was 99.7MB in the beginning and 76.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:30,418 INFO L158 Benchmark]: TraceAbstraction took 32509.21ms. Allocated memory was 138.4MB in the beginning and 377.5MB in the end (delta: 239.1MB). Free memory was 76.0MB in the beginning and 241.0MB in the end (delta: -165.0MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. [2022-02-20 16:51:30,418 INFO L158 Benchmark]: Witness Printer took 24.75ms. Allocated memory is still 377.5MB. Free memory was 241.0MB in the beginning and 238.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:51:30,419 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.15ms. Allocated memory is still 109.1MB. Free memory is still 61.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 384.23ms. Allocated memory was 109.1MB in the beginning and 138.4MB in the end (delta: 29.4MB). Free memory was 76.4MB in the beginning and 104.6MB in the end (delta: -28.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.30ms. Allocated memory is still 138.4MB. Free memory was 104.6MB in the beginning and 101.8MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.04ms. Allocated memory is still 138.4MB. Free memory was 101.8MB in the beginning and 99.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 425.30ms. Allocated memory is still 138.4MB. Free memory was 99.7MB in the beginning and 76.6MB in the end (delta: 23.1MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 32509.21ms. Allocated memory was 138.4MB in the beginning and 377.5MB in the end (delta: 239.1MB). Free memory was 76.0MB in the beginning and 241.0MB in the end (delta: -165.0MB). Peak memory consumption was 77.2MB. Max. memory is 16.1GB. * Witness Printer took 24.75ms. Allocated memory is still 377.5MB. Free memory was 241.0MB in the beginning and 238.9MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. 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: 1051]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1005] SLL* list = malloc(sizeof(SLL)); [L1006] list->next = ((void*)0) [L1007] list->prev = ((void*)0) [L1008] list->colour = BLACK [L1010] SLL* end = list; VAL [end={-1:0}, list={-1:0}] [L1013] COND FALSE !(__VERIFIER_nondet_int()) [L1036] end = ((void*)0) [L1037] end = list VAL [end={-1:0}, list={-1:0}] [L1040] COND FALSE !(!(((void*)0) != end)) VAL [end={-1:0}, list={-1:0}] [L1041] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1041] COND FALSE !(!(BLACK == end->colour)) [L1043] COND TRUE ((void*)0) != end [L1045] EXPR end->colour VAL [end={-1:0}, end->colour=1, list={-1:0}] [L1045] COND FALSE !(RED == end->colour) [L1051] EXPR end->next VAL [end={-1:0}, end->next={0:0}, list={-1:0}] [L1051] COND TRUE !(end->next) [L1051] reach_error() VAL [end={-1:0}, list={-1:0}] - UnprovableResult [Line: 1040]: 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: 1041]: 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, 29 locations, 3 error locations. Started 1 CEGAR loops. OverallTime: 32.4s, OverallIterations: 6, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 137 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 137 mSDsluCounter, 252 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 57 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 51 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 164 IncrementalHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 51 mSolverCounterUnsat, 110 mSDtfsCounter, 164 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, InterpolantAutomatonStates: 25, 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, 5 MinimizatonAttempts, 49 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 29.6s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 70 ConstructedInterpolants, 3 QuantifiedInterpolants, 767 SizeOfPredicates, 9 NumberOfNonLiveVariables, 280 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 0/6 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:51:30,450 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