./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/termination-crafted/4BitCounterPointer.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-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 64bit --witnessprinter.graph.data.programhash 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:33:48,057 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:33:48,059 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:33:48,093 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:33:48,094 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:33:48,095 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:33:48,099 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:33:48,101 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:33:48,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:33:48,107 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:33:48,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:33:48,110 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:33:48,110 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:33:48,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:33:48,113 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:33:48,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:33:48,115 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:33:48,116 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:33:48,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:33:48,125 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:33:48,127 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:33:48,127 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:33:48,128 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:33:48,129 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:33:48,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:33:48,137 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:33:48,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:33:48,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:33:48,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:33:48,139 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:33:48,140 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:33:48,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:33:48,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:33:48,143 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:33:48,143 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:33:48,144 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:33:48,144 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:33:48,145 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:33:48,145 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:33:48,145 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:33:48,146 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:33:48,148 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:33:48,149 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2022-07-20 06:33:48,177 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:33:48,177 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:33:48,177 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:33:48,178 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:33:48,178 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:33:48,179 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:33:48,179 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:33:48,179 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:33:48,180 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:33:48,180 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:33:48,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:33:48,181 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:33:48,181 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:33:48,181 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:33:48,181 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:33:48,182 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:33:48,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:33:48,182 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:33:48,182 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:33:48,182 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:33:48,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:33:48,183 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:33:48,183 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:33:48,183 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:33:48,183 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:33:48,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:33:48,184 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:33:48,184 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 7e6a17b7d4143542ba439290f9741c160a8cb32cc90a0cc2a238a67702990ba0 [2022-07-20 06:33:48,433 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:33:48,460 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:33:48,462 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:33:48,464 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:33:48,465 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:33:48,466 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-07-20 06:33:48,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc87fbd2/3ef11581332f4e3593085b76fa359fd3/FLAGce9f17ad9 [2022-07-20 06:33:48,953 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:33:48,953 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-crafted/4BitCounterPointer.c [2022-07-20 06:33:48,960 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc87fbd2/3ef11581332f4e3593085b76fa359fd3/FLAGce9f17ad9 [2022-07-20 06:33:49,364 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fc87fbd2/3ef11581332f4e3593085b76fa359fd3 [2022-07-20 06:33:49,366 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:33:49,367 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:33:49,370 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:33:49,370 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:33:49,373 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:33:49,374 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,374 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7662a154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49, skipping insertion in model container [2022-07-20 06:33:49,375 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,380 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:33:49,390 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:33:49,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:33:49,573 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:33:49,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:33:49,598 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:33:49,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49 WrapperNode [2022-07-20 06:33:49,600 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:33:49,602 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:33:49,602 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:33:49,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:33:49,608 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:33:49" (1/1) ... [2022-07-20 06:33:49,615 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:33:49" (1/1) ... [2022-07-20 06:33:49,634 INFO L137 Inliner]: procedures = 7, calls = 29, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 61 [2022-07-20 06:33:49,635 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:33:49,636 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:33:49,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:33:49,637 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:33:49,643 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,643 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,652 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,653 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,670 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,671 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,673 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:33:49,677 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:33:49,677 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:33:49,678 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:33:49,679 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (1/1) ... [2022-07-20 06:33:49,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:33:49,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:33:49,713 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:33:49,740 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:33:49,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:33:49,756 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:33:49,757 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:33:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:33:49,757 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 06:33:49,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:33:49,818 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:33:49,820 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:33:50,051 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:33:50,056 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:33:50,057 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 06:33:50,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:33:50 BoogieIcfgContainer [2022-07-20 06:33:50,059 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:33:50,060 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:33:50,060 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:33:50,064 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:33:50,064 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:33:49" (1/3) ... [2022-07-20 06:33:50,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242e44cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:33:50, skipping insertion in model container [2022-07-20 06:33:50,065 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:33:49" (2/3) ... [2022-07-20 06:33:50,065 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@242e44cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:33:50, skipping insertion in model container [2022-07-20 06:33:50,066 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:33:50" (3/3) ... [2022-07-20 06:33:50,067 INFO L111 eAbstractionObserver]: Analyzing ICFG 4BitCounterPointer.c [2022-07-20 06:33:50,079 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:33:50,099 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-07-20 06:33:50,153 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:33:50,162 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@4a18eb3e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4cce985a [2022-07-20 06:33:50,162 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-07-20 06:33:50,166 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 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:33:50,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:33:50,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:50,175 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:33:50,175 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:50,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:33:50,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:50,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896507372] [2022-07-20 06:33:50,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:50,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:50,471 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:33:50,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:50,473 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896507372] [2022-07-20 06:33:50,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896507372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:50,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:50,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:50,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073868572] [2022-07-20 06:33:50,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:50,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:50,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:50,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:50,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:50,516 INFO L87 Difference]: Start difference. First operand has 56 states, 24 states have (on average 2.5) internal successors, (60), 55 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:50,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:50,601 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2022-07-20 06:33:50,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:50,604 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-07-20 06:33:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:50,611 INFO L225 Difference]: With dead ends: 52 [2022-07-20 06:33:50,612 INFO L226 Difference]: Without dead ends: 50 [2022-07-20 06:33:50,614 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:33:50,619 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 49 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:50,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 25 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:33:50,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-20 06:33:50,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-07-20 06:33:50,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 23 states have (on average 2.3043478260869565) internal successors, (53), 49 states have internal predecessors, (53), 0 states have call successors, (0), 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:33:50,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2022-07-20 06:33:50,651 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 3 [2022-07-20 06:33:50,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:50,652 INFO L495 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2022-07-20 06:33:50,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2022-07-20 06:33:50,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:33:50,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:50,653 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:33:50,654 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:33:50,654 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:50,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:50,655 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:33:50,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:50,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186564023] [2022-07-20 06:33:50,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:50,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:50,712 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:33:50,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:50,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186564023] [2022-07-20 06:33:50,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186564023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:50,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:50,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:50,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979528952] [2022-07-20 06:33:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:50,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:50,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:50,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:50,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:50,717 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:50,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:50,782 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-07-20 06:33:50,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:50,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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 3 [2022-07-20 06:33:50,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:50,784 INFO L225 Difference]: With dead ends: 46 [2022-07-20 06:33:50,784 INFO L226 Difference]: Without dead ends: 46 [2022-07-20 06:33:50,784 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:33:50,786 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 47 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:50,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 24 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:33:50,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-07-20 06:33:50,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-07-20 06:33:50,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 23 states have (on average 2.130434782608696) internal successors, (49), 45 states have internal predecessors, (49), 0 states have call successors, (0), 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:33:50,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2022-07-20 06:33:50,792 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 3 [2022-07-20 06:33:50,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:50,793 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2022-07-20 06:33:50,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 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:33:50,793 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2022-07-20 06:33:50,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-20 06:33:50,794 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:50,794 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-20 06:33:50,794 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:33:50,794 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:50,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:50,795 INFO L85 PathProgramCache]: Analyzing trace with hash 925543, now seen corresponding path program 1 times [2022-07-20 06:33:50,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:50,796 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072230283] [2022-07-20 06:33:50,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:50,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:50,835 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:33:50,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:50,842 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072230283] [2022-07-20 06:33:50,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072230283] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:50,854 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:50,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:50,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817143711] [2022-07-20 06:33:50,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:50,856 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:50,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:50,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:50,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:50,857 INFO L87 Difference]: Start difference. First operand 46 states and 49 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:33:50,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:50,906 INFO L93 Difference]: Finished difference Result 42 states and 45 transitions. [2022-07-20 06:33:50,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:50,907 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:33:50,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:50,908 INFO L225 Difference]: With dead ends: 42 [2022-07-20 06:33:50,908 INFO L226 Difference]: Without dead ends: 42 [2022-07-20 06:33:50,908 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:33:50,909 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 40 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:50,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 18 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:50,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-07-20 06:33:50,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-07-20 06:33:50,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 23 states have (on average 1.9565217391304348) internal successors, (45), 41 states have internal predecessors, (45), 0 states have call successors, (0), 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:33:50,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2022-07-20 06:33:50,927 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 4 [2022-07-20 06:33:50,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:50,927 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2022-07-20 06:33:50,927 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:33:50,928 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2022-07-20 06:33:50,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-07-20 06:33:50,928 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:50,928 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2022-07-20 06:33:50,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:33:50,929 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:50,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:50,929 INFO L85 PathProgramCache]: Analyzing trace with hash 925544, now seen corresponding path program 1 times [2022-07-20 06:33:50,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:50,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [555198476] [2022-07-20 06:33:50,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:50,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:50,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:50,974 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:33:50,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:50,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [555198476] [2022-07-20 06:33:50,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [555198476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:50,975 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:50,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:50,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364715721] [2022-07-20 06:33:50,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:50,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:50,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:50,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:50,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:50,977 INFO L87 Difference]: Start difference. First operand 42 states and 45 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:33:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:51,008 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-07-20 06:33:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:51,008 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:33:51,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:51,024 INFO L225 Difference]: With dead ends: 38 [2022-07-20 06:33:51,024 INFO L226 Difference]: Without dead ends: 38 [2022-07-20 06:33:51,024 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:33:51,026 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 38 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 20 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:51,026 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 20 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:51,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-07-20 06:33:51,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-07-20 06:33:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 37 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:51,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-07-20 06:33:51,031 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 4 [2022-07-20 06:33:51,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:51,031 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-07-20 06:33:51,032 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:33:51,032 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-07-20 06:33:51,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:33:51,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:51,032 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:33:51,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:33:51,033 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:51,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:51,034 INFO L85 PathProgramCache]: Analyzing trace with hash 28691812, now seen corresponding path program 1 times [2022-07-20 06:33:51,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:51,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933464255] [2022-07-20 06:33:51,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:51,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:51,098 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:33:51,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:51,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1933464255] [2022-07-20 06:33:51,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1933464255] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:51,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:51,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:51,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237887942] [2022-07-20 06:33:51,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:51,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:51,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:51,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:51,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:51,101 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:33:51,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:51,133 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-07-20 06:33:51,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:51,134 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-20 06:33:51,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:51,135 INFO L225 Difference]: With dead ends: 34 [2022-07-20 06:33:51,135 INFO L226 Difference]: Without dead ends: 34 [2022-07-20 06:33:51,135 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:33:51,137 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:51,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 14 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:51,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-20 06:33:51,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-07-20 06:33:51,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.608695652173913) internal successors, (37), 33 states have internal predecessors, (37), 0 states have call successors, (0), 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:33:51,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2022-07-20 06:33:51,141 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 5 [2022-07-20 06:33:51,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:51,142 INFO L495 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2022-07-20 06:33:51,142 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:33:51,142 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2022-07-20 06:33:51,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-07-20 06:33:51,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:51,143 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-07-20 06:33:51,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:33:51,143 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:51,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:51,144 INFO L85 PathProgramCache]: Analyzing trace with hash 28691813, now seen corresponding path program 1 times [2022-07-20 06:33:51,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:51,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122750422] [2022-07-20 06:33:51,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:51,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:51,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:51,200 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:33:51,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:51,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122750422] [2022-07-20 06:33:51,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122750422] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:51,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:51,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:51,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731002135] [2022-07-20 06:33:51,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:51,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:51,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:51,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:51,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:51,207 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:33:51,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:51,246 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-07-20 06:33:51,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:51,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-07-20 06:33:51,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:51,249 INFO L225 Difference]: With dead ends: 30 [2022-07-20 06:33:51,249 INFO L226 Difference]: Without dead ends: 30 [2022-07-20 06:33:51,249 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:33:51,251 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 29 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:51,251 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 16 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:51,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-07-20 06:33:51,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-07-20 06:33:51,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.434782608695652) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:51,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2022-07-20 06:33:51,255 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 5 [2022-07-20 06:33:51,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:51,255 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2022-07-20 06:33:51,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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:33:51,256 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2022-07-20 06:33:51,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:33:51,256 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:51,256 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:33:51,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:33:51,257 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:51,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:51,257 INFO L85 PathProgramCache]: Analyzing trace with hash 889446154, now seen corresponding path program 1 times [2022-07-20 06:33:51,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:51,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570250756] [2022-07-20 06:33:51,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:51,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:51,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:51,295 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:33:51,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:51,296 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570250756] [2022-07-20 06:33:51,296 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570250756] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:51,296 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:51,296 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:51,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377529957] [2022-07-20 06:33:51,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:51,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:51,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:51,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:51,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:51,298 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:51,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:51,339 INFO L93 Difference]: Finished difference Result 27 states and 30 transitions. [2022-07-20 06:33:51,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:51,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 06:33:51,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:51,342 INFO L225 Difference]: With dead ends: 27 [2022-07-20 06:33:51,342 INFO L226 Difference]: Without dead ends: 27 [2022-07-20 06:33:51,343 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:33:51,347 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 23 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:51,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 11 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:51,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-07-20 06:33:51,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-07-20 06:33:51,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 26 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:33:51,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2022-07-20 06:33:51,351 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 6 [2022-07-20 06:33:51,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:51,351 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2022-07-20 06:33:51,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:51,352 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2022-07-20 06:33:51,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-07-20 06:33:51,352 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:51,352 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-07-20 06:33:51,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:33:51,352 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:51,353 INFO L85 PathProgramCache]: Analyzing trace with hash 889446155, now seen corresponding path program 1 times [2022-07-20 06:33:51,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:51,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101027262] [2022-07-20 06:33:51,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:51,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:51,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:51,393 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:33:51,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:51,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101027262] [2022-07-20 06:33:51,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101027262] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:51,394 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:51,394 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:33:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604552301] [2022-07-20 06:33:51,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:51,395 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:33:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:51,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:33:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:33:51,396 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:51,425 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-07-20 06:33:51,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:33:51,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-07-20 06:33:51,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:51,426 INFO L225 Difference]: With dead ends: 24 [2022-07-20 06:33:51,426 INFO L226 Difference]: Without dead ends: 24 [2022-07-20 06:33:51,426 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:33:51,427 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:51,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 13 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:51,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-07-20 06:33:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-07-20 06:33:51,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 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:33:51,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-07-20 06:33:51,431 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 6 [2022-07-20 06:33:51,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:51,433 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-07-20 06:33:51,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:51,433 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-07-20 06:33:51,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-07-20 06:33:51,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:51,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:51,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 06:33:51,434 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:51,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961648, now seen corresponding path program 1 times [2022-07-20 06:33:51,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:51,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846839970] [2022-07-20 06:33:51,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:51,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:51,499 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:33:51,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:51,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846839970] [2022-07-20 06:33:51,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846839970] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:51,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:51,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:33:51,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930579651] [2022-07-20 06:33:51,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:51,500 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:33:51,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:51,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:33:51,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:33:51,501 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:33:51,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:51,564 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-20 06:33:51,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:33:51,565 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:33:51,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:51,566 INFO L225 Difference]: With dead ends: 39 [2022-07-20 06:33:51,566 INFO L226 Difference]: Without dead ends: 39 [2022-07-20 06:33:51,566 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:33:51,567 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 10 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:51,567 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 39 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:33:51,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-07-20 06:33:51,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 26. [2022-07-20 06:33:51,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.16) internal successors, (29), 25 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:33:51,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2022-07-20 06:33:51,571 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 10 [2022-07-20 06:33:51,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:51,572 INFO L495 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2022-07-20 06:33:51,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 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:33:51,572 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2022-07-20 06:33:51,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:33:51,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:51,573 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:51,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 06:33:51,573 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:51,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:51,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1456723757, now seen corresponding path program 1 times [2022-07-20 06:33:51,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:51,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430851660] [2022-07-20 06:33:51,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:51,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:51,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:51,687 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:51,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430851660] [2022-07-20 06:33:51,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1430851660] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:33:51,687 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [65816161] [2022-07-20 06:33:51,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:51,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:33:51,688 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:33:51,689 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:33:51,692 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:33:51,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:51,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 21 conjunts are in the unsatisfiable core [2022-07-20 06:33:51,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:51,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 16 [2022-07-20 06:33:51,888 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:33:51,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 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:33:51,957 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:33:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:51,963 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:33:51,979 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_225) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-20 06:33:52,008 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:33:52,009 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 18 treesize of output 19 [2022-07-20 06:33:52,012 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 30 treesize of output 22 [2022-07-20 06:33:52,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:33:52,036 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [65816161] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:33:52,036 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:33:52,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 7 [2022-07-20 06:33:52,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443968577] [2022-07-20 06:33:52,037 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:33:52,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:33:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:52,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:33:52,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=20, Unknown=1, NotChecked=8, Total=42 [2022-07-20 06:33:52,038 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:33:52,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:52,103 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2022-07-20 06:33:52,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:33:52,103 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:33:52,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:52,104 INFO L225 Difference]: With dead ends: 41 [2022-07-20 06:33:52,104 INFO L226 Difference]: Without dead ends: 41 [2022-07-20 06:33:52,104 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=26, Unknown=1, NotChecked=10, Total=56 [2022-07-20 06:33:52,105 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 35 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:52,105 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 48 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 60 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-07-20 06:33:52,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-07-20 06:33:52,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-07-20 06:33:52,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1785714285714286) internal successors, (33), 28 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:33:52,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2022-07-20 06:33:52,108 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 15 [2022-07-20 06:33:52,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:52,109 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2022-07-20 06:33:52,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 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:33:52,109 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2022-07-20 06:33:52,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:33:52,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:52,110 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:52,139 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:33:52,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-07-20 06:33:52,332 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:52,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:52,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1715432197, now seen corresponding path program 1 times [2022-07-20 06:33:52,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:52,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738644172] [2022-07-20 06:33:52,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:52,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:52,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:52,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:52,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:52,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738644172] [2022-07-20 06:33:52,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738644172] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:33:52,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:33:52,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:33:52,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902903305] [2022-07-20 06:33:52,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:33:52,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:33:52,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:52,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:33:52,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:33:52,768 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:33:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:53,128 INFO L93 Difference]: Finished difference Result 55 states and 65 transitions. [2022-07-20 06:33:53,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:33:53,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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 18 [2022-07-20 06:33:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:53,130 INFO L225 Difference]: With dead ends: 55 [2022-07-20 06:33:53,130 INFO L226 Difference]: Without dead ends: 55 [2022-07-20 06:33:53,130 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:33:53,131 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 71 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:53,131 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 70 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:33:53,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-07-20 06:33:53,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 33. [2022-07-20 06:33:53,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.15625) internal successors, (37), 32 states have internal predecessors, (37), 0 states have call successors, (0), 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:33:53,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2022-07-20 06:33:53,134 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 18 [2022-07-20 06:33:53,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:53,134 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2022-07-20 06:33:53,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 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:33:53,135 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2022-07-20 06:33:53,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:33:53,135 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:53,135 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:33:53,135 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:33:53,136 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:53,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:53,137 INFO L85 PathProgramCache]: Analyzing trace with hash -2128935000, now seen corresponding path program 1 times [2022-07-20 06:33:53,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:53,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683177593] [2022-07-20 06:33:53,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:53,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:33:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:53,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683177593] [2022-07-20 06:33:53,377 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683177593] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:33:53,377 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [881286856] [2022-07-20 06:33:53,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:53,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:33:53,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:33:53,379 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:33:53,402 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:33:53,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:53,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:33:53,474 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:53,490 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 51 treesize of output 49 [2022-07-20 06:33:53,554 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:33:53,651 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:33:53,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-20 06:33:53,687 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:33:53,714 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:33:53,716 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:53,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:33:53,725 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-20 06:33:53,737 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_326 (Array Int Int)) (v_ArrVal_325 (Array Int Int))) (= 0 (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_326) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|))) is different from false [2022-07-20 06:33:53,798 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 67 treesize of output 59 [2022-07-20 06:33:53,803 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:33:53,807 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 38 treesize of output 34 [2022-07-20 06:33:53,898 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:33:53,899 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [881286856] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:33:53,899 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:33:53,899 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2022-07-20 06:33:53,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581027444] [2022-07-20 06:33:53,899 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:33:53,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:33:53,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:53,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:33:53,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=303, Unknown=2, NotChecked=74, Total=462 [2022-07-20 06:33:53,901 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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:33:54,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:33:54,285 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2022-07-20 06:33:54,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:33:54,286 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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 23 [2022-07-20 06:33:54,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:33:54,286 INFO L225 Difference]: With dead ends: 59 [2022-07-20 06:33:54,286 INFO L226 Difference]: Without dead ends: 59 [2022-07-20 06:33:54,287 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 41 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=683, Unknown=2, NotChecked=118, Total=1056 [2022-07-20 06:33:54,287 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 157 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:33:54,288 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 107 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 152 Invalid, 0 Unknown, 128 Unchecked, 0.1s Time] [2022-07-20 06:33:54,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-07-20 06:33:54,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-07-20 06:33:54,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 0 states have call successors, (0), 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:33:54,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 45 transitions. [2022-07-20 06:33:54,291 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 45 transitions. Word has length 23 [2022-07-20 06:33:54,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:33:54,291 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 45 transitions. [2022-07-20 06:33:54,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.727272727272727) internal successors, (60), 22 states have internal predecessors, (60), 0 states have call successors, (0), 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:33:54,292 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 45 transitions. [2022-07-20 06:33:54,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:33:54,292 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:33:54,292 INFO L195 NwaCegarLoop]: trace histogram [3, 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:33:54,321 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:33:54,503 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,SelfDestructingSolverStorable11 [2022-07-20 06:33:54,504 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:33:54,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:33:54,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1038287010, now seen corresponding path program 1 times [2022-07-20 06:33:54,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:33:54,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [266924781] [2022-07-20 06:33:54,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:54,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:33:54,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:54,986 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:33:54,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:33:54,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [266924781] [2022-07-20 06:33:54,986 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [266924781] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:33:54,986 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1864501093] [2022-07-20 06:33:54,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:33:54,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:33:54,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:33:54,989 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:33:54,990 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:33:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:33:55,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 39 conjunts are in the unsatisfiable core [2022-07-20 06:33:55,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:33:55,092 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 414 treesize of output 406 [2022-07-20 06:33:55,162 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:33:55,229 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-20 06:33:55,230 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 19 treesize of output 22 [2022-07-20 06:33:55,367 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:33:55,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 2 case distinctions, treesize of input 21 treesize of output 25 [2022-07-20 06:33:55,418 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 06:33:55,419 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 19 treesize of output 18 [2022-07-20 06:33:55,465 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:33:55,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:33:55,489 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:33:55,489 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:33:55,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-20 06:33:55,513 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-20 06:33:55,530 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-20 06:33:55,699 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:33:55,699 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 48 treesize of output 40 [2022-07-20 06:33:55,710 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:33:55,710 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 390 treesize of output 382 [2022-07-20 06:33:55,722 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 368 treesize of output 344 [2022-07-20 06:33:55,734 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 356 treesize of output 346 [2022-07-20 06:33:55,833 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 246 treesize of output 238 [2022-07-20 06:33:55,997 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:33:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:33:56,032 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1864501093] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:33:56,032 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:33:56,032 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 29 [2022-07-20 06:33:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279330483] [2022-07-20 06:33:56,032 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:33:56,033 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:33:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:33:56,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:33:56,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=534, Unknown=3, NotChecked=150, Total=812 [2022-07-20 06:33:56,034 INFO L87 Difference]: Start difference. First operand 39 states and 45 transitions. Second operand has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 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:33:56,220 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|) 0) 1) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-20 06:33:57,208 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-20 06:33:58,190 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) (and (or (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem6#1| 0)) (not .cse0)) (or .cse0 .cse1) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) .cse1 (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-07-20 06:34:00,196 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-20 06:34:00,453 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)))) (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) .cse0 (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-20 06:34:00,464 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and (or (and (= |c_ULTIMATE.start_main_~x0~0#1.offset| |c_ULTIMATE.start_main_~x3~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem5#1| 0)) (not .cse0)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (or .cse0 (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-07-20 06:34:00,483 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (forall ((v_ArrVal_402 (Array Int Int)) (v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_402))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) is different from false [2022-07-20 06:34:02,487 WARN L833 $PredicateComparison]: unable to prove that (and (or (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-20 06:34:03,261 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (and (or (and (= |c_ULTIMATE.start_main_~x3~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) (= |c_ULTIMATE.start_main_#t~mem6#1| 0)) (not .cse0)) (or .cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-07-20 06:34:05,276 WARN L833 $PredicateComparison]: unable to prove that (and (not (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0) (forall ((v_ArrVal_405 (Array Int Int)) (|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_405) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))) is different from false [2022-07-20 06:34:05,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:05,327 INFO L93 Difference]: Finished difference Result 137 states and 162 transitions. [2022-07-20 06:34:05,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-07-20 06:34:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 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 26 [2022-07-20 06:34:05,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:05,328 INFO L225 Difference]: With dead ends: 137 [2022-07-20 06:34:05,328 INFO L226 Difference]: Without dead ends: 137 [2022-07-20 06:34:05,329 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 40 SyntacticMatches, 4 SemanticMatches, 47 ConstructedPredicates, 13 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=273, Invalid=1026, Unknown=13, NotChecked=1040, Total=2352 [2022-07-20 06:34:05,330 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 105 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 358 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:05,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 244 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 311 Invalid, 0 Unknown, 358 Unchecked, 0.2s Time] [2022-07-20 06:34:05,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-07-20 06:34:05,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 77. [2022-07-20 06:34:05,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 76 states have (on average 1.2236842105263157) internal successors, (93), 76 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:34:05,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 93 transitions. [2022-07-20 06:34:05,336 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 93 transitions. Word has length 26 [2022-07-20 06:34:05,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:05,336 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 93 transitions. [2022-07-20 06:34:05,337 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.3793103448275863) internal successors, (69), 29 states have internal predecessors, (69), 0 states have call successors, (0), 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:34:05,337 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 93 transitions. [2022-07-20 06:34:05,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:34:05,337 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:05,338 INFO L195 NwaCegarLoop]: trace histogram [3, 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:34:05,364 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:34:05,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:05,552 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:34:05,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:05,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1790452235, now seen corresponding path program 1 times [2022-07-20 06:34:05,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:05,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516032001] [2022-07-20 06:34:05,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:05,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:05,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:05,825 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:34:05,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:05,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516032001] [2022-07-20 06:34:05,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516032001] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:34:05,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1127661617] [2022-07-20 06:34:05,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:05,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:05,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:34:05,828 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:34:05,831 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:34:05,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:05,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:34:05,916 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:34:05,945 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:34:05,976 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:34:05,976 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 14 treesize of output 20 [2022-07-20 06:34:05,981 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 5 treesize of output 3 [2022-07-20 06:34:06,068 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:34:06,068 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 18 treesize of output 24 [2022-07-20 06:34:06,077 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 5 treesize of output 3 [2022-07-20 06:34:06,239 INFO L356 Elim1Store]: treesize reduction 24, result has 56.4 percent of original size [2022-07-20 06:34:06,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 31 treesize of output 49 [2022-07-20 06:34:06,327 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 06:34:06,327 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 19 treesize of output 18 [2022-07-20 06:34:06,352 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:34:06,355 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:34:06,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:34:07,657 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) is different from false [2022-07-20 06:34:12,296 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int))) (or (= (select (select (let ((.cse0 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) is different from false [2022-07-20 06:34:12,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (= (select (select (let ((.cse0 (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) is different from false [2022-07-20 06:34:12,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:12,355 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 72 treesize of output 56 [2022-07-20 06:34:12,365 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:12,365 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 1032 treesize of output 1016 [2022-07-20 06:34:12,382 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:12,383 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 1182 treesize of output 1144 [2022-07-20 06:34:12,442 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:12,442 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 1074 treesize of output 1034 [2022-07-20 06:34:12,719 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 148 treesize of output 140 [2022-07-20 06:34:12,878 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 663 treesize of output 651 [2022-07-20 06:34:13,200 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2022-07-20 06:34:13,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1127661617] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:34:13,201 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:34:13,201 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 24 [2022-07-20 06:34:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710705873] [2022-07-20 06:34:13,201 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:34:13,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-07-20 06:34:13,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:13,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-07-20 06:34:13,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=333, Unknown=5, NotChecked=120, Total=552 [2022-07-20 06:34:13,203 INFO L87 Difference]: Start difference. First operand 77 states and 93 transitions. Second operand has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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:34:13,241 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int)) (v_ArrVal_480 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_480))) (or (= (select (select (let ((.cse0 (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse0 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse0 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) is different from false [2022-07-20 06:34:13,245 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (.cse2 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) (and .cse0 (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_481 (Array Int Int))) (or (= (select (select (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_481 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)))) (store .cse1 |ULTIMATE.start_main_~x1~0#1.base| (store (select .cse1 |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0))) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_481) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (or .cse0 .cse2) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not .cse2))) is different from false [2022-07-20 06:34:14,481 WARN L833 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|))) is different from false [2022-07-20 06:34:15,912 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|))) (and (= (select .cse0 |c_ULTIMATE.start_main_~x2~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x3~0#1.base|)))) is different from false [2022-07-20 06:34:17,945 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x1~0#1.base| Int)) (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base| (store (select |c_#memory_int| |ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) |c_ULTIMATE.start_main_~x2~0#1.base|) |c_ULTIMATE.start_main_~x2~0#1.offset|) 0)) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x2~0#1.base|) 0) 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0)) is different from false [2022-07-20 06:34:17,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:17,982 INFO L93 Difference]: Finished difference Result 94 states and 112 transitions. [2022-07-20 06:34:17,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 06:34:17,983 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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 27 [2022-07-20 06:34:17,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:17,983 INFO L225 Difference]: With dead ends: 94 [2022-07-20 06:34:17,984 INFO L226 Difference]: Without dead ends: 94 [2022-07-20 06:34:17,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 41 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=202, Invalid=632, Unknown=10, NotChecked=488, Total=1332 [2022-07-20 06:34:17,985 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 18 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 169 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:17,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 109 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 125 Invalid, 0 Unknown, 169 Unchecked, 0.1s Time] [2022-07-20 06:34:17,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-07-20 06:34:17,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2022-07-20 06:34:17,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.211111111111111) internal successors, (109), 90 states have internal predecessors, (109), 0 states have call successors, (0), 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:34:17,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-07-20 06:34:17,991 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 27 [2022-07-20 06:34:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:17,991 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-07-20 06:34:17,991 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.6666666666666665) internal successors, (64), 24 states have internal predecessors, (64), 0 states have call successors, (0), 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:34:17,992 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-07-20 06:34:17,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:34:17,993 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:17,993 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:18,016 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:34:18,211 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:18,212 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:34:18,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:18,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1453199205, now seen corresponding path program 2 times [2022-07-20 06:34:18,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:18,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253460326] [2022-07-20 06:34:18,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:18,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:18,368 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:34:18,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:18,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253460326] [2022-07-20 06:34:18,368 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253460326] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:34:18,368 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489220759] [2022-07-20 06:34:18,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:34:18,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:18,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:34:18,370 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:34:18,371 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:34:18,437 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 06:34:18,437 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:34:18,439 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 06:34:18,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:34:18,795 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-07-20 06:34:18,795 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:34:18,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489220759] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:18,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 06:34:18,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-07-20 06:34:18,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313117643] [2022-07-20 06:34:18,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:18,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:34:18,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:18,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:34:18,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:34:18,797 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:34:18,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:18,798 INFO L93 Difference]: Finished difference Result 118 states and 142 transitions. [2022-07-20 06:34:18,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:34:18,798 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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 31 [2022-07-20 06:34:18,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:18,799 INFO L225 Difference]: With dead ends: 118 [2022-07-20 06:34:18,799 INFO L226 Difference]: Without dead ends: 116 [2022-07-20 06:34:18,799 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:34:18,800 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 2 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 24 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:18,800 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 31 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 24 Unchecked, 0.0s Time] [2022-07-20 06:34:18,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-07-20 06:34:18,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 74. [2022-07-20 06:34:18,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.2054794520547945) internal successors, (88), 73 states have internal predecessors, (88), 0 states have call successors, (0), 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:34:18,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 88 transitions. [2022-07-20 06:34:18,815 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 88 transitions. Word has length 31 [2022-07-20 06:34:18,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:18,816 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 88 transitions. [2022-07-20 06:34:18,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 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:34:18,816 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 88 transitions. [2022-07-20 06:34:18,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-20 06:34:18,818 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:18,818 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 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:34:18,841 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:34:19,035 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,SelfDestructingSolverStorable14 [2022-07-20 06:34:19,036 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:34:19,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash 1610490675, now seen corresponding path program 1 times [2022-07-20 06:34:19,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:19,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14668789] [2022-07-20 06:34:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:19,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:19,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:19,206 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:34:19,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:19,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14668789] [2022-07-20 06:34:19,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14668789] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:34:19,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [784716465] [2022-07-20 06:34:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:19,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:19,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:34:19,209 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:34:19,210 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:34:19,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:19,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 43 conjunts are in the unsatisfiable core [2022-07-20 06:34:19,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:34:19,355 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:34:19,389 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:34:19,390 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 14 treesize of output 20 [2022-07-20 06:34:19,397 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 5 treesize of output 3 [2022-07-20 06:34:19,432 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:34:19,433 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 18 treesize of output 24 [2022-07-20 06:34:19,439 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 5 treesize of output 3 [2022-07-20 06:34:19,522 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:34:19,522 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 21 treesize of output 27 [2022-07-20 06:34:19,526 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 5 treesize of output 3 [2022-07-20 06:34:19,739 INFO L356 Elim1Store]: treesize reduction 36, result has 61.7 percent of original size [2022-07-20 06:34:19,740 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 83 [2022-07-20 06:34:20,158 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:34:20,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 26 treesize of output 25 [2022-07-20 06:34:20,222 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:34:20,265 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:34:20,285 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:34:20,300 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:34:20,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:34:20,330 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_657) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0))) is different from false [2022-07-20 06:34:20,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:20,341 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 19 treesize of output 20 [2022-07-20 06:34:20,346 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:20,347 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 33 treesize of output 36 [2022-07-20 06:34:20,349 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 20 treesize of output 18 [2022-07-20 06:34:20,574 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse0))) is different from false [2022-07-20 06:34:20,670 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)) (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)))))) (and (or .cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (or .cse0 (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store (store |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) is different from false [2022-07-20 06:34:20,696 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x2~0#1.base| Int)) (or (= |ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store .cse0 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))))) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (or (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse1 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store .cse1 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|))) is different from false [2022-07-20 06:34:20,711 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:20,712 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 53 treesize of output 45 [2022-07-20 06:34:20,715 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 1092 treesize of output 1056 [2022-07-20 06:34:20,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:20,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1176 treesize of output 1118 [2022-07-20 06:34:20,797 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 930 treesize of output 914 [2022-07-20 06:34:20,814 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:20,815 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 934 treesize of output 908 [2022-07-20 06:34:21,279 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:21,280 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 53 treesize of output 45 [2022-07-20 06:34:21,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:34:21,290 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 88 treesize of output 80 [2022-07-20 06:34:21,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:21,300 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 79 treesize of output 81 [2022-07-20 06:34:21,310 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:34:21,311 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:34:21,377 WARN L234 Elim1Store]: Array PQE input equivalent to true [2022-07-20 06:34:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 13 not checked. [2022-07-20 06:34:21,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [784716465] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:34:21,403 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:34:21,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 15, 15] total 34 [2022-07-20 06:34:21,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89955600] [2022-07-20 06:34:21,403 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:34:21,403 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:34:21,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:21,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:34:21,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=756, Unknown=4, NotChecked=236, Total=1122 [2022-07-20 06:34:21,406 INFO L87 Difference]: Start difference. First operand 74 states and 88 transitions. Second operand has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 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:34:21,470 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~x0~0#1.base|))) (and (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (or (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (= (select .cse0 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (= (select .cse1 |c_ULTIMATE.start_main_~x0~0#1.offset|) 0) (= (select .cse1 0) 0) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x2~0#1.base| Int)) (or (= |ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (= (select (select (store .cse2 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store .cse2 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))))) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651) |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (or (forall ((|ULTIMATE.start_main_~x3~0#1.base| Int) (|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_650 (Array Int Int)) (v_ArrVal_652 (Array Int Int)) (v_ArrVal_651 (Array Int Int)) (|ULTIMATE.start_main_~x2~0#1.base| Int)) (let ((.cse3 (store (store |c_#memory_int| |ULTIMATE.start_main_~x2~0#1.base| v_ArrVal_650) |ULTIMATE.start_main_~x3~0#1.base| v_ArrVal_651))) (or (= (select (select (store .cse3 |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store .cse3 |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0))))) (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)))) is different from false [2022-07-20 06:34:21,550 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse3 (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)) (.cse2 (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|))) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse4 (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) .cse2 (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or .cse3 .cse0) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or .cse3 (and .cse2 .cse0 .cse4)) (or .cse4 .cse1))) is different from false [2022-07-20 06:34:21,555 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|))) (let ((.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse3 (= (select .cse5 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not .cse2) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or .cse3 (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (let ((.cse4 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= |c_ULTIMATE.start_main_#t~mem4#1| (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0))))) (or (and .cse4 .cse2) (= |c_ULTIMATE.start_main_#t~mem4#1| (select .cse5 0)) (and .cse4 .cse0) (and .cse3 .cse4))) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse1)))) is different from false [2022-07-20 06:34:21,560 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse2 (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse3 (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not .cse2) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or (= (select .cse3 |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (let ((.cse4 (exists ((|ULTIMATE.start_main_~x3~0#1.base| Int)) (= (select (select |c_#memory_int| |ULTIMATE.start_main_~x3~0#1.base|) 0) 0)))) (or (and .cse4 .cse2) (= (select .cse3 0) 0) (and .cse0 .cse4))) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse1))) is different from false [2022-07-20 06:34:21,566 WARN L833 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~x2~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (.cse1 (forall ((|ULTIMATE.start_main_~x0~0#1.base| Int) (v_ArrVal_652 (Array Int Int))) (or (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0)) |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |ULTIMATE.start_main_~x0~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))))) (and (or .cse0 .cse1) (forall ((v_ArrVal_652 (Array Int Int))) (or (= (select (store v_ArrVal_652 |c_ULTIMATE.start_main_~x0~0#1.offset| 0) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base| v_ArrVal_652) |c_ULTIMATE.start_main_~x3~0#1.base|) |c_ULTIMATE.start_main_~x3~0#1.offset|) 0)))) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|)) (not (= |c_ULTIMATE.start_main_#t~malloc1#1.base| |c_ULTIMATE.start_main_#t~malloc0#1.base|)) (or (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~x1~0#1.base|) |c_ULTIMATE.start_main_~x1~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~x3~0#1.base| |c_ULTIMATE.start_main_~x1~0#1.base|) .cse0) (= |c_ULTIMATE.start_main_~x2~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x0~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~x0~0#1.base| |c_ULTIMATE.start_main_~x2~0#1.base|)) (= |c_ULTIMATE.start_main_~x3~0#1.offset| 0) (= |c_ULTIMATE.start_main_~x1~0#1.offset| 0) (or (= |c_ULTIMATE.start_main_~x2~0#1.offset| |c_ULTIMATE.start_main_~x1~0#1.offset|) .cse1))) is different from false [2022-07-20 06:34:23,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:23,748 INFO L93 Difference]: Finished difference Result 321 states and 374 transitions. [2022-07-20 06:34:23,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2022-07-20 06:34:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 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:34:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:23,750 INFO L225 Difference]: With dead ends: 321 [2022-07-20 06:34:23,750 INFO L226 Difference]: Without dead ends: 321 [2022-07-20 06:34:23,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 50 SyntacticMatches, 18 SemanticMatches, 89 ConstructedPredicates, 9 IntricatePredicates, 1 DeprecatedPredicates, 2631 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1152, Invalid=5509, Unknown=17, NotChecked=1512, Total=8190 [2022-07-20 06:34:23,753 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 306 mSDsluCounter, 404 mSDsCounter, 0 mSdLazyCounter, 656 mSolverCounterSat, 197 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1526 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 197 IncrementalHoareTripleChecker+Valid, 656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 673 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:23,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 431 Invalid, 1526 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [197 Valid, 656 Invalid, 0 Unknown, 673 Unchecked, 0.4s Time] [2022-07-20 06:34:23,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-07-20 06:34:23,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 184. [2022-07-20 06:34:23,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 183 states have (on average 1.2076502732240437) internal successors, (221), 183 states have internal predecessors, (221), 0 states have call successors, (0), 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:34:23,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 221 transitions. [2022-07-20 06:34:23,762 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 221 transitions. Word has length 34 [2022-07-20 06:34:23,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:23,762 INFO L495 AbstractCegarLoop]: Abstraction has 184 states and 221 transitions. [2022-07-20 06:34:23,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.6470588235294117) internal successors, (90), 34 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:34:23,762 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 221 transitions. [2022-07-20 06:34:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-07-20 06:34:23,764 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:23,764 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:23,790 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:34:23,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-20 06:34:23,981 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:34:23,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:23,981 INFO L85 PathProgramCache]: Analyzing trace with hash 932056085, now seen corresponding path program 2 times [2022-07-20 06:34:23,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:23,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735687407] [2022-07-20 06:34:23,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:23,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:24,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:24,025 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-20 06:34:24,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:24,026 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735687407] [2022-07-20 06:34:24,026 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735687407] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:34:24,026 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:34:24,026 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:34:24,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840134078] [2022-07-20 06:34:24,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:24,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:34:24,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:24,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:34:24,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:34:24,029 INFO L87 Difference]: Start difference. First operand 184 states and 221 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:24,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:24,052 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2022-07-20 06:34:24,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:34:24,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-07-20 06:34:24,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:24,053 INFO L225 Difference]: With dead ends: 90 [2022-07-20 06:34:24,053 INFO L226 Difference]: Without dead ends: 90 [2022-07-20 06:34:24,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:34:24,054 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 4 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:24,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 66 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:34:24,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-07-20 06:34:24,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 87. [2022-07-20 06:34:24,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 86 states have (on average 1.1046511627906976) internal successors, (95), 86 states have internal predecessors, (95), 0 states have call successors, (0), 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:34:24,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 95 transitions. [2022-07-20 06:34:24,059 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 95 transitions. Word has length 37 [2022-07-20 06:34:24,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:24,059 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 95 transitions. [2022-07-20 06:34:24,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:34:24,060 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 95 transitions. [2022-07-20 06:34:24,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-07-20 06:34:24,064 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:34:24,064 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:24,064 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 06:34:24,064 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2022-07-20 06:34:24,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:34:24,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1795695146, now seen corresponding path program 2 times [2022-07-20 06:34:24,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:34:24,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607920865] [2022-07-20 06:34:24,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:34:24,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:34:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:34:24,522 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:34:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:34:24,522 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607920865] [2022-07-20 06:34:24,522 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607920865] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:34:24,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [125695957] [2022-07-20 06:34:24,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:34:24,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:24,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:34:24,524 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:34:24,532 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:34:24,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-07-20 06:34:24,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:34:24,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 06:34:24,611 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:34:25,107 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 06:34:25,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:34:25,291 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2022-07-20 06:34:25,292 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [125695957] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-20 06:34:25,292 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:34:25,292 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [16, 4] total 22 [2022-07-20 06:34:25,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94913554] [2022-07-20 06:34:25,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:34:25,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:34:25,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:34:25,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:34:25,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:34:25,295 INFO L87 Difference]: Start difference. First operand 87 states and 95 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:34:25,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:34:25,332 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2022-07-20 06:34:25,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:34:25,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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 39 [2022-07-20 06:34:25,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:34:25,334 INFO L225 Difference]: With dead ends: 86 [2022-07-20 06:34:25,335 INFO L226 Difference]: Without dead ends: 0 [2022-07-20 06:34:25,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:34:25,337 INFO L413 NwaCegarLoop]: 10 mSDtfsCounter, 25 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:34:25,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 18 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-20 06:34:25,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-20 06:34:25,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-20 06:34:25,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 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:34:25,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-20 06:34:25,338 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 39 [2022-07-20 06:34:25,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:34:25,338 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-20 06:34:25,338 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 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:34:25,338 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-20 06:34:25,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-20 06:34:25,341 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 31 remaining) [2022-07-20 06:34:25,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2022-07-20 06:34:25,342 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2022-07-20 06:34:25,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2022-07-20 06:34:25,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2022-07-20 06:34:25,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2022-07-20 06:34:25,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2022-07-20 06:34:25,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2022-07-20 06:34:25,343 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2022-07-20 06:34:25,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2022-07-20 06:34:25,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2022-07-20 06:34:25,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2022-07-20 06:34:25,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2022-07-20 06:34:25,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2022-07-20 06:34:25,344 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2022-07-20 06:34:25,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2022-07-20 06:34:25,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2022-07-20 06:34:25,345 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2022-07-20 06:34:25,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2022-07-20 06:34:25,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2022-07-20 06:34:25,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2022-07-20 06:34:25,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 31 remaining) [2022-07-20 06:34:25,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 31 remaining) [2022-07-20 06:34:25,346 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 31 remaining) [2022-07-20 06:34:25,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 31 remaining) [2022-07-20 06:34:25,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 31 remaining) [2022-07-20 06:34:25,347 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 31 remaining) [2022-07-20 06:34:25,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2022-07-20 06:34:25,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2022-07-20 06:34:25,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2022-07-20 06:34:25,348 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (0 of 31 remaining) [2022-07-20 06:34:25,376 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:34:25,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:34:25,576 INFO L356 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:34:25,579 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 06:34:25,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:34:25 BoogieIcfgContainer [2022-07-20 06:34:25,581 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 06:34:25,581 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 06:34:25,582 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 06:34:25,582 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 06:34:25,582 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:33:50" (3/4) ... [2022-07-20 06:34:25,587 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-07-20 06:34:25,599 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2022-07-20 06:34:25,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2022-07-20 06:34:25,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-07-20 06:34:25,600 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-07-20 06:34:25,637 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-20 06:34:25,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 06:34:25,639 INFO L158 Benchmark]: Toolchain (without parser) took 36271.20ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 53.8MB in the beginning and 108.2MB in the end (delta: -54.3MB). Peak memory consumption was 6.1MB. Max. memory is 16.1GB. [2022-07-20 06:34:25,639 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 69.8MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:34:25,640 INFO L158 Benchmark]: CACSL2BoogieTranslator took 230.49ms. Allocated memory is still 94.4MB. Free memory was 53.7MB in the beginning and 65.5MB in the end (delta: -11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 06:34:25,640 INFO L158 Benchmark]: Boogie Procedure Inliner took 33.19ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 64.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:34:25,640 INFO L158 Benchmark]: Boogie Preprocessor took 39.79ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 62.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:34:25,640 INFO L158 Benchmark]: RCFGBuilder took 382.22ms. Allocated memory is still 94.4MB. Free memory was 62.8MB in the beginning and 49.3MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-07-20 06:34:25,641 INFO L158 Benchmark]: TraceAbstraction took 35520.88ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 49.0MB in the beginning and 111.1MB in the end (delta: -62.1MB). Peak memory consumption was 179.8kB. Max. memory is 16.1GB. [2022-07-20 06:34:25,641 INFO L158 Benchmark]: Witness Printer took 56.28ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 108.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:34:25,647 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23ms. Allocated memory is still 94.4MB. Free memory was 69.9MB in the beginning and 69.8MB in the end (delta: 125.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 230.49ms. Allocated memory is still 94.4MB. Free memory was 53.7MB in the beginning and 65.5MB in the end (delta: -11.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 33.19ms. Allocated memory is still 94.4MB. Free memory was 65.5MB in the beginning and 64.0MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.79ms. Allocated memory is still 94.4MB. Free memory was 64.0MB in the beginning and 62.8MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 382.22ms. Allocated memory is still 94.4MB. Free memory was 62.8MB in the beginning and 49.3MB in the end (delta: 13.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 35520.88ms. Allocated memory was 94.4MB in the beginning and 155.2MB in the end (delta: 60.8MB). Free memory was 49.0MB in the beginning and 111.1MB in the end (delta: -62.1MB). Peak memory consumption was 179.8kB. Max. memory is 16.1GB. * Witness Printer took 56.28ms. Allocated memory is still 155.2MB. Free memory was 111.1MB in the beginning and 108.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 6]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 56 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 35.5s, OverallIterations: 18, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 17.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1012 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1012 mSDsluCounter, 1304 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 1391 IncrementalHoareTripleChecker+Unchecked, 1007 mSDsCounter, 486 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1697 IncrementalHoareTripleChecker+Invalid, 3574 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 486 mSolverCounterUnsat, 297 mSDtfsCounter, 1697 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 611 GetRequests, 322 SyntacticMatches, 26 SemanticMatches, 263 ConstructedPredicates, 33 IntricatePredicates, 1 DeprecatedPredicates, 3551 ImplicationChecksByTransitivity, 24.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=184occurred in iteration=16, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 312 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 14.5s InterpolantComputationTime, 491 NumberOfCodeBlocks, 441 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 624 ConstructedInterpolants, 129 QuantifiedInterpolants, 12358 SizeOfPredicates, 86 NumberOfNonLiveVariables, 1284 ConjunctsInSsa, 248 ConjunctsInUnsatCore, 31 InterpolantComputations, 13 PerfectInterpolantSequences, 194/324 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2022-07-20 06:34:25,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE