./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version eb692b52 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:07:58,149 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:07:58,151 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:07:58,171 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:07:58,172 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:07:58,173 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:07:58,173 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:07:58,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:07:58,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:07:58,176 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:07:58,177 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:07:58,178 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:07:58,178 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:07:58,179 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:07:58,179 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:07:58,180 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:07:58,181 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:07:58,181 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:07:58,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:07:58,184 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:07:58,184 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:07:58,185 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:07:58,186 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:07:58,187 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:07:58,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:07:58,189 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:07:58,189 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:07:58,189 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:07:58,190 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:07:58,190 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:07:58,191 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:07:58,191 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:07:58,191 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:07:58,192 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:07:58,193 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:07:58,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:07:58,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:07:58,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:07:58,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:07:58,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:07:58,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:07:58,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:07:58,196 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-07-20 06:07:58,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:07:58,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:07:58,211 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:07:58,211 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:07:58,211 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:07:58,212 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:07:58,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:07:58,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:07:58,212 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:07:58,213 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:07:58,213 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:07:58,213 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:07:58,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:07:58,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:07:58,214 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:07:58,214 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:07:58,214 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:07:58,214 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:07:58,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:07:58,214 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:07:58,215 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:07:58,215 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:07:58,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:07:58,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:07:58,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:07:58,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:58,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:07:58,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:07:58,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 06:07:58,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 06:07:58,217 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2022-07-20 06:07:58,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:07:58,437 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:07:58,439 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:07:58,440 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:07:58,441 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:07:58,442 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2022-07-20 06:07:58,487 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f69e7fd2/911cc794f27d4c928ad3bf341b9bfdd2/FLAG1c3d94902 [2022-07-20 06:07:58,924 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:07:58,925 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2022-07-20 06:07:58,936 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f69e7fd2/911cc794f27d4c928ad3bf341b9bfdd2/FLAG1c3d94902 [2022-07-20 06:07:58,960 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2f69e7fd2/911cc794f27d4c928ad3bf341b9bfdd2 [2022-07-20 06:07:58,962 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:07:58,963 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:07:58,965 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:58,966 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:07:58,968 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:07:58,968 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:58" (1/1) ... [2022-07-20 06:07:58,969 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28b90fdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:58, skipping insertion in model container [2022-07-20 06:07:58,969 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:07:58" (1/1) ... [2022-07-20 06:07:58,973 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:07:58,996 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:07:59,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2022-07-20 06:07:59,194 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:59,199 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:07:59,250 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2022-07-20 06:07:59,253 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:07:59,275 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:07:59,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59 WrapperNode [2022-07-20 06:07:59,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:07:59,277 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:59,277 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:07:59,277 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:07:59,283 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:07:59" (1/1) ... [2022-07-20 06:07:59,304 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:07:59" (1/1) ... [2022-07-20 06:07:59,325 INFO L137 Inliner]: procedures = 119, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 111 [2022-07-20 06:07:59,325 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:07:59,326 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:07:59,326 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:07:59,326 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:07:59,332 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,332 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,339 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,339 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,351 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,354 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,359 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,362 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:07:59,364 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:07:59,364 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:07:59,365 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:07:59,365 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (1/1) ... [2022-07-20 06:07:59,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:07:59,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:07:59,386 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:07:59,404 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:07:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 06:07:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 06:07:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:07:59,420 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:07:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:07:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:07:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:07:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 06:07:59,421 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:07:59,421 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:07:59,495 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:07:59,497 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:07:59,785 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:07:59,790 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:07:59,790 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-20 06:07:59,792 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:59 BoogieIcfgContainer [2022-07-20 06:07:59,807 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:07:59,809 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:07:59,809 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:07:59,811 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:07:59,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:07:58" (1/3) ... [2022-07-20 06:07:59,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1944b37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:59, skipping insertion in model container [2022-07-20 06:07:59,812 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:07:59" (2/3) ... [2022-07-20 06:07:59,812 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1944b37c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:07:59, skipping insertion in model container [2022-07-20 06:07:59,813 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:59" (3/3) ... [2022-07-20 06:07:59,813 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2022-07-20 06:07:59,822 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:07:59,823 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-07-20 06:07:59,849 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:07:59,854 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@7bab1298, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@152b0849 [2022-07-20 06:07:59,854 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2022-07-20 06:07:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand has 99 states, 53 states have (on average 2.150943396226415) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:07:59,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:07:59,860 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:07:59,860 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:07:59,861 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:07:59,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:07:59,864 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:07:59,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:07:59,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636791352] [2022-07-20 06:07:59,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:07:59,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:07:59,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:07:59,992 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:07:59,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:07:59,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636791352] [2022-07-20 06:07:59,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636791352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:07:59,994 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:07:59,994 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:07:59,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [294414371] [2022-07-20 06:07:59,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:07:59,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:07:59,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:00,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:00,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:00,023 INFO L87 Difference]: Start difference. First operand has 99 states, 53 states have (on average 2.150943396226415) internal successors, (114), 98 states have internal predecessors, (114), 0 states have call successors, (0), 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:08:00,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:00,147 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-07-20 06:08:00,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:00,150 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:08:00,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:00,155 INFO L225 Difference]: With dead ends: 127 [2022-07-20 06:08:00,155 INFO L226 Difference]: Without dead ends: 123 [2022-07-20 06:08:00,156 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:08:00,158 INFO L413 NwaCegarLoop]: 88 mSDtfsCounter, 85 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:00,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 110 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:00,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-07-20 06:08:00,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2022-07-20 06:08:00,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.9607843137254901) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:08:00,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2022-07-20 06:08:00,181 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 3 [2022-07-20 06:08:00,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:00,181 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2022-07-20 06:08:00,181 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:08:00,181 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2022-07-20 06:08:00,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:08:00,182 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:00,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:08:00,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 06:08:00,182 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:00,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:00,183 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:08:00,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:00,183 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1548025717] [2022-07-20 06:08:00,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:00,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:00,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,209 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:08:00,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:00,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1548025717] [2022-07-20 06:08:00,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1548025717] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:00,210 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:00,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:08:00,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492775513] [2022-07-20 06:08:00,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:00,211 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:08:00,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:00,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:08:00,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:08:00,212 INFO L87 Difference]: Start difference. First operand 94 states and 100 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:08:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:00,277 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2022-07-20 06:08:00,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:08:00,278 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:08:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:00,279 INFO L225 Difference]: With dead ends: 121 [2022-07-20 06:08:00,279 INFO L226 Difference]: Without dead ends: 121 [2022-07-20 06:08:00,279 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:08:00,280 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 81 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:00,281 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 106 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:00,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-20 06:08:00,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2022-07-20 06:08:00,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 51 states have (on average 1.9215686274509804) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:08:00,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-07-20 06:08:00,286 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2022-07-20 06:08:00,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:00,286 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-07-20 06:08:00,286 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:08:00,287 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-07-20 06:08:00,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:08:00,287 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:00,287 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:00,287 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 06:08:00,287 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:00,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:00,288 INFO L85 PathProgramCache]: Analyzing trace with hash 59263661, now seen corresponding path program 1 times [2022-07-20 06:08:00,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:00,288 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593715971] [2022-07-20 06:08:00,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:00,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:00,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,331 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:08:00,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:00,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593715971] [2022-07-20 06:08:00,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593715971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:00,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:00,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:00,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674312474] [2022-07-20 06:08:00,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:00,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:00,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:00,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:00,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:00,334 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:08:00,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:00,425 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2022-07-20 06:08:00,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:08:00,426 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 06:08:00,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:00,426 INFO L225 Difference]: With dead ends: 95 [2022-07-20 06:08:00,427 INFO L226 Difference]: Without dead ends: 95 [2022-07-20 06:08:00,427 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:08:00,428 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 123 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:00,428 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 40 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:00,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-07-20 06:08:00,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 87. [2022-07-20 06:08:00,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.6779661016949152) internal successors, (99), 86 states have internal predecessors, (99), 0 states have call successors, (0), 0 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:08:00,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 99 transitions. [2022-07-20 06:08:00,433 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 99 transitions. Word has length 8 [2022-07-20 06:08:00,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:00,433 INFO L495 AbstractCegarLoop]: Abstraction has 87 states and 99 transitions. [2022-07-20 06:08:00,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:08:00,433 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 99 transitions. [2022-07-20 06:08:00,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-07-20 06:08:00,434 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:00,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:00,434 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 06:08:00,434 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:00,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:00,435 INFO L85 PathProgramCache]: Analyzing trace with hash 59263662, now seen corresponding path program 1 times [2022-07-20 06:08:00,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:00,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035526470] [2022-07-20 06:08:00,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:00,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:00,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,490 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:08:00,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:00,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035526470] [2022-07-20 06:08:00,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035526470] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:00,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:00,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:00,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229337091] [2022-07-20 06:08:00,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:00,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:00,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:00,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:00,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:00,493 INFO L87 Difference]: Start difference. First operand 87 states and 99 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:08:00,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:00,629 INFO L93 Difference]: Finished difference Result 117 states and 128 transitions. [2022-07-20 06:08:00,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:00,630 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-07-20 06:08:00,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:00,631 INFO L225 Difference]: With dead ends: 117 [2022-07-20 06:08:00,631 INFO L226 Difference]: Without dead ends: 117 [2022-07-20 06:08:00,631 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:08:00,632 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 126 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:00,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 57 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:00,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-07-20 06:08:00,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 102. [2022-07-20 06:08:00,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.5) internal successors, (114), 101 states have internal predecessors, (114), 0 states have call successors, (0), 0 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:08:00,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 114 transitions. [2022-07-20 06:08:00,637 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 114 transitions. Word has length 8 [2022-07-20 06:08:00,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:00,638 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 114 transitions. [2022-07-20 06:08:00,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 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:08:00,638 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 114 transitions. [2022-07-20 06:08:00,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:08:00,638 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:00,638 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:00,639 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 06:08:00,639 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:00,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:00,639 INFO L85 PathProgramCache]: Analyzing trace with hash 467003055, now seen corresponding path program 1 times [2022-07-20 06:08:00,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:00,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485914193] [2022-07-20 06:08:00,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:00,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,699 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:08:00,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:00,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485914193] [2022-07-20 06:08:00,700 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485914193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:00,700 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:00,700 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:00,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825539217] [2022-07-20 06:08:00,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:00,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:00,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:00,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:00,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:00,702 INFO L87 Difference]: Start difference. First operand 102 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:08:00,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:00,862 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-07-20 06:08:00,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:08:00,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 06:08:00,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:00,863 INFO L225 Difference]: With dead ends: 103 [2022-07-20 06:08:00,863 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 06:08:00,863 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:08:00,875 INFO L413 NwaCegarLoop]: 57 mSDtfsCounter, 44 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:00,876 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 165 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:00,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 06:08:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 101. [2022-07-20 06:08:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.486842105263158) internal successors, (113), 100 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:08:00,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 113 transitions. [2022-07-20 06:08:00,880 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 113 transitions. Word has length 12 [2022-07-20 06:08:00,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:00,880 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 113 transitions. [2022-07-20 06:08:00,880 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:08:00,880 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 113 transitions. [2022-07-20 06:08:00,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-07-20 06:08:00,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:00,881 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:00,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 06:08:00,881 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:00,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:00,881 INFO L85 PathProgramCache]: Analyzing trace with hash 467003056, now seen corresponding path program 1 times [2022-07-20 06:08:00,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:00,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752481250] [2022-07-20 06:08:00,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:00,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:00,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:00,969 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:08:00,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:00,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752481250] [2022-07-20 06:08:00,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [752481250] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:00,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:00,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:00,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355568515] [2022-07-20 06:08:00,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:00,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:08:00,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:00,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:08:00,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:08:00,971 INFO L87 Difference]: Start difference. First operand 101 states and 113 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:08:01,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:01,167 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2022-07-20 06:08:01,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:08:01,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-07-20 06:08:01,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:01,168 INFO L225 Difference]: With dead ends: 101 [2022-07-20 06:08:01,168 INFO L226 Difference]: Without dead ends: 101 [2022-07-20 06:08:01,168 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:01,169 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 13 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:01,169 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 207 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:01,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-07-20 06:08:01,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 92. [2022-07-20 06:08:01,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 71 states have (on average 1.4507042253521127) internal successors, (103), 91 states have internal predecessors, (103), 0 states have call successors, (0), 0 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:08:01,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2022-07-20 06:08:01,173 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 12 [2022-07-20 06:08:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:01,173 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2022-07-20 06:08:01,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 0 states have call successors, (0), 0 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:08:01,174 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2022-07-20 06:08:01,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-07-20 06:08:01,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:01,174 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:01,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 06:08:01,175 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:01,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:01,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1831378933, now seen corresponding path program 1 times [2022-07-20 06:08:01,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:01,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864490480] [2022-07-20 06:08:01,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:01,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:01,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:01,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:01,253 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864490480] [2022-07-20 06:08:01,253 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864490480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:01,253 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:01,253 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:08:01,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504571251] [2022-07-20 06:08:01,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:01,254 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:08:01,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:01,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:08:01,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:08:01,254 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:01,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:01,339 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2022-07-20 06:08:01,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:08:01,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-07-20 06:08:01,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:01,340 INFO L225 Difference]: With dead ends: 103 [2022-07-20 06:08:01,340 INFO L226 Difference]: Without dead ends: 103 [2022-07-20 06:08:01,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:01,344 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 16 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:01,344 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 204 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-07-20 06:08:01,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 98. [2022-07-20 06:08:01,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 77 states have (on average 1.4415584415584415) internal successors, (111), 97 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:08:01,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 111 transitions. [2022-07-20 06:08:01,363 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 111 transitions. Word has length 15 [2022-07-20 06:08:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:01,363 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 111 transitions. [2022-07-20 06:08:01,363 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:01,363 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 111 transitions. [2022-07-20 06:08:01,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:08:01,364 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:01,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:01,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 06:08:01,366 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:01,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:01,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1263266080, now seen corresponding path program 1 times [2022-07-20 06:08:01,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:01,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053177308] [2022-07-20 06:08:01,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:01,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:01,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:01,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:01,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:01,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053177308] [2022-07-20 06:08:01,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053177308] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:01,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027395944] [2022-07-20 06:08:01,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:01,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:01,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:01,492 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:08:01,493 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:08:01,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:01,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:08:01,573 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:01,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:01,699 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:08:01,700 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-07-20 06:08:01,726 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:01,726 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:01,778 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:08:01,782 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:08:01,862 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 31 treesize of output 19 [2022-07-20 06:08:01,869 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 26 treesize of output 14 [2022-07-20 06:08:01,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:01,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:02,168 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 37 treesize of output 33 [2022-07-20 06:08:02,213 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:02,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027395944] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:02,215 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:02,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 20 [2022-07-20 06:08:02,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799938431] [2022-07-20 06:08:02,216 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:02,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-20 06:08:02,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:02,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-20 06:08:02,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=363, Unknown=0, NotChecked=0, Total=420 [2022-07-20 06:08:02,225 INFO L87 Difference]: Start difference. First operand 98 states and 111 transitions. Second operand has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:08:02,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:02,917 INFO L93 Difference]: Finished difference Result 163 states and 178 transitions. [2022-07-20 06:08:02,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:08:02,917 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 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:08:02,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:02,919 INFO L225 Difference]: With dead ends: 163 [2022-07-20 06:08:02,919 INFO L226 Difference]: Without dead ends: 163 [2022-07-20 06:08:02,919 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 06:08:02,920 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 539 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 539 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 47 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:02,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [539 Valid, 290 Invalid, 743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 601 Invalid, 0 Unknown, 47 Unchecked, 0.3s Time] [2022-07-20 06:08:02,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-20 06:08:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 104. [2022-07-20 06:08:02,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 83 states have (on average 1.4337349397590362) internal successors, (119), 103 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:08:02,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-07-20 06:08:02,927 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 18 [2022-07-20 06:08:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:02,928 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-07-20 06:08:02,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.6) internal successors, (52), 21 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:08:02,928 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-07-20 06:08:02,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-20 06:08:02,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:02,929 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:02,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:03,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:03,130 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:03,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:03,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1263266079, now seen corresponding path program 1 times [2022-07-20 06:08:03,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:03,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818206635] [2022-07-20 06:08:03,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:03,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:03,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:03,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:03,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:03,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818206635] [2022-07-20 06:08:03,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818206635] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:03,206 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1010607449] [2022-07-20 06:08:03,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:03,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:03,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:03,228 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:08:03,244 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:08:03,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:03,297 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-20 06:08:03,300 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:03,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:03,329 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:08:03,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:08:03,351 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:08:03,393 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 25 treesize of output 13 [2022-07-20 06:08:03,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:03,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:03,478 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:03,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1010607449] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:03,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:03,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2022-07-20 06:08:03,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989254912] [2022-07-20 06:08:03,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:03,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 06:08:03,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:03,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 06:08:03,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:08:03,480 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:08:03,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:03,682 INFO L93 Difference]: Finished difference Result 146 states and 162 transitions. [2022-07-20 06:08:03,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:08:03,683 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 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:08:03,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:03,684 INFO L225 Difference]: With dead ends: 146 [2022-07-20 06:08:03,684 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 06:08:03,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:08:03,685 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 260 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:03,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 137 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 366 Invalid, 0 Unknown, 8 Unchecked, 0.1s Time] [2022-07-20 06:08:03,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 06:08:03,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 100. [2022-07-20 06:08:03,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 80 states have (on average 1.4125) internal successors, (113), 99 states have internal predecessors, (113), 0 states have call successors, (0), 0 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:08:03,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 113 transitions. [2022-07-20 06:08:03,688 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 113 transitions. Word has length 18 [2022-07-20 06:08:03,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:03,688 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 113 transitions. [2022-07-20 06:08:03,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.1818181818181817) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 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:08:03,689 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 113 transitions. [2022-07-20 06:08:03,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:08:03,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:03,689 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:03,709 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:08:03,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-07-20 06:08:03,890 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:03,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:03,890 INFO L85 PathProgramCache]: Analyzing trace with hash 504911936, now seen corresponding path program 1 times [2022-07-20 06:08:03,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:03,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720102238] [2022-07-20 06:08:03,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:03,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:03,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:03,984 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:08:03,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:03,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720102238] [2022-07-20 06:08:03,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720102238] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:03,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:03,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:03,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130653372] [2022-07-20 06:08:03,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:03,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:08:03,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:03,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:08:03,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:08:03,986 INFO L87 Difference]: Start difference. First operand 100 states and 113 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:08:04,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:04,177 INFO L93 Difference]: Finished difference Result 144 states and 160 transitions. [2022-07-20 06:08:04,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:08:04,178 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-20 06:08:04,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:04,178 INFO L225 Difference]: With dead ends: 144 [2022-07-20 06:08:04,178 INFO L226 Difference]: Without dead ends: 144 [2022-07-20 06:08:04,179 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:08:04,181 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 313 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:04,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 93 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:04,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-07-20 06:08:04,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 104. [2022-07-20 06:08:04,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 84 states have (on average 1.4166666666666667) internal successors, (119), 103 states have internal predecessors, (119), 0 states have call successors, (0), 0 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:08:04,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 119 transitions. [2022-07-20 06:08:04,187 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 119 transitions. Word has length 19 [2022-07-20 06:08:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:04,188 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 119 transitions. [2022-07-20 06:08:04,188 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 8 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:08:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 119 transitions. [2022-07-20 06:08:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:08:04,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:04,191 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:04,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 06:08:04,191 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:04,192 INFO L85 PathProgramCache]: Analyzing trace with hash 504911937, now seen corresponding path program 1 times [2022-07-20 06:08:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589815534] [2022-07-20 06:08:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:04,290 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:08:04,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:04,291 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589815534] [2022-07-20 06:08:04,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589815534] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:04,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:04,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:08:04,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094142264] [2022-07-20 06:08:04,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:04,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:08:04,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:04,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:08:04,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:08:04,293 INFO L87 Difference]: Start difference. First operand 104 states and 119 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:08:04,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:04,619 INFO L93 Difference]: Finished difference Result 167 states and 183 transitions. [2022-07-20 06:08:04,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:08:04,620 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-20 06:08:04,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:04,620 INFO L225 Difference]: With dead ends: 167 [2022-07-20 06:08:04,620 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 06:08:04,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:08:04,621 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 245 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:04,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 179 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:04,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 06:08:04,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 106. [2022-07-20 06:08:04,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 86 states have (on average 1.4069767441860466) internal successors, (121), 105 states have internal predecessors, (121), 0 states have call successors, (0), 0 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:08:04,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 121 transitions. [2022-07-20 06:08:04,623 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 121 transitions. Word has length 19 [2022-07-20 06:08:04,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:04,623 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 121 transitions. [2022-07-20 06:08:04,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:08:04,623 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 121 transitions. [2022-07-20 06:08:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:08:04,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:04,624 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:04,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 06:08:04,624 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:04,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:04,624 INFO L85 PathProgramCache]: Analyzing trace with hash -110930843, now seen corresponding path program 1 times [2022-07-20 06:08:04,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:04,624 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547638960] [2022-07-20 06:08:04,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:04,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:04,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:04,748 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:08:04,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:04,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547638960] [2022-07-20 06:08:04,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547638960] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:04,748 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:04,749 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:08:04,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159380504] [2022-07-20 06:08:04,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:04,749 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:08:04,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:04,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:08:04,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:08:04,750 INFO L87 Difference]: Start difference. First operand 106 states and 121 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:08:05,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:05,068 INFO L93 Difference]: Finished difference Result 204 states and 226 transitions. [2022-07-20 06:08:05,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:08:05,069 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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 21 [2022-07-20 06:08:05,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:05,070 INFO L225 Difference]: With dead ends: 204 [2022-07-20 06:08:05,070 INFO L226 Difference]: Without dead ends: 204 [2022-07-20 06:08:05,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=275, Unknown=0, NotChecked=0, Total=342 [2022-07-20 06:08:05,071 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 218 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 471 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 471 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:05,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 331 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 471 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:05,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-07-20 06:08:05,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 117. [2022-07-20 06:08:05,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3814432989690721) internal successors, (134), 116 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:05,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 134 transitions. [2022-07-20 06:08:05,074 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 134 transitions. Word has length 21 [2022-07-20 06:08:05,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:05,074 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 134 transitions. [2022-07-20 06:08:05,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 11 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:08:05,075 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 134 transitions. [2022-07-20 06:08:05,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:08:05,075 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:05,075 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:05,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 06:08:05,075 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:05,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:05,076 INFO L85 PathProgramCache]: Analyzing trace with hash 855282434, now seen corresponding path program 1 times [2022-07-20 06:08:05,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:05,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85329815] [2022-07-20 06:08:05,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:05,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:05,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:05,117 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:08:05,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:05,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85329815] [2022-07-20 06:08:05,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85329815] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:05,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:05,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:08:05,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957741333] [2022-07-20 06:08:05,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:05,117 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:05,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:05,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:05,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:05,118 INFO L87 Difference]: Start difference. First operand 117 states and 134 transitions. Second operand has 4 states, 4 states have (on average 5.5) 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:08:05,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:05,179 INFO L93 Difference]: Finished difference Result 136 states and 153 transitions. [2022-07-20 06:08:05,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:05,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) 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 22 [2022-07-20 06:08:05,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:05,180 INFO L225 Difference]: With dead ends: 136 [2022-07-20 06:08:05,181 INFO L226 Difference]: Without dead ends: 136 [2022-07-20 06:08:05,181 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:08:05,182 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 114 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:05,182 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 83 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:05,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-07-20 06:08:05,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 117. [2022-07-20 06:08:05,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.3711340206185567) internal successors, (133), 116 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:05,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 133 transitions. [2022-07-20 06:08:05,185 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 133 transitions. Word has length 22 [2022-07-20 06:08:05,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:05,185 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 133 transitions. [2022-07-20 06:08:05,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) 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:08:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 133 transitions. [2022-07-20 06:08:05,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:08:05,186 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:05,186 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:05,186 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 06:08:05,186 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:05,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:05,187 INFO L85 PathProgramCache]: Analyzing trace with hash -2096783466, now seen corresponding path program 2 times [2022-07-20 06:08:05,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:05,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363959963] [2022-07-20 06:08:05,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:05,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:05,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:05,261 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-07-20 06:08:05,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:05,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363959963] [2022-07-20 06:08:05,261 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [363959963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:05,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:05,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 06:08:05,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140746401] [2022-07-20 06:08:05,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:05,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 06:08:05,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:05,263 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 06:08:05,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:08:05,263 INFO L87 Difference]: Start difference. First operand 117 states and 133 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:05,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:05,408 INFO L93 Difference]: Finished difference Result 145 states and 160 transitions. [2022-07-20 06:08:05,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:08:05,408 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:08:05,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:05,409 INFO L225 Difference]: With dead ends: 145 [2022-07-20 06:08:05,409 INFO L226 Difference]: Without dead ends: 145 [2022-07-20 06:08:05,409 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:08:05,410 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 123 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:05,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 198 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:05,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-07-20 06:08:05,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 115. [2022-07-20 06:08:05,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.3578947368421053) internal successors, (129), 114 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:05,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 129 transitions. [2022-07-20 06:08:05,412 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 129 transitions. Word has length 22 [2022-07-20 06:08:05,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:05,412 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 129 transitions. [2022-07-20 06:08:05,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 129 transitions. [2022-07-20 06:08:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:08:05,412 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:05,412 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:05,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 06:08:05,413 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:05,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:05,413 INFO L85 PathProgramCache]: Analyzing trace with hash 720011197, now seen corresponding path program 1 times [2022-07-20 06:08:05,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:05,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120756438] [2022-07-20 06:08:05,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:05,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:05,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:05,486 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120756438] [2022-07-20 06:08:05,486 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120756438] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:05,486 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:05,486 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 06:08:05,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472485333] [2022-07-20 06:08:05,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:05,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:08:05,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:05,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:08:05,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:08:05,487 INFO L87 Difference]: Start difference. First operand 115 states and 129 transitions. Second operand has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:08:05,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:05,688 INFO L93 Difference]: Finished difference Result 164 states and 180 transitions. [2022-07-20 06:08:05,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:08:05,688 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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:08:05,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:05,689 INFO L225 Difference]: With dead ends: 164 [2022-07-20 06:08:05,689 INFO L226 Difference]: Without dead ends: 164 [2022-07-20 06:08:05,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:08:05,689 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 135 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:05,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 229 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:05,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-07-20 06:08:05,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 118. [2022-07-20 06:08:05,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 98 states have (on average 1.346938775510204) internal successors, (132), 117 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:05,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 132 transitions. [2022-07-20 06:08:05,692 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 132 transitions. Word has length 23 [2022-07-20 06:08:05,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:05,692 INFO L495 AbstractCegarLoop]: Abstraction has 118 states and 132 transitions. [2022-07-20 06:08:05,692 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.875) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 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:08:05,692 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 132 transitions. [2022-07-20 06:08:05,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:08:05,693 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:05,693 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:05,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 06:08:05,693 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:05,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:05,694 INFO L85 PathProgramCache]: Analyzing trace with hash 836442201, now seen corresponding path program 1 times [2022-07-20 06:08:05,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:05,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021036800] [2022-07-20 06:08:05,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:05,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:05,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:05,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:05,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021036800] [2022-07-20 06:08:05,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021036800] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:05,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [568139399] [2022-07-20 06:08:05,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:05,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:05,807 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:05,820 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:08:05,821 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:08:05,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:05,885 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 35 conjunts are in the unsatisfiable core [2022-07-20 06:08:05,887 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:05,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:05,945 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:08:05,946 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:08:05,981 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:08:06,072 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:06,073 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 31 treesize of output 29 [2022-07-20 06:08:06,088 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:06,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:08:06,159 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 25 treesize of output 13 [2022-07-20 06:08:06,210 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:06,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:06,300 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:06,300 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 20 treesize of output 21 [2022-07-20 06:08:06,308 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:06,308 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 34 treesize of output 37 [2022-07-20 06:08:06,312 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 11 treesize of output 9 [2022-07-20 06:08:10,469 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:10,469 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [568139399] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:10,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:10,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 27 [2022-07-20 06:08:10,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426818957] [2022-07-20 06:08:10,469 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:10,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 06:08:10,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:10,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 06:08:10,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=616, Unknown=15, NotChecked=0, Total=756 [2022-07-20 06:08:10,488 INFO L87 Difference]: Start difference. First operand 118 states and 132 transitions. Second operand has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:08:10,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:10,950 INFO L93 Difference]: Finished difference Result 178 states and 199 transitions. [2022-07-20 06:08:10,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:08:10,950 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 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:08:10,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:10,951 INFO L225 Difference]: With dead ends: 178 [2022-07-20 06:08:10,951 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:08:10,951 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=244, Invalid=1000, Unknown=16, NotChecked=0, Total=1260 [2022-07-20 06:08:10,952 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 294 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 1446 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 697 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:10,952 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 477 Invalid, 1446 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 671 Invalid, 0 Unknown, 697 Unchecked, 0.3s Time] [2022-07-20 06:08:10,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:08:10,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 134. [2022-07-20 06:08:10,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 114 states have (on average 1.3421052631578947) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:08:10,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2022-07-20 06:08:10,954 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 23 [2022-07-20 06:08:10,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:10,954 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2022-07-20 06:08:10,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 2.111111111111111) internal successors, (57), 28 states have internal predecessors, (57), 0 states have call successors, (0), 0 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:08:10,954 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2022-07-20 06:08:10,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-07-20 06:08:10,955 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:10,955 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:10,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-07-20 06:08:11,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:11,155 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:11,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:11,156 INFO L85 PathProgramCache]: Analyzing trace with hash 836442202, now seen corresponding path program 1 times [2022-07-20 06:08:11,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:11,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232574904] [2022-07-20 06:08:11,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:11,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:11,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:11,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:11,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232574904] [2022-07-20 06:08:11,286 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232574904] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:11,286 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1527937842] [2022-07-20 06:08:11,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:11,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:11,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:11,288 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:08:11,289 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:08:11,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:11,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 06:08:11,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:11,363 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:11,406 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:11,417 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:11,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:11,442 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:08:11,449 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:08:11,539 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,540 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 31 treesize of output 29 [2022-07-20 06:08:11,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:11,546 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:08:11,557 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:11,558 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:08:11,560 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 18 treesize of output 20 [2022-07-20 06:08:11,641 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 25 treesize of output 13 [2022-07-20 06:08:11,644 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 15 treesize of output 7 [2022-07-20 06:08:11,679 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:11,679 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:12,427 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_542 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:08:12,555 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_541) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_542 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:08:12,627 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_542 (Array Int Int)) (v_ArrVal_541 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_541) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_542 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_542) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:08:12,747 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:12,748 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 37 treesize of output 38 [2022-07-20 06:08:12,802 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:12,802 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 29 treesize of output 30 [2022-07-20 06:08:12,947 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:12,948 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 52 treesize of output 55 [2022-07-20 06:08:13,111 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:13,112 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 82 treesize of output 81 [2022-07-20 06:08:13,143 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 34 treesize of output 30 [2022-07-20 06:08:13,179 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 62 treesize of output 58 [2022-07-20 06:08:13,755 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:13,756 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:08:13,775 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:13,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:08:15,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:15,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1527937842] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:15,176 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:15,176 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 31 [2022-07-20 06:08:15,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655895956] [2022-07-20 06:08:15,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:15,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:08:15,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:15,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:08:15,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=720, Unknown=3, NotChecked=168, Total=992 [2022-07-20 06:08:15,177 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:08:30,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:30,733 INFO L93 Difference]: Finished difference Result 185 states and 208 transitions. [2022-07-20 06:08:30,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-20 06:08:30,734 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 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:08:30,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:30,734 INFO L225 Difference]: With dead ends: 185 [2022-07-20 06:08:30,734 INFO L226 Difference]: Without dead ends: 185 [2022-07-20 06:08:30,735 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 297 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=356, Invalid=1723, Unknown=3, NotChecked=270, Total=2352 [2022-07-20 06:08:30,735 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 310 mSDsluCounter, 613 mSDsCounter, 0 mSdLazyCounter, 1521 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 2094 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 454 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:30,736 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [310 Valid, 677 Invalid, 2094 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1521 Invalid, 0 Unknown, 454 Unchecked, 8.3s Time] [2022-07-20 06:08:30,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-20 06:08:30,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 137. [2022-07-20 06:08:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 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:08:30,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-07-20 06:08:30,740 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 23 [2022-07-20 06:08:30,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:30,740 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-07-20 06:08:30,740 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.161290322580645) internal successors, (67), 32 states have internal predecessors, (67), 0 states have call successors, (0), 0 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:08:30,740 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-07-20 06:08:30,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:08:30,741 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:30,741 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:30,795 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:08:30,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-20 06:08:30,954 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:30,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:30,954 INFO L85 PathProgramCache]: Analyzing trace with hash 843879747, now seen corresponding path program 1 times [2022-07-20 06:08:30,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:30,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071789356] [2022-07-20 06:08:30,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:30,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:30,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:31,134 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:08:31,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:31,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071789356] [2022-07-20 06:08:31,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071789356] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:31,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:31,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:08:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360563227] [2022-07-20 06:08:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:31,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:08:31,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:31,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:08:31,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:08:31,137 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:31,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:31,459 INFO L93 Difference]: Finished difference Result 165 states and 185 transitions. [2022-07-20 06:08:31,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:08:31,460 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 06:08:31,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:31,461 INFO L225 Difference]: With dead ends: 165 [2022-07-20 06:08:31,461 INFO L226 Difference]: Without dead ends: 165 [2022-07-20 06:08:31,461 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:08:31,461 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 77 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 446 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 446 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:31,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 261 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 446 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:31,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-20 06:08:31,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 149. [2022-07-20 06:08:31,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.2803030303030303) internal successors, (169), 148 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:08:31,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 169 transitions. [2022-07-20 06:08:31,464 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 169 transitions. Word has length 24 [2022-07-20 06:08:31,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:31,464 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 169 transitions. [2022-07-20 06:08:31,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 11 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:31,464 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 169 transitions. [2022-07-20 06:08:31,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:08:31,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:31,465 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:31,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 06:08:31,465 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1589119206, now seen corresponding path program 1 times [2022-07-20 06:08:31,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:31,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [353513803] [2022-07-20 06:08:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:31,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:31,555 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:08:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:31,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [353513803] [2022-07-20 06:08:31,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [353513803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:31,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:31,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:08:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410193615] [2022-07-20 06:08:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:31,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:08:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:31,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:08:31,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:08:31,558 INFO L87 Difference]: Start difference. First operand 149 states and 169 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:31,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:31,772 INFO L93 Difference]: Finished difference Result 185 states and 203 transitions. [2022-07-20 06:08:31,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:08:31,772 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-20 06:08:31,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:31,773 INFO L225 Difference]: With dead ends: 185 [2022-07-20 06:08:31,773 INFO L226 Difference]: Without dead ends: 185 [2022-07-20 06:08:31,773 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:08:31,773 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 169 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:31,774 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 204 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:08:31,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-07-20 06:08:31,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 149. [2022-07-20 06:08:31,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 132 states have (on average 1.2651515151515151) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:08:31,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 167 transitions. [2022-07-20 06:08:31,776 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 167 transitions. Word has length 24 [2022-07-20 06:08:31,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:31,776 INFO L495 AbstractCegarLoop]: Abstraction has 149 states and 167 transitions. [2022-07-20 06:08:31,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:31,776 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 167 transitions. [2022-07-20 06:08:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-20 06:08:31,776 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:31,777 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:31,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 06:08:31,777 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1892750440, now seen corresponding path program 1 times [2022-07-20 06:08:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:31,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080053240] [2022-07-20 06:08:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:31,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:31,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:31,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:31,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080053240] [2022-07-20 06:08:31,948 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080053240] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:31,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1123110867] [2022-07-20 06:08:31,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:31,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:31,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:31,950 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:08:32,001 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:08:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:32,099 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 06:08:32,102 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:32,106 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:32,119 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:08:32,124 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:08:32,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:32,146 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:32,152 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:32,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:32,205 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:32,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:32,245 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:08:32,254 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:08:32,263 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-07-20 06:08:32,282 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:08:32,512 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-20 06:08:32,512 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-07-20 06:08:32,519 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:08:32,520 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-20 06:08:32,527 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:32,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:32,611 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:32,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:08:32,617 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:32,617 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:08:32,711 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.base_97| Int)) (or (and (forall ((v_arrayElimArr_6 (Array Int Int))) (or (not (= (select v_arrayElimArr_6 0) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_97| v_arrayElimArr_6) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) (forall ((v_arrayElimArr_5 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_main_~x~0#1.base_97| v_arrayElimArr_5) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0) (not (= (select v_arrayElimArr_5 0) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) 0)))) is different from false [2022-07-20 06:08:32,914 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-20 06:08:32,915 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 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-20 06:08:32,928 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:08:32,933 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:32,934 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 12 treesize of output 16 [2022-07-20 06:08:32,946 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:32,948 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:08:32,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-07-20 06:08:32,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:32,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1123110867] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:32,974 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:32,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 13] total 22 [2022-07-20 06:08:32,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409413144] [2022-07-20 06:08:32,975 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:32,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:08:32,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:32,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:08:32,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=349, Unknown=17, NotChecked=38, Total=462 [2022-07-20 06:08:32,977 INFO L87 Difference]: Start difference. First operand 149 states and 167 transitions. Second operand has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:08:33,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:33,338 INFO L93 Difference]: Finished difference Result 158 states and 177 transitions. [2022-07-20 06:08:33,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 06:08:33,338 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 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 24 [2022-07-20 06:08:33,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:33,339 INFO L225 Difference]: With dead ends: 158 [2022-07-20 06:08:33,339 INFO L226 Difference]: Without dead ends: 158 [2022-07-20 06:08:33,339 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=529, Unknown=22, NotChecked=48, Total=702 [2022-07-20 06:08:33,340 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 68 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 221 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:33,340 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 458 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 443 Invalid, 0 Unknown, 221 Unchecked, 0.2s Time] [2022-07-20 06:08:33,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-07-20 06:08:33,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2022-07-20 06:08:33,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.2611940298507462) internal successors, (169), 150 states have internal predecessors, (169), 0 states have call successors, (0), 0 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:08:33,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2022-07-20 06:08:33,342 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 24 [2022-07-20 06:08:33,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:33,342 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2022-07-20 06:08:33,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.4545454545454546) internal successors, (54), 22 states have internal predecessors, (54), 0 states have call successors, (0), 0 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:08:33,342 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2022-07-20 06:08:33,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-20 06:08:33,343 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:33,343 INFO L195 NwaCegarLoop]: trace histogram [2, 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:08:33,377 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:08:33,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:33,559 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:33,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:33,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1291386135, now seen corresponding path program 2 times [2022-07-20 06:08:33,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:33,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149364981] [2022-07-20 06:08:33,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:33,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:33,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:33,798 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:33,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:33,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149364981] [2022-07-20 06:08:33,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149364981] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:33,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937490460] [2022-07-20 06:08:33,798 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:08:33,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:33,799 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:33,800 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:08:33,853 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:08:33,928 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:08:33,928 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:08:33,930 INFO L263 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-20 06:08:33,934 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:33,940 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:34,016 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:34,019 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:34,054 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:08:34,060 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:08:34,187 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:08:34,188 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 25 [2022-07-20 06:08:34,196 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 11 treesize of output 7 [2022-07-20 06:08:34,206 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:34,206 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 22 treesize of output 22 [2022-07-20 06:08:34,250 INFO L356 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-07-20 06:08:34,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-20 06:08:34,255 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 36 [2022-07-20 06:08:34,503 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:08:34,504 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-20 06:08:34,507 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2022-07-20 06:08:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:34,512 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:34,585 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:34,585 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-20 06:08:34,588 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:34,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-07-20 06:08:34,596 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:34,597 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-07-20 06:08:34,605 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:34,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-20 06:08:34,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:34,948 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 49 [2022-07-20 06:08:34,953 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:34,954 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 40 treesize of output 33 [2022-07-20 06:08:34,960 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:34,961 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 58 treesize of output 61 [2022-07-20 06:08:35,147 INFO L356 Elim1Store]: treesize reduction 30, result has 83.9 percent of original size [2022-07-20 06:08:35,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 7 new quantified variables, introduced 15 case distinctions, treesize of input 162 treesize of output 277 [2022-07-20 06:08:35,164 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:35,165 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 143 treesize of output 129 [2022-07-20 06:08:35,212 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:35,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 184 treesize of output 210 [2022-07-20 06:08:53,784 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:53,784 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 49 [2022-07-20 06:08:53,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:53,791 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 40 treesize of output 33 [2022-07-20 06:08:53,835 INFO L356 Elim1Store]: treesize reduction 72, result has 26.5 percent of original size [2022-07-20 06:08:53,836 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 112 treesize of output 101 [2022-07-20 06:08:53,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:53,842 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 35 treesize of output 31 [2022-07-20 06:08:53,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:53,863 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:53,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 67 [2022-07-20 06:08:53,869 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:08:54,054 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:54,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937490460] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:54,055 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:54,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 30 [2022-07-20 06:08:54,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265880431] [2022-07-20 06:08:54,055 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:54,055 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:08:54,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:54,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:08:54,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=735, Unknown=47, NotChecked=0, Total=870 [2022-07-20 06:08:54,056 INFO L87 Difference]: Start difference. First operand 151 states and 169 transitions. Second operand has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:08:54,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:54,792 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2022-07-20 06:08:54,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-20 06:08:54,793 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-07-20 06:08:54,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:54,794 INFO L225 Difference]: With dead ends: 184 [2022-07-20 06:08:54,794 INFO L226 Difference]: Without dead ends: 184 [2022-07-20 06:08:54,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 40 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=220, Invalid=1353, Unknown=67, NotChecked=0, Total=1640 [2022-07-20 06:08:54,795 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 207 mSDsluCounter, 568 mSDsCounter, 0 mSdLazyCounter, 835 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 835 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 347 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:54,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 629 Invalid, 1253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 835 Invalid, 0 Unknown, 347 Unchecked, 0.4s Time] [2022-07-20 06:08:54,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-07-20 06:08:54,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 150. [2022-07-20 06:08:54,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 133 states have (on average 1.2481203007518797) internal successors, (166), 149 states have internal predecessors, (166), 0 states have call successors, (0), 0 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:08:54,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 166 transitions. [2022-07-20 06:08:54,797 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 166 transitions. Word has length 28 [2022-07-20 06:08:54,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:54,797 INFO L495 AbstractCegarLoop]: Abstraction has 150 states and 166 transitions. [2022-07-20 06:08:54,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.066666666666667) internal successors, (62), 30 states have internal predecessors, (62), 0 states have call successors, (0), 0 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:08:54,798 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 166 transitions. [2022-07-20 06:08:54,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:08:54,798 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:54,798 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:54,830 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:08:55,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:55,007 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:55,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:55,008 INFO L85 PathProgramCache]: Analyzing trace with hash -406817341, now seen corresponding path program 1 times [2022-07-20 06:08:55,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:55,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812349053] [2022-07-20 06:08:55,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:55,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:55,049 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:08:55,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:55,050 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812349053] [2022-07-20 06:08:55,050 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812349053] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:08:55,050 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:08:55,050 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:08:55,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856185812] [2022-07-20 06:08:55,050 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:08:55,051 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:08:55,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:55,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:08:55,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:08:55,051 INFO L87 Difference]: Start difference. First operand 150 states and 166 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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:08:55,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:55,132 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-07-20 06:08:55,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:08:55,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:08:55,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:55,133 INFO L225 Difference]: With dead ends: 155 [2022-07-20 06:08:55,133 INFO L226 Difference]: Without dead ends: 155 [2022-07-20 06:08:55,133 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:08:55,134 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 82 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:55,134 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 71 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:08:55,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-07-20 06:08:55,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 151. [2022-07-20 06:08:55,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 134 states have (on average 1.2462686567164178) internal successors, (167), 150 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:08:55,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 167 transitions. [2022-07-20 06:08:55,137 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 167 transitions. Word has length 29 [2022-07-20 06:08:55,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:55,137 INFO L495 AbstractCegarLoop]: Abstraction has 151 states and 167 transitions. [2022-07-20 06:08:55,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 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:08:55,137 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 167 transitions. [2022-07-20 06:08:55,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-07-20 06:08:55,138 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:55,138 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:55,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-20 06:08:55,138 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:55,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:55,138 INFO L85 PathProgramCache]: Analyzing trace with hash -1562174925, now seen corresponding path program 1 times [2022-07-20 06:08:55,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:55,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866745349] [2022-07-20 06:08:55,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:55,139 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:55,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:55,415 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:08:55,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:55,415 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866745349] [2022-07-20 06:08:55,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866745349] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:55,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [280969150] [2022-07-20 06:08:55,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:55,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:55,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:55,417 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:08:55,430 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:08:55,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:55,536 INFO L263 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 62 conjunts are in the unsatisfiable core [2022-07-20 06:08:55,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:55,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:55,549 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:08:55,588 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:55,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:55,617 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:08:55,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:08:55,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:08:55,666 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 16 treesize of output 8 [2022-07-20 06:08:55,676 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 16 treesize of output 18 [2022-07-20 06:08:55,685 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 16 treesize of output 18 [2022-07-20 06:08:55,705 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:55,705 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:55,726 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 16 treesize of output 18 [2022-07-20 06:08:55,739 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:08:55,742 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 18 treesize of output 20 [2022-07-20 06:08:55,746 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:08:55,799 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 27 treesize of output 15 [2022-07-20 06:08:55,812 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 15 treesize of output 7 [2022-07-20 06:08:55,833 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:08:55,834 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:08:55,834 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:55,893 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1))) is different from false [2022-07-20 06:08:55,898 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_109| Int)) (or (not (= (select (select (store |c_#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_109| v_ArrVal_899) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_109|) 0)))) is different from false [2022-07-20 06:08:56,088 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:08:56,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:08:56,185 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_90| Int) (v_ArrVal_890 Int) (|v_ULTIMATE.start_main_~x~0#1.base_109| Int) (|v_ULTIMATE.start_main_#t~malloc3#1.base_18| Int) (v_ArrVal_893 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_18|) 0)) (= |v_ULTIMATE.start_main_~x~0#1.base_109| |c_ULTIMATE.start_main_~head~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_90| |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_90| v_ArrVal_890)) |v_ULTIMATE.start_main_#t~malloc3#1.base_18| v_ArrVal_893) |v_ULTIMATE.start_main_~x~0#1.base_109| v_ArrVal_899) |c_ULTIMATE.start_main_~head~0#1.base|) (+ |c_ULTIMATE.start_main_~head~0#1.offset| 4)) 1)))) is different from false [2022-07-20 06:08:56,191 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:56,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:56,195 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-07-20 06:08:56,197 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:08:56,198 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 39 treesize of output 27 [2022-07-20 06:08:56,200 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 8 treesize of output 4 [2022-07-20 06:08:56,220 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:08:56,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [280969150] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:56,220 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:56,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 16] total 37 [2022-07-20 06:08:56,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584121429] [2022-07-20 06:08:56,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:56,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-07-20 06:08:56,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:56,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-07-20 06:08:56,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=960, Unknown=37, NotChecked=198, Total=1332 [2022-07-20 06:08:56,222 INFO L87 Difference]: Start difference. First operand 151 states and 167 transitions. Second operand has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:08:56,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:56,920 INFO L93 Difference]: Finished difference Result 214 states and 232 transitions. [2022-07-20 06:08:56,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:08:56,921 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-07-20 06:08:56,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:56,922 INFO L225 Difference]: With dead ends: 214 [2022-07-20 06:08:56,922 INFO L226 Difference]: Without dead ends: 214 [2022-07-20 06:08:56,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=303, Invalid=1825, Unknown=46, NotChecked=276, Total=2450 [2022-07-20 06:08:56,923 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 268 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 879 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 1852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 879 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 857 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:56,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 757 Invalid, 1852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 879 Invalid, 0 Unknown, 857 Unchecked, 0.4s Time] [2022-07-20 06:08:56,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-07-20 06:08:56,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 162. [2022-07-20 06:08:56,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 145 states have (on average 1.2275862068965517) internal successors, (178), 161 states have internal predecessors, (178), 0 states have call successors, (0), 0 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:08:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 178 transitions. [2022-07-20 06:08:56,925 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 178 transitions. Word has length 29 [2022-07-20 06:08:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:56,925 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 178 transitions. [2022-07-20 06:08:56,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.027027027027027) internal successors, (75), 37 states have internal predecessors, (75), 0 states have call successors, (0), 0 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:08:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-07-20 06:08:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:08:56,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:56,926 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:56,944 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:08:57,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:57,140 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:57,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:57,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2055250599, now seen corresponding path program 3 times [2022-07-20 06:08:57,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:57,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224569211] [2022-07-20 06:08:57,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:57,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:57,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:57,333 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:57,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224569211] [2022-07-20 06:08:57,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224569211] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:57,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961483023] [2022-07-20 06:08:57,333 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 06:08:57,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:57,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:57,335 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:08:57,336 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-20 06:08:57,444 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 06:08:57,444 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:08:57,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 48 conjunts are in the unsatisfiable core [2022-07-20 06:08:57,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:57,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:57,507 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:57,508 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:57,531 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:08:57,611 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:57,611 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 22 treesize of output 22 [2022-07-20 06:08:57,624 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:08:57,624 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 22 treesize of output 22 [2022-07-20 06:08:57,640 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:57,640 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:57,671 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:08:57,671 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 27 treesize of output 22 [2022-07-20 06:08:57,824 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:08:57,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-07-20 06:08:57,830 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 12 treesize of output 8 [2022-07-20 06:08:57,881 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:08:57,881 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-20 06:08:57,894 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 16 treesize of output 12 [2022-07-20 06:08:57,962 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 25 treesize of output 13 [2022-07-20 06:08:57,965 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:57,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:08:57,980 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1016 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1)) is different from false [2022-07-20 06:08:58,057 INFO L356 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2022-07-20 06:08:58,057 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 27 treesize of output 26 [2022-07-20 06:08:58,061 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2022-07-20 06:08:58,095 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:58,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:08:58,102 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_18 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_18) .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-20 06:08:58,111 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int) (v_ArrVal_1016 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int))) (let ((.cse0 (select v_arrayElimArr_18 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_18) .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|) (not (= (select |c_#valid| .cse0) 0))))) is different from false [2022-07-20 06:08:58,117 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1016 (Array Int Int)) (v_arrayElimArr_18 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_96| Int)) (let ((.cse0 (select v_arrayElimArr_18 |v_ULTIMATE.start_main_~x~0#1.offset_96|))) (or (not (= (select |c_#valid| .cse0) 0)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| .cse1 v_arrayElimArr_18) .cse0 v_ArrVal_1016) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-20 06:08:58,126 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:58,126 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 06:08:58,132 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:58,133 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 134 treesize of output 133 [2022-07-20 06:08:58,137 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 118 treesize of output 110 [2022-07-20 06:08:58,145 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:08:58,146 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 118 treesize of output 108 [2022-07-20 06:08:58,154 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:08:58,154 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:08:58,233 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 06:08:58,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [961483023] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:08:58,233 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:08:58,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16, 16] total 38 [2022-07-20 06:08:58,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412786631] [2022-07-20 06:08:58,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:08:58,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-20 06:08:58,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:08:58,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-20 06:08:58,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=966, Unknown=32, NotChecked=340, Total=1482 [2022-07-20 06:08:58,235 INFO L87 Difference]: Start difference. First operand 162 states and 178 transitions. Second operand has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:59,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:08:59,417 INFO L93 Difference]: Finished difference Result 291 states and 318 transitions. [2022-07-20 06:08:59,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-07-20 06:08:59,418 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-07-20 06:08:59,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:08:59,418 INFO L225 Difference]: With dead ends: 291 [2022-07-20 06:08:59,419 INFO L226 Difference]: Without dead ends: 291 [2022-07-20 06:08:59,420 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 64 ConstructedPredicates, 5 IntricatePredicates, 2 DeprecatedPredicates, 1042 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=550, Invalid=3079, Unknown=51, NotChecked=610, Total=4290 [2022-07-20 06:08:59,420 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 489 mSDsluCounter, 540 mSDsCounter, 0 mSdLazyCounter, 1267 mSolverCounterSat, 158 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 586 SdHoareTripleChecker+Invalid, 2691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 158 IncrementalHoareTripleChecker+Valid, 1267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1266 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:08:59,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 586 Invalid, 2691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [158 Valid, 1267 Invalid, 0 Unknown, 1266 Unchecked, 0.6s Time] [2022-07-20 06:08:59,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2022-07-20 06:08:59,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 178. [2022-07-20 06:08:59,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 161 states have (on average 1.236024844720497) internal successors, (199), 177 states have internal predecessors, (199), 0 states have call successors, (0), 0 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:08:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 199 transitions. [2022-07-20 06:08:59,423 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 199 transitions. Word has length 31 [2022-07-20 06:08:59,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:08:59,423 INFO L495 AbstractCegarLoop]: Abstraction has 178 states and 199 transitions. [2022-07-20 06:08:59,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.0789473684210527) internal successors, (79), 39 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:08:59,423 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 199 transitions. [2022-07-20 06:08:59,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-07-20 06:08:59,424 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:08:59,424 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:08:59,441 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:08:59,641 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-07-20 06:08:59,641 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:08:59,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:08:59,642 INFO L85 PathProgramCache]: Analyzing trace with hash 2055250600, now seen corresponding path program 2 times [2022-07-20 06:08:59,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:08:59,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418246419] [2022-07-20 06:08:59,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:08:59,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:08:59,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:08:59,854 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:08:59,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:08:59,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418246419] [2022-07-20 06:08:59,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418246419] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:08:59,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104204475] [2022-07-20 06:08:59,855 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:08:59,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:08:59,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:08:59,857 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:08:59,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-20 06:08:59,939 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:08:59,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:08:59,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 65 conjunts are in the unsatisfiable core [2022-07-20 06:08:59,946 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:08:59,947 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:08:59,981 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:08:59,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:08:59,997 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:09:00,021 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:09:00,087 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:09:00,087 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:09:00,091 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:09:00,096 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:00,096 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 22 treesize of output 22 [2022-07-20 06:09:00,138 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:00,138 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 22 treesize of output 22 [2022-07-20 06:09:00,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:00,142 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:09:00,173 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:00,174 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:09:00,199 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:09:00,199 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:09:00,202 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:09:00,210 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:09:00,210 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 27 treesize of output 22 [2022-07-20 06:09:00,331 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:09:00,331 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 51 [2022-07-20 06:09:00,337 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 12 treesize of output 8 [2022-07-20 06:09:00,355 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:09:00,355 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:09:00,358 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:09:00,420 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:09:00,420 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 58 treesize of output 58 [2022-07-20 06:09:00,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:00,424 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:09:00,522 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 25 treesize of output 13 [2022-07-20 06:09:00,524 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 15 treesize of output 7 [2022-07-20 06:09:00,529 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:00,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:00,647 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_1139 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:09:00,656 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1139 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:09:00,662 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1139 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (<= (+ (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-20 06:09:00,678 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:00,679 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 55 treesize of output 59 [2022-07-20 06:09:00,717 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1140 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1134) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-07-20 06:09:00,788 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:00,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:09:00,867 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:00,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:09:00,891 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (v_ArrVal_1133 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) 0)) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1134) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_ArrVal_1140 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_1133 |ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))))) is different from false [2022-07-20 06:09:00,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:00,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:09:00,914 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:00,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:09:00,948 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:00,949 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:09:00,961 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:00,962 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:09:00,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (and (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1134) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|)) (forall ((v_arrayElimArr_25 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_25) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select v_arrayElimArr_25 |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc3#1.base_26|)))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) 0)))) is different from false [2022-07-20 06:09:01,033 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (|ULTIMATE.start_main_~x~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (and (forall ((v_arrayElimArr_25 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 |ULTIMATE.start_main_~x~0#1.offset|) |v_ULTIMATE.start_main_#t~malloc3#1.base_26|)) (= |c_ULTIMATE.start_main_#t~mem4#1.base| (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_25) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1134) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) 0)))) is different from false [2022-07-20 06:09:01,098 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_26| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_103| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_103|)) (and (forall ((v_arrayElimArr_25 (Array Int Int)) (v_ArrVal_1140 (Array Int Int))) (or (not (= (select v_arrayElimArr_25 |v_ULTIMATE.start_main_~x~0#1.offset_103|) |v_ULTIMATE.start_main_#t~malloc3#1.base_26|)) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_25) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1140) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (<= 0 (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (forall ((v_ArrVal_1139 (Array Int Int)) (v_ArrVal_1134 (Array Int Int))) (<= (select (select (store (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1134) |v_ULTIMATE.start_main_#t~malloc3#1.base_26| v_ArrVal_1139) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |v_ULTIMATE.start_main_~x~0#1.offset_103|))) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_26|) 0)))) is different from false [2022-07-20 06:09:01,170 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:01,170 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-20 06:09:01,177 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:01,178 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 60 treesize of output 63 [2022-07-20 06:09:01,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 44 [2022-07-20 06:09:01,184 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2022-07-20 06:09:01,211 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:09:01,212 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 21 treesize of output 1 [2022-07-20 06:09:01,216 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:01,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2022-07-20 06:09:01,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:01,218 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:01,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-07-20 06:09:01,224 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:01,224 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:09:01,301 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 06:09:01,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104204475] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:01,301 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:09:01,301 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 17] total 45 [2022-07-20 06:09:01,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397416936] [2022-07-20 06:09:01,301 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:01,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-20 06:09:01,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:09:01,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-20 06:09:01,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=1258, Unknown=8, NotChecked=632, Total=2070 [2022-07-20 06:09:01,303 INFO L87 Difference]: Start difference. First operand 178 states and 199 transitions. Second operand has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:09:02,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:02,200 INFO L93 Difference]: Finished difference Result 263 states and 288 transitions. [2022-07-20 06:09:02,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:09:02,201 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 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:09:02,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:02,201 INFO L225 Difference]: With dead ends: 263 [2022-07-20 06:09:02,201 INFO L226 Difference]: Without dead ends: 263 [2022-07-20 06:09:02,202 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 56 ConstructedPredicates, 8 IntricatePredicates, 2 DeprecatedPredicates, 742 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=311, Invalid=2162, Unknown=9, NotChecked=824, Total=3306 [2022-07-20 06:09:02,203 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 254 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 978 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 2630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 978 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1589 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:02,203 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 853 Invalid, 2630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 978 Invalid, 0 Unknown, 1589 Unchecked, 0.4s Time] [2022-07-20 06:09:02,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2022-07-20 06:09:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 183. [2022-07-20 06:09:02,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 166 states have (on average 1.2349397590361446) internal successors, (205), 182 states have internal predecessors, (205), 0 states have call successors, (0), 0 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:09:02,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 205 transitions. [2022-07-20 06:09:02,206 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 205 transitions. Word has length 31 [2022-07-20 06:09:02,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:02,206 INFO L495 AbstractCegarLoop]: Abstraction has 183 states and 205 transitions. [2022-07-20 06:09:02,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 states have internal predecessors, (89), 0 states have call successors, (0), 0 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:09:02,206 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 205 transitions. [2022-07-20 06:09:02,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:09:02,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:02,207 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:02,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-07-20 06:09:02,419 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-20 06:09:02,420 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:02,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:02,420 INFO L85 PathProgramCache]: Analyzing trace with hash 902505836, now seen corresponding path program 1 times [2022-07-20 06:09:02,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:09:02,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182720536] [2022-07-20 06:09:02,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:02,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:09:02,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:02,505 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:02,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:09:02,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182720536] [2022-07-20 06:09:02,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182720536] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:09:02,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [149413067] [2022-07-20 06:09:02,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:02,506 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:09:02,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:09:02,508 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:09:02,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-20 06:09:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:02,630 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-20 06:09:02,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:02,667 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:09:02,669 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:09:02,760 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:02,761 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-07-20 06:09:02,763 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:02,764 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:02,765 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 15 treesize of output 10 [2022-07-20 06:09:02,775 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:02,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:03,037 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:03,038 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 75 treesize of output 70 [2022-07-20 06:09:03,043 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 76 [2022-07-20 06:09:03,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:03,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [149413067] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:03,098 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:09:03,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 22 [2022-07-20 06:09:03,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691880868] [2022-07-20 06:09:03,098 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:03,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:09:03,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:09:03,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:09:03,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=389, Unknown=0, NotChecked=0, Total=462 [2022-07-20 06:09:03,099 INFO L87 Difference]: Start difference. First operand 183 states and 205 transitions. Second operand has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:03,448 INFO L93 Difference]: Finished difference Result 230 states and 252 transitions. [2022-07-20 06:09:03,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 06:09:03,449 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-07-20 06:09:03,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:03,449 INFO L225 Difference]: With dead ends: 230 [2022-07-20 06:09:03,449 INFO L226 Difference]: Without dead ends: 230 [2022-07-20 06:09:03,450 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=659, Unknown=0, NotChecked=0, Total=812 [2022-07-20 06:09:03,450 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 273 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 574 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 902 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 574 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 282 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:03,450 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 475 Invalid, 902 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 574 Invalid, 0 Unknown, 282 Unchecked, 0.2s Time] [2022-07-20 06:09:03,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-07-20 06:09:03,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 194. [2022-07-20 06:09:03,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 177 states have (on average 1.2259887005649717) internal successors, (217), 193 states have internal predecessors, (217), 0 states have call successors, (0), 0 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:09:03,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2022-07-20 06:09:03,453 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 32 [2022-07-20 06:09:03,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:03,453 INFO L495 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2022-07-20 06:09:03,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.727272727272727) internal successors, (82), 22 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2022-07-20 06:09:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:09:03,453 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:03,453 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:03,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-07-20 06:09:03,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-20 06:09:03,659 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:03,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:03,660 INFO L85 PathProgramCache]: Analyzing trace with hash -927967551, now seen corresponding path program 1 times [2022-07-20 06:09:03,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:09:03,660 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119089472] [2022-07-20 06:09:03,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:03,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:09:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:03,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:03,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:09:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119089472] [2022-07-20 06:09:03,808 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119089472] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:09:03,808 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [690949653] [2022-07-20 06:09:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:03,808 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:09:03,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:09:03,810 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:09:03,837 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-20 06:09:03,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:03,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 06:09:03,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:03,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:03,942 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:03,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:09:03,960 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:09:04,106 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:04,107 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 21 [2022-07-20 06:09:04,186 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:09:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:04,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:04,323 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:04,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2022-07-20 06:09:04,400 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 10 treesize of output 8 [2022-07-20 06:09:04,402 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 14 treesize of output 12 [2022-07-20 06:09:04,404 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 11 treesize of output 9 [2022-07-20 06:09:04,405 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:04,431 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:04,431 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [690949653] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:04,431 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:09:04,431 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 33 [2022-07-20 06:09:04,431 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991628924] [2022-07-20 06:09:04,431 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:04,431 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-07-20 06:09:04,432 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:09:04,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-07-20 06:09:04,432 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=1020, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 06:09:04,432 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:09:05,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:05,124 INFO L93 Difference]: Finished difference Result 226 states and 249 transitions. [2022-07-20 06:09:05,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:09:05,125 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 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 32 [2022-07-20 06:09:05,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:05,126 INFO L225 Difference]: With dead ends: 226 [2022-07-20 06:09:05,126 INFO L226 Difference]: Without dead ends: 226 [2022-07-20 06:09:05,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 548 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=322, Invalid=1934, Unknown=0, NotChecked=0, Total=2256 [2022-07-20 06:09:05,127 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 336 mSDsluCounter, 519 mSDsCounter, 0 mSdLazyCounter, 1177 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1397 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:05,127 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 554 Invalid, 1397 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 1177 Invalid, 0 Unknown, 128 Unchecked, 0.4s Time] [2022-07-20 06:09:05,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-07-20 06:09:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 208. [2022-07-20 06:09:05,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 191 states have (on average 1.2460732984293195) internal successors, (238), 207 states have internal predecessors, (238), 0 states have call successors, (0), 0 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:09:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 238 transitions. [2022-07-20 06:09:05,130 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 238 transitions. Word has length 32 [2022-07-20 06:09:05,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:05,130 INFO L495 AbstractCegarLoop]: Abstraction has 208 states and 238 transitions. [2022-07-20 06:09:05,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 2.1818181818181817) internal successors, (72), 34 states have internal predecessors, (72), 0 states have call successors, (0), 0 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:09:05,130 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 238 transitions. [2022-07-20 06:09:05,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:09:05,130 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:05,130 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:05,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:05,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-07-20 06:09:05,339 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:05,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:05,340 INFO L85 PathProgramCache]: Analyzing trace with hash -927967550, now seen corresponding path program 1 times [2022-07-20 06:09:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:09:05,340 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226184545] [2022-07-20 06:09:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:05,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:09:05,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:05,424 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:05,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:09:05,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226184545] [2022-07-20 06:09:05,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226184545] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:09:05,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [467657519] [2022-07-20 06:09:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:05,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:09:05,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:09:05,440 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:09:05,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-07-20 06:09:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:05,539 INFO L263 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 06:09:05,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:05,564 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:09:05,568 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:09:05,731 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:05,731 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 15 treesize of output 15 [2022-07-20 06:09:05,737 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:05,737 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 17 treesize of output 17 [2022-07-20 06:09:05,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:05,837 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:06,141 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:06,141 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 29 treesize of output 33 [2022-07-20 06:09:06,522 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 10 treesize of output 8 [2022-07-20 06:09:06,524 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:09:06,529 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 10 treesize of output 8 [2022-07-20 06:09:06,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:06,533 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 10 treesize of output 8 [2022-07-20 06:09:06,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:06,610 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:06,610 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [467657519] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:06,611 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:09:06,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 37 [2022-07-20 06:09:06,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565013504] [2022-07-20 06:09:06,611 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:06,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-07-20 06:09:06,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:09:06,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-07-20 06:09:06,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=1300, Unknown=0, NotChecked=0, Total=1406 [2022-07-20 06:09:06,612 INFO L87 Difference]: Start difference. First operand 208 states and 238 transitions. Second operand has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:09:07,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:07,955 INFO L93 Difference]: Finished difference Result 260 states and 283 transitions. [2022-07-20 06:09:07,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-07-20 06:09:07,956 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 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 32 [2022-07-20 06:09:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:07,956 INFO L225 Difference]: With dead ends: 260 [2022-07-20 06:09:07,957 INFO L226 Difference]: Without dead ends: 260 [2022-07-20 06:09:07,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 39 SyntacticMatches, 11 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 1110 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=664, Invalid=4592, Unknown=0, NotChecked=0, Total=5256 [2022-07-20 06:09:07,959 INFO L413 NwaCegarLoop]: 50 mSDtfsCounter, 483 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1209 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 483 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 2151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 1209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 833 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:07,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [483 Valid, 859 Invalid, 2151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 1209 Invalid, 0 Unknown, 833 Unchecked, 0.4s Time] [2022-07-20 06:09:07,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2022-07-20 06:09:07,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 224. [2022-07-20 06:09:07,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 207 states have (on average 1.2560386473429952) internal successors, (260), 223 states have internal predecessors, (260), 0 states have call successors, (0), 0 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:09:07,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 260 transitions. [2022-07-20 06:09:07,967 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 260 transitions. Word has length 32 [2022-07-20 06:09:07,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:07,967 INFO L495 AbstractCegarLoop]: Abstraction has 224 states and 260 transitions. [2022-07-20 06:09:07,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.5405405405405403) internal successors, (94), 38 states have internal predecessors, (94), 0 states have call successors, (0), 0 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:09:07,968 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 260 transitions. [2022-07-20 06:09:07,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:09:07,968 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:07,968 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:07,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:08,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-20 06:09:08,184 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:08,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:08,185 INFO L85 PathProgramCache]: Analyzing trace with hash 1530571530, now seen corresponding path program 1 times [2022-07-20 06:09:08,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:09:08,186 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072314460] [2022-07-20 06:09:08,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:08,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:09:08,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:08,345 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:08,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:09:08,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072314460] [2022-07-20 06:09:08,346 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072314460] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:09:08,346 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [474744927] [2022-07-20 06:09:08,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:08,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:09:08,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:09:08,347 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:09:08,348 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-07-20 06:09:08,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:08,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-20 06:09:08,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:08,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:08,523 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:09:08,523 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:09:08,575 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:09:08,672 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:08,672 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 31 treesize of output 29 [2022-07-20 06:09:08,682 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:08,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:09:08,729 INFO L356 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2022-07-20 06:09:08,730 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2022-07-20 06:09:08,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-20 06:09:08,780 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 37 treesize of output 28 [2022-07-20 06:09:08,790 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:09:08,871 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:09:08,986 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:08,987 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2022-07-20 06:09:09,037 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:09,037 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:09,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,071 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-20 06:09:09,075 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_29 (Array Int Int))) (or (not (= (select v_arrayElimArr_29 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1))) is different from false [2022-07-20 06:09:09,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1441 Int) (v_arrayElimArr_29 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_152| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152| v_ArrVal_1441) (select (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_main_~x~0#1.base_152| v_arrayElimArr_29) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152|) 0)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_29 0))))) is different from false [2022-07-20 06:09:09,125 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1441 Int) (v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_152| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152| v_ArrVal_1441) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1440) |v_ULTIMATE.start_main_~x~0#1.base_152| v_arrayElimArr_29) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_29 0))))) is different from false [2022-07-20 06:09:09,138 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1441 Int) (v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_152| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152| v_ArrVal_1441) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_1440) |v_ULTIMATE.start_main_~x~0#1.base_152| v_arrayElimArr_29) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_29 0))))) is different from false [2022-07-20 06:09:09,146 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1441 Int) (v_arrayElimArr_29 (Array Int Int)) (v_ArrVal_1440 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_152| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152|) 0)) (= (select (store |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_152| v_ArrVal_1441) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_1440) |v_ULTIMATE.start_main_~x~0#1.base_152| v_arrayElimArr_29) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) 1) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_29 0))))) is different from false [2022-07-20 06:09:09,159 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,159 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-07-20 06:09:09,167 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,167 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 162 treesize of output 161 [2022-07-20 06:09:09,172 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 73 treesize of output 69 [2022-07-20 06:09:09,180 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:09,180 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 148 treesize of output 146 [2022-07-20 06:09:14,983 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-07-20 06:09:14,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [474744927] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:14,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:09:14,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15, 16] total 40 [2022-07-20 06:09:14,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225841965] [2022-07-20 06:09:14,983 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:14,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-07-20 06:09:14,984 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:09:14,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-07-20 06:09:14,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=1091, Unknown=5, NotChecked=360, Total=1640 [2022-07-20 06:09:14,984 INFO L87 Difference]: Start difference. First operand 224 states and 260 transitions. Second operand has 41 states, 40 states have (on average 2.025) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:09:15,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:15,743 INFO L93 Difference]: Finished difference Result 243 states and 277 transitions. [2022-07-20 06:09:15,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-20 06:09:15,743 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 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 32 [2022-07-20 06:09:15,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:15,744 INFO L225 Difference]: With dead ends: 243 [2022-07-20 06:09:15,744 INFO L226 Difference]: Without dead ends: 243 [2022-07-20 06:09:15,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 40 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 706 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=301, Invalid=1694, Unknown=5, NotChecked=450, Total=2450 [2022-07-20 06:09:15,745 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 225 mSDsluCounter, 619 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 2074 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 895 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:15,745 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 677 Invalid, 2074 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1099 Invalid, 0 Unknown, 895 Unchecked, 0.4s Time] [2022-07-20 06:09:15,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-07-20 06:09:15,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 228. [2022-07-20 06:09:15,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 211 states have (on average 1.2606635071090047) internal successors, (266), 227 states have internal predecessors, (266), 0 states have call successors, (0), 0 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:09:15,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 266 transitions. [2022-07-20 06:09:15,748 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 266 transitions. Word has length 32 [2022-07-20 06:09:15,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:15,748 INFO L495 AbstractCegarLoop]: Abstraction has 228 states and 266 transitions. [2022-07-20 06:09:15,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.025) internal successors, (81), 41 states have internal predecessors, (81), 0 states have call successors, (0), 0 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:09:15,748 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 266 transitions. [2022-07-20 06:09:15,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-07-20 06:09:15,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:15,748 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:15,766 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:15,948 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-07-20 06:09:15,949 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:15,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:15,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1530571531, now seen corresponding path program 1 times [2022-07-20 06:09:15,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:09:15,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1894734166] [2022-07-20 06:09:15,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:15,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:09:15,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:16,283 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:16,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 06:09:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1894734166] [2022-07-20 06:09:16,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1894734166] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 06:09:16,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40731424] [2022-07-20 06:09:16,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:16,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:09:16,284 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:09:16,299 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 06:09:16,300 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-07-20 06:09:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:16,434 INFO L263 TraceCheckSpWp]: Trace formula consists of 247 conjuncts, 76 conjunts are in the unsatisfiable core [2022-07-20 06:09:16,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:16,441 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:16,492 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:16,511 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-07-20 06:09:16,511 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-07-20 06:09:16,546 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:09:16,557 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:09:16,671 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:09:16,672 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:09:16,676 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:09:16,685 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:16,685 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 40 treesize of output 36 [2022-07-20 06:09:16,720 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:16,721 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 44 [2022-07-20 06:09:16,724 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 18 treesize of output 20 [2022-07-20 06:09:16,789 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-07-20 06:09:16,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 26 [2022-07-20 06:09:16,806 INFO L356 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-07-20 06:09:16,806 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2022-07-20 06:09:16,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2022-07-20 06:09:16,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-07-20 06:09:16,866 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 37 treesize of output 28 [2022-07-20 06:09:16,869 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-20 06:09:17,039 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:09:17,040 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 83 treesize of output 45 [2022-07-20 06:09:17,045 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:09:17,045 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-20 06:09:17,051 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:17,052 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:17,239 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,239 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-07-20 06:09:17,244 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-07-20 06:09:17,247 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 28 [2022-07-20 06:09:17,253 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_33 (Array Int Int)) (v_arrayElimArr_32 (Array Int Int))) (or (<= (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_32) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_32 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.base|)) (not (= (select v_arrayElimArr_33 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (<= 0 (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_31) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) (not (= (select v_arrayElimArr_31 |c_ULTIMATE.start_main_~x~0#1.offset|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:09:17,491 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1553 (Array Int Int)) (v_ArrVal_1552 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.base_160| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_160|) 0)) (and (forall ((v_arrayElimArr_33 (Array Int Int)) (v_arrayElimArr_32 (Array Int Int)) (v_ArrVal_1554 Int)) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_32 0))) (<= (+ 8 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1552) |v_ULTIMATE.start_main_~x~0#1.base_160| v_arrayElimArr_33) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~x~0#1.base_160| v_ArrVal_1554) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1553) |v_ULTIMATE.start_main_~x~0#1.base_160| v_arrayElimArr_32) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (select v_arrayElimArr_33 0) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimArr_31 (Array Int Int))) (or (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_1552) |v_ULTIMATE.start_main_~x~0#1.base_160| v_arrayElimArr_31) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 4)) (not (= (select v_arrayElimArr_31 0) |c_ULTIMATE.start_main_~head~0#1.offset|))))))) is different from false [2022-07-20 06:09:17,776 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,776 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 46 treesize of output 47 [2022-07-20 06:09:17,781 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,781 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 38 treesize of output 39 [2022-07-20 06:09:17,790 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,790 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 128 treesize of output 131 [2022-07-20 06:09:17,801 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,801 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 766 treesize of output 741 [2022-07-20 06:09:17,811 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 370 treesize of output 354 [2022-07-20 06:09:17,822 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,822 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 716 treesize of output 690 [2022-07-20 06:09:17,835 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:17,835 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 684 treesize of output 658 [2022-07-20 06:09:17,843 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 646 treesize of output 630 [2022-07-20 06:09:18,558 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:18,559 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 06:09:18,565 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:18,565 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 138 treesize of output 137 [2022-07-20 06:09:18,569 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 118 [2022-07-20 06:09:18,576 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:18,576 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 124 treesize of output 122 [2022-07-20 06:09:27,095 WARN L233 SmtUtils]: Spent 8.14s on a formula simplification. DAG size of input: 53 DAG size of output: 45 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-07-20 06:09:27,104 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:09:27,106 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 133 treesize of output 129 [2022-07-20 06:09:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:27,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40731424] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:27,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-20 06:09:27,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 17] total 44 [2022-07-20 06:09:27,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141023262] [2022-07-20 06:09:27,266 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:27,267 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-07-20 06:09:27,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 06:09:27,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-07-20 06:09:27,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=1625, Unknown=18, NotChecked=166, Total=1980 [2022-07-20 06:09:27,268 INFO L87 Difference]: Start difference. First operand 228 states and 266 transitions. Second operand has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:09:28,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:28,573 INFO L93 Difference]: Finished difference Result 247 states and 284 transitions. [2022-07-20 06:09:28,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-20 06:09:28,573 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 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 32 [2022-07-20 06:09:28,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:28,574 INFO L225 Difference]: With dead ends: 247 [2022-07-20 06:09:28,574 INFO L226 Difference]: Without dead ends: 247 [2022-07-20 06:09:28,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 62 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=424, Invalid=3348, Unknown=18, NotChecked=242, Total=4032 [2022-07-20 06:09:28,576 INFO L413 NwaCegarLoop]: 56 mSDtfsCounter, 160 mSDsluCounter, 552 mSDsCounter, 0 mSdLazyCounter, 786 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 608 SdHoareTripleChecker+Invalid, 1560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 786 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 707 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:28,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 608 Invalid, 1560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 786 Invalid, 0 Unknown, 707 Unchecked, 0.4s Time] [2022-07-20 06:09:28,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-07-20 06:09:28,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 227. [2022-07-20 06:09:28,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 210 states have (on average 1.2571428571428571) internal successors, (264), 226 states have internal predecessors, (264), 0 states have call successors, (0), 0 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:09:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 264 transitions. [2022-07-20 06:09:28,579 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 264 transitions. Word has length 32 [2022-07-20 06:09:28,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:28,579 INFO L495 AbstractCegarLoop]: Abstraction has 227 states and 264 transitions. [2022-07-20 06:09:28,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 44 states have (on average 2.0681818181818183) internal successors, (91), 45 states have internal predecessors, (91), 0 states have call successors, (0), 0 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:09:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-07-20 06:09:28,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-07-20 06:09:28,580 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:28,580 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:28,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:28,801 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 06:09:28,801 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:28,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:28,802 INFO L85 PathProgramCache]: Analyzing trace with hash -2087091526, now seen corresponding path program 1 times [2022-07-20 06:09:28,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 06:09:28,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636258357] [2022-07-20 06:09:28,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:28,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 06:09:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 06:09:28,816 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-20 06:09:28,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-20 06:09:28,853 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-20 06:09:28,853 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-20 06:09:28,854 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (44 of 45 remaining) [2022-07-20 06:09:28,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 45 remaining) [2022-07-20 06:09:28,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 45 remaining) [2022-07-20 06:09:28,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 45 remaining) [2022-07-20 06:09:28,855 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 45 remaining) [2022-07-20 06:09:28,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 45 remaining) [2022-07-20 06:09:28,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 45 remaining) [2022-07-20 06:09:28,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 45 remaining) [2022-07-20 06:09:28,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 45 remaining) [2022-07-20 06:09:28,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 45 remaining) [2022-07-20 06:09:28,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 45 remaining) [2022-07-20 06:09:28,856 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 45 remaining) [2022-07-20 06:09:28,857 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 45 remaining) [2022-07-20 06:09:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 45 remaining) [2022-07-20 06:09:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 45 remaining) [2022-07-20 06:09:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 45 remaining) [2022-07-20 06:09:28,858 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 45 remaining) [2022-07-20 06:09:28,859 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 45 remaining) [2022-07-20 06:09:28,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 45 remaining) [2022-07-20 06:09:28,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 45 remaining) [2022-07-20 06:09:28,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 45 remaining) [2022-07-20 06:09:28,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 45 remaining) [2022-07-20 06:09:28,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 45 remaining) [2022-07-20 06:09:28,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK (7 of 45 remaining) [2022-07-20 06:09:28,860 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 45 remaining) [2022-07-20 06:09:28,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 45 remaining) [2022-07-20 06:09:28,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 45 remaining) [2022-07-20 06:09:28,861 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 45 remaining) [2022-07-20 06:09:28,874 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (2 of 45 remaining) [2022-07-20 06:09:28,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (1 of 45 remaining) [2022-07-20 06:09:28,875 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (0 of 45 remaining) [2022-07-20 06:09:28,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 06:09:28,878 INFO L356 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:28,881 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-20 06:09:28,909 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.07 06:09:28 BoogieIcfgContainer [2022-07-20 06:09:28,913 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-20 06:09:28,914 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-20 06:09:28,914 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-20 06:09:28,914 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-20 06:09:28,915 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:07:59" (3/4) ... [2022-07-20 06:09:28,917 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-07-20 06:09:28,917 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-20 06:09:28,917 INFO L158 Benchmark]: Toolchain (without parser) took 89953.86ms. Allocated memory was 104.9MB in the beginning and 553.6MB in the end (delta: 448.8MB). Free memory was 74.0MB in the beginning and 518.5MB in the end (delta: -444.5MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2022-07-20 06:09:28,918 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 104.9MB. Free memory was 60.7MB in the beginning and 60.7MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:09:28,918 INFO L158 Benchmark]: CACSL2BoogieTranslator took 311.16ms. Allocated memory was 104.9MB in the beginning and 148.9MB in the end (delta: 44.0MB). Free memory was 73.8MB in the beginning and 116.6MB in the end (delta: -42.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-20 06:09:28,918 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.00ms. Allocated memory is still 148.9MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:09:28,918 INFO L158 Benchmark]: Boogie Preprocessor took 37.71ms. Allocated memory is still 148.9MB. Free memory was 114.5MB in the beginning and 112.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-20 06:09:28,918 INFO L158 Benchmark]: RCFGBuilder took 443.20ms. Allocated memory is still 148.9MB. Free memory was 112.9MB in the beginning and 94.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-07-20 06:09:28,918 INFO L158 Benchmark]: TraceAbstraction took 89104.78ms. Allocated memory was 148.9MB in the beginning and 553.6MB in the end (delta: 404.8MB). Free memory was 94.4MB in the beginning and 518.5MB in the end (delta: -424.1MB). Peak memory consumption was 308.8MB. Max. memory is 16.1GB. [2022-07-20 06:09:28,918 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 553.6MB. Free memory is still 518.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-20 06:09:28,920 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.21ms. Allocated memory is still 104.9MB. Free memory was 60.7MB in the beginning and 60.7MB in the end (delta: 47.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 311.16ms. Allocated memory was 104.9MB in the beginning and 148.9MB in the end (delta: 44.0MB). Free memory was 73.8MB in the beginning and 116.6MB in the end (delta: -42.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.00ms. Allocated memory is still 148.9MB. Free memory was 116.6MB in the beginning and 114.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 37.71ms. Allocated memory is still 148.9MB. Free memory was 114.5MB in the beginning and 112.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 443.20ms. Allocated memory is still 148.9MB. Free memory was 112.9MB in the beginning and 94.8MB in the end (delta: 18.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 89104.78ms. Allocated memory was 148.9MB in the beginning and 553.6MB in the end (delta: 404.8MB). Free memory was 94.4MB in the beginning and 518.5MB in the end (delta: -424.1MB). Peak memory consumption was 308.8MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 553.6MB. Free memory is still 518.5MB. There was no memory consumed. 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 - UnprovableResult [Line: 996]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 996. Possible FailurePath: [L999] SLL* head = malloc(sizeof(SLL)); [L1000] head->next = ((void*)0) VAL [head={3:0}] [L1001] head->data = 0 VAL [head={3:0}] [L1003] SLL* x = head; VAL [head={3:0}, x={3:0}] [L1006] COND FALSE !(__VERIFIER_nondet_int()) [L1016] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x = head VAL [head={3:0}, x={3:0}] [L1026] x->next VAL [head={3:0}, x={3:0}, x->next={0:0}] [L1026] COND FALSE !(x->next) [L1033] EXPR x->next VAL [head={3:0}, x={3:0}, x->next={0:0}] [L1033] SLL* y = x->next; [L1034] x->next = malloc(sizeof(SLL)) VAL [head={3:0}, malloc(sizeof(SLL))={-1:0}, x={3:0}, y={0:0}] [L1035] x->data = 1 VAL [head={3:0}, x={3:0}, y={0:0}] [L1036] x->next = y VAL [head={3:0}, x={3:0}, y={0:0}] [L1040] x = head VAL [head={3:0}, x={3:0}, y={0:0}] [L1043] EXPR x->data VAL [head={3:0}, x={3:0}, x->data=1, y={0:0}] [L1043] COND FALSE !(x->data != 1) [L1049] EXPR x->next VAL [head={3:0}, x={3:0}, x->next={0:0}, y={0:0}] [L1049] x = x->next [L1050] COND FALSE !(\read(*x)) VAL [head={3:0}, x={0:0}, y={0:0}] [L1058] x = head VAL [head={3:0}, x={3:0}, y={0:0}] [L1059] COND TRUE x != ((void*)0) [L1061] head = x VAL [head={3:0}, x={3:0}, y={0:0}] [L1062] EXPR x->next VAL [head={3:0}, x={3:0}, x->next={0:0}, y={0:0}] [L1062] x = x->next [L1063] free(head) VAL [head={3:0}, x={0:0}, y={0:0}] [L1063] free(head) VAL [head={3:0}, x={0:0}, y={0:0}] [L1063] free(head) [L1059] COND FALSE !(x != ((void*)0)) VAL [head={3:0}, x={0:0}, y={0:0}] [L1066] return 0; VAL [\result=0, head={3:0}, x={0:0}, y={0:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1053]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1063]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 45 error locations. Started 1 CEGAR loops. OverallTime: 89.0s, OverallIterations: 31, TraceHistogramMax: 3, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 28.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 6130 SdHoareTripleChecker+Valid, 15.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 6130 mSDsluCounter, 10575 SdHoareTripleChecker+Invalid, 13.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 8331 IncrementalHoareTripleChecker+Unchecked, 8973 mSDsCounter, 1571 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 15740 IncrementalHoareTripleChecker+Invalid, 25642 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1571 mSolverCounterUnsat, 1602 mSDtfsCounter, 15740 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1358 GetRequests, 570 SyntacticMatches, 47 SemanticMatches, 741 ConstructedPredicates, 27 IntricatePredicates, 5 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 32.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=228occurred in iteration=29, InterpolantAutomatonStates: 428, 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, 30 MinimizatonAttempts, 1044 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 55.4s InterpolantComputationTime, 1067 NumberOfCodeBlocks, 1067 NumberOfCodeBlocksAsserted, 49 NumberOfCheckSat, 1361 ConstructedInterpolants, 175 QuantifiedInterpolants, 23829 SizeOfPredicates, 227 NumberOfNonLiveVariables, 2938 ConjunctsInSsa, 694 ConjunctsInUnsatCore, 58 InterpolantComputations, 16 PerfectInterpolantSequences, 29/197 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-07-20 06:09:28,952 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 Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/forester-heap/sll-simple-white-blue-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d --- Real Ultimate output --- This is Ultimate 0.2.2-?-eb692b5 [2022-07-20 06:09:30,896 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 06:09:30,898 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 06:09:30,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 06:09:30,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 06:09:30,924 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 06:09:30,927 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 06:09:30,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 06:09:30,931 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 06:09:30,945 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 06:09:30,946 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 06:09:30,947 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 06:09:30,947 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 06:09:30,949 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 06:09:30,950 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 06:09:30,953 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 06:09:30,954 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 06:09:30,955 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 06:09:30,957 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 06:09:30,960 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 06:09:30,961 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 06:09:30,964 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 06:09:30,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 06:09:30,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 06:09:30,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 06:09:30,969 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 06:09:30,970 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 06:09:30,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 06:09:30,971 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 06:09:30,972 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 06:09:30,972 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 06:09:30,972 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 06:09:30,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 06:09:30,974 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 06:09:30,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 06:09:30,977 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 06:09:30,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 06:09:30,978 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 06:09:30,978 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 06:09:30,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 06:09:30,979 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 06:09:30,981 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 06:09:30,984 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-07-20 06:09:31,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 06:09:31,014 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 06:09:31,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 06:09:31,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 06:09:31,015 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 06:09:31,015 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 06:09:31,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 06:09:31,016 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 06:09:31,016 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 06:09:31,017 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 06:09:31,017 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-20 06:09:31,017 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-07-20 06:09:31,017 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 06:09:31,017 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-20 06:09:31,017 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 06:09:31,017 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-07-20 06:09:31,018 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-07-20 06:09:31,018 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-07-20 06:09:31,018 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 06:09:31,018 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-07-20 06:09:31,018 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-07-20 06:09:31,018 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-07-20 06:09:31,019 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-20 06:09:31,019 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 06:09:31,019 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 06:09:31,019 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 06:09:31,019 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 06:09:31,019 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:09:31,020 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 06:09:31,020 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 06:09:31,020 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-07-20 06:09:31,020 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-07-20 06:09:31,020 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-07-20 06:09:31,020 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b63900034700ff8018e29578512f73f88317ae4b603a38b2f2f558c77b57812d [2022-07-20 06:09:31,284 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 06:09:31,307 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 06:09:31,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 06:09:31,309 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 06:09:31,309 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 06:09:31,311 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2022-07-20 06:09:31,354 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798c9ce7e/68af1618d9394af09dc7149a59ba4327/FLAG823d33768 [2022-07-20 06:09:31,788 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 06:09:31,788 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i [2022-07-20 06:09:31,799 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798c9ce7e/68af1618d9394af09dc7149a59ba4327/FLAG823d33768 [2022-07-20 06:09:31,810 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/798c9ce7e/68af1618d9394af09dc7149a59ba4327 [2022-07-20 06:09:31,812 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 06:09:31,813 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 06:09:31,814 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 06:09:31,814 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 06:09:31,816 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 06:09:31,816 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:09:31" (1/1) ... [2022-07-20 06:09:31,817 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3857b2dc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:31, skipping insertion in model container [2022-07-20 06:09:31,818 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 06:09:31" (1/1) ... [2022-07-20 06:09:31,822 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 06:09:31,852 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 06:09:32,100 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2022-07-20 06:09:32,107 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:09:32,117 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 06:09:32,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-simple-white-blue-1.i[22605,22618] [2022-07-20 06:09:32,162 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 06:09:32,185 INFO L208 MainTranslator]: Completed translation [2022-07-20 06:09:32,186 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32 WrapperNode [2022-07-20 06:09:32,186 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 06:09:32,187 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 06:09:32,187 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 06:09:32,188 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 06:09:32,192 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:09:32" (1/1) ... [2022-07-20 06:09:32,211 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:09:32" (1/1) ... [2022-07-20 06:09:32,228 INFO L137 Inliner]: procedures = 122, calls = 31, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 109 [2022-07-20 06:09:32,229 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 06:09:32,230 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 06:09:32,230 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 06:09:32,230 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 06:09:32,235 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,244 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,244 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,252 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,255 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,256 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,260 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 06:09:32,260 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 06:09:32,261 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 06:09:32,261 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 06:09:32,261 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (1/1) ... [2022-07-20 06:09:32,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 06:09:32,281 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 06:09:32,292 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:09:32,294 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:09:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-07-20 06:09:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 06:09:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 06:09:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 06:09:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 06:09:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 06:09:32,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-07-20 06:09:32,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-07-20 06:09:32,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 06:09:32,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 06:09:32,394 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 06:09:32,395 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 06:09:32,744 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 06:09:32,749 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 06:09:32,749 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-07-20 06:09:32,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:09:32 BoogieIcfgContainer [2022-07-20 06:09:32,750 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 06:09:32,752 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 06:09:32,752 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 06:09:32,754 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 06:09:32,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 06:09:31" (1/3) ... [2022-07-20 06:09:32,754 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2dd590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:09:32, skipping insertion in model container [2022-07-20 06:09:32,754 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 06:09:32" (2/3) ... [2022-07-20 06:09:32,755 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c2dd590 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 06:09:32, skipping insertion in model container [2022-07-20 06:09:32,755 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 06:09:32" (3/3) ... [2022-07-20 06:09:32,756 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-simple-white-blue-1.i [2022-07-20 06:09:32,765 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 06:09:32,766 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 45 error locations. [2022-07-20 06:09:32,795 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 06:09:32,801 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@644e0cbc, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@2310b4d9 [2022-07-20 06:09:32,801 INFO L358 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2022-07-20 06:09:32,804 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 51 states have (on average 2.196078431372549) internal successors, (112), 96 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:32,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:09:32,808 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:32,809 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:09:32,810 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:32,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:32,815 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-07-20 06:09:32,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:32,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [423143394] [2022-07-20 06:09:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:32,824 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:32,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:32,829 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:32,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-07-20 06:09:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:32,935 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-20 06:09:32,939 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:32,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:32,990 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:09:32,990 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:32,991 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:32,991 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [423143394] [2022-07-20 06:09:32,991 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [423143394] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:32,992 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:32,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:09:32,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870709165] [2022-07-20 06:09:32,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:32,997 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:09:32,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:33,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:09:33,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:09:33,019 INFO L87 Difference]: Start difference. First operand has 97 states, 51 states have (on average 2.196078431372549) internal successors, (112), 96 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) 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:09:33,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:33,181 INFO L93 Difference]: Finished difference Result 125 states and 133 transitions. [2022-07-20 06:09:33,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:09:33,184 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:09:33,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:33,189 INFO L225 Difference]: With dead ends: 125 [2022-07-20 06:09:33,189 INFO L226 Difference]: Without dead ends: 121 [2022-07-20 06:09:33,190 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:09:33,193 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 83 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:33,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 108 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-20 06:09:33,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-07-20 06:09:33,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 92. [2022-07-20 06:09:33,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 2.0) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 0 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:09:33,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2022-07-20 06:09:33,218 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 3 [2022-07-20 06:09:33,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:33,218 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2022-07-20 06:09:33,219 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:09:33,219 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2022-07-20 06:09:33,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-07-20 06:09:33,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:33,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2022-07-20 06:09:33,227 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:33,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:33,428 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:33,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:33,429 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-07-20 06:09:33,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:33,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1909791010] [2022-07-20 06:09:33,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:33,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:33,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:33,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:33,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-07-20 06:09:33,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:33,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-20 06:09:33,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:33,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:33,480 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:09:33,481 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:33,481 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:33,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1909791010] [2022-07-20 06:09:33,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1909791010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:33,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:33,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-20 06:09:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574542624] [2022-07-20 06:09:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:33,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 06:09:33,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:33,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 06:09:33,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-07-20 06:09:33,486 INFO L87 Difference]: Start difference. First operand 92 states and 98 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:09:33,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:33,648 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-07-20 06:09:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 06:09:33,648 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:09:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:33,649 INFO L225 Difference]: With dead ends: 119 [2022-07-20 06:09:33,649 INFO L226 Difference]: Without dead ends: 119 [2022-07-20 06:09:33,650 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:09:33,651 INFO L413 NwaCegarLoop]: 84 mSDtfsCounter, 79 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:33,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 104 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:09:33,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-07-20 06:09:33,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 90. [2022-07-20 06:09:33,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 0 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:09:33,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2022-07-20 06:09:33,657 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 3 [2022-07-20 06:09:33,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:33,658 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2022-07-20 06:09:33,658 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:09:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2022-07-20 06:09:33,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:09:33,658 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:33,658 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:33,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:33,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:33,859 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:33,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027173, now seen corresponding path program 1 times [2022-07-20 06:09:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:33,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1517057265] [2022-07-20 06:09:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:33,860 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:33,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:33,862 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:33,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-07-20 06:09:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:33,908 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:09:33,909 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:33,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:33,944 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:09:33,945 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-20 06:09:33,954 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:09:33,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:33,955 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:33,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1517057265] [2022-07-20 06:09:33,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1517057265] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:33,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:33,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:09:33,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903045872] [2022-07-20 06:09:33,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:33,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:09:33,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:33,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:09:33,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:09:33,956 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:34,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:34,139 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-07-20 06:09:34,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:09:34,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:09:34,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:34,140 INFO L225 Difference]: With dead ends: 93 [2022-07-20 06:09:34,141 INFO L226 Difference]: Without dead ends: 93 [2022-07-20 06:09:34,141 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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:09:34,141 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 120 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:34,142 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 38 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:09:34,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-07-20 06:09:34,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2022-07-20 06:09:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 57 states have (on average 1.7017543859649122) internal successors, (97), 84 states have internal predecessors, (97), 0 states have call successors, (0), 0 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:09:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 97 transitions. [2022-07-20 06:09:34,147 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 97 transitions. Word has length 7 [2022-07-20 06:09:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:34,147 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 97 transitions. [2022-07-20 06:09:34,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 97 transitions. [2022-07-20 06:09:34,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-07-20 06:09:34,147 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:34,147 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:34,168 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:34,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:34,368 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:34,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:34,369 INFO L85 PathProgramCache]: Analyzing trace with hash 1803027174, now seen corresponding path program 1 times [2022-07-20 06:09:34,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:34,369 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2008467023] [2022-07-20 06:09:34,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:34,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:34,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:34,381 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:34,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-07-20 06:09:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:34,432 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:09:34,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:34,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:34,500 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:34,500 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:09:34,510 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:09:34,510 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:34,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:34,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2008467023] [2022-07-20 06:09:34,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2008467023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:34,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:34,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:09:34,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492706998] [2022-07-20 06:09:34,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:34,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-20 06:09:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:34,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-20 06:09:34,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-20 06:09:34,512 INFO L87 Difference]: Start difference. First operand 85 states and 97 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:34,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:34,763 INFO L93 Difference]: Finished difference Result 113 states and 124 transitions. [2022-07-20 06:09:34,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-20 06:09:34,763 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-07-20 06:09:34,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:34,764 INFO L225 Difference]: With dead ends: 113 [2022-07-20 06:09:34,764 INFO L226 Difference]: Without dead ends: 113 [2022-07-20 06:09:34,764 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 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:09:34,765 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 121 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:34,765 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 53 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:09:34,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-07-20 06:09:34,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 99. [2022-07-20 06:09:34,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.5205479452054795) internal successors, (111), 98 states have internal predecessors, (111), 0 states have call successors, (0), 0 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:09:34,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2022-07-20 06:09:34,769 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 7 [2022-07-20 06:09:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:34,769 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2022-07-20 06:09:34,769 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2022-07-20 06:09:34,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:09:34,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:34,770 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:34,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:34,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:34,971 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:34,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:34,971 INFO L85 PathProgramCache]: Analyzing trace with hash 406735527, now seen corresponding path program 1 times [2022-07-20 06:09:34,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:34,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [595349652] [2022-07-20 06:09:34,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:34,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:34,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:34,973 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:34,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-07-20 06:09:35,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:35,045 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:09:35,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:35,057 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:35,070 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:09:35,085 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 17 treesize of output 9 [2022-07-20 06:09:35,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:09:35,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:35,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:35,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [595349652] [2022-07-20 06:09:35,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [595349652] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:35,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:35,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:09:35,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504269502] [2022-07-20 06:09:35,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:35,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:09:35,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:35,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:09:35,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:09:35,101 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:09:35,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:35,411 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-07-20 06:09:35,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:09:35,412 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 06:09:35,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:35,412 INFO L225 Difference]: With dead ends: 99 [2022-07-20 06:09:35,412 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 06:09:35,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:09:35,413 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:35,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 147 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:09:35,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 06:09:35,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-07-20 06:09:35,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.5068493150684932) internal successors, (110), 97 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:09:35,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 110 transitions. [2022-07-20 06:09:35,418 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 110 transitions. Word has length 11 [2022-07-20 06:09:35,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:35,418 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 110 transitions. [2022-07-20 06:09:35,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:09:35,418 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 110 transitions. [2022-07-20 06:09:35,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-07-20 06:09:35,419 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:35,419 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:35,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:35,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:35,628 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:35,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:35,628 INFO L85 PathProgramCache]: Analyzing trace with hash 406735528, now seen corresponding path program 1 times [2022-07-20 06:09:35,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:35,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800224494] [2022-07-20 06:09:35,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:35,629 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:35,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:35,630 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:35,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-07-20 06:09:35,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:35,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:09:35,700 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:35,706 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:35,730 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:09:35,734 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:09:35,766 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 17 treesize of output 9 [2022-07-20 06:09:35,769 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:09:35,805 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:09:35,806 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:35,806 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:35,806 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800224494] [2022-07-20 06:09:35,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800224494] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:35,806 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:35,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:09:35,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478126165] [2022-07-20 06:09:35,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:35,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:09:35,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:35,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:09:35,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:09:35,807 INFO L87 Difference]: Start difference. First operand 98 states and 110 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:09:36,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:36,159 INFO L93 Difference]: Finished difference Result 97 states and 110 transitions. [2022-07-20 06:09:36,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 06:09:36,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-07-20 06:09:36,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:36,160 INFO L225 Difference]: With dead ends: 97 [2022-07-20 06:09:36,160 INFO L226 Difference]: Without dead ends: 97 [2022-07-20 06:09:36,160 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:09:36,161 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 11 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:36,161 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 189 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:09:36,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-07-20 06:09:36,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 90. [2022-07-20 06:09:36,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 69 states have (on average 1.463768115942029) internal successors, (101), 89 states have internal predecessors, (101), 0 states have call successors, (0), 0 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:09:36,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 101 transitions. [2022-07-20 06:09:36,165 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 101 transitions. Word has length 11 [2022-07-20 06:09:36,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:36,165 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 101 transitions. [2022-07-20 06:09:36,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 states have internal predecessors, (11), 0 states have call successors, (0), 0 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:09:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 101 transitions. [2022-07-20 06:09:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-07-20 06:09:36,166 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:36,166 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:36,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:36,366 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:36,367 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:36,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:36,367 INFO L85 PathProgramCache]: Analyzing trace with hash 813754491, now seen corresponding path program 1 times [2022-07-20 06:09:36,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:36,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [63893500] [2022-07-20 06:09:36,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:36,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:36,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:36,369 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:36,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-07-20 06:09:36,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:36,458 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 15 conjunts are in the unsatisfiable core [2022-07-20 06:09:36,460 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:36,467 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:09:36,472 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:09:36,497 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-07-20 06:09:36,497 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 20 [2022-07-20 06:09:36,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:36,506 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:09:36,536 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:09:36,539 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:09:36,550 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:36,550 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:36,551 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:36,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [63893500] [2022-07-20 06:09:36,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [63893500] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:36,551 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:36,551 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-20 06:09:36,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1233407023] [2022-07-20 06:09:36,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:36,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:09:36,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:36,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:09:36,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:09:36,552 INFO L87 Difference]: Start difference. First operand 90 states and 101 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:36,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:36,775 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2022-07-20 06:09:36,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:09:36,775 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-07-20 06:09:36,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:36,776 INFO L225 Difference]: With dead ends: 99 [2022-07-20 06:09:36,776 INFO L226 Difference]: Without dead ends: 99 [2022-07-20 06:09:36,776 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:09:36,776 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 12 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:36,776 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 198 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:09:36,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-07-20 06:09:36,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 94. [2022-07-20 06:09:36,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 73 states have (on average 1.4657534246575343) internal successors, (107), 93 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:36,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2022-07-20 06:09:36,780 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 13 [2022-07-20 06:09:36,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:36,780 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2022-07-20 06:09:36,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:36,780 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2022-07-20 06:09:36,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-07-20 06:09:36,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:36,780 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:36,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:36,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:36,988 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:36,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:36,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1626848531, now seen corresponding path program 1 times [2022-07-20 06:09:36,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:36,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1833705025] [2022-07-20 06:09:36,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:36,988 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:36,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:36,990 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:36,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-07-20 06:09:37,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:37,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 13 conjunts are in the unsatisfiable core [2022-07-20 06:09:37,068 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:37,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:09:37,119 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:37,120 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:09:37,146 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:09:37,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:09:37,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:37,153 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:37,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1833705025] [2022-07-20 06:09:37,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1833705025] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:37,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:37,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 06:09:37,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147151709] [2022-07-20 06:09:37,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:37,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:09:37,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:37,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:09:37,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:09:37,155 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:09:37,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:37,421 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2022-07-20 06:09:37,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 06:09:37,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 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 16 [2022-07-20 06:09:37,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:37,422 INFO L225 Difference]: With dead ends: 124 [2022-07-20 06:09:37,422 INFO L226 Difference]: Without dead ends: 124 [2022-07-20 06:09:37,422 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-07-20 06:09:37,423 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 36 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:37,423 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 211 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:09:37,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-07-20 06:09:37,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 97. [2022-07-20 06:09:37,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 96 states have internal predecessors, (110), 0 states have call successors, (0), 0 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:09:37,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 110 transitions. [2022-07-20 06:09:37,426 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 110 transitions. Word has length 16 [2022-07-20 06:09:37,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:37,426 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 110 transitions. [2022-07-20 06:09:37,426 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 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:09:37,426 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 110 transitions. [2022-07-20 06:09:37,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:09:37,427 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:37,427 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:37,447 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:37,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:37,628 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:37,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:37,628 INFO L85 PathProgramCache]: Analyzing trace with hash 1105672240, now seen corresponding path program 1 times [2022-07-20 06:09:37,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:37,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [450328091] [2022-07-20 06:09:37,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:37,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:37,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:37,630 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:37,630 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-07-20 06:09:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:37,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 14 conjunts are in the unsatisfiable core [2022-07-20 06:09:37,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:37,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:37,731 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-07-20 06:09:37,731 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-07-20 06:09:37,755 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:09:37,794 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 20 treesize of output 12 [2022-07-20 06:09:37,817 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:09:37,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:37,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:37,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [450328091] [2022-07-20 06:09:37,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [450328091] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:37,818 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:37,818 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:09:37,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471903114] [2022-07-20 06:09:37,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:37,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:09:37,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:37,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:09:37,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:09:37,820 INFO L87 Difference]: Start difference. First operand 97 states and 110 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:38,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:38,228 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-07-20 06:09:38,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 06:09:38,229 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 06:09:38,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:38,229 INFO L225 Difference]: With dead ends: 128 [2022-07-20 06:09:38,229 INFO L226 Difference]: Without dead ends: 128 [2022-07-20 06:09:38,230 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=83, Unknown=0, NotChecked=0, Total=132 [2022-07-20 06:09:38,230 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 105 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 259 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 259 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:38,230 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 96 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 259 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:09:38,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-07-20 06:09:38,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 101. [2022-07-20 06:09:38,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 80 states have (on average 1.45) internal successors, (116), 100 states have internal predecessors, (116), 0 states have call successors, (0), 0 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:09:38,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 116 transitions. [2022-07-20 06:09:38,233 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 116 transitions. Word has length 17 [2022-07-20 06:09:38,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:38,233 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 116 transitions. [2022-07-20 06:09:38,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:38,233 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 116 transitions. [2022-07-20 06:09:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-07-20 06:09:38,233 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:38,233 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:38,261 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:38,440 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:38,440 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:38,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:38,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1105672241, now seen corresponding path program 1 times [2022-07-20 06:09:38,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:38,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569545388] [2022-07-20 06:09:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:38,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:38,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:38,443 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:38,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-07-20 06:09:38,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:38,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 20 conjunts are in the unsatisfiable core [2022-07-20 06:09:38,533 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:38,538 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:38,573 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:38,573 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-07-20 06:09:38,597 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:09:38,602 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:09:38,660 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:09:38,664 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 17 treesize of output 9 [2022-07-20 06:09:38,701 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:09:38,702 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:38,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:38,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569545388] [2022-07-20 06:09:38,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569545388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:38,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:38,702 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:09:38,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545819735] [2022-07-20 06:09:38,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:38,703 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 06:09:38,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:38,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 06:09:38,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:09:38,704 INFO L87 Difference]: Start difference. First operand 101 states and 116 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:39,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:39,262 INFO L93 Difference]: Finished difference Result 148 states and 161 transitions. [2022-07-20 06:09:39,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:09:39,262 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-07-20 06:09:39,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:39,263 INFO L225 Difference]: With dead ends: 148 [2022-07-20 06:09:39,263 INFO L226 Difference]: Without dead ends: 148 [2022-07-20 06:09:39,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2022-07-20 06:09:39,264 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 198 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 325 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 325 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:39,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 132 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 325 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-20 06:09:39,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-07-20 06:09:39,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 103. [2022-07-20 06:09:39,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 82 states have (on average 1.4390243902439024) internal successors, (118), 102 states have internal predecessors, (118), 0 states have call successors, (0), 0 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:09:39,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 118 transitions. [2022-07-20 06:09:39,267 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 118 transitions. Word has length 17 [2022-07-20 06:09:39,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:39,267 INFO L495 AbstractCegarLoop]: Abstraction has 103 states and 118 transitions. [2022-07-20 06:09:39,267 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:39,267 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 118 transitions. [2022-07-20 06:09:39,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-20 06:09:39,267 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:39,268 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:39,287 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:39,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:39,475 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:39,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1694103573, now seen corresponding path program 1 times [2022-07-20 06:09:39,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:39,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [630723126] [2022-07-20 06:09:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:39,476 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:39,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:39,477 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:39,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-07-20 06:09:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:39,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 24 conjunts are in the unsatisfiable core [2022-07-20 06:09:39,559 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:39,562 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:39,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:09:39,597 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:39,598 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:09:39,617 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 16 treesize of output 18 [2022-07-20 06:09:39,636 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:09:39,641 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 20 treesize of output 22 [2022-07-20 06:09:39,645 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:09:39,702 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 33 treesize of output 21 [2022-07-20 06:09:39,705 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 21 treesize of output 13 [2022-07-20 06:09:39,740 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 19 treesize of output 7 [2022-07-20 06:09:39,754 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:09:39,754 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:39,754 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:39,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [630723126] [2022-07-20 06:09:39,754 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [630723126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:39,754 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:39,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 06:09:39,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246059159] [2022-07-20 06:09:39,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:39,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 06:09:39,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:39,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 06:09:39,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 06:09:39,755 INFO L87 Difference]: Start difference. First operand 103 states and 118 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:09:40,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:40,608 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2022-07-20 06:09:40,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-20 06:09:40,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-07-20 06:09:40,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:40,609 INFO L225 Difference]: With dead ends: 163 [2022-07-20 06:09:40,609 INFO L226 Difference]: Without dead ends: 163 [2022-07-20 06:09:40,609 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2022-07-20 06:09:40,610 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 111 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:40,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 273 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-20 06:09:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-07-20 06:09:40,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 114. [2022-07-20 06:09:40,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 113 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:09:40,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 130 transitions. [2022-07-20 06:09:40,612 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 130 transitions. Word has length 19 [2022-07-20 06:09:40,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:40,612 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 130 transitions. [2022-07-20 06:09:40,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 10 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:09:40,613 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 130 transitions. [2022-07-20 06:09:40,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:09:40,613 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:40,613 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:40,627 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:40,827 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:40,827 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:40,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:40,828 INFO L85 PathProgramCache]: Analyzing trace with hash 976774480, now seen corresponding path program 1 times [2022-07-20 06:09:40,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:40,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [681199992] [2022-07-20 06:09:40,828 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:40,829 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:40,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:40,830 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:40,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-07-20 06:09:40,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:40,894 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:09:40,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:40,925 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:09:40,945 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 16 treesize of output 8 [2022-07-20 06:09:40,956 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:09:40,956 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:09:40,956 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:40,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [681199992] [2022-07-20 06:09:40,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [681199992] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:09:40,957 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:09:40,957 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:09:40,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865613333] [2022-07-20 06:09:40,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:09:40,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:09:40,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:40,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:09:40,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:09:40,958 INFO L87 Difference]: Start difference. First operand 114 states and 130 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:41,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:41,267 INFO L93 Difference]: Finished difference Result 152 states and 164 transitions. [2022-07-20 06:09:41,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-20 06:09:41,267 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-20 06:09:41,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:41,271 INFO L225 Difference]: With dead ends: 152 [2022-07-20 06:09:41,271 INFO L226 Difference]: Without dead ends: 152 [2022-07-20 06:09:41,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2022-07-20 06:09:41,285 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 182 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:41,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 189 Invalid, 231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:09:41,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-07-20 06:09:41,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 114. [2022-07-20 06:09:41,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3655913978494623) internal successors, (127), 113 states have internal predecessors, (127), 0 states have call successors, (0), 0 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:09:41,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 127 transitions. [2022-07-20 06:09:41,297 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 127 transitions. Word has length 20 [2022-07-20 06:09:41,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:41,297 INFO L495 AbstractCegarLoop]: Abstraction has 114 states and 127 transitions. [2022-07-20 06:09:41,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 127 transitions. [2022-07-20 06:09:41,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:09:41,300 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:41,301 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:41,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-07-20 06:09:41,508 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:41,508 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:41,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:41,508 INFO L85 PathProgramCache]: Analyzing trace with hash -531988400, now seen corresponding path program 1 times [2022-07-20 06:09:41,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:41,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [339619170] [2022-07-20 06:09:41,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:41,509 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:41,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:41,510 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:41,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-07-20 06:09:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:41,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-20 06:09:41,612 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:41,615 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:41,648 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-07-20 06:09:41,649 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-07-20 06:09:41,682 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:09:41,768 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:41,768 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 31 treesize of output 29 [2022-07-20 06:09:41,789 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:41,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-07-20 06:09:41,849 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-07-20 06:09:41,892 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:09:41,892 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:41,994 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_321 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_321) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-07-20 06:09:42,044 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:42,045 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 20 treesize of output 21 [2022-07-20 06:09:42,070 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:42,070 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 34 treesize of output 37 [2022-07-20 06:09:42,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 11 treesize of output 9 [2022-07-20 06:09:56,831 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:09:56,832 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:56,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [339619170] [2022-07-20 06:09:56,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [339619170] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:56,832 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:56,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-20 06:09:56,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997592472] [2022-07-20 06:09:56,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:56,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:09:56,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:56,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:09:56,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=335, Unknown=5, NotChecked=38, Total=462 [2022-07-20 06:09:56,833 INFO L87 Difference]: Start difference. First operand 114 states and 127 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:09:57,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:09:57,697 INFO L93 Difference]: Finished difference Result 174 states and 193 transitions. [2022-07-20 06:09:57,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-20 06:09:57,697 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 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 20 [2022-07-20 06:09:57,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:09:57,698 INFO L225 Difference]: With dead ends: 174 [2022-07-20 06:09:57,698 INFO L226 Difference]: Without dead ends: 174 [2022-07-20 06:09:57,698 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 19 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=212, Invalid=657, Unknown=5, NotChecked=56, Total=930 [2022-07-20 06:09:57,699 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 357 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:09:57,699 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 267 Invalid, 1160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 445 Invalid, 0 Unknown, 618 Unchecked, 0.6s Time] [2022-07-20 06:09:57,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-07-20 06:09:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 128. [2022-07-20 06:09:57,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 107 states have (on average 1.3644859813084111) internal successors, (146), 127 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-20 06:09:57,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 146 transitions. [2022-07-20 06:09:57,701 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 146 transitions. Word has length 20 [2022-07-20 06:09:57,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:09:57,701 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 146 transitions. [2022-07-20 06:09:57,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:09:57,702 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 146 transitions. [2022-07-20 06:09:57,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-20 06:09:57,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:09:57,702 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:09:57,717 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-07-20 06:09:57,911 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:09:57,911 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:09:57,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:09:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash -531988399, now seen corresponding path program 1 times [2022-07-20 06:09:57,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:09:57,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2040736376] [2022-07-20 06:09:57,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:09:57,912 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:09:57,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:09:57,913 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:09:57,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-07-20 06:09:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:09:58,018 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 06:09:58,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:09:58,025 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:58,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:09:58,075 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:09:58,075 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:09:58,106 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:09:58,111 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:09:58,258 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:58,258 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 31 treesize of output 29 [2022-07-20 06:09:58,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:09:58,268 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:09:58,285 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:09:58,286 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-07-20 06:09:58,296 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 18 treesize of output 20 [2022-07-20 06:09:58,383 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 25 treesize of output 13 [2022-07-20 06:09:58,386 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 15 treesize of output 7 [2022-07-20 06:09:58,424 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:09:58,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:09:58,744 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:09:58,777 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_365) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:09:58,797 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_365 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_365) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) (forall ((v_ArrVal_364 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_364) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse1 (bvadd (_ bv4 32) .cse1))))) is different from false [2022-07-20 06:09:58,834 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:58,834 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 37 treesize of output 38 [2022-07-20 06:09:58,839 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:58,840 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 29 treesize of output 30 [2022-07-20 06:09:58,850 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:58,850 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 52 treesize of output 55 [2022-07-20 06:09:58,866 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:58,866 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 82 treesize of output 81 [2022-07-20 06:09:58,872 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 66 treesize of output 62 [2022-07-20 06:09:58,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 32 treesize of output 28 [2022-07-20 06:09:58,978 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:58,978 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 35 treesize of output 28 [2022-07-20 06:09:58,996 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:09:58,996 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 40 treesize of output 39 [2022-07-20 06:09:59,007 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 13 treesize of output 9 [2022-07-20 06:09:59,401 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:09:59,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:09:59,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2040736376] [2022-07-20 06:09:59,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2040736376] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:09:59,401 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:09:59,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2022-07-20 06:09:59,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357807420] [2022-07-20 06:09:59,401 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:09:59,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:09:59,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:09:59,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:09:59,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=292, Unknown=3, NotChecked=108, Total=462 [2022-07-20 06:09:59,402 INFO L87 Difference]: Start difference. First operand 128 states and 146 transitions. Second operand has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:10:01,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:01,919 INFO L93 Difference]: Finished difference Result 205 states and 229 transitions. [2022-07-20 06:10:01,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-20 06:10:01,920 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 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 20 [2022-07-20 06:10:01,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:01,921 INFO L225 Difference]: With dead ends: 205 [2022-07-20 06:10:01,921 INFO L226 Difference]: Without dead ends: 205 [2022-07-20 06:10:01,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 18 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 1 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=209, Invalid=856, Unknown=3, NotChecked=192, Total=1260 [2022-07-20 06:10:01,921 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 203 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 1345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 428 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:01,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 431 Invalid, 1345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 827 Invalid, 0 Unknown, 428 Unchecked, 1.5s Time] [2022-07-20 06:10:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-07-20 06:10:01,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 122. [2022-07-20 06:10:01,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 104 states have (on average 1.3365384615384615) internal successors, (139), 121 states have internal predecessors, (139), 0 states have call successors, (0), 0 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:10:01,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 139 transitions. [2022-07-20 06:10:01,924 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 139 transitions. Word has length 20 [2022-07-20 06:10:01,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:01,924 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 139 transitions. [2022-07-20 06:10:01,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 22 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:10:01,924 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 139 transitions. [2022-07-20 06:10:01,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-07-20 06:10:01,924 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:01,924 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:10:01,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:02,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:02,133 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:10:02,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:02,133 INFO L85 PathProgramCache]: Analyzing trace with hash 191297324, now seen corresponding path program 1 times [2022-07-20 06:10:02,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:02,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1713684193] [2022-07-20 06:10:02,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:02,133 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:02,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:02,137 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:02,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-07-20 06:10:02,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:02,251 INFO L263 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-20 06:10:02,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:02,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:10:02,322 INFO L356 Elim1Store]: treesize reduction 23, result has 28.1 percent of original size [2022-07-20 06:10:02,323 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 20 [2022-07-20 06:10:02,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 19 treesize of output 7 [2022-07-20 06:10:02,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:02,359 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:10:02,359 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:02,359 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1713684193] [2022-07-20 06:10:02,359 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1713684193] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:10:02,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:10:02,360 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 06:10:02,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797413042] [2022-07-20 06:10:02,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:10:02,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 06:10:02,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:02,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 06:10:02,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-07-20 06:10:02,361 INFO L87 Difference]: Start difference. First operand 122 states and 139 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:10:02,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:02,670 INFO L93 Difference]: Finished difference Result 162 states and 182 transitions. [2022-07-20 06:10:02,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 06:10:02,670 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 21 [2022-07-20 06:10:02,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:02,672 INFO L225 Difference]: With dead ends: 162 [2022-07-20 06:10:02,672 INFO L226 Difference]: Without dead ends: 162 [2022-07-20 06:10:02,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-07-20 06:10:02,674 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 52 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:02,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 165 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 06:10:02,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-07-20 06:10:02,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 134. [2022-07-20 06:10:02,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 116 states have (on average 1.3189655172413792) internal successors, (153), 133 states have internal predecessors, (153), 0 states have call successors, (0), 0 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:10:02,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 153 transitions. [2022-07-20 06:10:02,679 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 153 transitions. Word has length 21 [2022-07-20 06:10:02,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:02,681 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 153 transitions. [2022-07-20 06:10:02,681 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:10:02,681 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 153 transitions. [2022-07-20 06:10:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:10:02,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:02,682 INFO L195 NwaCegarLoop]: trace histogram [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:10:02,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:02,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:02,890 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:10:02,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:02,891 INFO L85 PathProgramCache]: Analyzing trace with hash -1103011290, now seen corresponding path program 1 times [2022-07-20 06:10:02,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:02,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [661136457] [2022-07-20 06:10:02,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:02,891 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:02,891 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:02,893 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:02,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-07-20 06:10:02,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:02,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-20 06:10:02,990 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:02,998 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:10:03,002 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:10:03,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:03,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:10:03,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:03,021 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:10:03,063 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:10:03,063 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:10:03,071 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:10:03,085 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:10:03,085 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:10:03,089 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:10:03,129 INFO L356 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2022-07-20 06:10:03,129 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 23 treesize of output 26 [2022-07-20 06:10:03,145 INFO L356 Elim1Store]: treesize reduction 21, result has 47.5 percent of original size [2022-07-20 06:10:03,145 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 31 treesize of output 38 [2022-07-20 06:10:09,636 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:09,641 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:09,641 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 17 treesize of output 15 [2022-07-20 06:10:14,142 INFO L356 Elim1Store]: treesize reduction 17, result has 15.0 percent of original size [2022-07-20 06:10:14,142 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 35 [2022-07-20 06:10:14,150 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:10:14,150 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 16 [2022-07-20 06:10:14,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:14,192 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:10:18,673 INFO L356 Elim1Store]: treesize reduction 8, result has 65.2 percent of original size [2022-07-20 06:10:18,674 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 28 treesize of output 23 [2022-07-20 06:10:18,855 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,855 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,865 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,866 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,876 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,892 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,893 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,900 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,912 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,913 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,921 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:18,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2022-07-20 06:10:18,928 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (or (and (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_11 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (and (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2022-07-20 06:10:18,971 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (or (and (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_11 (_ bv0 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_12 (_ bv0 32))))))) (and (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))))) is different from false [2022-07-20 06:10:19,278 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:19,287 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:19,287 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 29 [2022-07-20 06:10:19,291 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:10:19,294 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:19,295 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2022-07-20 06:10:19,298 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:10:19,300 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-07-20 06:10:19,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-07-20 06:10:19,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:19,304 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:19,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [661136457] [2022-07-20 06:10:19,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [661136457] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:10:19,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:10:19,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 28 [2022-07-20 06:10:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727244864] [2022-07-20 06:10:19,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:10:19,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-07-20 06:10:19,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:19,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-07-20 06:10:19,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=553, Unknown=21, NotChecked=98, Total=756 [2022-07-20 06:10:19,307 INFO L87 Difference]: Start difference. First operand 134 states and 153 transitions. Second operand has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:10:19,424 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (or (and (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_11 (_ bv0 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_12 (_ bv0 32))))))) (and (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32))))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:10:19,430 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)) (forall ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (or (and (forall ((v_arrayElimArr_12 (Array (_ BitVec 32) (_ BitVec 32)))) (or (not (= |c_ULTIMATE.start_main_~head~0#1.offset| (select v_arrayElimArr_12 |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))) (forall ((v_arrayElimArr_11 (Array (_ BitVec 32) (_ BitVec 32)))) (or (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (not (= |c_ULTIMATE.start_main_~head~0#1.base| (select v_arrayElimArr_11 |c_ULTIMATE.start_main_~x~0#1.offset|)))))) (and (= |c_ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= |c_ULTIMATE.start_main_~head~0#1.offset| |c_ULTIMATE.start_main_~x~0#1.offset|)))) (= |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32))) is different from false [2022-07-20 06:10:20,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:20,909 INFO L93 Difference]: Finished difference Result 146 states and 165 transitions. [2022-07-20 06:10:20,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 06:10:20,910 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:10:20,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:20,911 INFO L225 Difference]: With dead ends: 146 [2022-07-20 06:10:20,911 INFO L226 Difference]: Without dead ends: 146 [2022-07-20 06:10:20,911 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=155, Invalid=828, Unknown=25, NotChecked=252, Total=1260 [2022-07-20 06:10:20,912 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 47 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 837 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 267 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:20,912 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 547 Invalid, 837 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 534 Invalid, 0 Unknown, 267 Unchecked, 1.1s Time] [2022-07-20 06:10:20,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-07-20 06:10:20,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 137. [2022-07-20 06:10:20,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.3109243697478992) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 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:10:20,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2022-07-20 06:10:20,915 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 22 [2022-07-20 06:10:20,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:20,915 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2022-07-20 06:10:20,915 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 1.3928571428571428) internal successors, (39), 28 states have internal predecessors, (39), 0 states have call successors, (0), 0 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:10:20,915 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2022-07-20 06:10:20,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-07-20 06:10:20,917 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:20,917 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:10:20,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-07-20 06:10:21,127 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:21,127 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:10:21,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:21,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1633618897, now seen corresponding path program 1 times [2022-07-20 06:10:21,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:21,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1595671072] [2022-07-20 06:10:21,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:10:21,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:21,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:21,132 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:21,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-07-20 06:10:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:10:21,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 23 conjunts are in the unsatisfiable core [2022-07-20 06:10:21,208 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:21,253 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:10:21,260 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:10:21,305 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:10:21,307 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:10:21,333 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:10:21,335 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:10:21,353 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:10:21,353 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:10:21,353 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:10:21,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1595671072] [2022-07-20 06:10:21,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1595671072] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:10:21,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:10:21,353 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 06:10:21,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026835707] [2022-07-20 06:10:21,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:10:21,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 06:10:21,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:10:21,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 06:10:21,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-07-20 06:10:21,354 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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:10:22,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:10:22,001 INFO L93 Difference]: Finished difference Result 165 states and 184 transitions. [2022-07-20 06:10:22,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:10:22,002 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-07-20 06:10:22,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:10:22,002 INFO L225 Difference]: With dead ends: 165 [2022-07-20 06:10:22,002 INFO L226 Difference]: Without dead ends: 165 [2022-07-20 06:10:22,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=181, Unknown=0, NotChecked=0, Total=240 [2022-07-20 06:10:22,003 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 57 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 505 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-20 06:10:22,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 259 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 505 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-20 06:10:22,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-07-20 06:10:22,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 148. [2022-07-20 06:10:22,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 147 states have internal predecessors, (167), 0 states have call successors, (0), 0 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:10:22,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 167 transitions. [2022-07-20 06:10:22,005 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 167 transitions. Word has length 22 [2022-07-20 06:10:22,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:10:22,005 INFO L495 AbstractCegarLoop]: Abstraction has 148 states and 167 transitions. [2022-07-20 06:10:22,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 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:10:22,005 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 167 transitions. [2022-07-20 06:10:22,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-20 06:10:22,005 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:10:22,006 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:10:22,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Ended with exit code 0 [2022-07-20 06:10:22,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:10:22,213 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:10:22,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:10:22,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1267607554, now seen corresponding path program 2 times [2022-07-20 06:10:22,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:10:22,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [451609744] [2022-07-20 06:10:22,214 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:10:22,214 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:10:22,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:10:22,215 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:10:22,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-07-20 06:10:22,361 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:10:22,361 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:10:22,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 30 conjunts are in the unsatisfiable core [2022-07-20 06:10:22,369 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:10:22,371 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:10:22,399 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:10:22,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:10:22,417 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:10:22,421 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 6 treesize of output 5 [2022-07-20 06:10:22,479 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:10:22,479 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 22 treesize of output 22 [2022-07-20 06:10:22,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:10:22,485 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:10:22,498 INFO L356 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-07-20 06:10:22,498 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 41 [2022-07-20 06:10:22,501 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-07-20 06:10:22,643 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-07-20 06:10:22,643 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 36 [2022-07-20 06:10:22,646 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 10 [2022-07-20 06:10:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:10:22,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:10:22,884 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:22,884 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-07-20 06:10:22,889 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:22,889 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2022-07-20 06:10:22,901 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:22,901 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 37 [2022-07-20 06:10:22,905 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:22,905 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 31 [2022-07-20 06:10:23,320 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:23,320 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 38 treesize of output 39 [2022-07-20 06:10:23,400 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:23,400 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 2038 treesize of output 1868 [2022-07-20 06:10:23,437 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:23,437 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 3220 treesize of output 2767 [2022-07-20 06:10:23,494 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:23,495 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 2760 treesize of output 2536 [2022-07-20 06:10:23,665 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:23,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2512 treesize of output 2522 [2022-07-20 06:10:23,846 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:10:23,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 2466 treesize of output 2438 [2022-07-20 06:12:12,345 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:12:12,345 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 43 treesize of output 1 [2022-07-20 06:12:16,422 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:12:16,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:12:16,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [451609744] [2022-07-20 06:12:16,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [451609744] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:12:16,422 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:12:16,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 22 [2022-07-20 06:12:16,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041169607] [2022-07-20 06:12:16,422 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:12:16,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-20 06:12:16,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:12:16,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-20 06:12:16,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=396, Unknown=13, NotChecked=0, Total=462 [2022-07-20 06:12:16,423 INFO L87 Difference]: Start difference. First operand 148 states and 167 transitions. Second operand has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 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:12:17,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:12:17,913 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2022-07-20 06:12:17,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 06:12:17,914 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 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) Word has length 25 [2022-07-20 06:12:17,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:12:17,915 INFO L225 Difference]: With dead ends: 178 [2022-07-20 06:12:17,915 INFO L226 Difference]: Without dead ends: 178 [2022-07-20 06:12:17,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=126, Invalid=731, Unknown=13, NotChecked=0, Total=870 [2022-07-20 06:12:17,915 INFO L413 NwaCegarLoop]: 66 mSDtfsCounter, 97 mSDsluCounter, 569 mSDsCounter, 0 mSdLazyCounter, 676 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 288 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:12:17,916 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 635 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 676 Invalid, 0 Unknown, 288 Unchecked, 1.1s Time] [2022-07-20 06:12:17,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-07-20 06:12:17,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 147. [2022-07-20 06:12:17,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 129 states have (on average 1.2713178294573644) internal successors, (164), 146 states have internal predecessors, (164), 0 states have call successors, (0), 0 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:12:17,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 164 transitions. [2022-07-20 06:12:17,918 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 164 transitions. Word has length 25 [2022-07-20 06:12:17,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:12:17,918 INFO L495 AbstractCegarLoop]: Abstraction has 147 states and 164 transitions. [2022-07-20 06:12:17,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8636363636363635) internal successors, (41), 22 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:12:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2022-07-20 06:12:17,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-07-20 06:12:17,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:12:17,918 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:12:17,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Forceful destruction successful, exit code 0 [2022-07-20 06:12:18,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:12:18,127 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:12:18,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:12:18,127 INFO L85 PathProgramCache]: Analyzing trace with hash 713399338, now seen corresponding path program 1 times [2022-07-20 06:12:18,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:12:18,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556800886] [2022-07-20 06:12:18,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:12:18,128 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:12:18,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:12:18,131 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:12:18,170 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-07-20 06:12:18,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:12:18,288 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 38 conjunts are in the unsatisfiable core [2022-07-20 06:12:18,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:12:18,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:12:18,316 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-20 06:12:18,392 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:12:18,393 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:12:18,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:12:18,435 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-07-20 06:12:18,447 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:12:18,520 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 16 treesize of output 8 [2022-07-20 06:12:18,594 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 16 treesize of output 18 [2022-07-20 06:12:18,622 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 16 treesize of output 18 [2022-07-20 06:12:18,638 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:12:18,638 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:12:18,678 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 16 treesize of output 18 [2022-07-20 06:12:18,688 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:12:18,693 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 18 treesize of output 20 [2022-07-20 06:12:18,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-20 06:12:18,807 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:12:18,809 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 27 treesize of output 15 [2022-07-20 06:12:18,879 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:12:18,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:12:18,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:12:19,174 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv1 32)))) is different from false [2022-07-20 06:12:19,353 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (or (not (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_584) |v_ULTIMATE.start_main_~x~0#1.base_99| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv1 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))))) is different from false [2022-07-20 06:12:19,383 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (or (not (= (_ bv1 32) (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |v_ULTIMATE.start_main_~x~0#1.base_99| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))))) is different from false [2022-07-20 06:12:19,393 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (or (not (= (select (select (store (store |c_#memory_int| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |v_ULTIMATE.start_main_~x~0#1.base_99| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv1 32))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))))) is different from false [2022-07-20 06:12:19,418 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:12:19,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:12:19,430 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (_ BitVec 32)) (v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~x~0#1.base_99| |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| v_ArrVal_580)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_584) |v_ULTIMATE.start_main_~x~0#1.base_99| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))) (_ bv1 32))))) is different from false [2022-07-20 06:12:19,548 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_580 (_ BitVec 32)) (v_ArrVal_586 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_584 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_16| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_16|) (_ bv0 1))) (= |v_ULTIMATE.start_main_~x~0#1.base_99| |c_ULTIMATE.start_main_~head~0#1.base|) (not (= (_ bv1 32) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset| v_ArrVal_580)) |v_ULTIMATE.start_main_#t~malloc3#1.base_16| v_ArrVal_584) |v_ULTIMATE.start_main_~x~0#1.base_99| v_ArrVal_586) |c_ULTIMATE.start_main_~head~0#1.base|) (bvadd |c_ULTIMATE.start_main_~head~0#1.offset| (_ bv4 32))))))) is different from false [2022-07-20 06:12:19,605 INFO L356 Elim1Store]: treesize reduction 23, result has 45.2 percent of original size [2022-07-20 06:12:19,605 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-07-20 06:12:19,609 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:12:19,611 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 39 treesize of output 27 [2022-07-20 06:12:19,614 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 8 treesize of output 4 [2022-07-20 06:12:19,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:12:19,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:12:19,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556800886] [2022-07-20 06:12:19,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556800886] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:12:19,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:12:19,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 16] total 29 [2022-07-20 06:12:19,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387631156] [2022-07-20 06:12:19,656 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:12:19,656 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-07-20 06:12:19,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:12:19,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-07-20 06:12:19,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=420, Unknown=19, NotChecked=282, Total=812 [2022-07-20 06:12:19,657 INFO L87 Difference]: Start difference. First operand 147 states and 164 transitions. Second operand has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:12:21,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:12:21,272 INFO L93 Difference]: Finished difference Result 221 states and 240 transitions. [2022-07-20 06:12:21,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-20 06:12:21,273 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 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:12:21,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:12:21,274 INFO L225 Difference]: With dead ends: 221 [2022-07-20 06:12:21,274 INFO L226 Difference]: Without dead ends: 221 [2022-07-20 06:12:21,274 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 23 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=198, Invalid=928, Unknown=20, NotChecked=414, Total=1560 [2022-07-20 06:12:21,275 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 152 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 767 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-20 06:12:21,275 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 455 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 788 Invalid, 0 Unknown, 767 Unchecked, 1.1s Time] [2022-07-20 06:12:21,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2022-07-20 06:12:21,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 158. [2022-07-20 06:12:21,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.25) internal successors, (175), 157 states have internal predecessors, (175), 0 states have call successors, (0), 0 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:12:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2022-07-20 06:12:21,277 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 26 [2022-07-20 06:12:21,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:12:21,278 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2022-07-20 06:12:21,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.7241379310344827) internal successors, (50), 29 states have internal predecessors, (50), 0 states have call successors, (0), 0 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:12:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-07-20 06:12:21,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:12:21,278 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:12:21,278 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:12:21,288 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-07-20 06:12:21,486 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:12:21,486 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:12:21,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:12:21,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1412046654, now seen corresponding path program 1 times [2022-07-20 06:12:21,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:12:21,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1102864917] [2022-07-20 06:12:21,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:12:21,487 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:12:21,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:12:21,488 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:12:21,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-07-20 06:12:21,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:12:21,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 06:12:21,589 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:12:21,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-20 06:12:21,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:12:21,835 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:12:21,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1102864917] [2022-07-20 06:12:21,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1102864917] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:12:21,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:12:21,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-20 06:12:21,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148336497] [2022-07-20 06:12:21,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:12:21,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 06:12:21,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:12:21,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 06:12:21,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:12:21,836 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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:12:21,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:12:21,840 INFO L93 Difference]: Finished difference Result 167 states and 184 transitions. [2022-07-20 06:12:21,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-20 06:12:21,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:12:21,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:12:21,841 INFO L225 Difference]: With dead ends: 167 [2022-07-20 06:12:21,841 INFO L226 Difference]: Without dead ends: 167 [2022-07-20 06:12:21,842 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 20 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:12:21,842 INFO L413 NwaCegarLoop]: 62 mSDtfsCounter, 39 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-20 06:12:21,842 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 130 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 31 Unchecked, 0.0s Time] [2022-07-20 06:12:21,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-07-20 06:12:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2022-07-20 06:12:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 147 states have (on average 1.2380952380952381) internal successors, (182), 164 states have internal predecessors, (182), 0 states have call successors, (0), 0 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:12:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 182 transitions. [2022-07-20 06:12:21,845 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 182 transitions. Word has length 27 [2022-07-20 06:12:21,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:12:21,845 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 182 transitions. [2022-07-20 06:12:21,845 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.4) internal successors, (27), 5 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:12:21,845 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 182 transitions. [2022-07-20 06:12:21,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:12:21,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:12:21,846 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:12:21,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Ended with exit code 0 [2022-07-20 06:12:22,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:12:22,047 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:12:22,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:12:22,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1577400205, now seen corresponding path program 1 times [2022-07-20 06:12:22,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:12:22,048 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [229813800] [2022-07-20 06:12:22,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 06:12:22,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:12:22,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:12:22,049 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:12:22,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-07-20 06:12:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 06:12:22,138 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-20 06:12:22,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:12:22,230 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:12:22,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 06:12:22,230 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:12:22,230 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [229813800] [2022-07-20 06:12:22,230 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [229813800] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 06:12:22,230 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 06:12:22,230 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-20 06:12:22,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590335419] [2022-07-20 06:12:22,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 06:12:22,231 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-20 06:12:22,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:12:22,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-20 06:12:22,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-07-20 06:12:22,231 INFO L87 Difference]: Start difference. First operand 165 states and 182 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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:12:22,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:12:22,439 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2022-07-20 06:12:22,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-20 06:12:22,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-07-20 06:12:22,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:12:22,440 INFO L225 Difference]: With dead ends: 173 [2022-07-20 06:12:22,440 INFO L226 Difference]: Without dead ends: 173 [2022-07-20 06:12:22,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-07-20 06:12:22,441 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 186 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-20 06:12:22,441 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 70 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-20 06:12:22,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-07-20 06:12:22,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 158. [2022-07-20 06:12:22,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 140 states have (on average 1.2428571428571429) internal successors, (174), 157 states have internal predecessors, (174), 0 states have call successors, (0), 0 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:12:22,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 174 transitions. [2022-07-20 06:12:22,444 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 174 transitions. Word has length 27 [2022-07-20 06:12:22,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:12:22,444 INFO L495 AbstractCegarLoop]: Abstraction has 158 states and 174 transitions. [2022-07-20 06:12:22,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 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:12:22,444 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 174 transitions. [2022-07-20 06:12:22,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:12:22,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:12:22,444 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:12:22,462 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-07-20 06:12:22,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:12:22,651 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:12:22,652 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:12:22,652 INFO L85 PathProgramCache]: Analyzing trace with hash -869048613, now seen corresponding path program 3 times [2022-07-20 06:12:22,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:12:22,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [893765502] [2022-07-20 06:12:22,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-20 06:12:22,652 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:12:22,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:12:22,653 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:12:22,655 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-07-20 06:12:22,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-07-20 06:12:22,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:12:22,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 28 conjunts are in the unsatisfiable core [2022-07-20 06:12:22,799 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:12:22,811 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-07-20 06:12:22,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-07-20 06:12:22,867 INFO L356 Elim1Store]: treesize reduction 9, result has 64.0 percent of original size [2022-07-20 06:12:22,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 29 [2022-07-20 06:12:22,890 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:12:22,956 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:12:22,956 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 22 treesize of output 22 [2022-07-20 06:12:22,970 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:12:22,970 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 22 treesize of output 22 [2022-07-20 06:12:22,980 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:12:22,981 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:12:23,018 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:12:23,018 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 27 treesize of output 22 [2022-07-20 06:12:23,138 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:12:23,138 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 49 [2022-07-20 06:12:23,147 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 12 treesize of output 8 [2022-07-20 06:12:23,216 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:12:23,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 56 [2022-07-20 06:12:23,293 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 27 treesize of output 15 [2022-07-20 06:12:23,333 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:12:23,333 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:12:23,411 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1)))) is different from false [2022-07-20 06:12:23,419 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))))) is different from false [2022-07-20 06:12:23,494 INFO L356 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2022-07-20 06:12:23,494 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 29 treesize of output 28 [2022-07-20 06:12:23,502 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|)) is different from false [2022-07-20 06:12:23,595 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:23,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:12:23,604 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_22 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_arrayElimArr_22) .cse0 v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) is different from false [2022-07-20 06:12:23,619 WARN L833 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~x~0#1.offset| (_ BitVec 32)) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select v_arrayElimArr_22 |ULTIMATE.start_main_~x~0#1.offset|))) (or (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_arrayElimArr_22) .cse0 v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_#t~mem4#1.base|) (not (= (select |c_#valid| .cse0) (_ bv0 1)))))) is different from false [2022-07-20 06:12:23,630 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~x~0#1.offset_87| (_ BitVec 32)) (v_ArrVal_715 (Array (_ BitVec 32) (_ BitVec 32))) (v_arrayElimArr_22 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select v_arrayElimArr_22 |v_ULTIMATE.start_main_~x~0#1.offset_87|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_arrayElimArr_22) .cse1 v_ArrVal_715) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (not (= (_ bv0 1) (select |c_#valid| .cse1)))))) is different from false [2022-07-20 06:12:23,646 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:23,647 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 06:12:23,658 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:23,658 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 134 treesize of output 133 [2022-07-20 06:12:23,664 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 118 treesize of output 110 [2022-07-20 06:12:23,673 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:23,673 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 118 treesize of output 108 [2022-07-20 06:12:23,687 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:12:23,687 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:12:23,876 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2022-07-20 06:12:23,877 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:12:23,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [893765502] [2022-07-20 06:12:23,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [893765502] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:12:23,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:12:23,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2022-07-20 06:12:23,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014028764] [2022-07-20 06:12:23,877 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:12:23,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-07-20 06:12:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:12:23,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-07-20 06:12:23,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=470, Unknown=22, NotChecked=294, Total=870 [2022-07-20 06:12:23,878 INFO L87 Difference]: Start difference. First operand 158 states and 174 transitions. Second operand has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:12:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 06:12:28,382 INFO L93 Difference]: Finished difference Result 301 states and 329 transitions. [2022-07-20 06:12:28,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-07-20 06:12:28,383 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 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:12:28,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 06:12:28,384 INFO L225 Difference]: With dead ends: 301 [2022-07-20 06:12:28,384 INFO L226 Difference]: Without dead ends: 301 [2022-07-20 06:12:28,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 23 SyntacticMatches, 7 SemanticMatches, 52 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=336, Invalid=1916, Unknown=28, NotChecked=582, Total=2862 [2022-07-20 06:12:28,385 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 222 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 222 SdHoareTripleChecker+Valid, 573 SdHoareTripleChecker+Invalid, 2432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1473 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2022-07-20 06:12:28,385 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [222 Valid, 573 Invalid, 2432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 895 Invalid, 0 Unknown, 1473 Unchecked, 1.4s Time] [2022-07-20 06:12:28,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2022-07-20 06:12:28,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 172. [2022-07-20 06:12:28,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 154 states have (on average 1.2532467532467533) internal successors, (193), 171 states have internal predecessors, (193), 0 states have call successors, (0), 0 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:12:28,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 193 transitions. [2022-07-20 06:12:28,388 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 193 transitions. Word has length 27 [2022-07-20 06:12:28,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 06:12:28,388 INFO L495 AbstractCegarLoop]: Abstraction has 172 states and 193 transitions. [2022-07-20 06:12:28,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.793103448275862) internal successors, (52), 30 states have internal predecessors, (52), 0 states have call successors, (0), 0 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:12:28,388 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 193 transitions. [2022-07-20 06:12:28,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-07-20 06:12:28,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 06:12:28,389 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-20 06:12:28,397 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-07-20 06:12:28,595 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-07-20 06:12:28,595 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 42 more)] === [2022-07-20 06:12:28,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 06:12:28,596 INFO L85 PathProgramCache]: Analyzing trace with hash -869048612, now seen corresponding path program 2 times [2022-07-20 06:12:28,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-07-20 06:12:28,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1087870685] [2022-07-20 06:12:28,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-20 06:12:28,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-07-20 06:12:28,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-07-20 06:12:28,598 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-07-20 06:12:28,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-07-20 06:12:28,777 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-20 06:12:28,778 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-20 06:12:28,784 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 40 conjunts are in the unsatisfiable core [2022-07-20 06:12:28,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 06:12:28,789 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-07-20 06:12:28,813 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:12:28,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:12:28,835 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:12:28,841 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:12:28,928 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:12:28,929 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 25 [2022-07-20 06:12:28,931 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 11 treesize of output 7 [2022-07-20 06:12:28,950 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:12:28,950 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 22 treesize of output 22 [2022-07-20 06:12:28,978 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-07-20 06:12:28,978 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 25 [2022-07-20 06:12:28,982 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 11 treesize of output 7 [2022-07-20 06:12:28,997 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:12:28,997 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 22 treesize of output 22 [2022-07-20 06:12:29,018 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-07-20 06:12:29,018 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-07-20 06:12:29,065 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-07-20 06:12:29,066 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 27 treesize of output 22 [2022-07-20 06:12:29,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-20 06:12:29,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-07-20 06:12:29,227 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:12:29,228 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 63 [2022-07-20 06:12:29,242 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:12:29,243 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 48 treesize of output 44 [2022-07-20 06:12:29,250 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 8 [2022-07-20 06:12:29,322 INFO L356 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-07-20 06:12:29,323 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 70 treesize of output 70 [2022-07-20 06:12:29,336 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-07-20 06:12:29,336 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 57 treesize of output 53 [2022-07-20 06:12:29,457 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 31 treesize of output 19 [2022-07-20 06:12:29,460 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 26 treesize of output 14 [2022-07-20 06:12:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-20 06:12:29,534 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-20 06:12:29,890 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_785 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-20 06:12:29,921 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_785 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))) is different from false [2022-07-20 06:12:29,944 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd .cse0 (_ bv4 32))))) (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_785 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_785) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))))) is different from false [2022-07-20 06:12:29,985 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:29,986 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 67 treesize of output 71 [2022-07-20 06:12:30,115 WARN L833 $PredicateComparison]: unable to prove that (and (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |c_ULTIMATE.start_main_#t~malloc3#1.base|)) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_785) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_779) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |c_ULTIMATE.start_main_#t~malloc3#1.base| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|)))) is different from false [2022-07-20 06:12:30,170 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (and (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_785) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_779) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))))) is different from false [2022-07-20 06:12:30,194 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:30,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:12:30,255 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_777 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc3#1.base_24| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|))) (and (or (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv0 32))) (forall ((v_ArrVal_785 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| (store v_ArrVal_777 |c_ULTIMATE.start_main_~x~0#1.offset| |v_ULTIMATE.start_main_#t~malloc3#1.base_24|)) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_785) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) |c_ULTIMATE.start_main_~x~0#1.base|))) (forall ((v_prenex_1 (Array (_ BitVec 32) (_ BitVec 32))) (v_prenex_2 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_prenex_2) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_prenex_1) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~x~0#1.offset|))) (forall ((v_ArrVal_784 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_779 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_779) |v_ULTIMATE.start_main_#t~malloc3#1.base_24| v_ArrVal_784) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|))) (bvule .cse0 (bvadd (_ bv4 32) .cse0))))))) is different from false [2022-07-20 06:12:30,277 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:30,277 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:12:30,303 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:30,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2022-07-20 06:12:31,341 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:31,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 21 treesize of output 22 [2022-07-20 06:12:31,352 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:31,352 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 60 treesize of output 63 [2022-07-20 06:12:31,363 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:31,363 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 31 treesize of output 35 [2022-07-20 06:12:31,367 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 46 treesize of output 42 [2022-07-20 06:12:31,433 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:31,433 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 24 [2022-07-20 06:12:31,448 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:31,448 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 138 treesize of output 137 [2022-07-20 06:12:31,453 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 61 treesize of output 57 [2022-07-20 06:12:31,457 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 118 treesize of output 110 [2022-07-20 06:12:31,507 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-07-20 06:12:31,508 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 41 treesize of output 34 [2022-07-20 06:12:31,509 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:12:31,510 INFO L173 IndexEqualityManager]: detected equality via solver [2022-07-20 06:12:31,512 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2022-07-20 06:12:31,529 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-07-20 06:12:31,529 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 25 treesize of output 1 [2022-07-20 06:12:31,542 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-07-20 06:12:31,542 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-07-20 06:12:31,736 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 8 not checked. [2022-07-20 06:12:31,736 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-07-20 06:12:31,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1087870685] [2022-07-20 06:12:31,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1087870685] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-20 06:12:31,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-20 06:12:31,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17] total 31 [2022-07-20 06:12:31,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860593559] [2022-07-20 06:12:31,736 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-20 06:12:31,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-07-20 06:12:31,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-07-20 06:12:31,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-07-20 06:12:31,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=559, Unknown=23, NotChecked=318, Total=992 [2022-07-20 06:12:31,737 INFO L87 Difference]: Start difference. First operand 172 states and 193 transitions. Second operand has 32 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 32 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)