./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -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/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:27:57,034 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:27:57,036 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:27:57,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:27:57,061 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:27:57,062 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:27:57,064 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:27:57,065 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:27:57,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:27:57,067 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:27:57,068 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:27:57,069 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:27:57,069 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:27:57,070 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:27:57,071 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:27:57,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:27:57,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:27:57,073 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:27:57,075 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:27:57,077 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:27:57,078 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:27:57,088 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:27:57,089 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:27:57,090 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:27:57,091 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:27:57,094 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:27:57,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:27:57,100 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:27:57,101 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:27:57,101 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:27:57,102 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:27:57,102 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:27:57,102 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:27:57,103 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:27:57,104 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:27:57,104 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:27:57,105 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:27:57,105 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:27:57,105 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:27:57,106 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:27:57,107 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:27:57,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:27:57,108 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:27:57,127 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:27:57,127 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:27:57,128 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:27:57,128 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:27:57,129 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:27:57,129 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:27:57,129 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:27:57,130 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:27:57,130 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:27:57,130 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:27:57,130 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:27:57,130 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:27:57,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:27:57,131 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:27:57,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:27:57,131 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:27:57,131 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:27:57,132 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:27:57,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:27:57,132 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:27:57,132 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:27:57,132 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:27:57,133 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:27:57,133 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:27:57,133 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:27:57,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:27:57,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:27:57,134 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:27:57,134 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:27:57,134 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:27:57,134 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2022-07-20 06:27:57,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:27:57,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:27:57,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:27:57,427 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:27:57,428 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:27:57,429 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-07-20 06:27:57,496 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe066019/623a26d7db1340da94b34ba4403dca41/FLAG99c9c7c00 [2022-07-20 06:27:57,963 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:27:57,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2022-07-20 06:27:57,997 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe066019/623a26d7db1340da94b34ba4403dca41/FLAG99c9c7c00 [2022-07-20 06:27:58,311 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bbe066019/623a26d7db1340da94b34ba4403dca41 [2022-07-20 06:27:58,313 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:27:58,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:27:58,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:27:58,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:27:58,328 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:27:58,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2481f2b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58, skipping insertion in model container [2022-07-20 06:27:58,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:27:58,371 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:27:58,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:27:58,620 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:27:58,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:27:58,681 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:27:58,681 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58 WrapperNode [2022-07-20 06:27:58,681 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:27:58,683 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:27:58,683 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:27:58,683 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:27:58,691 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,722 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,760 INFO L137 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 128 [2022-07-20 06:27:58,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:27:58,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:27:58,762 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:27:58,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:27:58,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,795 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,808 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,811 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:27:58,826 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:27:58,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:27:58,827 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:27:58,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (1/1) ... [2022-07-20 06:27:58,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:27:58,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:27:58,869 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-07-20 06:27:58,890 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-07-20 06:27:58,913 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-07-20 06:27:58,914 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-07-20 06:27:58,914 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:27:58,914 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:27:58,914 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:27:58,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:27:58,914 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:27:58,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:27:59,030 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:27:59,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:27:59,068 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-07-20 06:27:59,348 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:27:59,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:27:59,359 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 06:27:59,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:27:59 BoogieIcfgContainer [2022-07-20 06:27:59,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:27:59,363 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:27:59,363 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:27:59,371 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:27:59,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:27:58" (1/3) ... [2022-07-20 06:27:59,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd5cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:27:59, skipping insertion in model container [2022-07-20 06:27:59,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:27:58" (2/3) ... [2022-07-20 06:27:59,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29cd5cc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:27:59, skipping insertion in model container [2022-07-20 06:27:59,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:27:59" (3/3) ... [2022-07-20 06:27:59,375 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2022-07-20 06:27:59,389 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:27:59,389 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-07-20 06:27:59,435 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:27:59,451 INFO L357 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=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@75c5efe6, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@517aa2ab [2022-07-20 06:27:59,452 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-07-20 06:27:59,456 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:27:59,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-20 06:27:59,469 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:59,469 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-20 06:27:59,470 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:27:59,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:59,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1079622, now seen corresponding path program 1 times [2022-07-20 06:27:59,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:59,482 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360406733] [2022-07-20 06:27:59,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:59,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:59,641 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:59,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:59,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360406733] [2022-07-20 06:27:59,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360406733] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:59,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:59,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:27:59,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330969784] [2022-07-20 06:27:59,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:59,653 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:27:59,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:59,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:27:59,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:27:59,693 INFO L87 Difference]: Start difference. First operand has 139 states, 74 states have (on average 1.9594594594594594) internal successors, (145), 137 states have internal predecessors, (145), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-07-20 06:27:59,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:59,824 INFO L93 Difference]: Finished difference Result 136 states and 143 transitions. [2022-07-20 06:27:59,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:27:59,826 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-07-20 06:27:59,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:59,839 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:27:59,840 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:27:59,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-20 06:27:59,846 INFO L413 NwaCegarLoop]: 117 mSDtfsCounter, 50 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:59,847 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:27:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:27:59,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-20 06:27:59,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 71 states have (on average 1.9014084507042253) internal successors, (135), 129 states have internal predecessors, (135), 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-07-20 06:27:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 135 transitions. [2022-07-20 06:27:59,883 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 135 transitions. Word has length 4 [2022-07-20 06:27:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:59,883 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 135 transitions. [2022-07-20 06:27:59,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-07-20 06:27:59,884 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 135 transitions. [2022-07-20 06:27:59,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-20 06:27:59,884 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:59,884 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-20 06:27:59,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:27:59,884 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:27:59,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:27:59,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1079623, now seen corresponding path program 1 times [2022-07-20 06:27:59,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:27:59,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658853016] [2022-07-20 06:27:59,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:27:59,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:27:59,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:27:59,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:27:59,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:27:59,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658853016] [2022-07-20 06:27:59,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658853016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:27:59,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:27:59,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:27:59,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366264898] [2022-07-20 06:27:59,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:27:59,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:27:59,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:27:59,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:27:59,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:27:59,927 INFO L87 Difference]: Start difference. First operand 130 states and 135 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-07-20 06:27:59,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:27:59,970 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-20 06:27:59,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:27:59,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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 4 [2022-07-20 06:27:59,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:27:59,981 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:27:59,981 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:27:59,981 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-20 06:27:59,982 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 128 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:27:59,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 117 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:27:59,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:27:59,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-20 06:27:59,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 71 states have (on average 1.8591549295774648) internal successors, (132), 126 states have internal predecessors, (132), 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-07-20 06:27:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-07-20 06:27:59,996 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 4 [2022-07-20 06:27:59,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:27:59,998 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-07-20 06:27:59,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 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-07-20 06:27:59,998 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-07-20 06:27:59,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:27:59,998 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:27:59,999 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:27:59,999 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:27:59,999 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:00,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:00,000 INFO L85 PathProgramCache]: Analyzing trace with hash 2065247192, now seen corresponding path program 1 times [2022-07-20 06:28:00,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:00,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503301834] [2022-07-20 06:28:00,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:00,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:00,047 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:00,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:00,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503301834] [2022-07-20 06:28:00,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503301834] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:00,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:00,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:28:00,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218179059] [2022-07-20 06:28:00,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:00,049 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:28:00,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:00,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:28:00,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:28:00,050 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-07-20 06:28:00,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:00,061 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2022-07-20 06:28:00,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:28:00,062 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-20 06:28:00,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:00,063 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:28:00,063 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:28:00,063 INFO L412 NwaCegarLoop]: 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-07-20 06:28:00,065 INFO L413 NwaCegarLoop]: 130 mSDtfsCounter, 8 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:00,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 254 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:28:00,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:28:00,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 128. [2022-07-20 06:28:00,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 72 states have (on average 1.8472222222222223) internal successors, (133), 127 states have internal predecessors, (133), 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-07-20 06:28:00,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 133 transitions. [2022-07-20 06:28:00,074 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 133 transitions. Word has length 9 [2022-07-20 06:28:00,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:00,074 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 133 transitions. [2022-07-20 06:28:00,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 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-07-20 06:28:00,074 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 133 transitions. [2022-07-20 06:28:00,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:28:00,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:00,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:00,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:28:00,075 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:00,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:00,076 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248729, now seen corresponding path program 1 times [2022-07-20 06:28:00,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:00,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919836884] [2022-07-20 06:28:00,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:00,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:00,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:00,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:00,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919836884] [2022-07-20 06:28:00,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919836884] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:00,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:00,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:28:00,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648486519] [2022-07-20 06:28:00,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:00,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:28:00,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:00,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:28:00,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:28:00,118 INFO L87 Difference]: Start difference. First operand 128 states and 133 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-07-20 06:28:00,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:00,204 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-20 06:28:00,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:28:00,205 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-20 06:28:00,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:00,209 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:28:00,209 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:28:00,211 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-20 06:28:00,215 INFO L413 NwaCegarLoop]: 112 mSDtfsCounter, 40 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:00,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 169 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:00,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:28:00,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-20 06:28:00,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 72 states have (on average 1.8333333333333333) internal successors, (132), 126 states have internal predecessors, (132), 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-07-20 06:28:00,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-07-20 06:28:00,230 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 9 [2022-07-20 06:28:00,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:00,230 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-07-20 06:28:00,231 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-07-20 06:28:00,231 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-07-20 06:28:00,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-07-20 06:28:00,231 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:00,232 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:00,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:28:00,232 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:00,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:00,233 INFO L85 PathProgramCache]: Analyzing trace with hash 2065248730, now seen corresponding path program 1 times [2022-07-20 06:28:00,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:00,233 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655142172] [2022-07-20 06:28:00,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:00,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:00,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:00,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:00,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655142172] [2022-07-20 06:28:00,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655142172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:00,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:00,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:28:00,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962622863] [2022-07-20 06:28:00,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:00,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:28:00,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:00,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:28:00,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:28:00,280 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-07-20 06:28:00,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:00,301 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2022-07-20 06:28:00,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:28:00,302 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 9 [2022-07-20 06:28:00,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:00,303 INFO L225 Difference]: With dead ends: 126 [2022-07-20 06:28:00,303 INFO L226 Difference]: Without dead ends: 126 [2022-07-20 06:28:00,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-20 06:28:00,305 INFO L413 NwaCegarLoop]: 118 mSDtfsCounter, 122 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:00,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 121 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:28:00,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-07-20 06:28:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-07-20 06:28:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 72 states have (on average 1.8194444444444444) internal successors, (131), 125 states have internal predecessors, (131), 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-07-20 06:28:00,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2022-07-20 06:28:00,312 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 9 [2022-07-20 06:28:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:00,313 INFO L495 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2022-07-20 06:28:00,313 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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-07-20 06:28:00,313 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2022-07-20 06:28:00,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:28:00,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:00,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:00,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:28:00,314 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:00,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -401798830, now seen corresponding path program 1 times [2022-07-20 06:28:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:00,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760534045] [2022-07-20 06:28:00,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:00,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:00,396 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:00,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:00,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760534045] [2022-07-20 06:28:00,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760534045] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:00,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:00,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:28:00,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [726591628] [2022-07-20 06:28:00,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:00,397 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:28:00,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:00,398 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:28:00,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:28:00,398 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:00,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:00,508 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-20 06:28:00,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:28:00,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-07-20 06:28:00,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:00,510 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:28:00,510 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:28:00,510 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:28:00,514 INFO L413 NwaCegarLoop]: 106 mSDtfsCounter, 114 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:00,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 217 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:00,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:28:00,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-20 06:28:00,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.8) internal successors, (135), 128 states have internal predecessors, (135), 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-07-20 06:28:00,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 135 transitions. [2022-07-20 06:28:00,539 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 135 transitions. Word has length 10 [2022-07-20 06:28:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:00,539 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 135 transitions. [2022-07-20 06:28:00,540 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:00,540 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-07-20 06:28:00,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:28:00,540 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:00,541 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:00,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:28:00,541 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:00,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:00,543 INFO L85 PathProgramCache]: Analyzing trace with hash -401798829, now seen corresponding path program 1 times [2022-07-20 06:28:00,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:00,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [454028670] [2022-07-20 06:28:00,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:00,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:00,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:00,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:00,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:00,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [454028670] [2022-07-20 06:28:00,696 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [454028670] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:00,696 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:00,696 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:28:00,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628238500] [2022-07-20 06:28:00,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:00,697 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:28:00,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:00,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:28:00,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:28:00,698 INFO L87 Difference]: Start difference. First operand 129 states and 135 transitions. Second operand has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-07-20 06:28:00,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:00,800 INFO L93 Difference]: Finished difference Result 130 states and 135 transitions. [2022-07-20 06:28:00,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:28:00,801 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-07-20 06:28:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:00,802 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:28:00,806 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:28:00,806 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:28:00,807 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 132 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:00,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 263 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:00,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:28:00,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2022-07-20 06:28:00,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 75 states have (on average 1.7866666666666666) internal successors, (134), 128 states have internal predecessors, (134), 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-07-20 06:28:00,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-07-20 06:28:00,813 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 10 [2022-07-20 06:28:00,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:00,813 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-07-20 06:28:00,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.0) internal successors, (10), 6 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-07-20 06:28:00,814 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-07-20 06:28:00,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-20 06:28:00,814 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:00,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:00,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:28:00,815 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:00,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1662359483, now seen corresponding path program 1 times [2022-07-20 06:28:00,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:00,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962628597] [2022-07-20 06:28:00,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:00,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:00,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:00,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:00,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962628597] [2022-07-20 06:28:00,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962628597] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:00,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1068590408] [2022-07-20 06:28:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:00,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:00,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:00,861 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-07-20 06:28:00,894 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-07-20 06:28:00,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:00,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-20 06:28:00,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:00,999 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:01,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:01,025 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:01,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1068590408] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:01,026 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:01,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2022-07-20 06:28:01,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967091840] [2022-07-20 06:28:01,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:01,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:28:01,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:01,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:28:01,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:28:01,028 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:01,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:01,041 INFO L93 Difference]: Finished difference Result 131 states and 136 transitions. [2022-07-20 06:28:01,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:28:01,042 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-20 06:28:01,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:01,043 INFO L225 Difference]: With dead ends: 131 [2022-07-20 06:28:01,043 INFO L226 Difference]: Without dead ends: 131 [2022-07-20 06:28:01,043 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:28:01,044 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 14 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 489 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:01,044 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 489 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:28:01,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-07-20 06:28:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-07-20 06:28:01,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 77 states have (on average 1.7662337662337662) internal successors, (136), 130 states have internal predecessors, (136), 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-07-20 06:28:01,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2022-07-20 06:28:01,048 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 14 [2022-07-20 06:28:01,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:01,049 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2022-07-20 06:28:01,049 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:01,049 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2022-07-20 06:28:01,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:28:01,049 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:01,050 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:01,089 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-20 06:28:01,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:01,275 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:01,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:01,275 INFO L85 PathProgramCache]: Analyzing trace with hash 6511237, now seen corresponding path program 1 times [2022-07-20 06:28:01,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:01,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321195173] [2022-07-20 06:28:01,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:01,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:01,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:01,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:01,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:01,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321195173] [2022-07-20 06:28:01,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321195173] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:01,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415230693] [2022-07-20 06:28:01,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:01,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:01,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:01,366 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-07-20 06:28:01,367 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-07-20 06:28:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:01,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-20 06:28:01,448 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:01,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:28:01,539 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:28:01,540 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:28:01,549 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:01,549 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:01,646 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:01,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415230693] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:01,647 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:01,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 4] total 6 [2022-07-20 06:28:01,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043562947] [2022-07-20 06:28:01,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:01,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:28:01,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:01,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:28:01,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:28:01,649 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:01,682 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2022-07-20 06:28:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:28:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 06:28:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:01,683 INFO L225 Difference]: With dead ends: 129 [2022-07-20 06:28:01,683 INFO L226 Difference]: Without dead ends: 129 [2022-07-20 06:28:01,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:28:01,684 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 138 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:01,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 278 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 69 Unchecked, 0.0s Time] [2022-07-20 06:28:01,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-07-20 06:28:01,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-07-20 06:28:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 77 states have (on average 1.7402597402597402) internal successors, (134), 128 states have internal predecessors, (134), 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-07-20 06:28:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 134 transitions. [2022-07-20 06:28:01,688 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 134 transitions. Word has length 15 [2022-07-20 06:28:01,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:01,689 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 134 transitions. [2022-07-20 06:28:01,689 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.5) internal successors, (27), 7 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:01,689 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 134 transitions. [2022-07-20 06:28:01,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:28:01,690 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:01,690 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:01,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:01,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-20 06:28:01,916 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:01,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:01,916 INFO L85 PathProgramCache]: Analyzing trace with hash 6511238, now seen corresponding path program 1 times [2022-07-20 06:28:01,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:01,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801695553] [2022-07-20 06:28:01,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:01,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:01,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:02,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:02,014 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801695553] [2022-07-20 06:28:02,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801695553] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:02,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1186560774] [2022-07-20 06:28:02,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:02,015 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:02,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:02,017 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:02,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 06:28:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:02,089 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:28:02,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:02,100 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-07-20 06:28:02,105 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-07-20 06:28:02,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:02,162 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:02,170 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:28:02,171 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-07-20 06:28:02,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:02,197 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:02,384 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:02,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1186560774] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:02,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:02,385 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 12 [2022-07-20 06:28:02,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [579452708] [2022-07-20 06:28:02,386 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:02,386 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 06:28:02,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:02,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 06:28:02,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:28:02,387 INFO L87 Difference]: Start difference. First operand 129 states and 134 transitions. Second operand has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 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-07-20 06:28:02,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:02,646 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2022-07-20 06:28:02,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:28:02,647 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 06:28:02,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:02,652 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:28:02,653 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:28:02,654 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:28:02,655 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 496 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 86 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:02,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 344 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 138 Invalid, 0 Unknown, 86 Unchecked, 0.1s Time] [2022-07-20 06:28:02,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:28:02,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-20 06:28:02,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 77 states have (on average 1.7142857142857142) internal successors, (132), 126 states have internal predecessors, (132), 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-07-20 06:28:02,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 132 transitions. [2022-07-20 06:28:02,666 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 132 transitions. Word has length 15 [2022-07-20 06:28:02,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:02,666 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 132 transitions. [2022-07-20 06:28:02,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.0) internal successors, (36), 13 states have internal predecessors, (36), 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-07-20 06:28:02,667 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 132 transitions. [2022-07-20 06:28:02,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:28:02,667 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:02,668 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:02,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:02,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:02,880 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:02,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:02,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520033, now seen corresponding path program 1 times [2022-07-20 06:28:02,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:02,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899924156] [2022-07-20 06:28:02,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:02,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:02,930 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:28:02,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:02,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899924156] [2022-07-20 06:28:02,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899924156] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:02,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:02,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:28:02,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644369894] [2022-07-20 06:28:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:02,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:28:02,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:02,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:28:02,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:28:02,932 INFO L87 Difference]: Start difference. First operand 127 states and 132 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-07-20 06:28:03,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:03,072 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2022-07-20 06:28:03,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:28:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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 22 [2022-07-20 06:28:03,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:03,073 INFO L225 Difference]: With dead ends: 124 [2022-07-20 06:28:03,073 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 06:28:03,073 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:28:03,074 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 107 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:03,074 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 325 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:03,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 06:28:03,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2022-07-20 06:28:03,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 77 states have (on average 1.6753246753246753) internal successors, (129), 123 states have internal predecessors, (129), 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-07-20 06:28:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 129 transitions. [2022-07-20 06:28:03,077 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 129 transitions. Word has length 22 [2022-07-20 06:28:03,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:03,077 INFO L495 AbstractCegarLoop]: Abstraction has 124 states and 129 transitions. [2022-07-20 06:28:03,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 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-07-20 06:28:03,078 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 129 transitions. [2022-07-20 06:28:03,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:28:03,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:03,078 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:03,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:28:03,079 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:03,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1580520034, now seen corresponding path program 1 times [2022-07-20 06:28:03,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:03,079 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724079797] [2022-07-20 06:28:03,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:03,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:03,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:03,153 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:28:03,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:03,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724079797] [2022-07-20 06:28:03,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724079797] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:03,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:03,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:28:03,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821927075] [2022-07-20 06:28:03,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:03,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:28:03,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:03,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:28:03,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:28:03,155 INFO L87 Difference]: Start difference. First operand 124 states and 129 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:03,266 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-07-20 06:28:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:28:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:28:03,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:03,268 INFO L225 Difference]: With dead ends: 117 [2022-07-20 06:28:03,268 INFO L226 Difference]: Without dead ends: 117 [2022-07-20 06:28:03,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:28:03,269 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 412 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:03,270 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 95 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:03,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-20 06:28:03,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-07-20 06:28:03,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 77 states have (on average 1.5844155844155845) internal successors, (122), 116 states have internal predecessors, (122), 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-07-20 06:28:03,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2022-07-20 06:28:03,273 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 22 [2022-07-20 06:28:03,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:03,273 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2022-07-20 06:28:03,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:28:03,273 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-07-20 06:28:03,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:28:03,274 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:03,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:03,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:28:03,274 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:03,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:03,275 INFO L85 PathProgramCache]: Analyzing trace with hash 67241285, now seen corresponding path program 1 times [2022-07-20 06:28:03,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:03,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204209972] [2022-07-20 06:28:03,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:03,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:03,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:03,332 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:28:03,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:03,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204209972] [2022-07-20 06:28:03,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204209972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:03,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:03,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:28:03,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [964187430] [2022-07-20 06:28:03,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:03,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:28:03,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:03,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:28:03,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:28:03,334 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-07-20 06:28:03,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:03,439 INFO L93 Difference]: Finished difference Result 112 states and 117 transitions. [2022-07-20 06:28:03,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:28:03,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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 28 [2022-07-20 06:28:03,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:03,441 INFO L225 Difference]: With dead ends: 112 [2022-07-20 06:28:03,441 INFO L226 Difference]: Without dead ends: 112 [2022-07-20 06:28:03,441 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:28:03,443 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 386 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:03,444 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 84 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:03,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-07-20 06:28:03,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2022-07-20 06:28:03,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 77 states have (on average 1.5194805194805194) internal successors, (117), 111 states have internal predecessors, (117), 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-07-20 06:28:03,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 117 transitions. [2022-07-20 06:28:03,447 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 117 transitions. Word has length 28 [2022-07-20 06:28:03,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:03,448 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 117 transitions. [2022-07-20 06:28:03,448 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 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-07-20 06:28:03,448 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 117 transitions. [2022-07-20 06:28:03,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:28:03,451 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:03,451 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:03,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:28:03,452 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:03,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:03,452 INFO L85 PathProgramCache]: Analyzing trace with hash 67280267, now seen corresponding path program 1 times [2022-07-20 06:28:03,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:03,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163901786] [2022-07-20 06:28:03,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:03,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:28:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163901786] [2022-07-20 06:28:03,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163901786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:03,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:03,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:28:03,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847143601] [2022-07-20 06:28:03,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:03,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:28:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:03,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:28:03,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:28:03,629 INFO L87 Difference]: Start difference. First operand 112 states and 117 transitions. Second operand has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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-07-20 06:28:03,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:03,811 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2022-07-20 06:28:03,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:28:03,812 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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 28 [2022-07-20 06:28:03,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:03,812 INFO L225 Difference]: With dead ends: 107 [2022-07-20 06:28:03,813 INFO L226 Difference]: Without dead ends: 107 [2022-07-20 06:28:03,813 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:28:03,813 INFO L413 NwaCegarLoop]: 68 mSDtfsCounter, 548 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 548 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:03,814 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [548 Valid, 162 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:03,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-07-20 06:28:03,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2022-07-20 06:28:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 106 states have internal predecessors, (112), 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-07-20 06:28:03,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2022-07-20 06:28:03,816 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 28 [2022-07-20 06:28:03,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:03,817 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2022-07-20 06:28:03,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.8) internal successors, (28), 11 states have internal predecessors, (28), 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-07-20 06:28:03,817 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2022-07-20 06:28:03,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:28:03,817 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:03,817 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:03,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:28:03,818 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:03,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 67279051, now seen corresponding path program 1 times [2022-07-20 06:28:03,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:03,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264710896] [2022-07-20 06:28:03,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:03,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:03,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:04,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:04,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:04,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264710896] [2022-07-20 06:28:04,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264710896] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:04,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369282705] [2022-07-20 06:28:04,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:04,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:04,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:04,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:04,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-20 06:28:04,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:04,175 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 56 conjunts are in the unsatisfiable core [2022-07-20 06:28:04,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:04,216 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-07-20 06:28:04,333 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-20 06:28:04,333 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:04,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:04,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:28:04,494 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 14 treesize of output 16 [2022-07-20 06:28:04,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:04,526 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 21 treesize of output 20 [2022-07-20 06:28:04,625 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:04,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 10 [2022-07-20 06:28:04,632 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:04,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:04,654 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2022-07-20 06:28:04,662 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-20 06:28:04,669 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_465 (Array Int Int)) (v_ArrVal_464 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_464) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_465) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2022-07-20 06:28:04,676 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:04,677 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-20 06:28:04,688 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 60 treesize of output 52 [2022-07-20 06:28:04,692 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 48 treesize of output 44 [2022-07-20 06:28:04,696 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 22 treesize of output 20 [2022-07-20 06:28:04,909 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:28:04,910 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 25 treesize of output 24 [2022-07-20 06:28:04,916 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:28:04,917 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369282705] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:04,917 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:04,917 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 14] total 35 [2022-07-20 06:28:04,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [374586537] [2022-07-20 06:28:04,917 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:04,918 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-07-20 06:28:04,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:04,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-07-20 06:28:04,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=952, Unknown=3, NotChecked=192, Total=1260 [2022-07-20 06:28:04,919 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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-07-20 06:28:05,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:05,791 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2022-07-20 06:28:05,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:28:05,791 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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 28 [2022-07-20 06:28:05,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:05,792 INFO L225 Difference]: With dead ends: 106 [2022-07-20 06:28:05,792 INFO L226 Difference]: Without dead ends: 106 [2022-07-20 06:28:05,793 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=369, Invalid=1896, Unknown=3, NotChecked=282, Total=2550 [2022-07-20 06:28:05,794 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 775 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 715 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 487 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:05,794 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 662 Invalid, 1274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 715 Invalid, 0 Unknown, 487 Unchecked, 0.4s Time] [2022-07-20 06:28:05,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-20 06:28:05,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2022-07-20 06:28:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 77 states have (on average 1.3896103896103895) internal successors, (107), 101 states have internal predecessors, (107), 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-07-20 06:28:05,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-07-20 06:28:05,796 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 28 [2022-07-20 06:28:05,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:05,797 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-07-20 06:28:05,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 1.8) internal successors, (63), 36 states have internal predecessors, (63), 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-07-20 06:28:05,797 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-07-20 06:28:05,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:28:05,797 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:05,798 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:05,824 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:05,998 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-07-20 06:28:05,998 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:05,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:05,999 INFO L85 PathProgramCache]: Analyzing trace with hash 2085688457, now seen corresponding path program 1 times [2022-07-20 06:28:05,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:05,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211996006] [2022-07-20 06:28:05,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:05,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:06,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:06,139 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:28:06,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:06,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211996006] [2022-07-20 06:28:06,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211996006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:06,140 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:06,140 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:28:06,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913379600] [2022-07-20 06:28:06,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:06,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:28:06,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:06,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:28:06,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:28:06,141 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-07-20 06:28:06,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:06,380 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2022-07-20 06:28:06,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:28:06,381 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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 29 [2022-07-20 06:28:06,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:06,381 INFO L225 Difference]: With dead ends: 97 [2022-07-20 06:28:06,381 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:28:06,382 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-07-20 06:28:06,382 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 572 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 572 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:06,382 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [572 Valid, 75 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:28:06,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:28:06,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2022-07-20 06:28:06,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 96 states have internal predecessors, (102), 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-07-20 06:28:06,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-07-20 06:28:06,385 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 29 [2022-07-20 06:28:06,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:06,385 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-07-20 06:28:06,385 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 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-07-20 06:28:06,385 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-07-20 06:28:06,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:28:06,386 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:06,386 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:06,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 06:28:06,386 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:06,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:06,387 INFO L85 PathProgramCache]: Analyzing trace with hash 2085650723, now seen corresponding path program 1 times [2022-07-20 06:28:06,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:06,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497156578] [2022-07-20 06:28:06,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:06,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:06,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:06,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:06,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497156578] [2022-07-20 06:28:06,642 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497156578] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:06,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1508318359] [2022-07-20 06:28:06,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:06,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:06,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:06,645 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:06,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-20 06:28:06,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:06,745 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 46 conjunts are in the unsatisfiable core [2022-07-20 06:28:06,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:06,756 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-07-20 06:28:06,799 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-20 06:28:06,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:06,819 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:06,857 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:28:06,981 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 40 treesize of output 38 [2022-07-20 06:28:07,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:07,037 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 47 treesize of output 38 [2022-07-20 06:28:07,147 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 41 treesize of output 25 [2022-07-20 06:28:07,165 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:07,165 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:07,200 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:07,217 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:07,223 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array Int Int)) (v_ArrVal_587 (Array Int Int))) (<= (+ (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_587) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 1) |c_#StackHeapBarrier|)) is different from false [2022-07-20 06:28:07,231 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:07,231 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 06:28:07,234 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 68 treesize of output 60 [2022-07-20 06:28:07,237 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 56 treesize of output 52 [2022-07-20 06:28:07,241 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 26 treesize of output 24 [2022-07-20 06:28:07,472 INFO L356 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2022-07-20 06:28:07,473 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 55 [2022-07-20 06:28:07,529 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:28:07,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1508318359] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:07,530 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:07,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-07-20 06:28:07,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583474430] [2022-07-20 06:28:07,530 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:07,531 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:28:07,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:07,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:28:07,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=581, Unknown=3, NotChecked=150, Total=812 [2022-07-20 06:28:07,533 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 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-07-20 06:28:08,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:08,397 INFO L93 Difference]: Finished difference Result 177 states and 187 transitions. [2022-07-20 06:28:08,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 06:28:08,398 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 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 29 [2022-07-20 06:28:08,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:08,399 INFO L225 Difference]: With dead ends: 177 [2022-07-20 06:28:08,399 INFO L226 Difference]: Without dead ends: 177 [2022-07-20 06:28:08,400 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=148, Invalid=983, Unknown=3, NotChecked=198, Total=1332 [2022-07-20 06:28:08,400 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 491 mSDsluCounter, 664 mSDsCounter, 0 mSdLazyCounter, 821 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 491 SdHoareTripleChecker+Valid, 710 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 821 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 547 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:08,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [491 Valid, 710 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 821 Invalid, 0 Unknown, 547 Unchecked, 0.5s Time] [2022-07-20 06:28:08,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-07-20 06:28:08,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 136. [2022-07-20 06:28:08,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 116 states have (on average 1.2844827586206897) internal successors, (149), 135 states have internal predecessors, (149), 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-07-20 06:28:08,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2022-07-20 06:28:08,404 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 29 [2022-07-20 06:28:08,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:08,405 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2022-07-20 06:28:08,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 1.9642857142857142) internal successors, (55), 29 states have internal predecessors, (55), 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-07-20 06:28:08,405 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2022-07-20 06:28:08,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:28:08,420 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:08,420 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:08,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:08,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 06:28:08,636 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash 231832909, now seen corresponding path program 1 times [2022-07-20 06:28:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:08,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406091389] [2022-07-20 06:28:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:08,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:08,765 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:28:08,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:08,765 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406091389] [2022-07-20 06:28:08,765 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406091389] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:08,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:28:08,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:28:08,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176125788] [2022-07-20 06:28:08,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:08,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:28:08,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:08,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:28:08,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:28:08,767 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-07-20 06:28:09,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:09,027 INFO L93 Difference]: Finished difference Result 135 states and 147 transitions. [2022-07-20 06:28:09,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:28:09,028 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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 30 [2022-07-20 06:28:09,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:09,029 INFO L225 Difference]: With dead ends: 135 [2022-07-20 06:28:09,029 INFO L226 Difference]: Without dead ends: 135 [2022-07-20 06:28:09,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=240, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:28:09,030 INFO L413 NwaCegarLoop]: 74 mSDtfsCounter, 233 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:09,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 286 Invalid, 322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:28:09,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-20 06:28:09,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2022-07-20 06:28:09,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 116 states have (on average 1.2672413793103448) internal successors, (147), 134 states have internal predecessors, (147), 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-07-20 06:28:09,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 147 transitions. [2022-07-20 06:28:09,033 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 147 transitions. Word has length 30 [2022-07-20 06:28:09,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:09,034 INFO L495 AbstractCegarLoop]: Abstraction has 135 states and 147 transitions. [2022-07-20 06:28:09,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.727272727272727) internal successors, (30), 12 states have internal predecessors, (30), 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-07-20 06:28:09,034 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 147 transitions. [2022-07-20 06:28:09,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-20 06:28:09,035 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:09,035 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:09,035 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:28:09,035 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:09,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash 230663117, now seen corresponding path program 1 times [2022-07-20 06:28:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:09,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118925567] [2022-07-20 06:28:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:09,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:09,186 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:09,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:09,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118925567] [2022-07-20 06:28:09,187 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118925567] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:09,187 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1248400823] [2022-07-20 06:28:09,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:09,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:09,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:09,188 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:09,189 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-20 06:28:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:09,282 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 06:28:09,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:09,290 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-07-20 06:28:09,312 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:09,312 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:09,338 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-20 06:28:09,338 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:09,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:09,376 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:09,376 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:28:09,441 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 24 treesize of output 24 [2022-07-20 06:28:09,475 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:09,476 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-07-20 06:28:09,580 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:09,580 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 42 treesize of output 22 [2022-07-20 06:28:09,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:09,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:09,688 INFO L356 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2022-07-20 06:28:09,688 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2022-07-20 06:28:09,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_710 (Array Int Int)) (v_ArrVal_709 (Array Int Int))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_709) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_710) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse0)))) is different from false [2022-07-20 06:28:09,713 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:09,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 35 [2022-07-20 06:28:09,717 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 235 treesize of output 215 [2022-07-20 06:28:09,725 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 195 treesize of output 187 [2022-07-20 06:28:09,730 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 187 treesize of output 171 [2022-07-20 06:28:10,037 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:28:10,038 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1248400823] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:10,038 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:10,038 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 13] total 28 [2022-07-20 06:28:10,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646441398] [2022-07-20 06:28:10,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:10,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:28:10,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:10,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:28:10,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=673, Unknown=2, NotChecked=52, Total=812 [2022-07-20 06:28:10,039 INFO L87 Difference]: Start difference. First operand 135 states and 147 transitions. Second operand has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-07-20 06:28:10,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:10,814 INFO L93 Difference]: Finished difference Result 134 states and 146 transitions. [2022-07-20 06:28:10,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:28:10,814 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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 30 [2022-07-20 06:28:10,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:10,815 INFO L225 Difference]: With dead ends: 134 [2022-07-20 06:28:10,815 INFO L226 Difference]: Without dead ends: 134 [2022-07-20 06:28:10,816 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=314, Invalid=1248, Unknown=2, NotChecked=76, Total=1640 [2022-07-20 06:28:10,816 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 189 mSDsluCounter, 834 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 152 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:10,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 901 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 697 Invalid, 0 Unknown, 152 Unchecked, 0.4s Time] [2022-07-20 06:28:10,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-07-20 06:28:10,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2022-07-20 06:28:10,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.2586206896551724) internal successors, (146), 133 states have internal predecessors, (146), 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-07-20 06:28:10,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-07-20 06:28:10,820 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 30 [2022-07-20 06:28:10,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:10,821 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-07-20 06:28:10,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.357142857142857) internal successors, (66), 29 states have internal predecessors, (66), 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-07-20 06:28:10,821 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-07-20 06:28:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:28:10,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:10,822 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:10,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:11,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:11,040 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:11,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash 823875782, now seen corresponding path program 1 times [2022-07-20 06:28:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:11,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820199886] [2022-07-20 06:28:11,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:11,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:11,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:11,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:11,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:11,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820199886] [2022-07-20 06:28:11,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820199886] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:11,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2028378899] [2022-07-20 06:28:11,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:11,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:11,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:11,275 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:11,276 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-20 06:28:11,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:11,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 36 conjunts are in the unsatisfiable core [2022-07-20 06:28:11,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:11,403 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:28:11,403 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-07-20 06:28:11,478 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:11,539 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:11,540 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 27 treesize of output 23 [2022-07-20 06:28:11,702 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:11,709 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:11,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:11,884 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 13 treesize of output 11 [2022-07-20 06:28:11,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-20 06:28:11,893 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 14 treesize of output 12 [2022-07-20 06:28:11,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:11,915 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 6 treesize of output 4 [2022-07-20 06:28:11,956 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:28:11,956 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 13 treesize of output 12 [2022-07-20 06:28:11,961 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:11,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2028378899] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:11,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:11,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 29 [2022-07-20 06:28:11,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119666153] [2022-07-20 06:28:11,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:11,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:28:11,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:11,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:28:11,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=773, Unknown=0, NotChecked=0, Total=870 [2022-07-20 06:28:11,963 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 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-07-20 06:28:12,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:12,547 INFO L93 Difference]: Finished difference Result 133 states and 144 transitions. [2022-07-20 06:28:12,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:28:12,547 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 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) Word has length 33 [2022-07-20 06:28:12,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:12,548 INFO L225 Difference]: With dead ends: 133 [2022-07-20 06:28:12,548 INFO L226 Difference]: Without dead ends: 133 [2022-07-20 06:28:12,548 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 362 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=282, Invalid=1358, Unknown=0, NotChecked=0, Total=1640 [2022-07-20 06:28:12,549 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 424 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 729 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 577 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 729 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 62 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:12,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 577 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 729 Invalid, 0 Unknown, 62 Unchecked, 0.3s Time] [2022-07-20 06:28:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-07-20 06:28:12,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-07-20 06:28:12,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 116 states have (on average 1.2413793103448276) internal successors, (144), 132 states have internal predecessors, (144), 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-07-20 06:28:12,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2022-07-20 06:28:12,553 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 33 [2022-07-20 06:28:12,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:12,553 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2022-07-20 06:28:12,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.3448275862068964) internal successors, (68), 30 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-07-20 06:28:12,553 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2022-07-20 06:28:12,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:28:12,554 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:12,554 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:12,577 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:12,771 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:12,772 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:12,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:12,772 INFO L85 PathProgramCache]: Analyzing trace with hash 823444806, now seen corresponding path program 1 times [2022-07-20 06:28:12,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:12,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614414254] [2022-07-20 06:28:12,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:12,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:12,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:12,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:12,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:12,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614414254] [2022-07-20 06:28:12,996 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614414254] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:12,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [915989194] [2022-07-20 06:28:12,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:12,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:12,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:13,000 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:13,028 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:28:13,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:13,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 45 conjunts are in the unsatisfiable core [2022-07-20 06:28:13,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:13,120 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-07-20 06:28:13,151 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:13,152 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:13,208 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-20 06:28:13,208 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:13,223 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:13,261 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:13,261 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 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:28:13,298 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 24 treesize of output 24 [2022-07-20 06:28:13,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:13,326 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 31 treesize of output 26 [2022-07-20 06:28:13,412 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:13,412 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 25 treesize of output 21 [2022-07-20 06:28:13,533 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:13,538 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:13,538 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:13,745 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0)) 1)) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2022-07-20 06:28:13,769 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) is different from false [2022-07-20 06:28:13,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:13,791 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 47 treesize of output 51 [2022-07-20 06:28:13,833 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) is different from false [2022-07-20 06:28:13,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:13,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:28:13,849 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 162 treesize of output 156 [2022-07-20 06:28:13,854 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 99 treesize of output 95 [2022-07-20 06:28:13,859 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 218 treesize of output 210 [2022-07-20 06:28:13,880 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:13,880 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 240 treesize of output 242 [2022-07-20 06:28:14,034 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:28:14,034 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 1 [2022-07-20 06:28:14,070 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:28:14,070 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [915989194] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:14,070 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:14,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 32 [2022-07-20 06:28:14,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140091279] [2022-07-20 06:28:14,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:14,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-20 06:28:14,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:14,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-20 06:28:14,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=793, Unknown=3, NotChecked=174, Total=1056 [2022-07-20 06:28:14,073 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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-07-20 06:28:16,197 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 0)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= .cse1 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-20 06:28:16,714 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_881 Int) (v_ArrVal_880 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0)) 1))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-20 06:28:18,790 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (not (= .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| .cse1) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| Int)) (or (and (forall ((v_ArrVal_881 Int) (v_ArrVal_879 (Array Int Int)) (v_ArrVal_880 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_879) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_880) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_ArrVal_881) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1 Int) (v_prenex_2 (Array Int Int)) (v_prenex_3 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29| 4) v_prenex_1) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_29|)))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-20 06:28:19,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:19,229 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2022-07-20 06:28:19,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:28:19,230 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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 33 [2022-07-20 06:28:19,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:19,230 INFO L225 Difference]: With dead ends: 132 [2022-07-20 06:28:19,230 INFO L226 Difference]: Without dead ends: 132 [2022-07-20 06:28:19,231 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 44 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=210, Invalid=1368, Unknown=6, NotChecked=486, Total=2070 [2022-07-20 06:28:19,231 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 179 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 666 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 1044 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 666 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 341 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:19,231 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 803 Invalid, 1044 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 666 Invalid, 0 Unknown, 341 Unchecked, 0.3s Time] [2022-07-20 06:28:19,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-07-20 06:28:19,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-07-20 06:28:19,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 116 states have (on average 1.2327586206896552) internal successors, (143), 131 states have internal predecessors, (143), 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-07-20 06:28:19,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-07-20 06:28:19,238 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 33 [2022-07-20 06:28:19,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:19,238 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-07-20 06:28:19,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.28125) internal successors, (73), 33 states have internal predecessors, (73), 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-07-20 06:28:19,239 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-07-20 06:28:19,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:28:19,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:19,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:19,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-07-20 06:28:19,451 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-07-20 06:28:19,451 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:19,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:19,452 INFO L85 PathProgramCache]: Analyzing trace with hash -1553624943, now seen corresponding path program 1 times [2022-07-20 06:28:19,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:19,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667746566] [2022-07-20 06:28:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:19,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:19,788 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:19,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:19,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667746566] [2022-07-20 06:28:19,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667746566] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:19,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [605373962] [2022-07-20 06:28:19,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:19,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:19,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:19,791 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:19,791 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:28:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:19,916 INFO L263 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 06:28:19,918 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:19,923 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-07-20 06:28:19,973 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:28:19,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:28:20,062 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:28:20,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:20,094 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:20,133 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:20,133 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 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-20 06:28:20,216 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 32 treesize of output 30 [2022-07-20 06:28:20,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:20,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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-07-20 06:28:20,397 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:20,397 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 24 [2022-07-20 06:28:20,415 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:20,419 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:20,595 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2022-07-20 06:28:20,608 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_968 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((v_ArrVal_968 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1))) is different from false [2022-07-20 06:28:20,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:20,617 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 37 treesize of output 41 [2022-07-20 06:28:20,632 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_4 (Array Int Int)) (v_prenex_5 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_968 (Array Int Int)) (v_ArrVal_967 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_967) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_968) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-20 06:28:20,637 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:20,637 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 06:28:20,639 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 65 treesize of output 57 [2022-07-20 06:28:20,642 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 6 treesize of output 4 [2022-07-20 06:28:20,645 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 6 treesize of output 4 [2022-07-20 06:28:20,652 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 6 treesize of output 4 [2022-07-20 06:28:20,659 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:28:20,659 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2022-07-20 06:28:20,944 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:28:20,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [605373962] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:20,945 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:20,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 18, 19] total 50 [2022-07-20 06:28:20,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128861089] [2022-07-20 06:28:20,945 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:20,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-20 06:28:20,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:20,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-20 06:28:20,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2070, Unknown=3, NotChecked=282, Total=2550 [2022-07-20 06:28:20,947 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 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-07-20 06:28:22,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:22,735 INFO L93 Difference]: Finished difference Result 211 states and 227 transitions. [2022-07-20 06:28:22,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-20 06:28:22,737 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 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 34 [2022-07-20 06:28:22,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:22,738 INFO L225 Difference]: With dead ends: 211 [2022-07-20 06:28:22,738 INFO L226 Difference]: Without dead ends: 211 [2022-07-20 06:28:22,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1995 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=688, Invalid=6116, Unknown=14, NotChecked=492, Total=7310 [2022-07-20 06:28:22,741 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 428 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 1056 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 1705 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 1056 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 574 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:22,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 902 Invalid, 1705 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 1056 Invalid, 0 Unknown, 574 Unchecked, 0.5s Time] [2022-07-20 06:28:22,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2022-07-20 06:28:22,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 131. [2022-07-20 06:28:22,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 116 states have (on average 1.2241379310344827) internal successors, (142), 130 states have internal predecessors, (142), 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-07-20 06:28:22,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 142 transitions. [2022-07-20 06:28:22,744 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 142 transitions. Word has length 34 [2022-07-20 06:28:22,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:22,745 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 142 transitions. [2022-07-20 06:28:22,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.6) internal successors, (80), 51 states have internal predecessors, (80), 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-07-20 06:28:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 142 transitions. [2022-07-20 06:28:22,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:28:22,745 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:22,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:22,765 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:22,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:22,955 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:22,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:22,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1554055919, now seen corresponding path program 1 times [2022-07-20 06:28:22,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:22,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483023878] [2022-07-20 06:28:22,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:22,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:22,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:23,171 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:23,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483023878] [2022-07-20 06:28:23,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [483023878] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:23,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1216549301] [2022-07-20 06:28:23,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:23,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:23,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:23,173 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:23,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:28:23,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:23,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 34 conjunts are in the unsatisfiable core [2022-07-20 06:28:23,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:23,349 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:28:23,350 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-07-20 06:28:23,401 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:23,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:23,449 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 18 treesize of output 18 [2022-07-20 06:28:23,563 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:28:23,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-07-20 06:28:23,602 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:23,602 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:23,726 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 36 treesize of output 32 [2022-07-20 06:28:23,756 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 13 treesize of output 11 [2022-07-20 06:28:23,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2022-07-20 06:28:23,802 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:28:23,802 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 13 treesize of output 12 [2022-07-20 06:28:23,808 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:23,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1216549301] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:23,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:23,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 30 [2022-07-20 06:28:23,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732671895] [2022-07-20 06:28:23,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:23,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-20 06:28:23,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:23,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-20 06:28:23,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=818, Unknown=0, NotChecked=0, Total=930 [2022-07-20 06:28:23,811 INFO L87 Difference]: Start difference. First operand 131 states and 142 transitions. Second operand has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 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-07-20 06:28:24,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:24,302 INFO L93 Difference]: Finished difference Result 130 states and 140 transitions. [2022-07-20 06:28:24,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:28:24,303 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 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 34 [2022-07-20 06:28:24,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:24,303 INFO L225 Difference]: With dead ends: 130 [2022-07-20 06:28:24,303 INFO L226 Difference]: Without dead ends: 130 [2022-07-20 06:28:24,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 379 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2022-07-20 06:28:24,304 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 595 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 111 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:24,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 498 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 587 Invalid, 0 Unknown, 111 Unchecked, 0.3s Time] [2022-07-20 06:28:24,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-07-20 06:28:24,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-07-20 06:28:24,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 116 states have (on average 1.206896551724138) internal successors, (140), 129 states have internal predecessors, (140), 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-07-20 06:28:24,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2022-07-20 06:28:24,308 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 34 [2022-07-20 06:28:24,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:24,308 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2022-07-20 06:28:24,308 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 2.6333333333333333) internal successors, (79), 31 states have internal predecessors, (79), 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-07-20 06:28:24,308 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2022-07-20 06:28:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:28:24,309 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:24,309 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:24,332 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:24,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-20 06:28:24,527 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:24,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:24,528 INFO L85 PathProgramCache]: Analyzing trace with hash 449486225, now seen corresponding path program 1 times [2022-07-20 06:28:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:24,528 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615766308] [2022-07-20 06:28:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:24,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:24,879 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:24,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:24,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615766308] [2022-07-20 06:28:24,880 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615766308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:24,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1750812137] [2022-07-20 06:28:24,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:24,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:24,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:24,882 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:24,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:28:25,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:25,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 06:28:25,043 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:25,049 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-07-20 06:28:25,084 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:28:25,085 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:28:25,151 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:28:25,151 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:25,182 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:25,223 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:25,223 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 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 06:28:25,276 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 23 treesize of output 23 [2022-07-20 06:28:25,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:25,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 25 [2022-07-20 06:28:25,485 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:25,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 52 treesize of output 24 [2022-07-20 06:28:25,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:25,512 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:25,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:25,699 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 6 treesize of output 4 [2022-07-20 06:28:25,704 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-20 06:28:25,716 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2022-07-20 06:28:25,721 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1137 (Array Int Int)) (v_ArrVal_1136 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1136) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) is different from false [2022-07-20 06:28:25,726 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:25,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2022-07-20 06:28:25,731 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 65 treesize of output 57 [2022-07-20 06:28:25,739 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 6 treesize of output 4 [2022-07-20 06:28:25,745 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 6 treesize of output 4 [2022-07-20 06:28:25,748 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 6 treesize of output 4 [2022-07-20 06:28:25,962 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:28:25,962 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1750812137] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:25,962 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:25,962 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 47 [2022-07-20 06:28:25,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000901731] [2022-07-20 06:28:25,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:25,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-20 06:28:25,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:25,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-20 06:28:25,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1817, Unknown=3, NotChecked=264, Total=2256 [2022-07-20 06:28:25,964 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 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-07-20 06:28:27,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:27,263 INFO L93 Difference]: Finished difference Result 127 states and 137 transitions. [2022-07-20 06:28:27,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:28:27,264 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 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 34 [2022-07-20 06:28:27,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:27,264 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:28:27,264 INFO L226 Difference]: Without dead ends: 127 [2022-07-20 06:28:27,265 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 953 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=592, Invalid=3198, Unknown=4, NotChecked=366, Total=4160 [2022-07-20 06:28:27,265 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 525 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 1180 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 525 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 1654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 350 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:27,266 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [525 Valid, 760 Invalid, 1654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1180 Invalid, 0 Unknown, 350 Unchecked, 0.5s Time] [2022-07-20 06:28:27,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-07-20 06:28:27,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-07-20 06:28:27,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 116 states have (on average 1.1810344827586208) internal successors, (137), 126 states have internal predecessors, (137), 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-07-20 06:28:27,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 137 transitions. [2022-07-20 06:28:27,268 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 137 transitions. Word has length 34 [2022-07-20 06:28:27,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:27,269 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 137 transitions. [2022-07-20 06:28:27,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 47 states have (on average 1.702127659574468) internal successors, (80), 48 states have internal predecessors, (80), 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-07-20 06:28:27,269 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 137 transitions. [2022-07-20 06:28:27,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:28:27,269 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:27,270 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:27,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:27,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 06:28:27,475 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:27,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:27,476 INFO L85 PathProgramCache]: Analyzing trace with hash 449055249, now seen corresponding path program 1 times [2022-07-20 06:28:27,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:27,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1936767758] [2022-07-20 06:28:27,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:27,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:27,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:27,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:27,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1936767758] [2022-07-20 06:28:27,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1936767758] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:27,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [819205702] [2022-07-20 06:28:27,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:27,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:27,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:27,677 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:27,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:28:27,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:27,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 42 conjunts are in the unsatisfiable core [2022-07-20 06:28:27,777 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:27,778 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-07-20 06:28:27,798 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:27,799 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:27,821 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-20 06:28:27,822 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:27,843 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:27,880 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:27,881 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 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-20 06:28:27,922 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 15 treesize of output 17 [2022-07-20 06:28:27,940 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:28:27,940 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 1 case distinctions, treesize of input 22 treesize of output 27 [2022-07-20 06:28:28,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:28,030 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 16 treesize of output 16 [2022-07-20 06:28:28,115 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:28:28,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-07-20 06:28:28,161 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:28,161 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:28,299 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 6 treesize of output 4 [2022-07-20 06:28:28,587 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-07-20 06:28:28,594 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) is different from false [2022-07-20 06:28:28,602 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) is different from false [2022-07-20 06:28:28,608 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:28:28,614 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:28,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 06:28:28,617 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 85 treesize of output 81 [2022-07-20 06:28:28,620 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 100 treesize of output 96 [2022-07-20 06:28:28,623 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 109 treesize of output 107 [2022-07-20 06:28:28,630 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:28,630 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 127 treesize of output 131 [2022-07-20 06:28:28,751 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:28:28,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [819205702] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:28,752 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:28,752 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 17] total 37 [2022-07-20 06:28:28,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571798459] [2022-07-20 06:28:28,752 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:28,752 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:28:28,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:28,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:28:28,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=1018, Unknown=4, NotChecked=268, Total=1406 [2022-07-20 06:28:28,753 INFO L87 Difference]: Start difference. First operand 127 states and 137 transitions. Second operand has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 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-07-20 06:28:29,190 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int)) (v_ArrVal_1223 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1223) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:28:29,534 WARN L833 $PredicateComparison]: unable to prove that (and (not (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:28:29,880 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1))) is different from false [2022-07-20 06:28:30,228 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:28:30,567 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int) (v_ArrVal_1224 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1224) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1))) is different from false [2022-07-20 06:28:30,861 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (and (not (= (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= (select .cse0 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (forall ((|ULTIMATE.start_dll_circular_create_~head~0#1.offset| Int)) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ |ULTIMATE.start_dll_circular_create_~head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2022-07-20 06:28:31,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:31,250 INFO L93 Difference]: Finished difference Result 158 states and 168 transitions. [2022-07-20 06:28:31,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:28:31,250 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 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 34 [2022-07-20 06:28:31,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:31,251 INFO L225 Difference]: With dead ends: 158 [2022-07-20 06:28:31,251 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 06:28:31,252 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 338 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=239, Invalid=1683, Unknown=10, NotChecked=930, Total=2862 [2022-07-20 06:28:31,253 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 322 mSDsluCounter, 1082 mSDsCounter, 0 mSdLazyCounter, 623 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 322 SdHoareTripleChecker+Valid, 1134 SdHoareTripleChecker+Invalid, 1119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 455 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:31,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [322 Valid, 1134 Invalid, 1119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 623 Invalid, 0 Unknown, 455 Unchecked, 0.3s Time] [2022-07-20 06:28:31,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 06:28:31,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 132. [2022-07-20 06:28:31,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 121 states have (on average 1.1818181818181819) internal successors, (143), 131 states have internal predecessors, (143), 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-07-20 06:28:31,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 143 transitions. [2022-07-20 06:28:31,256 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 143 transitions. Word has length 34 [2022-07-20 06:28:31,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:31,256 INFO L495 AbstractCegarLoop]: Abstraction has 132 states and 143 transitions. [2022-07-20 06:28:31,256 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.4324324324324325) internal successors, (90), 38 states have internal predecessors, (90), 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-07-20 06:28:31,256 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 143 transitions. [2022-07-20 06:28:31,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:28:31,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:31,257 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:31,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-07-20 06:28:31,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 06:28:31,467 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:31,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:31,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1035188976, now seen corresponding path program 2 times [2022-07-20 06:28:31,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:31,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481127213] [2022-07-20 06:28:31,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:31,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:31,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:31,499 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:31,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:31,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481127213] [2022-07-20 06:28:31,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481127213] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:31,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059801415] [2022-07-20 06:28:31,500 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:28:31,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:31,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:31,501 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:31,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 06:28:31,646 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:28:31,646 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:28:31,647 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:28:31,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:31,667 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:31,668 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:28:31,668 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059801415] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:28:31,668 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:28:31,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 6 [2022-07-20 06:28:31,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1586601449] [2022-07-20 06:28:31,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:28:31,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:28:31,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:31,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:28:31,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:28:31,670 INFO L87 Difference]: Start difference. First operand 132 states and 143 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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-07-20 06:28:31,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:31,677 INFO L93 Difference]: Finished difference Result 82 states and 86 transitions. [2022-07-20 06:28:31,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:28:31,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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) Word has length 34 [2022-07-20 06:28:31,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:31,678 INFO L225 Difference]: With dead ends: 82 [2022-07-20 06:28:31,678 INFO L226 Difference]: Without dead ends: 82 [2022-07-20 06:28:31,678 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:28:31,679 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 210 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:31,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 92 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:28:31,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2022-07-20 06:28:31,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2022-07-20 06:28:31,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.1168831168831168) internal successors, (86), 81 states have internal predecessors, (86), 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-07-20 06:28:31,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-07-20 06:28:31,683 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 34 [2022-07-20 06:28:31,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:31,683 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-07-20 06:28:31,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 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-07-20 06:28:31,684 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-07-20 06:28:31,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-07-20 06:28:31,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:31,684 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:31,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:31,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-20 06:28:31,908 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:31,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -1654547908, now seen corresponding path program 1 times [2022-07-20 06:28:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:31,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944022812] [2022-07-20 06:28:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:32,320 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:32,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944022812] [2022-07-20 06:28:32,321 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [944022812] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:32,321 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801497423] [2022-07-20 06:28:32,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:32,321 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:32,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:32,322 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:32,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 06:28:32,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:32,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 55 conjunts are in the unsatisfiable core [2022-07-20 06:28:32,436 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:32,444 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-07-20 06:28:32,471 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:28:32,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:28:32,529 INFO L356 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-07-20 06:28:32,529 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:32,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:32,592 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:32,592 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 1 case distinctions, treesize of input 36 treesize of output 35 [2022-07-20 06:28:32,666 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 32 treesize of output 30 [2022-07-20 06:28:32,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 28 [2022-07-20 06:28:32,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:32,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:32,881 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:32,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 63 treesize of output 55 [2022-07-20 06:28:33,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-07-20 06:28:33,345 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 17 [2022-07-20 06:28:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:33,349 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:34,248 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (let ((.cse1 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse0 (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0)) (not (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) .cse0)) (= (select |c_#valid| .cse0) 1)))))) is different from false [2022-07-20 06:28:36,224 INFO L356 Elim1Store]: treesize reduction 8, result has 85.5 percent of original size [2022-07-20 06:28:36,225 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 114 [2022-07-20 06:28:36,477 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (and (forall ((v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (let ((.cse2 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (and (forall ((v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2022-07-20 06:28:36,492 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:36,493 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 06:28:36,496 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 171 treesize of output 165 [2022-07-20 06:28:36,500 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 210 treesize of output 202 [2022-07-20 06:28:36,504 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 228 treesize of output 224 [2022-07-20 06:28:36,512 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:36,512 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 257 treesize of output 259 [2022-07-20 06:28:36,565 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:28:36,566 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 133 treesize of output 1 [2022-07-20 06:28:36,571 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:36,571 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 52 treesize of output 45 [2022-07-20 06:28:36,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:36,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 63 treesize of output 57 [2022-07-20 06:28:36,580 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:36,581 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 0 case distinctions, treesize of input 103 treesize of output 91 [2022-07-20 06:28:36,587 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:36,588 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:36,593 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:36,594 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 126 treesize of output 120 [2022-07-20 06:28:36,845 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-07-20 06:28:36,846 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801497423] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:36,846 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:36,846 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 19] total 54 [2022-07-20 06:28:36,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168291814] [2022-07-20 06:28:36,846 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:36,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-07-20 06:28:36,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:36,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-07-20 06:28:36,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=2570, Unknown=3, NotChecked=206, Total=2970 [2022-07-20 06:28:36,848 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 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-07-20 06:28:37,588 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (and (forall ((v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((v_ArrVal_1410 (Array Int Int)) (v_ArrVal_1409 (Array Int Int))) (let ((.cse2 (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1409) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1410) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (or (and (forall ((v_prenex_6 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) (select .cse1 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| .cse2)))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_9 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) is different from false [2022-07-20 06:28:38,137 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (let ((.cse2 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (let ((.cse1 (select .cse2 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|))) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse1)) (not (= (select .cse2 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) .cse1)) (= (select |c_#valid| .cse1) 1)))))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-20 06:28:39,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:39,218 INFO L93 Difference]: Finished difference Result 80 states and 84 transitions. [2022-07-20 06:28:39,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:28:39,219 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 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 36 [2022-07-20 06:28:39,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:39,219 INFO L225 Difference]: With dead ends: 80 [2022-07-20 06:28:39,219 INFO L226 Difference]: Without dead ends: 80 [2022-07-20 06:28:39,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 37 SyntacticMatches, 4 SemanticMatches, 69 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1358 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=404, Invalid=4029, Unknown=5, NotChecked=532, Total=4970 [2022-07-20 06:28:39,221 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 265 mSDsluCounter, 904 mSDsCounter, 0 mSdLazyCounter, 1139 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 946 SdHoareTripleChecker+Invalid, 1671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 1139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 480 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:39,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 946 Invalid, 1671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 1139 Invalid, 0 Unknown, 480 Unchecked, 0.5s Time] [2022-07-20 06:28:39,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-07-20 06:28:39,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-07-20 06:28:39,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 77 states have (on average 1.0909090909090908) internal successors, (84), 79 states have internal predecessors, (84), 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-07-20 06:28:39,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-07-20 06:28:39,223 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 36 [2022-07-20 06:28:39,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:39,223 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-07-20 06:28:39,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 54 states have (on average 1.7222222222222223) internal successors, (93), 55 states have internal predecessors, (93), 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-07-20 06:28:39,223 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-07-20 06:28:39,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:28:39,223 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:39,223 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:39,252 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:39,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:39,436 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:39,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:39,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1472889600, now seen corresponding path program 1 times [2022-07-20 06:28:39,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:39,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204411950] [2022-07-20 06:28:39,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:39,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:39,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:39,815 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204411950] [2022-07-20 06:28:39,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204411950] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:39,816 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079421097] [2022-07-20 06:28:39,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:39,816 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:39,816 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:39,817 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:39,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-07-20 06:28:39,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:39,954 INFO L263 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 53 conjunts are in the unsatisfiable core [2022-07-20 06:28:39,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:39,958 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-07-20 06:28:39,987 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:39,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 14 [2022-07-20 06:28:40,047 INFO L356 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-07-20 06:28:40,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-07-20 06:28:40,077 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:28:40,111 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:40,111 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 1 case distinctions, treesize of input 19 treesize of output 22 [2022-07-20 06:28:40,166 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 15 treesize of output 17 [2022-07-20 06:28:40,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2022-07-20 06:28:40,305 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:40,317 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:40,317 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 41 [2022-07-20 06:28:40,526 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:28:40,526 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 12 treesize of output 18 [2022-07-20 06:28:40,618 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:28:40,619 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 32 treesize of output 38 [2022-07-20 06:28:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:40,662 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:40,862 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 78 treesize of output 74 [2022-07-20 06:28:40,954 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2022-07-20 06:28:40,977 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-20 06:28:40,984 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1502 (Array Int Int)) (v_ArrVal_1501 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1501) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1502) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) is different from false [2022-07-20 06:28:40,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:40,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-07-20 06:28:40,993 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 85 treesize of output 81 [2022-07-20 06:28:40,998 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 87 treesize of output 85 [2022-07-20 06:28:41,005 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:41,005 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 105 treesize of output 109 [2022-07-20 06:28:41,010 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 122 treesize of output 118 [2022-07-20 06:28:41,057 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:41,058 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 27 treesize of output 28 [2022-07-20 06:28:41,060 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:41,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 43 treesize of output 39 [2022-07-20 06:28:41,065 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:41,066 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 0 case distinctions, treesize of input 52 treesize of output 48 [2022-07-20 06:28:41,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:41,073 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 6 treesize of output 4 [2022-07-20 06:28:41,212 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:28:41,212 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079421097] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:28:41,212 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:28:41,212 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 49 [2022-07-20 06:28:41,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931688221] [2022-07-20 06:28:41,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:28:41,213 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-20 06:28:41,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:28:41,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-20 06:28:41,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=1969, Unknown=3, NotChecked=276, Total=2450 [2022-07-20 06:28:41,214 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 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-07-20 06:28:42,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:28:42,227 INFO L93 Difference]: Finished difference Result 78 states and 82 transitions. [2022-07-20 06:28:42,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:28:42,228 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 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 37 [2022-07-20 06:28:42,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:28:42,228 INFO L225 Difference]: With dead ends: 78 [2022-07-20 06:28:42,228 INFO L226 Difference]: Without dead ends: 78 [2022-07-20 06:28:42,229 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 65 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1125 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=486, Invalid=3555, Unknown=3, NotChecked=378, Total=4422 [2022-07-20 06:28:42,229 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 536 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 610 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 536 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 1168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 610 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 447 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:28:42,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [536 Valid, 569 Invalid, 1168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 610 Invalid, 0 Unknown, 447 Unchecked, 0.3s Time] [2022-07-20 06:28:42,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-07-20 06:28:42,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2022-07-20 06:28:42,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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-07-20 06:28:42,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-07-20 06:28:42,232 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 37 [2022-07-20 06:28:42,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:28:42,232 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-07-20 06:28:42,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 50 states have internal predecessors, (102), 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-07-20 06:28:42,233 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-07-20 06:28:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-20 06:28:42,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:28:42,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:28:42,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:28:42,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 06:28:42,454 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2022-07-20 06:28:42,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:28:42,454 INFO L85 PathProgramCache]: Analyzing trace with hash -882633249, now seen corresponding path program 1 times [2022-07-20 06:28:42,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:28:42,454 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287716682] [2022-07-20 06:28:42,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:42,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:28:42,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:43,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:43,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:28:43,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287716682] [2022-07-20 06:28:43,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1287716682] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:28:43,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1679030202] [2022-07-20 06:28:43,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:28:43,109 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:28:43,109 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:28:43,110 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:28:43,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-07-20 06:28:43,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:28:43,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 60 conjunts are in the unsatisfiable core [2022-07-20 06:28:43,227 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:28:43,378 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 11 treesize of output 7 [2022-07-20 06:28:43,435 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:43,435 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 1 case distinctions, treesize of input 54 treesize of output 53 [2022-07-20 06:28:43,547 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:28:43,547 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 50 treesize of output 48 [2022-07-20 06:28:43,556 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 55 treesize of output 46 [2022-07-20 06:28:43,851 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:43,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:28:43,864 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:43,865 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 81 treesize of output 69 [2022-07-20 06:28:44,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:28:44,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:28:46,965 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-07-20 06:28:46,975 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))) (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)))) is different from false [2022-07-20 06:28:47,005 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0))))) is different from false [2022-07-20 06:28:47,017 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1595 (Array Int Int)) (v_ArrVal_1594 (Array Int Int)) (|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|)) (not (<= |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 0)) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1594) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1595) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 (+ |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset| 4)) 0) (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.offset|) 0)) |c_ULTIMATE.start_main_old_#valid#1|))) is different from false [2022-07-20 06:28:47,024 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:47,024 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2022-07-20 06:28:47,027 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 342 treesize of output 332 [2022-07-20 06:28:47,035 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:47,037 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 0 case distinctions, treesize of input 345 treesize of output 321 [2022-07-20 06:28:47,043 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:47,044 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 0 case distinctions, treesize of input 848 treesize of output 800 [2022-07-20 06:28:47,049 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:28:47,058 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:28:47,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 988 treesize of output 980 [2022-07-20 06:31:36,839 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse193 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse18 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse28 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse29 (< .cse193 0)) (.cse30 (< 0 .cse193)) (.cse21 (<= 0 .cse193)) (.cse20 (<= .cse193 0)) (.cse19 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse22 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (let ((.cse0 (not .cse22)) (.cse1 (not .cse19)) (.cse55 (not .cse20)) (.cse56 (not .cse21)) (.cse7 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse23 (or .cse28 .cse29 .cse30)) (.cse5 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse6 (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse4 (not .cse18))) (and (or (forall ((v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (forall ((v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (and (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) .cse0 .cse1) (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse2 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse3 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse2 (select (store .cse3 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse2 (select (store .cse3 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))) .cse4 .cse5 .cse6) (or .cse7 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse16 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse17 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (let ((.cse10 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse15 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse8 (and (or .cse10 (<= .cse15 0)) (<= 0 .cse15) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (.cse9 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse8 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (or .cse9 .cse8) (or (and (or .cse10 .cse9) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse11 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse12 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse11 (select (store .cse12 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse14 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse13 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse13 (<= .cse14 0)) (<= 0 .cse14) (or .cse13 (= .cse11 (select (store .cse12 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))))) (or (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (< .cse15 0) (< 0 .cse15))) (= .cse16 (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (= .cse16 (select (store .cse17 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))) .cse18 (and (or .cse19 .cse20) .cse21 .cse22)) (or (and .cse23 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse24 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse25 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse24 (select (store .cse25 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse27 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse26 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse26 (<= .cse27 0)) (<= 0 .cse27) (or .cse26 (= .cse24 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))))))) .cse4) (or .cse28 .cse29 .cse4 .cse30) (or .cse29 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse30) (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse31 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse32 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse31 (select (store .cse32 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse36 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse35 (let ((.cse37 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or .cse36 (<= .cse37 0)) (<= 0 .cse37) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))))) (let ((.cse33 (or .cse35 (forall ((v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (.cse34 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (and .cse33 (or .cse34 .cse35) (or (= .cse31 (select (store .cse32 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and .cse33 (or .cse36 .cse34)))))))))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse38 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (not .cse38)) (and (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse38)))) .cse29 .cse30) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse52 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse51 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse54 (store .cse52 v_arrayElimCell_195 0))) (or (let ((.cse53 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse41 (<= 0 .cse53)) (.cse40 (= .cse51 (select (store .cse54 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (.cse39 (<= .cse53 0)) (.cse43 (= .cse51 (select (store (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (and (or (not .cse39) .cse40 (not .cse41) (forall ((v_arrayElimCell_197 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (or (let ((.cse42 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse42 .cse39) .cse41 (or .cse42 .cse40) (or .cse43 .cse39) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (or (forall ((v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) .cse43 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse46 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse45 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse47 (store .cse46 v_arrayElimCell_197 0))) (or (let ((.cse49 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse44 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse48 (<= .cse49 0))) (and (or .cse44 (= .cse45 (select (store (store .cse46 v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or .cse44 .cse48) (<= 0 .cse49) (let ((.cse50 (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse45 (select (store .cse50 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse50 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) .cse48)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)))) (= .cse45 (select (store .cse47 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))))))))) (= .cse51 (select (store .cse54 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))))) (or .cse55 .cse56 (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_197 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (and (forall ((v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse1)) .cse4) (or (and (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) .cse1) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse60 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse57 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse58 (store .cse60 v_arrayElimCell_197 0))) (or (and (or (= .cse57 (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (or (let ((.cse59 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (<= 0 .cse59) (<= .cse59 0))) (= .cse57 (select (store (store .cse60 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (= .cse57 (select (store .cse58 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse55 .cse56)) (not .cse7)) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse95 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse75 (store .cse95 v_arrayElimCell_197 0))) (or (let ((.cse64 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse66 (not .cse64)) (.cse65 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse73 (or (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) (= .cse74 (select (store (store .cse95 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (and (or (forall ((v_arrayElimCell_199 Int)) (let ((.cse61 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse62 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (= .cse61 (select (store .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse61 (select (store .cse62 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (let ((.cse63 (and (or (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= .cse65 0)) (<= 0 .cse65) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))) (and (or .cse63 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (or .cse64 .cse63)))) (or .cse66 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse70 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse72 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (let ((.cse68 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse69 (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse67 (<= .cse68 0))) (and (or (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse67) (<= 0 .cse68) (or .cse69 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (let ((.cse71 (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse70 (select (store .cse71 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) .cse69 (= .cse70 (select (store .cse71 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) .cse67)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))) (= .cse70 (select (store (store .cse72 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) .cse73)) (or (= .cse74 (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (or .cse66 (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse83 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse77 (store .cse83 v_arrayElimCell_195 0)) (.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse76 (select (store .cse77 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse80 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse78 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse81 (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse79 (<= .cse80 0))) (and (or .cse78 .cse79) (<= 0 .cse80) (or .cse78 (= .cse76 (select (store .cse77 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or .cse81 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (let ((.cse82 (store .cse83 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse76 (select (store .cse82 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) .cse81 (= .cse76 (select (store .cse82 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) .cse79)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))))))) (or (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (< .cse65 0) (< 0 .cse65)) .cse73)) (forall ((v_arrayElimCell_199 Int)) (let ((.cse88 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse89 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (let ((.cse94 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse85 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse84 (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse86 (< .cse94 0)) (.cse87 (< 0 .cse94))) (and (or (and .cse84 .cse85) .cse86 .cse87) (or (= .cse88 (select (store .cse89 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse90 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse91 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse90 (select (store .cse91 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse93 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse92 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse92 (<= .cse93 0)) (<= 0 .cse93) (or .cse92 (= .cse90 (select (store .cse91 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))))) (or .cse85 (and (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (or .cse84 .cse86 .cse87)))))) (= .cse88 (select (store .cse89 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (= .cse74 (select (store .cse75 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))))) (or .cse55 .cse56 (forall ((v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_arrayElimCell_197 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (and (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse133 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse96 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse97 (store .cse133 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (or (= .cse96 (select .cse97 v_antiDerIndex_entry0_1)) (let ((.cse134 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse114 (<= 0 .cse134)) (.cse113 (<= .cse134 0))) (let ((.cse98 (= .cse96 (select (store .cse97 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (.cse99 (not .cse113)) (.cse100 (not .cse114)) (.cse101 (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse110 (= .cse96 (select (store (store .cse133 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (.cse102 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse109 (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (.cse111 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse112 (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse98 .cse99 .cse100 (and .cse101 .cse102) (forall ((v_arrayElimCell_197 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (or (let ((.cse108 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse107 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse104 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (or (= .cse103 (select (store (store .cse104 v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse106 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse105 (<= .cse106 0))) (and (or (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse105) (<= 0 .cse106) (or (= .cse103 (select (store (store .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) .cse105) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))))))) (or .cse98 (and (or .cse99 .cse101 .cse100) .cse102 (or (and (or (not .cse107) (not .cse108)) .cse101) .cse109))) (or .cse110 .cse109 .cse111 .cse112) (or .cse102 (and (or .cse108 .cse113) .cse114 .cse107)))) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_arrayElimCell_197 Int) (v_arrayElimCell_198 Int)) (let ((.cse132 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse116 (store .cse132 v_arrayElimCell_197 0)) (.cse115 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse115 (select (store .cse116 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (let ((.cse131 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse123 (= .cse115 (select (store (store .cse132 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) (.cse122 (<= .cse131 0))) (let ((.cse118 (<= 0 .cse131)) (.cse119 (or .cse123 .cse122)) (.cse120 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse121 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse117 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse117 (and .cse118 .cse119 .cse120)) (or (and (or .cse121 .cse122) .cse118 .cse119 .cse120) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (or (forall ((v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) .cse123 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (or (= .cse115 (select (store .cse116 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (or .cse121 .cse117) (forall ((v_arrayElimCell_196 Int)) (let ((.cse124 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse125 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse124 (select (store .cse125 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse127 (= .cse124 (select (store .cse125 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (and (or (let ((.cse126 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (<= 0 .cse126) (<= .cse126 0))) (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) .cse127) (or .cse127 (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (< 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))))) (forall ((v_arrayElimCell_196 Int)) (let ((.cse128 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse129 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (or (= .cse128 (select (store .cse129 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse130 (= .cse128 (select (store .cse129 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)))) (and (or (not (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (not (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) .cse130) (or (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) .cse130)))))) (or (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (< .cse131 0) (< 0 .cse131)))))))))))) (or (forall ((v_arrayElimCell_198 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_198 0) v_antiDerIndex_entry0_1))) .cse110 (and .cse102 .cse109) .cse111 .cse112))))))))) (or .cse7 (and (or (and (forall ((v_arrayElimCell_195 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_196 Int)) (let ((.cse140 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse136 (store .cse140 v_arrayElimCell_195 0)) (.cse135 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse135 (select (store .cse136 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse139 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse137 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse138 (<= .cse139 0)) (.cse141 (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse137 .cse138) (<= 0 .cse139) (or .cse137 (= .cse135 (select (store .cse136 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or (= .cse135 (select (store (store .cse140 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) .cse141 .cse138) (or .cse141 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))))))) .cse23 (or (forall ((v_arrayElimCell_196 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))) .cse5 .cse6)) .cse4) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_199 Int)) (let ((.cse146 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse147 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (let ((.cse152 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse143 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse142 (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse144 (< .cse152 0)) (.cse145 (< 0 .cse152))) (and (or (and .cse142 .cse143) .cse144 .cse145) (or (= .cse146 (select (store .cse147 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse149 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse148 (select (store .cse149 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse151 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse150 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse150 (<= .cse151 0)) (<= 0 .cse151) (or .cse150 (= .cse148 (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))))) (or .cse143 (and (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (or .cse142 .cse144 .cse145)))))) (= .cse146 (select (store .cse147 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse29 .cse30 (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int)) (or (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (let ((.cse155 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse154 (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse153 (not .cse155))) (and (or (and (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse153) (and .cse154 .cse155)) (or .cse154 .cse153))))))) (forall ((v_arrayElimCell_197 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_198 Int)) (let ((.cse156 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse157 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_197 0))) (or (= .cse156 (select (store .cse157 v_arrayElimCell_198 0) v_antiDerIndex_entry0_1)) (let ((.cse185 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse190 (or (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= .cse185 0))) (.cse191 (<= 0 .cse185)) (.cse192 (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (let ((.cse184 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse188 (and .cse190 .cse191 .cse192)) (.cse189 (forall ((v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (let ((.cse158 (or .cse184 .cse188 .cse189)) (.cse186 (and .cse190 .cse191 (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) .cse192) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (.cse183 (not .cse184)) (.cse187 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1))))) (and (or (= .cse156 (select (store .cse157 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (let ((.cse180 (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse181 (< .cse185 0)) (.cse182 (< 0 .cse185))) (and .cse158 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse160 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse159 (select (store .cse160 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse164 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (let ((.cse163 (let ((.cse165 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or .cse164 (<= .cse165 0)) (<= 0 .cse165) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))))) (let ((.cse161 (or .cse163 (forall ((v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (.cse162 (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (and .cse161 (or .cse162 .cse163) (or (= .cse159 (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (and .cse161 (or .cse164 .cse162)))))))))) (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse175 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0))) (or (let ((.cse168 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (.cse173 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (let ((.cse166 (and (or .cse168 (<= .cse173 0)) (<= 0 .cse173) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (.cse167 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or .cse166 (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)))) (or .cse167 .cse166) (or (and (or .cse168 .cse167) (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse169 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse170 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse169 (select (store .cse170 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse172 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse171 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse171 (<= .cse172 0)) (<= 0 .cse172) (or .cse171 (= .cse169 (select (store .cse170 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))))) (or (forall ((v_arrayElimCell_195 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (< .cse173 0) (< 0 .cse173))) (= .cse174 (select (store .cse175 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (= .cse174 (select (store .cse175 v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_195 Int) (v_arrayElimCell_196 Int)) (let ((.cse176 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse177 (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_195 0))) (or (= .cse176 (select (store .cse177 v_arrayElimCell_196 0) v_antiDerIndex_entry0_1)) (let ((.cse179 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse178 (<= 0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) (and (or .cse178 (<= .cse179 0)) (<= 0 .cse179) (or .cse178 (= .cse176 (select (store .cse177 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (or (<= 4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (<= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)))))) (or .cse180 .cse181 .cse182)) .cse183) (or (forall ((v_arrayElimCell_199 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (and .cse180 .cse184) .cse181 .cse182) (or .cse180 .cse181 .cse183 .cse182)))) .cse158 (or (forall ((v_arrayElimCell_199 Int) (v_arrayElimCell_201 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) v_arrayElimCell_199 0) v_arrayElimCell_201 0) v_antiDerIndex_entry0_1))) (and (or .cse186 .cse187) (or .cse184 .cse186))) (or .cse183 .cse186 .cse187) (or (and (or .cse188 .cse189) (or .cse183 .cse188)) .cse187))))))))))))) is different from false