./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/forester-heap/dll-circular-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-circular-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 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:50:49,187 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:50:49,188 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:50:49,210 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:50:49,213 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:50:49,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:50:49,218 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:50:49,220 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:50:49,222 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:50:49,226 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:50:49,227 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:50:49,228 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:50:49,228 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:50:49,230 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:50:49,231 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:50:49,233 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:50:49,233 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:50:49,234 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:50:49,237 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:50:49,240 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:50:49,241 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:50:49,242 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:50:49,243 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:50:49,244 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:50:49,246 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:50:49,246 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:50:49,246 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:50:49,247 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:50:49,247 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:50:49,248 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:50:49,248 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:50:49,249 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:50:49,250 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:50:49,251 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:50:49,251 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:50:49,252 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:50:49,253 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:50:49,253 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:50:49,253 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:50:49,253 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:50:49,254 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:50:49,255 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:50:49,283 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:50:49,283 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:50:49,284 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:50:49,284 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:50:49,285 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:50:49,285 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:50:49,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:50:49,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:50:49,285 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:50:49,286 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:50:49,286 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:50:49,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:50:49,287 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:50:49,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:50:49,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:50:49,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:50:49,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:50:49,287 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:50:49,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:50:49,288 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:50:49,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:50:49,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:50:49,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:50:49,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:50:49,288 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:49,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:50:49,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:50:49,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:50:49,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:50:49,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:50:49,289 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:50:49,289 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:50:49,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:50:49,290 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 -> 5b2cf85bdf3ceca18f859bba09ed8bf6de8160130db2f8571365ac2bc4f0e30c [2022-02-20 16:50:49,497 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:50:49,519 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:50:49,521 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:50:49,522 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:50:49,522 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:50:49,523 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-02-20 16:50:49,582 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68b58066/13a4fe974b0b45ba83fe386af9aa0390/FLAG6f6c77555 [2022-02-20 16:50:49,941 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:50:49,944 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i [2022-02-20 16:50:49,959 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68b58066/13a4fe974b0b45ba83fe386af9aa0390/FLAG6f6c77555 [2022-02-20 16:50:50,303 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f68b58066/13a4fe974b0b45ba83fe386af9aa0390 [2022-02-20 16:50:50,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:50:50,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:50:50,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:50,309 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:50:50,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:50:50,313 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,314 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@385bb5ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50, skipping insertion in model container [2022-02-20 16:50:50,315 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,321 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:50:50,349 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:50:50,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-02-20 16:50:50,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-02-20 16:50:50,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-02-20 16:50:50,531 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:50,536 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:50:50,581 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22391,22404] [2022-02-20 16:50:50,582 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22497,22510] [2022-02-20 16:50:50,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-circular-2.i[22622,22635] [2022-02-20 16:50:50,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:50:50,616 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:50:50,617 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50 WrapperNode [2022-02-20 16:50:50,617 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:50:50,618 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:50,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:50:50,618 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:50:50,623 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,649 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,668 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-02-20 16:50:50,668 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:50:50,669 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:50:50,669 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:50:50,669 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:50:50,675 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,679 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,679 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,685 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,688 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,691 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:50:50,692 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:50:50,692 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:50:50,692 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:50:50,693 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (1/1) ... [2022-02-20 16:50:50,706 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:50:50,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:50,722 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 16:50:50,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 16:50:50,748 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:50:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:50:50,749 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:50:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:50:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:50:50,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:50:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:50:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:50:50,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:50:50,751 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:50:50,859 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:50:50,860 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:50:51,147 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:50:51,153 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:50:51,153 INFO L299 CfgBuilder]: Removed 9 assume(true) statements. [2022-02-20 16:50:51,154 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:51 BoogieIcfgContainer [2022-02-20 16:50:51,155 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:50:51,156 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:50:51,156 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:50:51,159 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:50:51,160 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:50:50" (1/3) ... [2022-02-20 16:50:51,160 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e44a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:51, skipping insertion in model container [2022-02-20 16:50:51,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:50:50" (2/3) ... [2022-02-20 16:50:51,161 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72e44a38 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:50:51, skipping insertion in model container [2022-02-20 16:50:51,161 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:50:51" (3/3) ... [2022-02-20 16:50:51,162 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-circular-2.i [2022-02-20 16:50:51,166 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:50:51,166 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 3 error locations. [2022-02-20 16:50:51,215 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:50:51,232 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:51,232 INFO L340 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-02-20 16:50:51,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 16:50:51,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:51,252 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 16:50:51,252 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:51,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:51,256 INFO L85 PathProgramCache]: Analyzing trace with hash 890892102, now seen corresponding path program 1 times [2022-02-20 16:50:51,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:51,263 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327821330] [2022-02-20 16:50:51,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:51,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:51,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:51,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {36#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {36#true} is VALID [2022-02-20 16:50:51,435 INFO L290 TraceCheckUtils]: 1: Hoare triple {36#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {36#true} is VALID [2022-02-20 16:50:51,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#true} assume !true; {37#false} is VALID [2022-02-20 16:50:51,437 INFO L290 TraceCheckUtils]: 3: Hoare triple {37#false} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {37#false} is VALID [2022-02-20 16:50:51,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {37#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {37#false} is VALID [2022-02-20 16:50:51,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#false} assume !false; {37#false} is VALID [2022-02-20 16:50:51,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:51,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:51,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327821330] [2022-02-20 16:50:51,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327821330] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:51,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:51,441 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:50:51,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32476130] [2022-02-20 16:50:51,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:51,446 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:51,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:51,450 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:51,459 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:51,460 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:50:51,460 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:51,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:50:51,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:50:51,480 INFO L87 Difference]: Start difference. First operand has 33 states, 29 states have (on average 1.7586206896551724) internal successors, (51), 32 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,535 INFO L93 Difference]: Finished difference Result 64 states and 100 transitions. [2022-02-20 16:50:51,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:50:51,536 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:51,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:51,537 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:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-02-20 16:50:51,545 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:51,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-02-20 16:50:51,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-02-20 16:50:51,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:51,666 INFO L225 Difference]: With dead ends: 64 [2022-02-20 16:50:51,666 INFO L226 Difference]: Without dead ends: 26 [2022-02-20 16:50:51,668 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:51,671 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:51,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:51,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-02-20 16:50:51,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2022-02-20 16:50:51,692 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:51,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 26 states. Second operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,693 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,694 INFO L87 Difference]: Start difference. First operand 26 states. Second operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,696 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:50:51,696 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:50:51,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:51,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:51,698 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:50:51,698 INFO L87 Difference]: Start difference. First operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 26 states. [2022-02-20 16:50:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:51,699 INFO L93 Difference]: Finished difference Result 26 states and 31 transitions. [2022-02-20 16:50:51,699 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:50:51,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:51,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:51,700 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:51,700 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:51,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 23 states have (on average 1.3478260869565217) internal successors, (31), 25 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-02-20 16:50:51,704 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 6 [2022-02-20 16:50:51,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:51,704 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-02-20 16:50:51,704 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:51,704 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-02-20 16:50:51,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:50:51,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:51,705 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:51,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:50:51,707 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:51,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:51,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1806883023, now seen corresponding path program 1 times [2022-02-20 16:50:51,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:51,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1606841656] [2022-02-20 16:50:51,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:51,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:51,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:51,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {198#true} is VALID [2022-02-20 16:50:51,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 16:50:51,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 16:50:51,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 16:50:51,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {200#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {201#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 16:50:51,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {201#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {199#false} is VALID [2022-02-20 16:50:51,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {199#false} assume !false; {199#false} is VALID [2022-02-20 16:50:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:51,859 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:51,859 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1606841656] [2022-02-20 16:50:51,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1606841656] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:51,860 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:51,860 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:50:51,860 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377825954] [2022-02-20 16:50:51,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:50:51,861 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:51,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:51,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:51,869 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:50:51,870 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:51,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:50:51,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:50:51,873 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,008 INFO L93 Difference]: Finished difference Result 42 states and 49 transitions. [2022-02-20 16:50:52,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:50:52,008 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:52,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:52,009 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:52,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:50:52,010 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:52,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:50:52,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-02-20 16:50:52,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:52,050 INFO L225 Difference]: With dead ends: 42 [2022-02-20 16:50:52,050 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:50:52,051 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:52,052 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 24 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:52,053 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 47 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:50:52,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:50:52,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-02-20 16:50:52,060 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:52,063 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,063 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,064 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,067 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:50:52,067 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:50:52,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,068 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:50:52,069 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 16:50:52,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,075 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2022-02-20 16:50:52,075 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 16:50:52,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,076 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:52,076 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:52,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 27 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-20 16:50:52,078 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 7 [2022-02-20 16:50:52,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:52,078 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-20 16:50:52,079 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:52,080 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:50:52,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 16:50:52,081 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:52,081 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:52,081 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:50:52,081 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:52,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:52,082 INFO L85 PathProgramCache]: Analyzing trace with hash 706691337, now seen corresponding path program 1 times [2022-02-20 16:50:52,082 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:52,082 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599901106] [2022-02-20 16:50:52,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:52,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:52,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:52,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {365#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {365#true} is VALID [2022-02-20 16:50:52,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {365#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:52,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:52,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:52,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {367#(= |ULTIMATE.start_main_~state~0#1| 1)} is VALID [2022-02-20 16:50:52,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {367#(= |ULTIMATE.start_main_~state~0#1| 1)} assume !(1 == main_~state~0#1); {366#false} is VALID [2022-02-20 16:50:52,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#false} assume !(2 == main_~state~0#1); {366#false} is VALID [2022-02-20 16:50:52,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#false} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {366#false} is VALID [2022-02-20 16:50:52,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {366#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {366#false} is VALID [2022-02-20 16:50:52,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {366#false} assume !false; {366#false} is VALID [2022-02-20 16:50:52,150 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:52,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:52,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599901106] [2022-02-20 16:50:52,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599901106] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:52,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:52,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:50:52,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469279588] [2022-02-20 16:50:52,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:52,152 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:50:52,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:52,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,161 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:52,161 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:50:52,161 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:52,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:50:52,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:52,162 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,235 INFO L93 Difference]: Finished difference Result 71 states and 86 transitions. [2022-02-20 16:50:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:50:52,235 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 16:50:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:52,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 16:50:52,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 81 transitions. [2022-02-20 16:50:52,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 81 transitions. [2022-02-20 16:50:52,315 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:52,316 INFO L225 Difference]: With dead ends: 71 [2022-02-20 16:50:52,317 INFO L226 Difference]: Without dead ends: 49 [2022-02-20 16:50:52,320 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:52,322 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 20 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:52,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 48 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:52,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-02-20 16:50:52,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 35. [2022-02-20 16:50:52,329 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:52,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,329 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,330 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,333 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-02-20 16:50:52,333 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-02-20 16:50:52,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 16:50:52,334 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 49 states. [2022-02-20 16:50:52,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,337 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2022-02-20 16:50:52,337 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2022-02-20 16:50:52,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,338 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:52,338 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:52,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 33 states have (on average 1.303030303030303) internal successors, (43), 34 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 43 transitions. [2022-02-20 16:50:52,339 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 43 transitions. Word has length 10 [2022-02-20 16:50:52,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:52,339 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 43 transitions. [2022-02-20 16:50:52,340 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:50:52,340 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 43 transitions. [2022-02-20 16:50:52,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:50:52,340 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:52,340 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:52,340 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:50:52,341 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:52,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:52,341 INFO L85 PathProgramCache]: Analyzing trace with hash -84804677, now seen corresponding path program 1 times [2022-02-20 16:50:52,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:52,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510181949] [2022-02-20 16:50:52,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:52,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:52,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:52,366 INFO L290 TraceCheckUtils]: 0: Hoare triple {596#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {596#true} is VALID [2022-02-20 16:50:52,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {596#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {596#true} is VALID [2022-02-20 16:50:52,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {596#true} is VALID [2022-02-20 16:50:52,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {596#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {596#true} is VALID [2022-02-20 16:50:52,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {596#true} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {596#true} is VALID [2022-02-20 16:50:52,367 INFO L290 TraceCheckUtils]: 5: Hoare triple {596#true} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {596#true} is VALID [2022-02-20 16:50:52,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {596#true} goto; {596#true} is VALID [2022-02-20 16:50:52,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {596#true} call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {596#true} is VALID [2022-02-20 16:50:52,367 INFO L290 TraceCheckUtils]: 8: Hoare triple {596#true} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {596#true} is VALID [2022-02-20 16:50:52,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#true} call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4);main_#t~short14#1 := 0 == main_#t~mem10#1; {596#true} is VALID [2022-02-20 16:50:52,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {596#true} assume main_#t~short14#1; {598#|ULTIMATE.start_main_#t~short14#1|} is VALID [2022-02-20 16:50:52,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {598#|ULTIMATE.start_main_#t~short14#1|} assume !main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {597#false} is VALID [2022-02-20 16:50:52,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {597#false} assume !false; {597#false} is VALID [2022-02-20 16:50:52,369 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:52,369 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:52,369 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510181949] [2022-02-20 16:50:52,369 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510181949] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:52,369 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:52,369 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:50:52,369 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076424538] [2022-02-20 16:50:52,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:52,369 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:50:52,369 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:52,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:52,378 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:52,378 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:50:52,378 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:52,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:50:52,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:52,378 INFO L87 Difference]: Start difference. First operand 35 states and 43 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:52,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,412 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 16:50:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:50:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:50:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 16:50:52,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 32 transitions. [2022-02-20 16:50:52,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 32 transitions. [2022-02-20 16:50:52,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:52,436 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:50:52,436 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 16:50:52,436 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:52,437 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:52,437 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:52,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 16:50:52,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-02-20 16:50:52,439 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:52,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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:52,440 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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:52,440 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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:52,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,442 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-02-20 16:50:52,442 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-02-20 16:50:52,443 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,443 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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 36 states. [2022-02-20 16:50:52,443 INFO L87 Difference]: Start difference. First operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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 36 states. [2022-02-20 16:50:52,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,445 INFO L93 Difference]: Finished difference Result 36 states and 44 transitions. [2022-02-20 16:50:52,445 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-02-20 16:50:52,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:52,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 35 states have internal predecessors, (44), 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:52,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-02-20 16:50:52,448 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 13 [2022-02-20 16:50:52,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:52,448 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-02-20 16:50:52,448 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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:52,448 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-02-20 16:50:52,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:50:52,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:52,452 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:52,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:50:52,452 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:50:52,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:52,453 INFO L85 PathProgramCache]: Analyzing trace with hash -84802755, now seen corresponding path program 1 times [2022-02-20 16:50:52,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:52,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80064045] [2022-02-20 16:50:52,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:52,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:52,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:52,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {763#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {763#true} is VALID [2022-02-20 16:50:52,597 INFO L290 TraceCheckUtils]: 1: Hoare triple {763#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {765#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 16:50:52,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {765#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {765#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 16:50:52,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {765#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 16:50:52,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_~head~0#1.offset| (+ 8 |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:50:52,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:50:52,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} goto; {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:50:52,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:50:52,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:50:52,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4);main_#t~short14#1 := 0 == main_#t~mem10#1; {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 16:50:52,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {766#(and (= 8 (+ 8 |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} assume !main_#t~short14#1;call main_#t~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_#t~mem11#1.base, 8 + main_#t~mem11#1.offset, 4);main_#t~short14#1 := main_#t~mem12#1 <= main_#t~mem13#1; {767#|ULTIMATE.start_main_#t~short14#1|} is VALID [2022-02-20 16:50:52,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {767#|ULTIMATE.start_main_#t~short14#1|} assume !main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {764#false} is VALID [2022-02-20 16:50:52,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {764#false} assume !false; {764#false} is VALID [2022-02-20 16:50:52,604 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:52,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:52,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80064045] [2022-02-20 16:50:52,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [80064045] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:52,605 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:52,605 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:50:52,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745224831] [2022-02-20 16:50:52,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:52,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:50:52,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:52,606 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:52,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:52,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:50:52,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:52,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:50:52,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:50:52,617 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:52,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,797 INFO L93 Difference]: Finished difference Result 47 states and 56 transitions. [2022-02-20 16:50:52,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:50:52,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:50:52,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:52,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 16:50:52,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:52,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 16:50:52,798 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-20 16:50:52,832 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:52,833 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:50:52,833 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 16:50:52,833 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 16:50:52,834 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:52,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 73 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:52,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 16:50:52,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-02-20 16:50:52,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:52,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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:52,838 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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:52,839 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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:52,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,840 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-02-20 16:50:52,841 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 16:50:52,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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 34 states. [2022-02-20 16:50:52,841 INFO L87 Difference]: Start difference. First operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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 34 states. [2022-02-20 16:50:52,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:52,842 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2022-02-20 16:50:52,842 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 16:50:52,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:52,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:52,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:52,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:52,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 32 states have (on average 1.28125) internal successors, (41), 33 states have internal predecessors, (41), 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:52,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-02-20 16:50:52,844 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 13 [2022-02-20 16:50:52,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:52,844 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-02-20 16:50:52,844 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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:52,844 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-02-20 16:50:52,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 16:50:52,845 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:52,845 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:52,845 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:50:52,845 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:52,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:52,846 INFO L85 PathProgramCache]: Analyzing trace with hash 1783178116, now seen corresponding path program 1 times [2022-02-20 16:50:52,846 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:52,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437051695] [2022-02-20 16:50:52,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:52,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:52,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {939#true} is VALID [2022-02-20 16:50:52,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {941#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (or (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))))} is VALID [2022-02-20 16:50:52,922 INFO L290 TraceCheckUtils]: 2: Hoare triple {941#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (or (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {941#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (or (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))))} is VALID [2022-02-20 16:50:52,924 INFO L290 TraceCheckUtils]: 3: Hoare triple {941#(and (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (or (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~head~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_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:50:52,924 INFO L290 TraceCheckUtils]: 4: Hoare triple {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:50:52,925 INFO L290 TraceCheckUtils]: 5: Hoare triple {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:50:52,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:50:52,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} goto; {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:50:52,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:50:52,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 16:50:52,929 INFO L290 TraceCheckUtils]: 10: Hoare triple {942#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {943#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 16:50:52,929 INFO L290 TraceCheckUtils]: 11: Hoare triple {943#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {940#false} is VALID [2022-02-20 16:50:52,936 INFO L290 TraceCheckUtils]: 12: Hoare triple {940#false} assume !false; {940#false} is VALID [2022-02-20 16:50:52,936 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:52,936 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:52,936 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437051695] [2022-02-20 16:50:52,936 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437051695] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:50:52,937 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1643347236] [2022-02-20 16:50:52,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:52,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:50:52,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:52,938 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:52,939 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:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:53,017 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 30 conjunts are in the unsatisfiable core [2022-02-20 16:50:53,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:53,037 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:50:53,101 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:53,206 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 0 case distinctions, treesize of input 36 treesize of output 27 [2022-02-20 16:50:53,223 INFO L356 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-02-20 16:50:53,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 53 [2022-02-20 16:50:53,229 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 30 treesize of output 28 [2022-02-20 16:50:53,241 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 16:50:53,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 16:50:53,294 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:50:53,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 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 30 treesize of output 28 [2022-02-20 16:50:53,378 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 47 treesize of output 27 [2022-02-20 16:50:53,392 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:53,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {939#true} is VALID [2022-02-20 16:50:53,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {950#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 16:50:53,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {950#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {950#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 16:50:53,453 INFO L290 TraceCheckUtils]: 3: Hoare triple {950#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:53,454 INFO L290 TraceCheckUtils]: 4: Hoare triple {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:53,455 INFO L290 TraceCheckUtils]: 5: Hoare triple {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:53,455 INFO L290 TraceCheckUtils]: 6: Hoare triple {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:53,456 INFO L290 TraceCheckUtils]: 7: Hoare triple {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} goto; {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:53,456 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:53,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:53,458 INFO L290 TraceCheckUtils]: 10: Hoare triple {957#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {943#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 16:50:53,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {943#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {940#false} is VALID [2022-02-20 16:50:53,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {940#false} assume !false; {940#false} is VALID [2022-02-20 16:50:53,458 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:53,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:50:53,472 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-02-20 16:50:53,575 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:50:53,576 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 1 case distinctions, treesize of input 37 treesize of output 30 [2022-02-20 16:50:53,598 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 16:50:53,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 334 treesize of output 225 [2022-02-20 16:50:53,612 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 204 treesize of output 196 [2022-02-20 16:50:53,625 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 196 treesize of output 192 [2022-02-20 16:50:53,641 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 192 treesize of output 180 [2022-02-20 16:50:53,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {940#false} assume !false; {940#false} is VALID [2022-02-20 16:50:53,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {943#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {940#false} is VALID [2022-02-20 16:50:53,886 INFO L290 TraceCheckUtils]: 10: Hoare triple {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {943#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 16:50:53,886 INFO L290 TraceCheckUtils]: 9: Hoare triple {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:50:53,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:50:53,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} goto; {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:50:53,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:50:53,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:50:53,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:50:53,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {1013#(forall ((v_arrayElimCell_8 Int)) (or (= v_arrayElimCell_8 0) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_8 |ULTIMATE.start_main_~x~0#1.base|))) (not (= (select |#valid| v_arrayElimCell_8) 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_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {991#(forall ((v_ArrVal_322 (Array Int Int))) (not (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_322) |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0)))} is VALID [2022-02-20 16:50:53,892 INFO L290 TraceCheckUtils]: 2: Hoare triple {1013#(forall ((v_arrayElimCell_8 Int)) (or (= v_arrayElimCell_8 0) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_8 |ULTIMATE.start_main_~x~0#1.base|))) (not (= (select |#valid| v_arrayElimCell_8) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1013#(forall ((v_arrayElimCell_8 Int)) (or (= v_arrayElimCell_8 0) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_8 |ULTIMATE.start_main_~x~0#1.base|))) (not (= (select |#valid| v_arrayElimCell_8) 0))))} is VALID [2022-02-20 16:50:53,893 INFO L290 TraceCheckUtils]: 1: Hoare triple {939#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {1013#(forall ((v_arrayElimCell_8 Int)) (or (= v_arrayElimCell_8 0) (and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= v_arrayElimCell_8 |ULTIMATE.start_main_~x~0#1.base|))) (not (= (select |#valid| v_arrayElimCell_8) 0))))} is VALID [2022-02-20 16:50:53,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {939#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {939#true} is VALID [2022-02-20 16:50:53,894 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:50:53,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1643347236] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:50:53,894 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:50:53,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-20 16:50:53,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275162884] [2022-02-20 16:50:53,895 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:50:53,895 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:50:53,895 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:53,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:53,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 32 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:53,928 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:50:53,928 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:53,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:50:53,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=40, Unknown=1, NotChecked=12, Total=72 [2022-02-20 16:50:53,929 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:54,125 INFO L93 Difference]: Finished difference Result 61 states and 72 transitions. [2022-02-20 16:50:54,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:50:54,125 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:50:54,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:54,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-02-20 16:50:54,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:54,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-02-20 16:50:54,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-02-20 16:50:54,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:54,165 INFO L225 Difference]: With dead ends: 61 [2022-02-20 16:50:54,165 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 16:50:54,165 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=50, Unknown=1, NotChecked=14, Total=90 [2022-02-20 16:50:54,166 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 30 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 58 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:54,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 109 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 51 Invalid, 0 Unknown, 58 Unchecked, 0.1s Time] [2022-02-20 16:50:54,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 16:50:54,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 48. [2022-02-20 16:50:54,169 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:54,169 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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:54,169 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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:54,169 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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:54,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:54,171 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-02-20 16:50:54,171 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-02-20 16:50:54,171 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:54,171 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:54,171 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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 59 states. [2022-02-20 16:50:54,171 INFO L87 Difference]: Start difference. First operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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 59 states. [2022-02-20 16:50:54,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:54,173 INFO L93 Difference]: Finished difference Result 59 states and 70 transitions. [2022-02-20 16:50:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 70 transitions. [2022-02-20 16:50:54,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:54,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:54,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:54,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:54,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 46 states have (on average 1.2608695652173914) internal successors, (58), 47 states have internal predecessors, (58), 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:54,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2022-02-20 16:50:54,174 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 13 [2022-02-20 16:50:54,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:54,174 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2022-02-20 16:50:54,175 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 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:54,175 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2022-02-20 16:50:54,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 16:50:54,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:54,175 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:54,197 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:50:54,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-02-20 16:50:54,392 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:54,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:54,392 INFO L85 PathProgramCache]: Analyzing trace with hash -1644077251, now seen corresponding path program 1 times [2022-02-20 16:50:54,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:54,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192109338] [2022-02-20 16:50:54,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:54,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:54,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {1277#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1277#true} is VALID [2022-02-20 16:50:54,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {1277#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {1277#true} is VALID [2022-02-20 16:50:54,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {1277#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1277#true} is VALID [2022-02-20 16:50:54,434 INFO L290 TraceCheckUtils]: 3: Hoare triple {1277#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1277#true} is VALID [2022-02-20 16:50:54,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {1277#true} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {1277#true} is VALID [2022-02-20 16:50:54,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {1277#true} assume 1 == main_~state~0#1;main_~state~0#1 := 2; {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} goto; {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12);call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1; {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} assume !(1 == main_~state~0#1); {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} is VALID [2022-02-20 16:50:54,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {1279#(= 2 |ULTIMATE.start_main_~state~0#1|)} assume !(2 == main_~state~0#1); {1278#false} is VALID [2022-02-20 16:50:54,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {1278#false} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {1278#false} is VALID [2022-02-20 16:50:54,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {1278#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1278#false} is VALID [2022-02-20 16:50:54,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {1278#false} assume !false; {1278#false} is VALID [2022-02-20 16:50:54,439 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:50:54,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:54,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192109338] [2022-02-20 16:50:54,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192109338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:50:54,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:50:54,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:50:54,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128317431] [2022-02-20 16:50:54,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:50:54,440 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-02-20 16:50:54,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:50:54,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:54,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:54,452 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:50:54,452 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:50:54,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:50:54,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:54,452 INFO L87 Difference]: Start difference. First operand 48 states and 58 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:54,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:54,505 INFO L93 Difference]: Finished difference Result 96 states and 116 transitions. [2022-02-20 16:50:54,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:50:54,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-02-20 16:50:54,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:50:54,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-02-20 16:50:54,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:54,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 83 transitions. [2022-02-20 16:50:54,508 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 83 transitions. [2022-02-20 16:50:54,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:50:54,581 INFO L225 Difference]: With dead ends: 96 [2022-02-20 16:50:54,581 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 16:50:54,581 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:50:54,581 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 17 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:50:54,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 70 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:50:54,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 16:50:54,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 56. [2022-02-20 16:50:54,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:50:54,589 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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:54,589 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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:54,589 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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:54,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:54,591 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-02-20 16:50:54,591 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-02-20 16:50:54,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:54,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:54,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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 73 states. [2022-02-20 16:50:54,592 INFO L87 Difference]: Start difference. First operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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 73 states. [2022-02-20 16:50:54,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:50:54,593 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-02-20 16:50:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 86 transitions. [2022-02-20 16:50:54,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:50:54,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:50:54,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:50:54,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:50:54,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 55 states have internal predecessors, (68), 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:54,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 68 transitions. [2022-02-20 16:50:54,595 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 68 transitions. Word has length 17 [2022-02-20 16:50:54,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:50:54,595 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 68 transitions. [2022-02-20 16:50:54,595 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:54,595 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 68 transitions. [2022-02-20 16:50:54,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:50:54,596 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:50:54,596 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:50:54,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 16:50:54,596 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:50:54,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:50:54,597 INFO L85 PathProgramCache]: Analyzing trace with hash 619754034, now seen corresponding path program 1 times [2022-02-20 16:50:54,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:50:54,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560997132] [2022-02-20 16:50:54,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:54,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:50:54,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:54,740 INFO L290 TraceCheckUtils]: 0: Hoare triple {1615#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(17, 2); {1615#true} is VALID [2022-02-20 16:50:54,742 INFO L290 TraceCheckUtils]: 1: Hoare triple {1615#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet6#1, main_#t~nondet2#1, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem13#1, main_#t~short14#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem8#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem17#1, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~state~0#1;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, main_~head~0#1.offset, 4);call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4);call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~state~0#1 := 1; {1617#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0))} is VALID [2022-02-20 16:50:54,742 INFO L290 TraceCheckUtils]: 2: Hoare triple {1617#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1617#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0))} is VALID [2022-02-20 16:50:54,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {1617#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~x~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 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_~x~0#1.base, main_~x~0#1.offset, 4);havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4);havoc main_#t~mem4#1.base, main_#t~mem4#1.offset;call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4);assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:54,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:54,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:54,747 INFO L290 TraceCheckUtils]: 6: Hoare triple {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:54,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} goto; {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:54,748 INFO L290 TraceCheckUtils]: 8: Hoare triple {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:54,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 16:50:54,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {1618#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ |ULTIMATE.start_main_~head~0#1.offset| 8)) 0) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} call write~int(main_~state~0#1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, 4);main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem7#1.base, main_#t~mem7#1.offset;havoc main_#t~mem7#1.base, main_#t~mem7#1.offset; {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} is VALID [2022-02-20 16:50:54,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} is VALID [2022-02-20 16:50:54,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} goto; {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} is VALID [2022-02-20 16:50:54,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} call main_#t~mem8#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} is VALID [2022-02-20 16:50:54,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} assume !!(0 != main_#t~mem8#1);havoc main_#t~mem8#1; {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} is VALID [2022-02-20 16:50:54,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {1619#(= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 8)) 0)} call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem10#1 := read~int(main_#t~mem9#1.base, 8 + main_#t~mem9#1.offset, 4);main_#t~short14#1 := 0 == main_#t~mem10#1; {1620#|ULTIMATE.start_main_#t~short14#1|} is VALID [2022-02-20 16:50:54,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {1620#|ULTIMATE.start_main_#t~short14#1|} assume !main_#t~short14#1;call main_#t~mem12#1 := read~int(main_~x~0#1.base, 8 + main_~x~0#1.offset, 4);call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4);call main_#t~mem13#1 := read~int(main_#t~mem11#1.base, 8 + main_#t~mem11#1.offset, 4);main_#t~short14#1 := main_#t~mem12#1 <= main_#t~mem13#1; {1616#false} is VALID [2022-02-20 16:50:54,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {1616#false} assume !main_#t~short14#1;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem10#1;havoc main_#t~mem12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~mem13#1;havoc main_#t~short14#1; {1616#false} is VALID [2022-02-20 16:50:54,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {1616#false} assume !false; {1616#false} is VALID [2022-02-20 16:50:54,753 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:54,753 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:50:54,753 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560997132] [2022-02-20 16:50:54,753 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560997132] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:50:54,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794572030] [2022-02-20 16:50:54,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:50:54,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:50:54,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:50:54,755 INFO L229 MonitoredProcess]: Starting monitored process 3 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:54,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 16:50:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:54,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 73 conjunts are in the unsatisfiable core [2022-02-20 16:50:54,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:50:54,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:50:54,891 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:54,896 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:55,046 INFO L356 Elim1Store]: treesize reduction 26, result has 16.1 percent of original size [2022-02-20 16:50:55,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 253 treesize of output 190 [2022-02-20 16:50:55,076 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,077 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:50:55,083 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 39 treesize of output 30 [2022-02-20 16:50:55,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,109 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:55,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,132 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,150 INFO L356 Elim1Store]: treesize reduction 136, result has 3.5 percent of original size [2022-02-20 16:50:55,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 186 treesize of output 204 [2022-02-20 16:50:55,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,177 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:50:55,179 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 27 treesize of output 24 [2022-02-20 16:50:55,198 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:50:55,200 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 16:50:55,200 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:55,219 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 8 treesize of output 7 [2022-02-20 16:50:55,239 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 8 treesize of output 7 [2022-02-20 16:50:55,258 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 8 treesize of output 7 [2022-02-20 16:50:55,290 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 16:50:55,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 16:50:55,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 16:50:55,330 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 8 treesize of output 7