./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.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 --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 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:40:31,249 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:40:31,311 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:40:31,316 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:40:31,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:40:31,337 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:40:31,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:40:31,338 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:40:31,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:40:31,340 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:40:31,341 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:40:31,341 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:40:31,341 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:40:31,342 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:40:31,344 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:40:31,344 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:40:31,344 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:40:31,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:40:31,345 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:40:31,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:40:31,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:40:31,345 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:40:31,345 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:40:31,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:40:31,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:40:31,347 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:40:31,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:40:31,347 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:40:31,348 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:40:31,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:40:31,348 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:40:31,348 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:40:31,348 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:40:31,348 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:40:31,349 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:40:31,349 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:40:31,349 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:40:31,349 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:40:31,349 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:40:31,349 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:40:31,349 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:40:31,351 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:40:31,351 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 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 -> 2fe3fcfd23f0db0414af322b91d2d32e3943484ebce4a900c0ef2633a5499508 [2024-11-20 14:40:31,618 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:40:31,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:40:31,658 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:40:31,659 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:40:31,660 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:40:31,664 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-20 14:40:33,044 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:40:33,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:40:33,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext2/optional_data_creation_test04-2.i [2024-11-20 14:40:33,268 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f7d2320/a6da491b91ec49f49be306559ad35ad1/FLAG56fbd7276 [2024-11-20 14:40:33,282 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d6f7d2320/a6da491b91ec49f49be306559ad35ad1 [2024-11-20 14:40:33,284 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:40:33,285 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:40:33,287 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:40:33,287 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:40:33,292 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:40:33,292 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,293 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@210fca10 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33, skipping insertion in model container [2024-11-20 14:40:33,294 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,324 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:40:33,574 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 14:40:33,584 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:40:33,590 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:40:33,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:40:33,643 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:40:33,643 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33 WrapperNode [2024-11-20 14:40:33,644 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:40:33,644 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:40:33,645 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:40:33,645 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:40:33,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,659 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,675 INFO L138 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 120 [2024-11-20 14:40:33,676 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:40:33,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:40:33,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:40:33,676 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:40:33,685 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,688 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,701 INFO L175 MemorySlicer]: Split 21 memory accesses to 3 slices as follows [2, 11, 8]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 8 writes are split as follows [0, 6, 2]. [2024-11-20 14:40:33,702 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,702 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,707 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,711 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,712 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,714 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:40:33,715 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:40:33,715 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:40:33,715 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:40:33,716 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (1/1) ... [2024-11-20 14:40:33,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:40:33,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:33,746 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 14:40:33,748 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 14:40:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:40:33,785 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 14:40:33,786 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-20 14:40:33,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:40:33,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:40:33,863 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:40:33,865 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:40:34,149 INFO L? ?]: Removed 106 outVars from TransFormulas that were not future-live. [2024-11-20 14:40:34,149 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:40:34,164 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:40:34,164 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-20 14:40:34,165 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:34 BoogieIcfgContainer [2024-11-20 14:40:34,165 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:40:34,166 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:40:34,168 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:40:34,170 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:40:34,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:40:33" (1/3) ... [2024-11-20 14:40:34,171 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27008c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:34, skipping insertion in model container [2024-11-20 14:40:34,171 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:40:33" (2/3) ... [2024-11-20 14:40:34,172 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27008c2e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:40:34, skipping insertion in model container [2024-11-20 14:40:34,172 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:40:34" (3/3) ... [2024-11-20 14:40:34,173 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04-2.i [2024-11-20 14:40:34,186 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:40:34,186 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-20 14:40:34,245 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:40:34,252 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4e30a29a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:40:34,253 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-20 14:40:34,257 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 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) [2024-11-20 14:40:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:40:34,262 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:34,263 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:40:34,263 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:34,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:34,268 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2024-11-20 14:40:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:34,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150469616] [2024-11-20 14:40:34,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:34,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:34,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:34,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:34,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150469616] [2024-11-20 14:40:34,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150469616] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:34,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:34,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:40:34,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157068056] [2024-11-20 14:40:34,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:34,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:40:34,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:34,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:40:34,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:40:34,587 INFO L87 Difference]: Start difference. First operand has 103 states, 56 states have (on average 2.0) internal successors, (112), 102 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 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:34,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:34,722 INFO L93 Difference]: Finished difference Result 106 states and 113 transitions. [2024-11-20 14:40:34,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:40:34,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-20 14:40:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:34,732 INFO L225 Difference]: With dead ends: 106 [2024-11-20 14:40:34,732 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 14:40:34,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:34,737 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 120 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:34,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 97 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:34,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 14:40:34,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 98. [2024-11-20 14:40:34,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 57 states have (on average 1.8421052631578947) internal successors, (105), 97 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:34,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2024-11-20 14:40:34,768 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 4 [2024-11-20 14:40:34,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:34,769 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2024-11-20 14:40:34,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:34,769 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2024-11-20 14:40:34,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:40:34,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:34,769 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:40:34,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:40:34,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:34,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:34,771 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2024-11-20 14:40:34,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:34,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833162090] [2024-11-20 14:40:34,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:34,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:34,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:34,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:34,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:34,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833162090] [2024-11-20 14:40:34,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [833162090] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:34,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:34,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:40:34,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096554183] [2024-11-20 14:40:34,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:34,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:40:34,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:34,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:40:34,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:40:34,873 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:34,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:34,998 INFO L93 Difference]: Finished difference Result 137 states and 147 transitions. [2024-11-20 14:40:34,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:40:34,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-20 14:40:34,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:35,000 INFO L225 Difference]: With dead ends: 137 [2024-11-20 14:40:35,000 INFO L226 Difference]: Without dead ends: 137 [2024-11-20 14:40:35,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:35,001 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 117 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:35,002 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 101 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:35,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-11-20 14:40:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 107. [2024-11-20 14:40:35,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 68 states have (on average 1.7647058823529411) internal successors, (120), 106 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 120 transitions. [2024-11-20 14:40:35,008 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 120 transitions. Word has length 4 [2024-11-20 14:40:35,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:35,008 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 120 transitions. [2024-11-20 14:40:35,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,008 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 120 transitions. [2024-11-20 14:40:35,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 14:40:35,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:35,009 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 14:40:35,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:40:35,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:35,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:35,009 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2024-11-20 14:40:35,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:35,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575353365] [2024-11-20 14:40:35,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:35,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:35,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:35,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:35,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575353365] [2024-11-20 14:40:35,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575353365] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:35,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:35,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:35,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954658999] [2024-11-20 14:40:35,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:35,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:35,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:35,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:35,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:35,046 INFO L87 Difference]: Start difference. First operand 107 states and 120 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:35,093 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2024-11-20 14:40:35,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:35,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 14:40:35,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:35,094 INFO L225 Difference]: With dead ends: 105 [2024-11-20 14:40:35,094 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 14:40:35,094 INFO L431 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 [2024-11-20 14:40:35,095 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:35,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 114 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:40:35,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 14:40:35,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-20 14:40:35,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 68 states have (on average 1.7352941176470589) internal successors, (118), 104 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) [2024-11-20 14:40:35,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 118 transitions. [2024-11-20 14:40:35,101 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 118 transitions. Word has length 5 [2024-11-20 14:40:35,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:35,101 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 118 transitions. [2024-11-20 14:40:35,101 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,101 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 118 transitions. [2024-11-20 14:40:35,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 14:40:35,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:35,101 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 14:40:35,102 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:40:35,102 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:35,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:35,102 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2024-11-20 14:40:35,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:35,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227101868] [2024-11-20 14:40:35,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:35,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:35,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:35,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:35,207 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227101868] [2024-11-20 14:40:35,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227101868] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:35,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:35,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:35,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061259244] [2024-11-20 14:40:35,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:35,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:35,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:35,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:35,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:35,209 INFO L87 Difference]: Start difference. First operand 105 states and 118 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:35,290 INFO L93 Difference]: Finished difference Result 103 states and 116 transitions. [2024-11-20 14:40:35,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:35,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 14:40:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:35,292 INFO L225 Difference]: With dead ends: 103 [2024-11-20 14:40:35,292 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 14:40:35,292 INFO L431 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 [2024-11-20 14:40:35,295 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 31 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:35,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 119 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 14:40:35,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-20 14:40:35,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 68 states have (on average 1.7058823529411764) internal successors, (116), 102 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) [2024-11-20 14:40:35,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-20 14:40:35,307 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 5 [2024-11-20 14:40:35,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:35,307 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-20 14:40:35,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,307 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-20 14:40:35,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:40:35,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:35,308 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:35,308 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:40:35,308 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:35,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:35,309 INFO L85 PathProgramCache]: Analyzing trace with hash 234240077, now seen corresponding path program 1 times [2024-11-20 14:40:35,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:35,309 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126173350] [2024-11-20 14:40:35,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:35,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:35,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:35,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:35,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126173350] [2024-11-20 14:40:35,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126173350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:35,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:35,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:35,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954705465] [2024-11-20 14:40:35,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:35,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:35,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:35,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:35,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:35,373 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:35,495 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-20 14:40:35,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:35,496 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:40:35,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:35,497 INFO L225 Difference]: With dead ends: 99 [2024-11-20 14:40:35,497 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 14:40:35,500 INFO L431 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 [2024-11-20 14:40:35,501 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:35,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 117 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:35,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 14:40:35,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-20 14:40:35,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 68 states have (on average 1.6470588235294117) internal successors, (112), 98 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) [2024-11-20 14:40:35,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-20 14:40:35,513 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 9 [2024-11-20 14:40:35,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:35,514 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-20 14:40:35,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,517 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-20 14:40:35,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:40:35,517 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:35,518 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:35,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:40:35,518 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:35,518 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:35,518 INFO L85 PathProgramCache]: Analyzing trace with hash 234240078, now seen corresponding path program 1 times [2024-11-20 14:40:35,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:35,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530494020] [2024-11-20 14:40:35,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:35,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:35,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:35,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530494020] [2024-11-20 14:40:35,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530494020] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:35,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:35,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:40:35,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098266358] [2024-11-20 14:40:35,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:35,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:40:35,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:35,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:40:35,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:40:35,612 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:35,657 INFO L93 Difference]: Finished difference Result 95 states and 108 transitions. [2024-11-20 14:40:35,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:40:35,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:40:35,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:35,659 INFO L225 Difference]: With dead ends: 95 [2024-11-20 14:40:35,659 INFO L226 Difference]: Without dead ends: 95 [2024-11-20 14:40:35,659 INFO L431 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 [2024-11-20 14:40:35,660 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 15 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:35,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 122 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:40:35,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-20 14:40:35,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-20 14:40:35,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.588235294117647) internal successors, (108), 94 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 108 transitions. [2024-11-20 14:40:35,668 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 108 transitions. Word has length 9 [2024-11-20 14:40:35,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:35,671 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 108 transitions. [2024-11-20 14:40:35,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,671 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 108 transitions. [2024-11-20 14:40:35,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:40:35,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:35,672 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:35,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:40:35,672 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:35,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:35,673 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747280, now seen corresponding path program 1 times [2024-11-20 14:40:35,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:35,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245983441] [2024-11-20 14:40:35,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:35,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:35,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:35,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:35,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245983441] [2024-11-20 14:40:35,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245983441] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:35,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:35,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:35,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915714236] [2024-11-20 14:40:35,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:35,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:35,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:35,766 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:35,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:35,766 INFO L87 Difference]: Start difference. First operand 95 states and 108 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:35,879 INFO L93 Difference]: Finished difference Result 104 states and 118 transitions. [2024-11-20 14:40:35,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:35,884 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 14:40:35,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:35,884 INFO L225 Difference]: With dead ends: 104 [2024-11-20 14:40:35,884 INFO L226 Difference]: Without dead ends: 104 [2024-11-20 14:40:35,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:35,885 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 6 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:35,885 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 225 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:35,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-20 14:40:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2024-11-20 14:40:35,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5833333333333333) 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) [2024-11-20 14:40:35,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 114 transitions. [2024-11-20 14:40:35,892 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 114 transitions. Word has length 14 [2024-11-20 14:40:35,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:35,896 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 114 transitions. [2024-11-20 14:40:35,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:35,896 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 114 transitions. [2024-11-20 14:40:35,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-20 14:40:35,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:35,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:35,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:40:35,897 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:35,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:35,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1431747281, now seen corresponding path program 1 times [2024-11-20 14:40:35,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:35,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775696595] [2024-11-20 14:40:35,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:35,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:36,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775696595] [2024-11-20 14:40:36,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775696595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:36,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:36,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:36,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1983332114] [2024-11-20 14:40:36,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:36,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:36,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:36,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:36,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:36,121 INFO L87 Difference]: Start difference. First operand 99 states and 114 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:36,206 INFO L93 Difference]: Finished difference Result 99 states and 112 transitions. [2024-11-20 14:40:36,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:36,206 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-20 14:40:36,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:36,207 INFO L225 Difference]: With dead ends: 99 [2024-11-20 14:40:36,207 INFO L226 Difference]: Without dead ends: 99 [2024-11-20 14:40:36,207 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:36,208 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:36,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 232 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:36,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-20 14:40:36,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-20 14:40:36,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 98 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) [2024-11-20 14:40:36,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 112 transitions. [2024-11-20 14:40:36,216 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 112 transitions. Word has length 14 [2024-11-20 14:40:36,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:36,216 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 112 transitions. [2024-11-20 14:40:36,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,216 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 112 transitions. [2024-11-20 14:40:36,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:40:36,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:36,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:36,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:40:36,217 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:36,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:36,217 INFO L85 PathProgramCache]: Analyzing trace with hash -475614716, now seen corresponding path program 1 times [2024-11-20 14:40:36,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:36,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685809679] [2024-11-20 14:40:36,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,312 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:36,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:36,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685809679] [2024-11-20 14:40:36,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [685809679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:36,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:36,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:36,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185336193] [2024-11-20 14:40:36,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:36,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:36,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:36,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:36,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:36,314 INFO L87 Difference]: Start difference. First operand 99 states and 112 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:36,391 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2024-11-20 14:40:36,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:40:36,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:36,392 INFO L225 Difference]: With dead ends: 160 [2024-11-20 14:40:36,392 INFO L226 Difference]: Without dead ends: 160 [2024-11-20 14:40:36,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:36,393 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 89 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:36,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 301 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:36,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-20 14:40:36,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 99. [2024-11-20 14:40:36,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 72 states have (on average 1.5416666666666667) 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) [2024-11-20 14:40:36,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 111 transitions. [2024-11-20 14:40:36,396 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 111 transitions. Word has length 18 [2024-11-20 14:40:36,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:36,396 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 111 transitions. [2024-11-20 14:40:36,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,396 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 111 transitions. [2024-11-20 14:40:36,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:40:36,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:36,397 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:36,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:40:36,397 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:36,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:36,398 INFO L85 PathProgramCache]: Analyzing trace with hash -475614743, now seen corresponding path program 1 times [2024-11-20 14:40:36,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:36,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969512360] [2024-11-20 14:40:36,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:36,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:36,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:36,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:36,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969512360] [2024-11-20 14:40:36,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969512360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:36,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:36,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:36,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195432315] [2024-11-20 14:40:36,540 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:36,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:36,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:36,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:36,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:36,541 INFO L87 Difference]: Start difference. First operand 99 states and 111 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:36,663 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2024-11-20 14:40:36,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:36,663 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:40:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:36,664 INFO L225 Difference]: With dead ends: 165 [2024-11-20 14:40:36,664 INFO L226 Difference]: Without dead ends: 165 [2024-11-20 14:40:36,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:36,665 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 57 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:36,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 227 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:36,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2024-11-20 14:40:36,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 113. [2024-11-20 14:40:36,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4767441860465116) internal successors, (127), 112 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) [2024-11-20 14:40:36,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 127 transitions. [2024-11-20 14:40:36,667 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 127 transitions. Word has length 18 [2024-11-20 14:40:36,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:36,667 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 127 transitions. [2024-11-20 14:40:36,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,668 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 127 transitions. [2024-11-20 14:40:36,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:40:36,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:36,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:36,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:40:36,668 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:36,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:36,669 INFO L85 PathProgramCache]: Analyzing trace with hash -475614744, now seen corresponding path program 1 times [2024-11-20 14:40:36,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:36,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006412832] [2024-11-20 14:40:36,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:36,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:36,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:36,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:36,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006412832] [2024-11-20 14:40:36,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006412832] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:36,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:36,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:36,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679599580] [2024-11-20 14:40:36,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:36,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:36,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:36,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:36,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:36,749 INFO L87 Difference]: Start difference. First operand 113 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:36,864 INFO L93 Difference]: Finished difference Result 177 states and 190 transitions. [2024-11-20 14:40:36,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:36,864 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:40:36,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:36,865 INFO L225 Difference]: With dead ends: 177 [2024-11-20 14:40:36,865 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 14:40:36,865 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:36,866 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 98 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:36,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 208 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:36,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 14:40:36,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 113. [2024-11-20 14:40:36,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 86 states have (on average 1.4534883720930232) internal successors, (125), 112 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 125 transitions. [2024-11-20 14:40:36,868 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 125 transitions. Word has length 18 [2024-11-20 14:40:36,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:36,868 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 125 transitions. [2024-11-20 14:40:36,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:36,869 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 125 transitions. [2024-11-20 14:40:36,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 14:40:36,869 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:36,869 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:36,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:40:36,870 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:36,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:36,870 INFO L85 PathProgramCache]: Analyzing trace with hash -764326860, now seen corresponding path program 1 times [2024-11-20 14:40:36,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:36,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257377292] [2024-11-20 14:40:36,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:36,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:37,005 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:37,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:37,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257377292] [2024-11-20 14:40:37,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257377292] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:37,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [436281253] [2024-11-20 14:40:37,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:37,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:37,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:37,009 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) [2024-11-20 14:40:37,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 14:40:37,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:37,083 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 14:40:37,087 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:37,133 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:37,152 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:40:37,152 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:37,171 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-20 14:40:37,214 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:37,215 INFO L378 Elim1Store]: Elim1 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 42 treesize of output 41 [2024-11-20 14:40:37,235 INFO L378 Elim1Store]: Elim1 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 13 [2024-11-20 14:40:37,247 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:37,247 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:37,268 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-20 14:40:37,268 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 20 [2024-11-20 14:40:37,320 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:37,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [436281253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:37,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:37,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-20 14:40:37,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510380794] [2024-11-20 14:40:37,321 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:37,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:40:37,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:37,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:40:37,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=124, Unknown=2, NotChecked=0, Total=156 [2024-11-20 14:40:37,322 INFO L87 Difference]: Start difference. First operand 113 states and 125 transitions. Second operand has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 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) [2024-11-20 14:40:37,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:37,576 INFO L93 Difference]: Finished difference Result 112 states and 124 transitions. [2024-11-20 14:40:37,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:37,576 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 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 20 [2024-11-20 14:40:37,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:37,577 INFO L225 Difference]: With dead ends: 112 [2024-11-20 14:40:37,577 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 14:40:37,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=183, Unknown=2, NotChecked=0, Total=240 [2024-11-20 14:40:37,578 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 21 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 576 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:37,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 576 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:37,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 14:40:37,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-20 14:40:37,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 86 states have (on average 1.441860465116279) internal successors, (124), 111 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:37,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 124 transitions. [2024-11-20 14:40:37,580 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 124 transitions. Word has length 20 [2024-11-20 14:40:37,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:37,580 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 124 transitions. [2024-11-20 14:40:37,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 13 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) [2024-11-20 14:40:37,580 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 124 transitions. [2024-11-20 14:40:37,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 14:40:37,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:37,582 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:37,589 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 14:40:37,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-20 14:40:37,783 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:37,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:37,784 INFO L85 PathProgramCache]: Analyzing trace with hash -764326859, now seen corresponding path program 1 times [2024-11-20 14:40:37,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:37,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49619679] [2024-11-20 14:40:37,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:37,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:37,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:38,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:38,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49619679] [2024-11-20 14:40:38,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49619679] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:38,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15119319] [2024-11-20 14:40:38,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:38,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:38,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:38,196 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) [2024-11-20 14:40:38,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 14:40:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:38,265 INFO L255 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-20 14:40:38,267 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:38,272 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:38,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:40:38,293 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:40:38,294 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:38,319 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-20 14:40:38,327 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:38,478 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:38,479 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 57 [2024-11-20 14:40:38,489 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-20 14:40:38,544 INFO L378 Elim1Store]: Elim1 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 13 [2024-11-20 14:40:38,549 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-20 14:40:38,566 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:38,566 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:38,664 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4)) (.cse1 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0)))) (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse0) .cse1 4))))) is different from false [2024-11-20 14:40:38,746 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_261 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (forall ((v_ArrVal_261 (Array Int Int)) (v_ArrVal_262 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_261) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_262) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))))))) is different from false [2024-11-20 14:40:38,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:38,753 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 25 [2024-11-20 14:40:38,764 INFO L378 Elim1Store]: Elim1 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 40 treesize of output 28 [2024-11-20 14:40:38,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:38,773 INFO L378 Elim1Store]: Elim1 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 45 treesize of output 46 [2024-11-20 14:40:38,778 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:38,778 INFO L378 Elim1Store]: Elim1 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 35 treesize of output 36 [2024-11-20 14:40:38,780 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:38,782 INFO L378 Elim1Store]: Elim1 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 33 treesize of output 21 [2024-11-20 14:40:38,784 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:38,787 INFO L378 Elim1Store]: Elim1 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 24 treesize of output 12 [2024-11-20 14:40:38,823 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-20 14:40:38,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [15119319] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:38,824 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:38,824 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 23 [2024-11-20 14:40:38,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344732658] [2024-11-20 14:40:38,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:38,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 14:40:38,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:38,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 14:40:38,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=383, Unknown=7, NotChecked=82, Total=552 [2024-11-20 14:40:38,825 INFO L87 Difference]: Start difference. First operand 112 states and 124 transitions. Second operand has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:39,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:39,330 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2024-11-20 14:40:39,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:40:39,330 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 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 [2024-11-20 14:40:39,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:39,331 INFO L225 Difference]: With dead ends: 124 [2024-11-20 14:40:39,331 INFO L226 Difference]: Without dead ends: 124 [2024-11-20 14:40:39,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=178, Invalid=751, Unknown=9, NotChecked=118, Total=1056 [2024-11-20 14:40:39,332 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 83 mSDsluCounter, 592 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 4 mSolverCounterUnsat, 18 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 670 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 18 IncrementalHoareTripleChecker+Unknown, 119 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:39,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 670 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 470 Invalid, 18 Unknown, 119 Unchecked, 0.3s Time] [2024-11-20 14:40:39,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-20 14:40:39,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2024-11-20 14:40:39,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.3979591836734695) internal successors, (137), 123 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:39,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 137 transitions. [2024-11-20 14:40:39,334 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 137 transitions. Word has length 20 [2024-11-20 14:40:39,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:39,334 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 137 transitions. [2024-11-20 14:40:39,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.0434782608695654) internal successors, (47), 24 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:39,334 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 137 transitions. [2024-11-20 14:40:39,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:40:39,335 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:39,335 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:39,345 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 14:40:39,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-11-20 14:40:39,543 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:39,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:39,543 INFO L85 PathProgramCache]: Analyzing trace with hash 58337566, now seen corresponding path program 1 times [2024-11-20 14:40:39,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:39,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833873460] [2024-11-20 14:40:39,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:39,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:39,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:39,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:39,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833873460] [2024-11-20 14:40:39,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833873460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:39,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:39,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:39,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022089714] [2024-11-20 14:40:39,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:39,736 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:39,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:39,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:39,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:39,737 INFO L87 Difference]: Start difference. First operand 124 states and 137 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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) [2024-11-20 14:40:39,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:39,899 INFO L93 Difference]: Finished difference Result 198 states and 213 transitions. [2024-11-20 14:40:39,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:39,899 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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 [2024-11-20 14:40:39,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:39,900 INFO L225 Difference]: With dead ends: 198 [2024-11-20 14:40:39,900 INFO L226 Difference]: Without dead ends: 198 [2024-11-20 14:40:39,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:39,901 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 73 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:39,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 242 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-20 14:40:39,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 124. [2024-11-20 14:40:39,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.3877551020408163) internal successors, (136), 123 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:39,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 136 transitions. [2024-11-20 14:40:39,907 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 136 transitions. Word has length 21 [2024-11-20 14:40:39,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:39,907 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 136 transitions. [2024-11-20 14:40:39,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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) [2024-11-20 14:40:39,907 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 136 transitions. [2024-11-20 14:40:39,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:40:39,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:39,908 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:39,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:40:39,908 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:39,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:39,908 INFO L85 PathProgramCache]: Analyzing trace with hash 58337567, now seen corresponding path program 1 times [2024-11-20 14:40:39,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:39,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516366217] [2024-11-20 14:40:39,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:39,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:39,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:40,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:40,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516366217] [2024-11-20 14:40:40,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516366217] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:40,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:40,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:40,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300838189] [2024-11-20 14:40:40,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:40,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:40,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:40,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:40,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:40,099 INFO L87 Difference]: Start difference. First operand 124 states and 136 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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) [2024-11-20 14:40:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:40,222 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2024-11-20 14:40:40,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:40,222 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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 [2024-11-20 14:40:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:40,223 INFO L225 Difference]: With dead ends: 200 [2024-11-20 14:40:40,223 INFO L226 Difference]: Without dead ends: 200 [2024-11-20 14:40:40,223 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:40,223 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:40,224 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 221 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:40,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2024-11-20 14:40:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 124. [2024-11-20 14:40:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 98 states have (on average 1.3775510204081634) internal successors, (135), 123 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:40,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 135 transitions. [2024-11-20 14:40:40,226 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 135 transitions. Word has length 21 [2024-11-20 14:40:40,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:40,226 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 135 transitions. [2024-11-20 14:40:40,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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) [2024-11-20 14:40:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 135 transitions. [2024-11-20 14:40:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-20 14:40:40,227 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:40,227 INFO L215 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] [2024-11-20 14:40:40,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-20 14:40:40,227 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:40,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:40,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1527252530, now seen corresponding path program 1 times [2024-11-20 14:40:40,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:40,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200539035] [2024-11-20 14:40:40,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:40,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:40,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:40,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:40,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200539035] [2024-11-20 14:40:40,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200539035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:40,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:40,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:40:40,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558170319] [2024-11-20 14:40:40,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:40,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:40:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:40,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:40:40,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:40:40,439 INFO L87 Difference]: Start difference. First operand 124 states and 135 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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) [2024-11-20 14:40:40,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:40,581 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2024-11-20 14:40:40,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:40:40,581 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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 [2024-11-20 14:40:40,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:40,582 INFO L225 Difference]: With dead ends: 152 [2024-11-20 14:40:40,582 INFO L226 Difference]: Without dead ends: 152 [2024-11-20 14:40:40,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:40:40,582 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 36 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:40,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 415 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:40,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-20 14:40:40,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 140. [2024-11-20 14:40:40,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 114 states have (on average 1.3333333333333333) internal successors, (152), 139 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:40,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 152 transitions. [2024-11-20 14:40:40,585 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 152 transitions. Word has length 24 [2024-11-20 14:40:40,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:40,585 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 152 transitions. [2024-11-20 14:40:40,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 10 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) [2024-11-20 14:40:40,586 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 152 transitions. [2024-11-20 14:40:40,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-20 14:40:40,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:40,591 INFO L215 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] [2024-11-20 14:40:40,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-20 14:40:40,592 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:40,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:40,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1189100778, now seen corresponding path program 1 times [2024-11-20 14:40:40,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:40,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [990901719] [2024-11-20 14:40:40,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:40,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:40,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:40,725 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:40,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:40,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [990901719] [2024-11-20 14:40:40,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [990901719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:40,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:40,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:40,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518811607] [2024-11-20 14:40:40,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:40,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:40,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:40,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:40,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:40,727 INFO L87 Difference]: Start difference. First operand 140 states and 152 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:40,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:40,776 INFO L93 Difference]: Finished difference Result 168 states and 184 transitions. [2024-11-20 14:40:40,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:40:40,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-11-20 14:40:40,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:40,778 INFO L225 Difference]: With dead ends: 168 [2024-11-20 14:40:40,778 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 14:40:40,778 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:40,778 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 73 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:40,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 230 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:40:40,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 14:40:40,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 152. [2024-11-20 14:40:40,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 126 states have (on average 1.4047619047619047) internal successors, (177), 151 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:40,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 177 transitions. [2024-11-20 14:40:40,782 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 177 transitions. Word has length 26 [2024-11-20 14:40:40,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:40,782 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 177 transitions. [2024-11-20 14:40:40,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:40,782 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 177 transitions. [2024-11-20 14:40:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 14:40:40,783 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:40,783 INFO L215 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] [2024-11-20 14:40:40,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 14:40:40,783 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:40,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:40,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1792581374, now seen corresponding path program 1 times [2024-11-20 14:40:40,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:40,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126212065] [2024-11-20 14:40:40,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:40,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:40,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:40,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:40,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126212065] [2024-11-20 14:40:40,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126212065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:40,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:40,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:40:40,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512537975] [2024-11-20 14:40:40,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:40,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:40:40,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:40,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:40:40,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:40:40,868 INFO L87 Difference]: Start difference. First operand 152 states and 177 transitions. Second operand has 5 states, 4 states have (on average 6.75) 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) [2024-11-20 14:40:40,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:40,952 INFO L93 Difference]: Finished difference Result 218 states and 238 transitions. [2024-11-20 14:40:40,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:40:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) 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 [2024-11-20 14:40:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:40,953 INFO L225 Difference]: With dead ends: 218 [2024-11-20 14:40:40,953 INFO L226 Difference]: Without dead ends: 218 [2024-11-20 14:40:40,953 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:40,954 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 73 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:40,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 258 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:40,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2024-11-20 14:40:40,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 153. [2024-11-20 14:40:40,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 127 states have (on average 1.4015748031496063) internal successors, (178), 152 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) [2024-11-20 14:40:40,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 178 transitions. [2024-11-20 14:40:40,956 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 178 transitions. Word has length 27 [2024-11-20 14:40:40,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:40,957 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 178 transitions. [2024-11-20 14:40:40,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) 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) [2024-11-20 14:40:40,957 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 178 transitions. [2024-11-20 14:40:40,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-20 14:40:40,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:40,958 INFO L215 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] [2024-11-20 14:40:40,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 14:40:40,958 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:40,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:40,958 INFO L85 PathProgramCache]: Analyzing trace with hash 264552428, now seen corresponding path program 1 times [2024-11-20 14:40:40,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:40,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140224229] [2024-11-20 14:40:40,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:40,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:40,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:41,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:41,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:41,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140224229] [2024-11-20 14:40:41,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140224229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:41,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:41,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:40:41,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84121836] [2024-11-20 14:40:41,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:41,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:40:41,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:41,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:40:41,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:40:41,035 INFO L87 Difference]: Start difference. First operand 153 states and 178 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:41,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:41,162 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2024-11-20 14:40:41,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:41,162 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-11-20 14:40:41,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:41,163 INFO L225 Difference]: With dead ends: 221 [2024-11-20 14:40:41,163 INFO L226 Difference]: Without dead ends: 221 [2024-11-20 14:40:41,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:40:41,164 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 64 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:41,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 244 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:41,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-20 14:40:41,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 156. [2024-11-20 14:40:41,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 130 states have (on average 1.3923076923076922) internal successors, (181), 155 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:41,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 181 transitions. [2024-11-20 14:40:41,167 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 181 transitions. Word has length 28 [2024-11-20 14:40:41,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:41,167 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 181 transitions. [2024-11-20 14:40:41,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:41,167 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 181 transitions. [2024-11-20 14:40:41,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:40:41,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:41,168 INFO L215 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] [2024-11-20 14:40:41,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:40:41,168 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:41,168 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:41,168 INFO L85 PathProgramCache]: Analyzing trace with hash -388809147, now seen corresponding path program 1 times [2024-11-20 14:40:41,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:41,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113128459] [2024-11-20 14:40:41,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:41,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:41,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:41,314 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:41,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:41,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113128459] [2024-11-20 14:40:41,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113128459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:40:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923481032] [2024-11-20 14:40:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:41,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:40:41,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:41,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:40:41,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:40:41,316 INFO L87 Difference]: Start difference. First operand 156 states and 181 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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) [2024-11-20 14:40:41,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:41,433 INFO L93 Difference]: Finished difference Result 177 states and 195 transitions. [2024-11-20 14:40:41,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:40:41,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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 [2024-11-20 14:40:41,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:41,435 INFO L225 Difference]: With dead ends: 177 [2024-11-20 14:40:41,435 INFO L226 Difference]: Without dead ends: 177 [2024-11-20 14:40:41,435 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:40:41,435 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 140 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:41,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 186 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:40:41,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-20 14:40:41,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 157. [2024-11-20 14:40:41,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 131 states have (on average 1.3969465648854962) internal successors, (183), 156 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 183 transitions. [2024-11-20 14:40:41,438 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 183 transitions. Word has length 29 [2024-11-20 14:40:41,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:41,438 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 183 transitions. [2024-11-20 14:40:41,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 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) [2024-11-20 14:40:41,439 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 183 transitions. [2024-11-20 14:40:41,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:40:41,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:41,439 INFO L215 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] [2024-11-20 14:40:41,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 14:40:41,439 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:41,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:41,440 INFO L85 PathProgramCache]: Analyzing trace with hash -388809146, now seen corresponding path program 1 times [2024-11-20 14:40:41,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:41,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071321406] [2024-11-20 14:40:41,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:41,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:41,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:41,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:41,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:41,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071321406] [2024-11-20 14:40:41,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071321406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:41,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:41,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:40:41,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147319552] [2024-11-20 14:40:41,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:41,477 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:40:41,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:41,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:40:41,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:40:41,477 INFO L87 Difference]: Start difference. First operand 157 states and 183 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) [2024-11-20 14:40:41,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:41,519 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2024-11-20 14:40:41,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:40:41,520 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 [2024-11-20 14:40:41,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:41,520 INFO L225 Difference]: With dead ends: 152 [2024-11-20 14:40:41,520 INFO L226 Difference]: Without dead ends: 152 [2024-11-20 14:40:41,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:40:41,521 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 61 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:41,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:40:41,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2024-11-20 14:40:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2024-11-20 14:40:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3358778625954197) internal successors, (175), 151 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) [2024-11-20 14:40:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 175 transitions. [2024-11-20 14:40:41,523 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 175 transitions. Word has length 29 [2024-11-20 14:40:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:41,524 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 175 transitions. [2024-11-20 14:40:41,524 INFO L472 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) [2024-11-20 14:40:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2024-11-20 14:40:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:40:41,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:41,524 INFO L215 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] [2024-11-20 14:40:41,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 14:40:41,524 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:41,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:41,525 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056854, now seen corresponding path program 1 times [2024-11-20 14:40:41,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:41,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096021911] [2024-11-20 14:40:41,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:41,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:41,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:41,817 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:41,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:41,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096021911] [2024-11-20 14:40:41,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096021911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:41,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:41,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:40:41,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136987072] [2024-11-20 14:40:41,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:41,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:40:41,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:41,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:40:41,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:40:41,819 INFO L87 Difference]: Start difference. First operand 152 states and 175 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:42,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:42,034 INFO L93 Difference]: Finished difference Result 172 states and 185 transitions. [2024-11-20 14:40:42,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 14:40:42,035 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-20 14:40:42,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:42,035 INFO L225 Difference]: With dead ends: 172 [2024-11-20 14:40:42,035 INFO L226 Difference]: Without dead ends: 172 [2024-11-20 14:40:42,036 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:40:42,036 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 68 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:42,036 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 371 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:42,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-20 14:40:42,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 152. [2024-11-20 14:40:42,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 131 states have (on average 1.3129770992366412) internal successors, (172), 151 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:42,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 172 transitions. [2024-11-20 14:40:42,039 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 172 transitions. Word has length 29 [2024-11-20 14:40:42,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:42,039 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 172 transitions. [2024-11-20 14:40:42,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:42,039 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 172 transitions. [2024-11-20 14:40:42,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-20 14:40:42,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:42,040 INFO L215 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] [2024-11-20 14:40:42,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 14:40:42,040 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:42,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:42,040 INFO L85 PathProgramCache]: Analyzing trace with hash -2066056855, now seen corresponding path program 1 times [2024-11-20 14:40:42,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:42,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121155476] [2024-11-20 14:40:42,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:42,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:42,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:42,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:42,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:42,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121155476] [2024-11-20 14:40:42,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121155476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:42,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:42,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:40:42,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1350693715] [2024-11-20 14:40:42,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:42,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:40:42,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:42,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:40:42,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:40:42,272 INFO L87 Difference]: Start difference. First operand 152 states and 172 transitions. Second operand has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:42,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:42,468 INFO L93 Difference]: Finished difference Result 171 states and 186 transitions. [2024-11-20 14:40:42,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:40:42,468 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-11-20 14:40:42,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:42,469 INFO L225 Difference]: With dead ends: 171 [2024-11-20 14:40:42,469 INFO L226 Difference]: Without dead ends: 171 [2024-11-20 14:40:42,469 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:40:42,470 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 74 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:42,470 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 340 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:42,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-20 14:40:42,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 157. [2024-11-20 14:40:42,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 137 states have (on average 1.2992700729927007) internal successors, (178), 156 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) [2024-11-20 14:40:42,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 178 transitions. [2024-11-20 14:40:42,474 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 178 transitions. Word has length 29 [2024-11-20 14:40:42,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:42,474 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 178 transitions. [2024-11-20 14:40:42,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.9) internal successors, (29), 11 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:42,474 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 178 transitions. [2024-11-20 14:40:42,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:40:42,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:42,475 INFO L215 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] [2024-11-20 14:40:42,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-20 14:40:42,475 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:42,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:42,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1276636110, now seen corresponding path program 1 times [2024-11-20 14:40:42,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:42,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091251367] [2024-11-20 14:40:42,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:42,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:42,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:42,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:42,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:42,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091251367] [2024-11-20 14:40:42,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091251367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:42,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:42,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 14:40:42,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945576359] [2024-11-20 14:40:42,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:42,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:40:42,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:42,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:40:42,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:40:42,896 INFO L87 Difference]: Start difference. First operand 157 states and 178 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:43,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:43,252 INFO L93 Difference]: Finished difference Result 194 states and 220 transitions. [2024-11-20 14:40:43,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 14:40:43,252 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-20 14:40:43,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:43,253 INFO L225 Difference]: With dead ends: 194 [2024-11-20 14:40:43,253 INFO L226 Difference]: Without dead ends: 194 [2024-11-20 14:40:43,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2024-11-20 14:40:43,254 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 73 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 660 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:43,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 660 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:43,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2024-11-20 14:40:43,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 166. [2024-11-20 14:40:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.2945205479452055) internal successors, (189), 165 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 189 transitions. [2024-11-20 14:40:43,257 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 189 transitions. Word has length 32 [2024-11-20 14:40:43,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:43,257 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 189 transitions. [2024-11-20 14:40:43,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 189 transitions. [2024-11-20 14:40:43,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:40:43,258 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:43,258 INFO L215 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] [2024-11-20 14:40:43,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-20 14:40:43,258 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:43,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:43,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1276647095, now seen corresponding path program 1 times [2024-11-20 14:40:43,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:43,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187252316] [2024-11-20 14:40:43,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:43,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:43,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:43,480 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:43,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:43,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187252316] [2024-11-20 14:40:43,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187252316] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:40:43,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:40:43,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-20 14:40:43,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987934005] [2024-11-20 14:40:43,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:40:43,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:40:43,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:43,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:40:43,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:40:43,482 INFO L87 Difference]: Start difference. First operand 166 states and 189 transitions. Second operand has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:43,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:40:43,688 INFO L93 Difference]: Finished difference Result 183 states and 200 transitions. [2024-11-20 14:40:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:40:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-20 14:40:43,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:40:43,689 INFO L225 Difference]: With dead ends: 183 [2024-11-20 14:40:43,689 INFO L226 Difference]: Without dead ends: 183 [2024-11-20 14:40:43,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-20 14:40:43,690 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 66 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:40:43,690 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 440 Invalid, 339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 14:40:43,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2024-11-20 14:40:43,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 166. [2024-11-20 14:40:43,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 146 states have (on average 1.2808219178082192) internal successors, (187), 165 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:43,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 187 transitions. [2024-11-20 14:40:43,693 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 187 transitions. Word has length 32 [2024-11-20 14:40:43,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:40:43,693 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 187 transitions. [2024-11-20 14:40:43,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.2) internal successors, (32), 11 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:40:43,693 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 187 transitions. [2024-11-20 14:40:43,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-20 14:40:43,693 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:40:43,694 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:40:43,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 14:40:43,694 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:40:43,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:40:43,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1383997955, now seen corresponding path program 2 times [2024-11-20 14:40:43,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:40:43,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531419136] [2024-11-20 14:40:43,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:40:43,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:40:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:40:44,102 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:44,102 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:40:44,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531419136] [2024-11-20 14:40:44,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531419136] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:40:44,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2111450816] [2024-11-20 14:40:44,103 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:40:44,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:40:44,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:40:44,105 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) [2024-11-20 14:40:44,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 14:40:44,204 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:40:44,204 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:40:44,206 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-20 14:40:44,209 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:40:44,214 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:44,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-20 14:40:44,227 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 14:40:44,228 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:44,240 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:40:44,246 INFO L378 Elim1Store]: Elim1 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 19 treesize of output 1 [2024-11-20 14:40:44,324 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:44,325 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 57 [2024-11-20 14:40:44,330 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-20 14:40:44,434 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:44,435 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 57 [2024-11-20 14:40:44,441 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-20 14:40:44,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 14:40:44,549 INFO L378 Elim1Store]: Elim1 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 62 treesize of output 57 [2024-11-20 14:40:44,556 INFO L378 Elim1Store]: Elim1 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 30 treesize of output 13 [2024-11-20 14:40:44,612 INFO L378 Elim1Store]: Elim1 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 13 [2024-11-20 14:40:44,616 INFO L378 Elim1Store]: Elim1 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 9 treesize of output 3 [2024-11-20 14:40:44,638 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:40:44,638 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:40:44,754 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4)))))) is different from false [2024-11-20 14:40:44,810 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) .cse2 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-20 14:40:44,890 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_668))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_669) .cse2 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12)))))) is different from false [2024-11-20 14:40:44,910 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 12 (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_667))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_666) .cse1 v_ArrVal_669) (select (select (store .cse2 .cse1 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670))) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_666 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_667))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_668))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 16 (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_666) .cse4 v_ArrVal_669) .cse5 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))))))) is different from false [2024-11-20 14:40:45,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:45,787 INFO L378 Elim1Store]: Elim1 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 177 treesize of output 178 [2024-11-20 14:40:45,794 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:45,795 INFO L378 Elim1Store]: Elim1 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 167 treesize of output 108 [2024-11-20 14:40:45,806 INFO L378 Elim1Store]: Elim1 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 120144 treesize of output 103902 [2024-11-20 14:40:46,711 INFO L378 Elim1Store]: Elim1 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 4987 treesize of output 4849 [2024-11-20 14:40:46,732 INFO L378 Elim1Store]: Elim1 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 557 treesize of output 461 [2024-11-20 14:40:46,737 INFO L378 Elim1Store]: Elim1 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 461 treesize of output 425 [2024-11-20 14:40:46,742 INFO L378 Elim1Store]: Elim1 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 425 treesize of output 353 [2024-11-20 14:40:46,749 INFO L378 Elim1Store]: Elim1 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 331 treesize of output 311 [2024-11-20 14:40:46,755 INFO L378 Elim1Store]: Elim1 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 311 treesize of output 303 [2024-11-20 14:40:46,760 INFO L378 Elim1Store]: Elim1 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 325 treesize of output 313 [2024-11-20 14:40:46,830 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:46,831 INFO L378 Elim1Store]: Elim1 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 90 treesize of output 91 [2024-11-20 14:40:46,837 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:40:46,837 INFO L378 Elim1Store]: Elim1 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 80 treesize of output 61 [2024-11-20 14:40:46,839 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:46,841 INFO L378 Elim1Store]: Elim1 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 85 treesize of output 55 [2024-11-20 14:40:46,844 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:40:46,846 INFO L378 Elim1Store]: Elim1 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 22 treesize of output 10 [2024-11-20 14:40:46,905 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 8 refuted. 2 times theorem prover too weak. 0 trivial. 20 not checked. [2024-11-20 14:40:46,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2111450816] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:40:46,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:40:46,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 15] total 34 [2024-11-20 14:40:46,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895910550] [2024-11-20 14:40:46,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:40:46,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-20 14:40:46,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:40:46,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-20 14:40:46,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=723, Unknown=44, NotChecked=244, Total=1190 [2024-11-20 14:40:46,907 INFO L87 Difference]: Start difference. First operand 166 states and 187 transitions. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:01,876 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .cse3 .cse2 8) (select |c_#length| .cse0)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (<= 0 (+ .cse3 .cse2 4)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_668))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse2 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_669) .cse4 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8)))))) is different from false [2024-11-20 14:41:02,112 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (<= (+ .cse3 .cse2 8) (select |c_#length| .cse0)) (<= 0 (+ .cse3 .cse2 4)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_668))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse2 16 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_669) .cse4 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse2 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 12))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8)))))) is different from false [2024-11-20 14:41:09,306 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (and (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_668))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_669) .cse2 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 12) (select |c_#length| (select (select (store .cse4 .cse2 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (<= 0 (+ .cse5 .cse0)) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 4))) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (<= (+ .cse5 .cse0 4) (select |c_#length| .cse1)) (= (select |c_#valid| |c_ULTIMATE.start_create_data_~data~0#1.base|) 1) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668))) (let ((.cse6 (select (select .cse7 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) .cse6 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)) (select |c_#length| (select (select (store .cse7 .cse6 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3)))))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse3) 8)))))) is different from false [2024-11-20 14:41:09,344 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (and (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 4))) (<= (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset| 4) (select |c_#length| |c_ULTIMATE.start_create_data_#t~mem7#1.base|)) (<= 0 (+ .cse0 |c_ULTIMATE.start_create_data_#t~mem7#1.offset|)) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int))) (<= 0 (+ .cse0 8 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ .cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_668))) (let ((.cse2 (select (select .cse3 |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (<= (+ .cse0 12 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_#t~mem7#1.base| v_ArrVal_669) .cse2 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (select |c_#length| (select (select (store .cse3 .cse2 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))))))) is different from false [2024-11-20 14:41:10,444 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_create_data_~data~0#1.offset| 4))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)) (.cse2 (* |c_ULTIMATE.start_create_data_~counter~0#1| 4)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1))) (and (forall ((v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_671) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1)))) (forall ((v_ArrVal_670 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_670) |c_ULTIMATE.start_create_data_~data~0#1.base|) .cse1) .cse2 4))) (<= 0 (+ .cse3 .cse2)) (<= (+ .cse3 .cse2 4) (select |c_#length| .cse0))))) is different from false [2024-11-20 14:41:12,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:12,825 INFO L93 Difference]: Finished difference Result 203 states and 227 transitions. [2024-11-20 14:41:12,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 14:41:12,825 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 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 [2024-11-20 14:41:12,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:12,826 INFO L225 Difference]: With dead ends: 203 [2024-11-20 14:41:12,826 INFO L226 Difference]: Without dead ends: 203 [2024-11-20 14:41:12,827 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 44 SyntacticMatches, 3 SemanticMatches, 56 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 659 ImplicationChecksByTransitivity, 22.3s TimeCoverageRelationStatistics Valid=476, Invalid=1825, Unknown=87, NotChecked=918, Total=3306 [2024-11-20 14:41:12,828 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 81 mSDsluCounter, 862 mSDsCounter, 0 mSdLazyCounter, 691 mSolverCounterSat, 14 mSolverCounterUnsat, 50 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 1294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 691 IncrementalHoareTripleChecker+Invalid, 50 IncrementalHoareTripleChecker+Unknown, 539 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:12,828 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 940 Invalid, 1294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 691 Invalid, 50 Unknown, 539 Unchecked, 4.9s Time] [2024-11-20 14:41:12,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-20 14:41:12,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 196. [2024-11-20 14:41:12,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 176 states have (on average 1.25) internal successors, (220), 195 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:12,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 220 transitions. [2024-11-20 14:41:12,831 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 220 transitions. Word has length 32 [2024-11-20 14:41:12,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:12,831 INFO L471 AbstractCegarLoop]: Abstraction has 196 states and 220 transitions. [2024-11-20 14:41:12,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:12,831 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 220 transitions. [2024-11-20 14:41:12,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-20 14:41:12,832 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:12,832 INFO L215 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] [2024-11-20 14:41:12,840 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 14:41:13,035 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:13,036 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:41:13,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:13,036 INFO L85 PathProgramCache]: Analyzing trace with hash 921013898, now seen corresponding path program 1 times [2024-11-20 14:41:13,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:13,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599306970] [2024-11-20 14:41:13,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:13,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:13,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:18,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:18,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:18,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599306970] [2024-11-20 14:41:18,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599306970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:41:18,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:41:18,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-20 14:41:18,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043498757] [2024-11-20 14:41:18,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:41:18,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 14:41:18,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:18,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 14:41:18,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2024-11-20 14:41:18,133 INFO L87 Difference]: Start difference. First operand 196 states and 220 transitions. Second operand has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:27,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:41:27,710 INFO L93 Difference]: Finished difference Result 215 states and 240 transitions. [2024-11-20 14:41:27,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-20 14:41:27,711 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-20 14:41:27,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:41:27,712 INFO L225 Difference]: With dead ends: 215 [2024-11-20 14:41:27,712 INFO L226 Difference]: Without dead ends: 213 [2024-11-20 14:41:27,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=100, Invalid=656, Unknown=0, NotChecked=0, Total=756 [2024-11-20 14:41:27,712 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 83 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 599 SdHoareTripleChecker+Invalid, 435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:41:27,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 599 Invalid, 435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2024-11-20 14:41:27,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2024-11-20 14:41:27,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 194. [2024-11-20 14:41:27,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 174 states have (on average 1.2471264367816093) 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) [2024-11-20 14:41:27,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 217 transitions. [2024-11-20 14:41:27,715 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 217 transitions. Word has length 33 [2024-11-20 14:41:27,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:41:27,716 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 217 transitions. [2024-11-20 14:41:27,716 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0625) internal successors, (33), 16 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:41:27,716 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 217 transitions. [2024-11-20 14:41:27,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:41:27,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:41:27,716 INFO L215 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, 1, 1] [2024-11-20 14:41:27,716 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-20 14:41:27,716 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:41:27,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:41:27,717 INFO L85 PathProgramCache]: Analyzing trace with hash -338052361, now seen corresponding path program 1 times [2024-11-20 14:41:27,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:41:27,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773800527] [2024-11-20 14:41:27,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:27,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:41:27,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:29,203 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:29,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:41:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773800527] [2024-11-20 14:41:29,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773800527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:41:29,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1091857778] [2024-11-20 14:41:29,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:41:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:41:29,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:41:29,209 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) [2024-11-20 14:41:29,211 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 14:41:29,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:41:29,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 14:41:29,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:41:31,983 INFO L349 Elim1Store]: treesize reduction 17, result has 39.3 percent of original size [2024-11-20 14:41:31,983 INFO L378 Elim1Store]: Elim1 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 15 [2024-11-20 14:41:36,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:41:36,431 INFO L378 Elim1Store]: Elim1 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 95 treesize of output 67 [2024-11-20 14:41:36,461 INFO L378 Elim1Store]: Elim1 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 21 treesize of output 13 [2024-11-20 14:41:40,098 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:40,099 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:41:42,588 INFO L378 Elim1Store]: Elim1 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 8 treesize of output 4 [2024-11-20 14:41:44,970 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_append_~node~0#1.base_13| Int) (|ULTIMATE.start_append_~pointerToList#1.offset| Int) (v_ArrVal_769 Int)) (let ((.cse0 (select (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_append_~pointerToList#1.offset| |v_ULTIMATE.start_append_~node~0#1.base_13|) |c_ULTIMATE.start_main_~#list~0#1.offset|))) (or (= .cse0 0) (not (= (select |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13|) 0)) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store |c_#valid| |v_ULTIMATE.start_append_~node~0#1.base_13| v_ArrVal_769) .cse0 0) |c_ULTIMATE.start_main_~#list~0#1.base| 0))))) is different from false [2024-11-20 14:41:44,993 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:41:44,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1091857778] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:41:44,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:41:44,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 10] total 24 [2024-11-20 14:41:44,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962067653] [2024-11-20 14:41:44,994 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:41:44,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 14:41:44,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:41:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 14:41:44,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=477, Unknown=2, NotChecked=44, Total=600 [2024-11-20 14:41:44,995 INFO L87 Difference]: Start difference. First operand 194 states and 217 transitions. Second operand has 25 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 25 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:00,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:42:00,988 INFO L93 Difference]: Finished difference Result 272 states and 300 transitions. [2024-11-20 14:42:00,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 14:42:00,989 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 25 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2024-11-20 14:42:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:42:00,989 INFO L225 Difference]: With dead ends: 272 [2024-11-20 14:42:00,989 INFO L226 Difference]: Without dead ends: 270 [2024-11-20 14:42:00,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=151, Invalid=781, Unknown=2, NotChecked=58, Total=992 [2024-11-20 14:42:00,990 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 96 mSDsluCounter, 820 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 895 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:42:00,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 885 Invalid, 895 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 772 Invalid, 0 Unknown, 118 Unchecked, 11.3s Time] [2024-11-20 14:42:00,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-20 14:42:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 224. [2024-11-20 14:42:00,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 204 states have (on average 1.2205882352941178) internal successors, (249), 223 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:00,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 249 transitions. [2024-11-20 14:42:00,993 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 249 transitions. Word has length 34 [2024-11-20 14:42:00,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:42:00,994 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 249 transitions. [2024-11-20 14:42:00,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 3.9583333333333335) internal successors, (95), 25 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:42:00,994 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 249 transitions. [2024-11-20 14:42:00,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-20 14:42:00,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:42:00,994 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:42:01,007 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 14:42:01,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-20 14:42:01,195 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-20 14:42:01,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:42:01,196 INFO L85 PathProgramCache]: Analyzing trace with hash -338052388, now seen corresponding path program 1 times [2024-11-20 14:42:01,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:42:01,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145520990] [2024-11-20 14:42:01,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:01,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:42:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:04,577 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:42:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:42:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145520990] [2024-11-20 14:42:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [145520990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:42:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863611224] [2024-11-20 14:42:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:42:04,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:42:04,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:42:04,580 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) [2024-11-20 14:42:04,581 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 14:42:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:42:04,678 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-20 14:42:04,681 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:42:05,827 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:42:05,828 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:42:06,601 INFO L378 Elim1Store]: Elim1 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 15 treesize of output 11 [2024-11-20 14:42:06,686 INFO L378 Elim1Store]: Elim1 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 [2024-11-20 14:42:08,177 INFO L378 Elim1Store]: Elim1 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 11 [2024-11-20 14:42:08,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-20 14:42:09,100 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:42:09,101 INFO L378 Elim1Store]: Elim1 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 15 [2024-11-20 14:42:11,191 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:42:11,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:42:11,304 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 19 [2024-11-20 14:42:11,510 INFO L349 Elim1Store]: treesize reduction 12, result has 50.0 percent of original size [2024-11-20 14:42:11,511 INFO L378 Elim1Store]: Elim1 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 29 treesize of output 19