./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 20:58:33,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 20:58:33,197 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 20:58:33,205 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 20:58:33,205 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 20:58:33,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 20:58:33,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 20:58:33,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 20:58:33,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 20:58:33,241 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 20:58:33,241 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 20:58:33,241 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 20:58:33,242 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 20:58:33,242 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 20:58:33,242 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 20:58:33,242 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 20:58:33,243 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 20:58:33,243 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 20:58:33,243 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 20:58:33,244 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 20:58:33,247 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 20:58:33,248 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 20:58:33,249 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 20:58:33,249 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 20:58:33,249 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 20:58:33,249 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 20:58:33,249 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:58:33,249 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 20:58:33,250 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 20:58:33,250 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 20:58:33,250 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 20:58:33,250 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 20:58:33,250 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 20:58:33,250 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 20:58:33,254 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 20:58:33,254 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 -> ee90c95792b81649f087e170ece38fbab8d5281ca8435570782565b7b775a87f [2024-11-22 20:58:33,444 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 20:58:33,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 20:58:33,479 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 20:58:33,479 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 20:58:33,483 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 20:58:33,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i [2024-11-22 20:58:34,825 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 20:58:35,074 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 20:58:35,075 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_nondet_test4-1.i [2024-11-22 20:58:35,087 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1bb1b6c4/1e4bc0bc5ff54b789b291394a5d25c34/FLAGda6516e46 [2024-11-22 20:58:35,388 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c1bb1b6c4/1e4bc0bc5ff54b789b291394a5d25c34 [2024-11-22 20:58:35,390 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 20:58:35,391 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 20:58:35,392 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 20:58:35,392 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 20:58:35,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 20:58:35,396 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:35" (1/1) ... [2024-11-22 20:58:35,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a9bc31b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:35, skipping insertion in model container [2024-11-22 20:58:35,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 08:58:35" (1/1) ... [2024-11-22 20:58:35,435 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 20:58:35,765 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-22 20:58:35,798 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-22 20:58:35,803 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-22 20:58:35,808 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-22 20:58:35,815 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-22 20:58:35,853 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-22 20:58:35,855 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-22 20:58:35,860 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-22 20:58:35,865 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-22 20:58:35,877 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-22 20:58:35,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:58:35,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 20:58:35,999 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 20:58:36,035 INFO L204 MainTranslator]: Completed translation [2024-11-22 20:58:36,036 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36 WrapperNode [2024-11-22 20:58:36,036 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 20:58:36,037 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 20:58:36,037 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 20:58:36,037 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 20:58:36,043 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,067 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,119 INFO L138 Inliner]: procedures = 176, calls = 326, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1563 [2024-11-22 20:58:36,120 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 20:58:36,121 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 20:58:36,121 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 20:58:36,121 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 20:58:36,130 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,149 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,217 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [2, 307]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 82 writes are split as follows [0, 82]. [2024-11-22 20:58:36,220 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,220 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,265 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,278 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,290 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,301 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 20:58:36,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 20:58:36,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 20:58:36,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 20:58:36,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (1/1) ... [2024-11-22 20:58:36,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 20:58:36,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:58:36,361 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-22 20:58:36,368 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-22 20:58:36,411 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 20:58:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 20:58:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 20:58:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 20:58:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-22 20:58:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-22 20:58:36,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-22 20:58:36,412 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-22 20:58:36,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 20:58:36,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 20:58:36,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 20:58:36,592 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 20:58:36,594 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 20:58:36,597 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:58:36,636 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-22 20:58:38,533 INFO L? ?]: Removed 1493 outVars from TransFormulas that were not future-live. [2024-11-22 20:58:38,533 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 20:58:38,561 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 20:58:38,561 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-22 20:58:38,562 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:58:38 BoogieIcfgContainer [2024-11-22 20:58:38,562 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 20:58:38,563 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 20:58:38,563 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 20:58:38,566 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 20:58:38,566 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 08:58:35" (1/3) ... [2024-11-22 20:58:38,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61636bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:58:38, skipping insertion in model container [2024-11-22 20:58:38,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 08:58:36" (2/3) ... [2024-11-22 20:58:38,567 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@61636bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 08:58:38, skipping insertion in model container [2024-11-22 20:58:38,567 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 08:58:38" (3/3) ... [2024-11-22 20:58:38,568 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_nondet_test4-1.i [2024-11-22 20:58:38,580 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 20:58:38,581 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-22 20:58:38,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 20:58:38,638 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;@69878082, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 20:58:38,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-22 20:58:38,646 INFO L276 IsEmpty]: Start isEmpty. Operand has 1432 states, 802 states have (on average 2.0773067331670823) internal successors, (1666), 1424 states have internal predecessors, (1666), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 20:58:38,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-22 20:58:38,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:38,652 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-22 20:58:38,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr627ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:38,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:38,657 INFO L85 PathProgramCache]: Analyzing trace with hash 1482245, now seen corresponding path program 1 times [2024-11-22 20:58:38,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:38,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225007270] [2024-11-22 20:58:38,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:38,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:38,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:38,913 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-22 20:58:38,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:38,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225007270] [2024-11-22 20:58:38,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225007270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:38,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:38,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:58:38,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522510665] [2024-11-22 20:58:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:38,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:38,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:38,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:38,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:38,941 INFO L87 Difference]: Start difference. First operand has 1432 states, 802 states have (on average 2.0773067331670823) internal successors, (1666), 1424 states have internal predecessors, (1666), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:39,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:39,522 INFO L93 Difference]: Finished difference Result 1437 states and 1617 transitions. [2024-11-22 20:58:39,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:39,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-22 20:58:39,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:39,540 INFO L225 Difference]: With dead ends: 1437 [2024-11-22 20:58:39,540 INFO L226 Difference]: Without dead ends: 1433 [2024-11-22 20:58:39,541 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-22 20:58:39,544 INFO L432 NwaCegarLoop]: 1582 mSDtfsCounter, 26 mSDsluCounter, 968 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 2550 SdHoareTripleChecker+Invalid, 627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:39,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 2550 Invalid, 627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-22 20:58:39,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1433 states. [2024-11-22 20:58:39,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1433 to 1424. [2024-11-22 20:58:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1424 states, 805 states have (on average 1.9838509316770185) internal successors, (1597), 1416 states have internal predecessors, (1597), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 20:58:39,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1424 states to 1424 states and 1609 transitions. [2024-11-22 20:58:39,611 INFO L78 Accepts]: Start accepts. Automaton has 1424 states and 1609 transitions. Word has length 4 [2024-11-22 20:58:39,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:39,611 INFO L471 AbstractCegarLoop]: Abstraction has 1424 states and 1609 transitions. [2024-11-22 20:58:39,611 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:39,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1424 states and 1609 transitions. [2024-11-22 20:58:39,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 20:58:39,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:39,612 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 20:58:39,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 20:58:39,612 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:39,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:39,613 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076526, now seen corresponding path program 1 times [2024-11-22 20:58:39,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:39,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980711300] [2024-11-22 20:58:39,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:39,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:39,669 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-22 20:58:39,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:39,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980711300] [2024-11-22 20:58:39,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980711300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:39,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:39,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:58:39,670 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45672570] [2024-11-22 20:58:39,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:39,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:39,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:39,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:39,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:39,672 INFO L87 Difference]: Start difference. First operand 1424 states and 1609 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:40,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:40,327 INFO L93 Difference]: Finished difference Result 1330 states and 1513 transitions. [2024-11-22 20:58:40,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:40,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 20:58:40,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:40,331 INFO L225 Difference]: With dead ends: 1330 [2024-11-22 20:58:40,331 INFO L226 Difference]: Without dead ends: 1330 [2024-11-22 20:58:40,331 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-22 20:58:40,332 INFO L432 NwaCegarLoop]: 882 mSDtfsCounter, 1353 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 732 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1359 SdHoareTripleChecker+Valid, 889 SdHoareTripleChecker+Invalid, 834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 732 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:40,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1359 Valid, 889 Invalid, 834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 732 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 20:58:40,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1330 states. [2024-11-22 20:58:40,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1330 to 1330. [2024-11-22 20:58:40,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1330 states, 805 states have (on average 1.8645962732919255) internal successors, (1501), 1322 states have internal predecessors, (1501), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 20:58:40,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1513 transitions. [2024-11-22 20:58:40,392 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1513 transitions. Word has length 6 [2024-11-22 20:58:40,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:40,392 INFO L471 AbstractCegarLoop]: Abstraction has 1330 states and 1513 transitions. [2024-11-22 20:58:40,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:40,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1513 transitions. [2024-11-22 20:58:40,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-22 20:58:40,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:40,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-22 20:58:40,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 20:58:40,393 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:40,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:40,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1422076527, now seen corresponding path program 1 times [2024-11-22 20:58:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138097859] [2024-11-22 20:58:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:40,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:40,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:40,569 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-22 20:58:40,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:40,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138097859] [2024-11-22 20:58:40,570 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138097859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:40,570 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:40,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 20:58:40,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413936958] [2024-11-22 20:58:40,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:40,571 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:40,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:40,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:40,572 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:40,572 INFO L87 Difference]: Start difference. First operand 1330 states and 1513 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:41,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:41,323 INFO L93 Difference]: Finished difference Result 1746 states and 2007 transitions. [2024-11-22 20:58:41,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:41,324 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-22 20:58:41,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:41,328 INFO L225 Difference]: With dead ends: 1746 [2024-11-22 20:58:41,329 INFO L226 Difference]: Without dead ends: 1746 [2024-11-22 20:58:41,329 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-22 20:58:41,330 INFO L432 NwaCegarLoop]: 1248 mSDtfsCounter, 820 mSDsluCounter, 623 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1871 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:41,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1871 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 20:58:41,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2024-11-22 20:58:41,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1593. [2024-11-22 20:58:41,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1593 states, 1078 states have (on average 1.8320964749536177) internal successors, (1975), 1585 states have internal predecessors, (1975), 6 states have call successors, (6), 1 states have call predecessors, (6), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-22 20:58:41,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1593 states to 1593 states and 1987 transitions. [2024-11-22 20:58:41,386 INFO L78 Accepts]: Start accepts. Automaton has 1593 states and 1987 transitions. Word has length 6 [2024-11-22 20:58:41,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:41,386 INFO L471 AbstractCegarLoop]: Abstraction has 1593 states and 1987 transitions. [2024-11-22 20:58:41,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:41,387 INFO L276 IsEmpty]: Start isEmpty. Operand 1593 states and 1987 transitions. [2024-11-22 20:58:41,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-22 20:58:41,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:41,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:41,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 20:58:41,387 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:41,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:41,388 INFO L85 PathProgramCache]: Analyzing trace with hash 1137087712, now seen corresponding path program 1 times [2024-11-22 20:58:41,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:41,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215782489] [2024-11-22 20:58:41,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:41,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:41,465 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-22 20:58:41,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:41,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215782489] [2024-11-22 20:58:41,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215782489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:41,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:41,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:41,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894120595] [2024-11-22 20:58:41,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:41,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:41,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:41,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:41,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:41,466 INFO L87 Difference]: Start difference. First operand 1593 states and 1987 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:41,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:41,720 INFO L93 Difference]: Finished difference Result 2646 states and 3337 transitions. [2024-11-22 20:58:41,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:41,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-22 20:58:41,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:41,728 INFO L225 Difference]: With dead ends: 2646 [2024-11-22 20:58:41,728 INFO L226 Difference]: Without dead ends: 2644 [2024-11-22 20:58:41,728 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:41,729 INFO L432 NwaCegarLoop]: 1481 mSDtfsCounter, 997 mSDsluCounter, 2727 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1000 SdHoareTripleChecker+Valid, 4208 SdHoareTripleChecker+Invalid, 240 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:41,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1000 Valid, 4208 Invalid, 240 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 20:58:41,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2644 states. [2024-11-22 20:58:41,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2644 to 2345. [2024-11-22 20:58:41,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2345 states, 1830 states have (on average 1.812568306010929) internal successors, (3317), 2334 states have internal predecessors, (3317), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:41,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2345 states to 2345 states and 3335 transitions. [2024-11-22 20:58:41,813 INFO L78 Accepts]: Start accepts. Automaton has 2345 states and 3335 transitions. Word has length 7 [2024-11-22 20:58:41,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:41,814 INFO L471 AbstractCegarLoop]: Abstraction has 2345 states and 3335 transitions. [2024-11-22 20:58:41,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:41,814 INFO L276 IsEmpty]: Start isEmpty. Operand 2345 states and 3335 transitions. [2024-11-22 20:58:41,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 20:58:41,814 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:41,815 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:41,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 20:58:41,815 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:41,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:41,816 INFO L85 PathProgramCache]: Analyzing trace with hash 242137368, now seen corresponding path program 1 times [2024-11-22 20:58:41,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:41,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324511323] [2024-11-22 20:58:41,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:41,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:41,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:41,879 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-22 20:58:41,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:41,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324511323] [2024-11-22 20:58:41,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324511323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:41,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:41,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:41,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891632361] [2024-11-22 20:58:41,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:41,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:41,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:41,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:41,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:41,881 INFO L87 Difference]: Start difference. First operand 2345 states and 3335 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:42,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:42,636 INFO L93 Difference]: Finished difference Result 2420 states and 3441 transitions. [2024-11-22 20:58:42,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:42,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 20:58:42,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:42,643 INFO L225 Difference]: With dead ends: 2420 [2024-11-22 20:58:42,643 INFO L226 Difference]: Without dead ends: 2420 [2024-11-22 20:58:42,643 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-22 20:58:42,644 INFO L432 NwaCegarLoop]: 856 mSDtfsCounter, 1621 mSDsluCounter, 716 mSDsCounter, 0 mSdLazyCounter, 1317 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1627 SdHoareTripleChecker+Valid, 1572 SdHoareTripleChecker+Invalid, 1350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:42,644 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1627 Valid, 1572 Invalid, 1350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1317 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 20:58:42,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2420 states. [2024-11-22 20:58:42,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2420 to 2322. [2024-11-22 20:58:42,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2322 states, 1830 states have (on average 1.787431693989071) internal successors, (3271), 2311 states have internal predecessors, (3271), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:42,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2322 states to 2322 states and 3289 transitions. [2024-11-22 20:58:42,670 INFO L78 Accepts]: Start accepts. Automaton has 2322 states and 3289 transitions. Word has length 12 [2024-11-22 20:58:42,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:42,670 INFO L471 AbstractCegarLoop]: Abstraction has 2322 states and 3289 transitions. [2024-11-22 20:58:42,670 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 2322 states and 3289 transitions. [2024-11-22 20:58:42,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-22 20:58:42,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:42,671 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:42,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-22 20:58:42,671 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:42,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:42,671 INFO L85 PathProgramCache]: Analyzing trace with hash 242137369, now seen corresponding path program 1 times [2024-11-22 20:58:42,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:42,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555864348] [2024-11-22 20:58:42,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:42,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:42,714 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-22 20:58:42,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:42,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555864348] [2024-11-22 20:58:42,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555864348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:42,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:42,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:42,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942466798] [2024-11-22 20:58:42,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:42,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:42,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:42,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:42,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:42,716 INFO L87 Difference]: Start difference. First operand 2322 states and 3289 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:42,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:42,740 INFO L93 Difference]: Finished difference Result 2184 states and 3083 transitions. [2024-11-22 20:58:42,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:42,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-22 20:58:42,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:42,745 INFO L225 Difference]: With dead ends: 2184 [2024-11-22 20:58:42,745 INFO L226 Difference]: Without dead ends: 2184 [2024-11-22 20:58:42,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:42,746 INFO L432 NwaCegarLoop]: 1345 mSDtfsCounter, 61 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2637 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:42,746 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2637 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2184 states. [2024-11-22 20:58:42,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2184 to 2184. [2024-11-22 20:58:42,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2184 states, 1704 states have (on average 1.7987089201877935) internal successors, (3065), 2173 states have internal predecessors, (3065), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:42,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2184 states to 2184 states and 3083 transitions. [2024-11-22 20:58:42,770 INFO L78 Accepts]: Start accepts. Automaton has 2184 states and 3083 transitions. Word has length 12 [2024-11-22 20:58:42,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:42,770 INFO L471 AbstractCegarLoop]: Abstraction has 2184 states and 3083 transitions. [2024-11-22 20:58:42,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:42,770 INFO L276 IsEmpty]: Start isEmpty. Operand 2184 states and 3083 transitions. [2024-11-22 20:58:42,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-22 20:58:42,771 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:42,771 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:42,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 20:58:42,771 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:42,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:42,771 INFO L85 PathProgramCache]: Analyzing trace with hash 765933813, now seen corresponding path program 1 times [2024-11-22 20:58:42,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:42,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051120936] [2024-11-22 20:58:42,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:42,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:42,882 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-22 20:58:42,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:42,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051120936] [2024-11-22 20:58:42,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051120936] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:42,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:42,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:42,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517304432] [2024-11-22 20:58:42,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:42,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:42,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:42,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:42,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:42,884 INFO L87 Difference]: Start difference. First operand 2184 states and 3083 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-22 20:58:42,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:42,943 INFO L93 Difference]: Finished difference Result 2155 states and 3033 transitions. [2024-11-22 20:58:42,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:42,944 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-22 20:58:42,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:42,949 INFO L225 Difference]: With dead ends: 2155 [2024-11-22 20:58:42,949 INFO L226 Difference]: Without dead ends: 2155 [2024-11-22 20:58:42,950 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:58:42,950 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 41 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3902 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:42,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3902 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:42,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2155 states. [2024-11-22 20:58:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2155 to 2149. [2024-11-22 20:58:42,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2149 states, 1676 states have (on average 1.795346062052506) internal successors, (3009), 2138 states have internal predecessors, (3009), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:42,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2149 states to 2149 states and 3027 transitions. [2024-11-22 20:58:42,984 INFO L78 Accepts]: Start accepts. Automaton has 2149 states and 3027 transitions. Word has length 14 [2024-11-22 20:58:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:42,985 INFO L471 AbstractCegarLoop]: Abstraction has 2149 states and 3027 transitions. [2024-11-22 20:58:42,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 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-22 20:58:42,985 INFO L276 IsEmpty]: Start isEmpty. Operand 2149 states and 3027 transitions. [2024-11-22 20:58:42,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-22 20:58:42,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:42,986 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-22 20:58:42,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 20:58:42,986 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:42,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1739624061, now seen corresponding path program 1 times [2024-11-22 20:58:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:42,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026526536] [2024-11-22 20:58:42,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:42,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:43,132 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-22 20:58:43,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:43,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026526536] [2024-11-22 20:58:43,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026526536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:43,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:43,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323563918] [2024-11-22 20:58:43,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:43,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:43,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:43,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:43,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:43,134 INFO L87 Difference]: Start difference. First operand 2149 states and 3027 transitions. Second operand has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-22 20:58:44,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:44,026 INFO L93 Difference]: Finished difference Result 2398 states and 3195 transitions. [2024-11-22 20:58:44,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 20:58:44,027 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-22 20:58:44,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:44,033 INFO L225 Difference]: With dead ends: 2398 [2024-11-22 20:58:44,033 INFO L226 Difference]: Without dead ends: 2398 [2024-11-22 20:58:44,033 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-22 20:58:44,033 INFO L432 NwaCegarLoop]: 1223 mSDtfsCounter, 825 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2627 SdHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:44,034 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2627 Invalid, 1342 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 20:58:44,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2398 states. [2024-11-22 20:58:44,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2398 to 2145. [2024-11-22 20:58:44,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1676 states have (on average 1.7905727923627686) internal successors, (3001), 2134 states have internal predecessors, (3001), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:44,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3019 transitions. [2024-11-22 20:58:44,060 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3019 transitions. Word has length 28 [2024-11-22 20:58:44,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:44,061 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3019 transitions. [2024-11-22 20:58:44,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.333333333333334) internal successors, (28), 4 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-22 20:58:44,061 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3019 transitions. [2024-11-22 20:58:44,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-22 20:58:44,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:44,066 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, 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-22 20:58:44,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-22 20:58:44,066 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:44,067 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:44,067 INFO L85 PathProgramCache]: Analyzing trace with hash 2099910807, now seen corresponding path program 1 times [2024-11-22 20:58:44,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:44,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844634831] [2024-11-22 20:58:44,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:44,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:44,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:44,151 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-22 20:58:44,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:44,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844634831] [2024-11-22 20:58:44,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844634831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:44,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:44,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:44,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1059732500] [2024-11-22 20:58:44,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:44,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 20:58:44,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:44,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 20:58:44,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 20:58:44,154 INFO L87 Difference]: Start difference. First operand 2145 states and 3019 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:44,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:44,222 INFO L93 Difference]: Finished difference Result 2145 states and 3011 transitions. [2024-11-22 20:58:44,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:58:44,223 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 62 [2024-11-22 20:58:44,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:44,228 INFO L225 Difference]: With dead ends: 2145 [2024-11-22 20:58:44,228 INFO L226 Difference]: Without dead ends: 2145 [2024-11-22 20:58:44,228 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:58:44,230 INFO L432 NwaCegarLoop]: 1305 mSDtfsCounter, 21 mSDsluCounter, 2579 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3884 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:44,230 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3884 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2145 states. [2024-11-22 20:58:44,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2145 to 2145. [2024-11-22 20:58:44,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2145 states, 1676 states have (on average 1.785799522673031) internal successors, (2993), 2134 states have internal predecessors, (2993), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:44,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3011 transitions. [2024-11-22 20:58:44,254 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3011 transitions. Word has length 62 [2024-11-22 20:58:44,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:44,255 INFO L471 AbstractCegarLoop]: Abstraction has 2145 states and 3011 transitions. [2024-11-22 20:58:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3011 transitions. [2024-11-22 20:58:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-11-22 20:58:44,259 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:44,259 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, 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, 1, 1, 1, 1] [2024-11-22 20:58:44,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 20:58:44,259 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:44,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:44,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1896484451, now seen corresponding path program 1 times [2024-11-22 20:58:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [337296712] [2024-11-22 20:58:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:44,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:44,368 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-22 20:58:44,368 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:44,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [337296712] [2024-11-22 20:58:44,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [337296712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:44,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:44,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 20:58:44,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275183270] [2024-11-22 20:58:44,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:44,369 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 20:58:44,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:44,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 20:58:44,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:44,370 INFO L87 Difference]: Start difference. First operand 2145 states and 3011 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-22 20:58:44,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:44,404 INFO L93 Difference]: Finished difference Result 1914 states and 2608 transitions. [2024-11-22 20:58:44,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 20:58:44,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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 70 [2024-11-22 20:58:44,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:44,410 INFO L225 Difference]: With dead ends: 1914 [2024-11-22 20:58:44,410 INFO L226 Difference]: Without dead ends: 1914 [2024-11-22 20:58:44,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 20:58:44,410 INFO L432 NwaCegarLoop]: 1320 mSDtfsCounter, 54 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2612 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:44,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2612 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 20:58:44,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1914 states. [2024-11-22 20:58:44,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1914 to 1914. [2024-11-22 20:58:44,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1445 states have (on average 1.792387543252595) internal successors, (2590), 1903 states have internal predecessors, (2590), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:44,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2608 transitions. [2024-11-22 20:58:44,432 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2608 transitions. Word has length 70 [2024-11-22 20:58:44,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:44,433 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2608 transitions. [2024-11-22 20:58:44,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 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-22 20:58:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2608 transitions. [2024-11-22 20:58:44,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 20:58:44,434 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:44,434 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, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:44,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 20:58:44,434 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:44,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:44,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2061322021, now seen corresponding path program 1 times [2024-11-22 20:58:44,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:44,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255923212] [2024-11-22 20:58:44,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:44,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:44,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:44,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-22 20:58:44,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:44,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255923212] [2024-11-22 20:58:44,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255923212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:44,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:44,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 20:58:44,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [47157952] [2024-11-22 20:58:44,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:44,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 20:58:44,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:44,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 20:58:44,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-22 20:58:44,819 INFO L87 Difference]: Start difference. First operand 1914 states and 2608 transitions. Second operand has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:45,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:45,965 INFO L93 Difference]: Finished difference Result 1830 states and 2483 transitions. [2024-11-22 20:58:45,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 20:58:45,966 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 73 [2024-11-22 20:58:45,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:45,970 INFO L225 Difference]: With dead ends: 1830 [2024-11-22 20:58:45,970 INFO L226 Difference]: Without dead ends: 1830 [2024-11-22 20:58:45,970 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-22 20:58:45,971 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 2256 mSDsluCounter, 1021 mSDsCounter, 0 mSdLazyCounter, 2023 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2262 SdHoareTripleChecker+Valid, 1594 SdHoareTripleChecker+Invalid, 2127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 2023 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:45,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2262 Valid, 1594 Invalid, 2127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 2023 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 20:58:45,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1830 states. [2024-11-22 20:58:45,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1830 to 1557. [2024-11-22 20:58:45,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1557 states, 1172 states have (on average 1.6902730375426622) internal successors, (1981), 1546 states have internal predecessors, (1981), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:45,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1557 states to 1557 states and 1999 transitions. [2024-11-22 20:58:45,988 INFO L78 Accepts]: Start accepts. Automaton has 1557 states and 1999 transitions. Word has length 73 [2024-11-22 20:58:45,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:45,988 INFO L471 AbstractCegarLoop]: Abstraction has 1557 states and 1999 transitions. [2024-11-22 20:58:45,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.166666666666666) internal successors, (73), 7 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-22 20:58:45,988 INFO L276 IsEmpty]: Start isEmpty. Operand 1557 states and 1999 transitions. [2024-11-22 20:58:45,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 20:58:45,989 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:45,989 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:45,989 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 20:58:45,989 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:45,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:45,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1316131126, now seen corresponding path program 1 times [2024-11-22 20:58:45,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:45,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239647418] [2024-11-22 20:58:45,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:45,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:46,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:46,160 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-22 20:58:46,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:46,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239647418] [2024-11-22 20:58:46,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239647418] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:46,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:46,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:46,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104925158] [2024-11-22 20:58:46,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:46,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:58:46,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:46,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:58:46,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:58:46,161 INFO L87 Difference]: Start difference. First operand 1557 states and 1999 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 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-22 20:58:46,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:46,910 INFO L93 Difference]: Finished difference Result 1556 states and 1997 transitions. [2024-11-22 20:58:46,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:58:46,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 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 78 [2024-11-22 20:58:46,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:46,914 INFO L225 Difference]: With dead ends: 1556 [2024-11-22 20:58:46,914 INFO L226 Difference]: Without dead ends: 1556 [2024-11-22 20:58:46,914 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-22 20:58:46,915 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 2 mSDsluCounter, 2236 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 1468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:46,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3468 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-22 20:58:46,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-11-22 20:58:46,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2024-11-22 20:58:46,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1172 states have (on average 1.6885665529010239) internal successors, (1979), 1545 states have internal predecessors, (1979), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:46,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1997 transitions. [2024-11-22 20:58:46,930 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1997 transitions. Word has length 78 [2024-11-22 20:58:46,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:46,930 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1997 transitions. [2024-11-22 20:58:46,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 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-22 20:58:46,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1997 transitions. [2024-11-22 20:58:46,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 20:58:46,931 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:46,931 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:46,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 20:58:46,931 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:46,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:46,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1316131127, now seen corresponding path program 1 times [2024-11-22 20:58:46,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:46,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73680023] [2024-11-22 20:58:46,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:46,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:46,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:47,218 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-22 20:58:47,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:47,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73680023] [2024-11-22 20:58:47,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73680023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:47,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:47,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 20:58:47,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63247677] [2024-11-22 20:58:47,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:47,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 20:58:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:47,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 20:58:47,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 20:58:47,223 INFO L87 Difference]: Start difference. First operand 1556 states and 1997 transitions. Second operand has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 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-22 20:58:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:48,070 INFO L93 Difference]: Finished difference Result 1555 states and 1995 transitions. [2024-11-22 20:58:48,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:58:48,071 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 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 78 [2024-11-22 20:58:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:48,075 INFO L225 Difference]: With dead ends: 1555 [2024-11-22 20:58:48,075 INFO L226 Difference]: Without dead ends: 1555 [2024-11-22 20:58:48,075 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-22 20:58:48,076 INFO L432 NwaCegarLoop]: 1232 mSDtfsCounter, 1 mSDsluCounter, 2251 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3483 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:48,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3483 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 20:58:48,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1555 states. [2024-11-22 20:58:48,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1555 to 1555. [2024-11-22 20:58:48,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1555 states, 1170 states have (on average 1.6897435897435897) internal successors, (1977), 1544 states have internal predecessors, (1977), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:48,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1555 states to 1555 states and 1995 transitions. [2024-11-22 20:58:48,092 INFO L78 Accepts]: Start accepts. Automaton has 1555 states and 1995 transitions. Word has length 78 [2024-11-22 20:58:48,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:48,092 INFO L471 AbstractCegarLoop]: Abstraction has 1555 states and 1995 transitions. [2024-11-22 20:58:48,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.5) internal successors, (78), 5 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-22 20:58:48,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1555 states and 1995 transitions. [2024-11-22 20:58:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 20:58:48,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:48,093 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 20:58:48,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1591552707, now seen corresponding path program 1 times [2024-11-22 20:58:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660530276] [2024-11-22 20:58:48,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:48,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:48,265 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-22 20:58:48,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:48,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660530276] [2024-11-22 20:58:48,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660530276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:48,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:48,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 20:58:48,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22888963] [2024-11-22 20:58:48,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:48,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 20:58:48,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:48,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 20:58:48,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-22 20:58:48,267 INFO L87 Difference]: Start difference. First operand 1555 states and 1995 transitions. Second operand has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:58:49,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:49,455 INFO L93 Difference]: Finished difference Result 1573 states and 2025 transitions. [2024-11-22 20:58:49,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-22 20:58:49,456 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-22 20:58:49,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:49,461 INFO L225 Difference]: With dead ends: 1573 [2024-11-22 20:58:49,461 INFO L226 Difference]: Without dead ends: 1573 [2024-11-22 20:58:49,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-22 20:58:49,461 INFO L432 NwaCegarLoop]: 1221 mSDtfsCounter, 6 mSDsluCounter, 4248 mSDsCounter, 0 mSdLazyCounter, 1930 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 5469 SdHoareTripleChecker+Invalid, 1937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:49,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 5469 Invalid, 1937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1930 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-22 20:58:49,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2024-11-22 20:58:49,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1564. [2024-11-22 20:58:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1178 states have (on average 1.6876061120543293) internal successors, (1988), 1551 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-22 20:58:49,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2015 transitions. [2024-11-22 20:58:49,482 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2015 transitions. Word has length 86 [2024-11-22 20:58:49,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:49,483 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2015 transitions. [2024-11-22 20:58:49,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:58:49,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2015 transitions. [2024-11-22 20:58:49,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-22 20:58:49,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:49,484 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:49,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 20:58:49,484 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:49,484 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:49,484 INFO L85 PathProgramCache]: Analyzing trace with hash -1591552706, now seen corresponding path program 1 times [2024-11-22 20:58:49,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:49,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325857706] [2024-11-22 20:58:49,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:49,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:49,872 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-22 20:58:49,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:49,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325857706] [2024-11-22 20:58:49,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325857706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:49,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:49,873 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 20:58:49,873 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199542772] [2024-11-22 20:58:49,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:49,873 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 20:58:49,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:49,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 20:58:49,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 20:58:49,874 INFO L87 Difference]: Start difference. First operand 1564 states and 2015 transitions. Second operand has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:58:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:50,832 INFO L93 Difference]: Finished difference Result 1564 states and 2013 transitions. [2024-11-22 20:58:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 20:58:50,832 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 86 [2024-11-22 20:58:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:50,836 INFO L225 Difference]: With dead ends: 1564 [2024-11-22 20:58:50,836 INFO L226 Difference]: Without dead ends: 1564 [2024-11-22 20:58:50,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-22 20:58:50,836 INFO L432 NwaCegarLoop]: 1228 mSDtfsCounter, 1 mSDsluCounter, 3270 mSDsCounter, 0 mSdLazyCounter, 1663 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 4498 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:50,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 4498 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1663 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-22 20:58:50,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2024-11-22 20:58:50,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1564. [2024-11-22 20:58:50,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 1178 states have (on average 1.6859083191850595) internal successors, (1986), 1551 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-22 20:58:50,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 2013 transitions. [2024-11-22 20:58:50,852 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 2013 transitions. Word has length 86 [2024-11-22 20:58:50,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:50,852 INFO L471 AbstractCegarLoop]: Abstraction has 1564 states and 2013 transitions. [2024-11-22 20:58:50,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 16.8) internal successors, (84), 6 states have internal predecessors, (84), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:58:50,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 2013 transitions. [2024-11-22 20:58:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 20:58:50,853 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:50,853 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:50,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 20:58:50,853 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:50,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:50,854 INFO L85 PathProgramCache]: Analyzing trace with hash -1899019630, now seen corresponding path program 1 times [2024-11-22 20:58:50,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:50,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1509440972] [2024-11-22 20:58:50,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:50,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:51,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:58:51,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:51,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1509440972] [2024-11-22 20:58:51,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1509440972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:58:51,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116017280] [2024-11-22 20:58:51,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:51,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:58:51,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:58:51,415 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-22 20:58:51,417 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-22 20:58:51,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:51,577 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 20:58:51,582 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:51,605 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-22 20:58:51,712 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:58:51,713 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-22 20:58:51,724 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-22 20:58:51,775 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:58:51,776 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-22 20:58:51,825 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-22 20:58:51,827 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:58:51,827 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:58:51,864 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2024-11-22 20:58:51,864 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-22 20:58:51,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116017280] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:58:51,898 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:58:51,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 13 [2024-11-22 20:58:51,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956115456] [2024-11-22 20:58:51,899 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:58:51,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 20:58:51,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:51,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 20:58:51,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=171, Unknown=4, NotChecked=0, Total=210 [2024-11-22 20:58:51,902 INFO L87 Difference]: Start difference. First operand 1564 states and 2013 transitions. Second operand has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:58:53,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:53,867 INFO L93 Difference]: Finished difference Result 1563 states and 2011 transitions. [2024-11-22 20:58:53,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 20:58:53,868 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 87 [2024-11-22 20:58:53,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:53,873 INFO L225 Difference]: With dead ends: 1563 [2024-11-22 20:58:53,876 INFO L226 Difference]: Without dead ends: 1563 [2024-11-22 20:58:53,876 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=374, Unknown=4, NotChecked=0, Total=462 [2024-11-22 20:58:53,877 INFO L432 NwaCegarLoop]: 748 mSDtfsCounter, 1151 mSDsluCounter, 5832 mSDsCounter, 0 mSdLazyCounter, 4504 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1161 SdHoareTripleChecker+Valid, 6580 SdHoareTripleChecker+Invalid, 4525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:53,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1161 Valid, 6580 Invalid, 4525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4504 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 20:58:53,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1563 states. [2024-11-22 20:58:53,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1563 to 1563. [2024-11-22 20:58:53,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1563 states, 1178 states have (on average 1.6842105263157894) internal successors, (1984), 1550 states have internal predecessors, (1984), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-22 20:58:53,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1563 states to 1563 states and 2011 transitions. [2024-11-22 20:58:53,898 INFO L78 Accepts]: Start accepts. Automaton has 1563 states and 2011 transitions. Word has length 87 [2024-11-22 20:58:53,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:53,898 INFO L471 AbstractCegarLoop]: Abstraction has 1563 states and 2011 transitions. [2024-11-22 20:58:53,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 10.333333333333334) internal successors, (124), 13 states have internal predecessors, (124), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:58:53,898 INFO L276 IsEmpty]: Start isEmpty. Operand 1563 states and 2011 transitions. [2024-11-22 20:58:53,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-22 20:58:53,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:53,899 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 20:58:53,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 20:58:54,103 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,SelfDestructingSolverStorable15 [2024-11-22 20:58:54,105 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:54,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:54,106 INFO L85 PathProgramCache]: Analyzing trace with hash -1899019629, now seen corresponding path program 1 times [2024-11-22 20:58:54,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:54,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771748108] [2024-11-22 20:58:54,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:54,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:54,605 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:58:54,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771748108] [2024-11-22 20:58:54,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771748108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:58:54,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1287369887] [2024-11-22 20:58:54,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:54,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:58:54,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:58:54,608 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-22 20:58:54,609 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-22 20:58:54,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:54,762 INFO L255 TraceCheckSpWp]: Trace formula consists of 404 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-22 20:58:54,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:58:54,772 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-22 20:58:54,853 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:58:54,854 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-22 20:58:54,874 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 19 treesize of output 1 [2024-11-22 20:58:54,876 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-22 20:58:55,001 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:58:55,002 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 70 treesize of output 65 [2024-11-22 20:58:55,006 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 49 treesize of output 30 [2024-11-22 20:58:55,079 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 39 treesize of output 21 [2024-11-22 20:58:55,091 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 32 treesize of output 14 [2024-11-22 20:58:55,119 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:58:55,119 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:58:55,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 20:58:55,221 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 48 treesize of output 52 [2024-11-22 20:58:55,254 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_prenex_1 (Array Int Int))) (<= 0 (+ 16 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_prenex_1) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_629 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_629) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (forall ((v_ArrVal_630 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_630) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) (+ |c_ULTIMATE.start_main_#t~mem50#1.offset| 25))))) is different from false [2024-11-22 20:58:55,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1287369887] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:58:55,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:58:55,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-22 20:58:55,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721456343] [2024-11-22 20:58:55,256 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:58:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 20:58:55,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:55,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 20:58:55,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2024-11-22 20:58:55,257 INFO L87 Difference]: Start difference. First operand 1563 states and 2011 transitions. Second operand has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:58:58,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:58:58,435 INFO L93 Difference]: Finished difference Result 1562 states and 2009 transitions. [2024-11-22 20:58:58,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 20:58:58,436 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 87 [2024-11-22 20:58:58,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:58:58,438 INFO L225 Difference]: With dead ends: 1562 [2024-11-22 20:58:58,438 INFO L226 Difference]: Without dead ends: 1562 [2024-11-22 20:58:58,439 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=98, Invalid=505, Unknown=1, NotChecked=46, Total=650 [2024-11-22 20:58:58,439 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1147 mSDsluCounter, 6392 mSDsCounter, 0 mSdLazyCounter, 6398 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 7139 SdHoareTripleChecker+Invalid, 6427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:58:58,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 7139 Invalid, 6427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6398 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-22 20:58:58,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2024-11-22 20:58:58,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1553. [2024-11-22 20:58:58,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1553 states, 1170 states have (on average 1.6863247863247863) internal successors, (1973), 1542 states have internal predecessors, (1973), 9 states have call successors, (9), 1 states have call predecessors, (9), 1 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:58:58,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 1991 transitions. [2024-11-22 20:58:58,451 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 1991 transitions. Word has length 87 [2024-11-22 20:58:58,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:58:58,451 INFO L471 AbstractCegarLoop]: Abstraction has 1553 states and 1991 transitions. [2024-11-22 20:58:58,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 8.5) internal successors, (136), 19 states have internal predecessors, (136), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:58:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 1991 transitions. [2024-11-22 20:58:58,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 20:58:58,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:58:58,452 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, 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, 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-22 20:58:58,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 20:58:58,654 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,SelfDestructingSolverStorable16 [2024-11-22 20:58:58,655 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:58:58,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:58:58,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1802103956, now seen corresponding path program 1 times [2024-11-22 20:58:58,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:58:58,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407137376] [2024-11-22 20:58:58,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:58:58,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:58:58,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:58:59,005 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-22 20:58:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:58:59,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407137376] [2024-11-22 20:58:59,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407137376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:58:59,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:58:59,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-22 20:58:59,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24256174] [2024-11-22 20:58:59,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:58:59,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 20:58:59,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:58:59,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 20:58:59,007 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-11-22 20:58:59,007 INFO L87 Difference]: Start difference. First operand 1553 states and 1991 transitions. Second operand has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:00,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:00,927 INFO L93 Difference]: Finished difference Result 1569 states and 2017 transitions. [2024-11-22 20:59:00,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 20:59:00,928 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-22 20:59:00,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:00,930 INFO L225 Difference]: With dead ends: 1569 [2024-11-22 20:59:00,930 INFO L226 Difference]: Without dead ends: 1569 [2024-11-22 20:59:00,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=339, Unknown=0, NotChecked=0, Total=420 [2024-11-22 20:59:00,931 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1178 mSDsluCounter, 5796 mSDsCounter, 0 mSdLazyCounter, 4503 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 6543 SdHoareTripleChecker+Invalid, 4524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 4503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:00,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 6543 Invalid, 4524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 4503 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 20:59:00,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1569 states. [2024-11-22 20:59:00,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1569 to 1568. [2024-11-22 20:59:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1184 states have (on average 1.6807432432432432) internal successors, (1990), 1555 states have internal predecessors, (1990), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-22 20:59:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2017 transitions. [2024-11-22 20:59:00,943 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2017 transitions. Word has length 89 [2024-11-22 20:59:00,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:00,943 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2017 transitions. [2024-11-22 20:59:00,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.25) internal successors, (87), 13 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:00,944 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2017 transitions. [2024-11-22 20:59:00,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-22 20:59:00,944 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:00,944 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, 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, 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-22 20:59:00,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-22 20:59:00,945 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:00,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:00,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1802103955, now seen corresponding path program 1 times [2024-11-22 20:59:00,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:00,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [355956846] [2024-11-22 20:59:00,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:00,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:00,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:01,484 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-22 20:59:01,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:01,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [355956846] [2024-11-22 20:59:01,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [355956846] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:59:01,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:59:01,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-22 20:59:01,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089830813] [2024-11-22 20:59:01,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:59:01,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 20:59:01,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:01,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 20:59:01,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-22 20:59:01,487 INFO L87 Difference]: Start difference. First operand 1568 states and 2017 transitions. Second operand has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:03,615 INFO L93 Difference]: Finished difference Result 1568 states and 2015 transitions. [2024-11-22 20:59:03,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 20:59:03,615 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 89 [2024-11-22 20:59:03,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:03,618 INFO L225 Difference]: With dead ends: 1568 [2024-11-22 20:59:03,618 INFO L226 Difference]: Without dead ends: 1568 [2024-11-22 20:59:03,618 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2024-11-22 20:59:03,618 INFO L432 NwaCegarLoop]: 754 mSDtfsCounter, 1152 mSDsluCounter, 4208 mSDsCounter, 0 mSdLazyCounter, 4890 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 4962 SdHoareTripleChecker+Invalid, 4909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:03,618 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 4962 Invalid, 4909 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4890 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 20:59:03,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2024-11-22 20:59:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1568. [2024-11-22 20:59:03,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 1184 states have (on average 1.679054054054054) internal successors, (1988), 1555 states have internal predecessors, (1988), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-22 20:59:03,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 2015 transitions. [2024-11-22 20:59:03,639 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 2015 transitions. Word has length 89 [2024-11-22 20:59:03,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:03,640 INFO L471 AbstractCegarLoop]: Abstraction has 1568 states and 2015 transitions. [2024-11-22 20:59:03,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.7) internal successors, (87), 11 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:03,640 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 2015 transitions. [2024-11-22 20:59:03,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-22 20:59:03,640 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:03,641 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, 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, 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-22 20:59:03,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-22 20:59:03,641 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:03,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:03,641 INFO L85 PathProgramCache]: Analyzing trace with hash -383964681, now seen corresponding path program 1 times [2024-11-22 20:59:03,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:03,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917537533] [2024-11-22 20:59:03,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:03,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:04,128 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:04,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:04,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917537533] [2024-11-22 20:59:04,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917537533] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:04,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678801063] [2024-11-22 20:59:04,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:04,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:04,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:59:04,131 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-22 20:59:04,136 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-22 20:59:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:04,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-22 20:59:04,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:04,318 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-22 20:59:04,394 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:04,395 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-22 20:59:04,399 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-22 20:59:04,442 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:04,443 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-22 20:59:04,484 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:04,485 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-22 20:59:04,494 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-22 20:59:04,496 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:04,496 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:04,503 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 20:59:04,507 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_879) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-22 20:59:04,536 INFO L349 Elim1Store]: treesize reduction 5, result has 82.8 percent of original size [2024-11-22 20:59:04,536 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 33 treesize of output 32 [2024-11-22 20:59:04,541 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_879 (Array Int Int)) (v_ArrVal_882 (Array Int Int))) (= (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_882))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_879)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) |c_ULTIMATE.start_main_#t~mem50#1.base|)) is different from false [2024-11-22 20:59:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678801063] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:04,542 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:04,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 15 [2024-11-22 20:59:04,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666076621] [2024-11-22 20:59:04,542 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:04,543 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 20:59:04,543 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:04,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 20:59:04,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=202, Unknown=3, NotChecked=90, Total=342 [2024-11-22 20:59:04,544 INFO L87 Difference]: Start difference. First operand 1568 states and 2015 transitions. Second operand has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:06,337 INFO L93 Difference]: Finished difference Result 1567 states and 2013 transitions. [2024-11-22 20:59:06,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 20:59:06,337 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 90 [2024-11-22 20:59:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:06,339 INFO L225 Difference]: With dead ends: 1567 [2024-11-22 20:59:06,339 INFO L226 Difference]: Without dead ends: 1567 [2024-11-22 20:59:06,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 92 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=418, Unknown=3, NotChecked=132, Total=650 [2024-11-22 20:59:06,340 INFO L432 NwaCegarLoop]: 747 mSDtfsCounter, 1147 mSDsluCounter, 5818 mSDsCounter, 0 mSdLazyCounter, 4518 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1157 SdHoareTripleChecker+Valid, 6565 SdHoareTripleChecker+Invalid, 4538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:06,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1157 Valid, 6565 Invalid, 4538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4518 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-22 20:59:06,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-22 20:59:06,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1567. [2024-11-22 20:59:06,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1567 states, 1184 states have (on average 1.677364864864865) internal successors, (1986), 1554 states have internal predecessors, (1986), 9 states have call successors, (9), 1 states have call predecessors, (9), 2 states have return successors, (18), 11 states have call predecessors, (18), 9 states have call successors, (18) [2024-11-22 20:59:06,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1567 states to 1567 states and 2013 transitions. [2024-11-22 20:59:06,360 INFO L78 Accepts]: Start accepts. Automaton has 1567 states and 2013 transitions. Word has length 90 [2024-11-22 20:59:06,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:06,360 INFO L471 AbstractCegarLoop]: Abstraction has 1567 states and 2013 transitions. [2024-11-22 20:59:06,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 9.214285714285714) internal successors, (129), 15 states have internal predecessors, (129), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:06,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1567 states and 2013 transitions. [2024-11-22 20:59:06,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2024-11-22 20:59:06,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:06,361 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, 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, 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-22 20:59:06,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-22 20:59:06,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:06,566 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:06,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:06,567 INFO L85 PathProgramCache]: Analyzing trace with hash -383964680, now seen corresponding path program 1 times [2024-11-22 20:59:06,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:06,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427209458] [2024-11-22 20:59:06,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:06,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:07,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:07,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427209458] [2024-11-22 20:59:07,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427209458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:07,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [878042695] [2024-11-22 20:59:07,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:07,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:07,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:59:07,132 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-22 20:59:07,133 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-22 20:59:07,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:07,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-22 20:59:07,305 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:07,308 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-22 20:59:07,381 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:07,382 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-22 20:59:07,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 20:59:07,402 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-22 20:59:07,404 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-22 20:59:07,466 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 22 treesize of output 10 [2024-11-22 20:59:07,469 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-22 20:59:07,547 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:07,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-22 20:59:07,552 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-22 20:59:07,608 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:07,609 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-22 20:59:07,612 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-22 20:59:07,625 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-22 20:59:07,628 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-22 20:59:07,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:07,642 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:07,688 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-22 20:59:07,696 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1019 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-22 20:59:07,735 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int)) (v_ArrVal_1020 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) .cse0 v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1020) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1019 (Array Int Int)) (v_ArrVal_1026 (Array Int Int)) (v_ArrVal_1025 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1025) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1026) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1019) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4))))) is different from false [2024-11-22 20:59:07,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [878042695] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:07,736 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:07,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 19 [2024-11-22 20:59:07,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669816662] [2024-11-22 20:59:07,738 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:07,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 20:59:07,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:07,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 20:59:07,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=397, Unknown=3, NotChecked=126, Total=600 [2024-11-22 20:59:07,740 INFO L87 Difference]: Start difference. First operand 1567 states and 2013 transitions. Second operand has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:59:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:12,077 INFO L93 Difference]: Finished difference Result 1574 states and 2019 transitions. [2024-11-22 20:59:12,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-22 20:59:12,077 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 90 [2024-11-22 20:59:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:12,079 INFO L225 Difference]: With dead ends: 1574 [2024-11-22 20:59:12,079 INFO L226 Difference]: Without dead ends: 1574 [2024-11-22 20:59:12,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=117, Invalid=594, Unknown=3, NotChecked=156, Total=870 [2024-11-22 20:59:12,080 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1145 mSDsluCounter, 8398 mSDsCounter, 0 mSdLazyCounter, 9257 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 9150 SdHoareTripleChecker+Invalid, 9279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 9257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:12,080 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 9150 Invalid, 9279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 9257 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2024-11-22 20:59:12,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1574 states. [2024-11-22 20:59:12,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1574 to 1556. [2024-11-22 20:59:12,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 1174 states have (on average 1.6814310051107326) internal successors, (1974), 1544 states have internal predecessors, (1974), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:59:12,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1992 transitions. [2024-11-22 20:59:12,092 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1992 transitions. Word has length 90 [2024-11-22 20:59:12,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:12,092 INFO L471 AbstractCegarLoop]: Abstraction has 1556 states and 1992 transitions. [2024-11-22 20:59:12,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 8.352941176470589) internal successors, (142), 20 states have internal predecessors, (142), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:59:12,092 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1992 transitions. [2024-11-22 20:59:12,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 20:59:12,093 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:12,093 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, 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, 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-22 20:59:12,104 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-22 20:59:12,297 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:12,298 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:12,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:12,298 INFO L85 PathProgramCache]: Analyzing trace with hash 612863492, now seen corresponding path program 1 times [2024-11-22 20:59:12,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:12,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15102513] [2024-11-22 20:59:12,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:12,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:12,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:12,706 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-22 20:59:12,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:12,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15102513] [2024-11-22 20:59:12,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15102513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:59:12,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:59:12,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-22 20:59:12,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323488537] [2024-11-22 20:59:12,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:59:12,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 20:59:12,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:12,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 20:59:12,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-22 20:59:12,709 INFO L87 Difference]: Start difference. First operand 1556 states and 1992 transitions. Second operand has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:14,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:14,596 INFO L93 Difference]: Finished difference Result 1581 states and 2027 transitions. [2024-11-22 20:59:14,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 20:59:14,597 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-22 20:59:14,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:14,599 INFO L225 Difference]: With dead ends: 1581 [2024-11-22 20:59:14,599 INFO L226 Difference]: Without dead ends: 1581 [2024-11-22 20:59:14,600 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=411, Unknown=0, NotChecked=0, Total=506 [2024-11-22 20:59:14,600 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1157 mSDsluCounter, 5795 mSDsCounter, 0 mSdLazyCounter, 4525 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 6541 SdHoareTripleChecker+Invalid, 4545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 4525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:14,600 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1167 Valid, 6541 Invalid, 4545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 4525 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-22 20:59:14,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1581 states. [2024-11-22 20:59:14,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1581 to 1577. [2024-11-22 20:59:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1194 states have (on average 1.6725293132328307) internal successors, (1997), 1563 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-22 20:59:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2017 transitions. [2024-11-22 20:59:14,612 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2017 transitions. Word has length 92 [2024-11-22 20:59:14,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:14,612 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2017 transitions. [2024-11-22 20:59:14,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.923076923076923) internal successors, (90), 14 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:14,613 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2017 transitions. [2024-11-22 20:59:14,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-22 20:59:14,613 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:14,613 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, 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, 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-22 20:59:14,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 20:59:14,614 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:14,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:14,614 INFO L85 PathProgramCache]: Analyzing trace with hash 612863493, now seen corresponding path program 1 times [2024-11-22 20:59:14,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:14,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095824300] [2024-11-22 20:59:14,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:14,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:15,109 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-22 20:59:15,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:15,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095824300] [2024-11-22 20:59:15,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095824300] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:59:15,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:59:15,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-22 20:59:15,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944142913] [2024-11-22 20:59:15,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:59:15,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-22 20:59:15,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:15,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-22 20:59:15,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-22 20:59:15,111 INFO L87 Difference]: Start difference. First operand 1577 states and 2017 transitions. Second operand has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:16,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:16,735 INFO L93 Difference]: Finished difference Result 1580 states and 2025 transitions. [2024-11-22 20:59:16,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 20:59:16,735 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 92 [2024-11-22 20:59:16,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:16,738 INFO L225 Difference]: With dead ends: 1580 [2024-11-22 20:59:16,739 INFO L226 Difference]: Without dead ends: 1580 [2024-11-22 20:59:16,739 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2024-11-22 20:59:16,739 INFO L432 NwaCegarLoop]: 753 mSDtfsCounter, 1172 mSDsluCounter, 3117 mSDsCounter, 0 mSdLazyCounter, 3533 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1182 SdHoareTripleChecker+Valid, 3870 SdHoareTripleChecker+Invalid, 3552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 3533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:16,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1182 Valid, 3870 Invalid, 3552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 3533 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 20:59:16,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1580 states. [2024-11-22 20:59:16,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1580 to 1577. [2024-11-22 20:59:16,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1577 states, 1194 states have (on average 1.670854271356784) internal successors, (1995), 1563 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-22 20:59:16,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1577 states to 1577 states and 2015 transitions. [2024-11-22 20:59:16,755 INFO L78 Accepts]: Start accepts. Automaton has 1577 states and 2015 transitions. Word has length 92 [2024-11-22 20:59:16,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:16,755 INFO L471 AbstractCegarLoop]: Abstraction has 1577 states and 2015 transitions. [2024-11-22 20:59:16,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 8.181818181818182) internal successors, (90), 12 states have internal predecessors, (90), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:16,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1577 states and 2015 transitions. [2024-11-22 20:59:16,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 20:59:16,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:16,756 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, 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, 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-22 20:59:16,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-22 20:59:16,756 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:16,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:16,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1193285735, now seen corresponding path program 1 times [2024-11-22 20:59:16,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:16,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278480826] [2024-11-22 20:59:16,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:16,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:16,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:17,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:17,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278480826] [2024-11-22 20:59:17,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278480826] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:17,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826713025] [2024-11-22 20:59:17,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:17,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:17,159 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:59:17,161 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-22 20:59:17,162 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-22 20:59:17,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:17,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-22 20:59:17,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:17,354 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-22 20:59:17,424 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:17,425 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-22 20:59:17,433 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-22 20:59:17,470 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:17,471 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-22 20:59:17,503 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:17,503 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-22 20:59:17,536 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:17,536 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-22 20:59:17,551 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-22 20:59:17,553 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:17,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:17,564 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-22 20:59:17,569 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1300) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-22 20:59:17,576 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 20:59:17,580 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1300 (Array Int Int)) (v_ArrVal_1299 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1299))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1300)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 20:59:17,606 INFO L349 Elim1Store]: treesize reduction 5, result has 90.6 percent of original size [2024-11-22 20:59:17,606 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 57 treesize of output 56 [2024-11-22 20:59:17,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826713025] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:17,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:17,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 17 [2024-11-22 20:59:17,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018509845] [2024-11-22 20:59:17,633 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:17,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 20:59:17,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:17,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 20:59:17,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=287, Unknown=8, NotChecked=148, Total=506 [2024-11-22 20:59:17,636 INFO L87 Difference]: Start difference. First operand 1577 states and 2015 transitions. Second operand has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:20,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:20,034 INFO L93 Difference]: Finished difference Result 1579 states and 2023 transitions. [2024-11-22 20:59:20,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 20:59:20,035 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 93 [2024-11-22 20:59:20,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:20,037 INFO L225 Difference]: With dead ends: 1579 [2024-11-22 20:59:20,037 INFO L226 Difference]: Without dead ends: 1579 [2024-11-22 20:59:20,038 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=585, Unknown=8, NotChecked=212, Total=930 [2024-11-22 20:59:20,039 INFO L432 NwaCegarLoop]: 746 mSDtfsCounter, 1141 mSDsluCounter, 7945 mSDsCounter, 0 mSdLazyCounter, 5982 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 8691 SdHoareTripleChecker+Invalid, 6002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:20,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 8691 Invalid, 6002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5982 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-22 20:59:20,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1579 states. [2024-11-22 20:59:20,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1579 to 1576. [2024-11-22 20:59:20,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1576 states, 1194 states have (on average 1.669179229480737) internal successors, (1993), 1562 states have internal predecessors, (1993), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-22 20:59:20,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1576 states to 1576 states and 2013 transitions. [2024-11-22 20:59:20,051 INFO L78 Accepts]: Start accepts. Automaton has 1576 states and 2013 transitions. Word has length 93 [2024-11-22 20:59:20,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:20,052 INFO L471 AbstractCegarLoop]: Abstraction has 1576 states and 2013 transitions. [2024-11-22 20:59:20,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.375) internal successors, (134), 17 states have internal predecessors, (134), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:20,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1576 states and 2013 transitions. [2024-11-22 20:59:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-22 20:59:20,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:20,053 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, 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, 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-22 20:59:20,062 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 20:59:20,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-22 20:59:20,255 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:20,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:20,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1193285734, now seen corresponding path program 1 times [2024-11-22 20:59:20,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:20,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [27501617] [2024-11-22 20:59:20,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:20,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:20,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:20,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:20,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:20,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [27501617] [2024-11-22 20:59:20,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [27501617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:20,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838153588] [2024-11-22 20:59:20,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:20,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:20,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:59:20,837 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 20:59:20,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 20:59:21,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:21,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-22 20:59:21,090 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:21,092 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-22 20:59:21,169 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-22 20:59:21,182 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:21,183 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-22 20:59:21,189 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-22 20:59:21,193 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-22 20:59:21,226 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 22 treesize of output 10 [2024-11-22 20:59:21,229 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-22 20:59:21,293 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:21,293 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-22 20:59:21,297 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-22 20:59:21,340 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:21,341 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-22 20:59:21,344 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-22 20:59:21,382 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:21,383 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-22 20:59:21,385 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-22 20:59:21,398 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-22 20:59:21,401 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-22 20:59:21,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:21,402 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:21,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-22 20:59:21,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1452))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1453) .cse1 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-22 20:59:21,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse0 v_ArrVal_1453) (select (select (store .cse1 .cse0 v_ArrVal_1452) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1454))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 8))) (forall ((v_ArrVal_1455 (Array Int Int)) (v_ArrVal_1454 (Array Int Int)) (v_ArrVal_1453 (Array Int Int)) (v_ArrVal_1452 (Array Int Int)) (v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1460))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1452))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1461) .cse3 v_ArrVal_1453) .cse4 v_ArrVal_1454) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 12) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1455) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-22 20:59:21,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838153588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:21,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:21,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 17 [2024-11-22 20:59:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451744092] [2024-11-22 20:59:21,597 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:21,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 20:59:21,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:21,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 20:59:21,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=375, Unknown=15, NotChecked=126, Total=600 [2024-11-22 20:59:21,598 INFO L87 Difference]: Start difference. First operand 1576 states and 2013 transitions. Second operand has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:59:24,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:24,288 INFO L93 Difference]: Finished difference Result 1578 states and 2021 transitions. [2024-11-22 20:59:24,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 20:59:24,288 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 93 [2024-11-22 20:59:24,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:24,291 INFO L225 Difference]: With dead ends: 1578 [2024-11-22 20:59:24,291 INFO L226 Difference]: Without dead ends: 1578 [2024-11-22 20:59:24,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 92 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=139, Invalid=614, Unknown=15, NotChecked=162, Total=930 [2024-11-22 20:59:24,291 INFO L432 NwaCegarLoop]: 751 mSDtfsCounter, 1142 mSDsluCounter, 4953 mSDsCounter, 0 mSdLazyCounter, 5375 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 5704 SdHoareTripleChecker+Invalid, 5396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 5375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:24,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 5704 Invalid, 5396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 5375 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-22 20:59:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2024-11-22 20:59:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1554. [2024-11-22 20:59:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 1174 states have (on average 1.678023850085179) internal successors, (1970), 1542 states have internal predecessors, (1970), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:59:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1988 transitions. [2024-11-22 20:59:24,304 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1988 transitions. Word has length 93 [2024-11-22 20:59:24,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:24,304 INFO L471 AbstractCegarLoop]: Abstraction has 1554 states and 1988 transitions. [2024-11-22 20:59:24,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 8.6875) internal successors, (139), 18 states have internal predecessors, (139), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:59:24,304 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1988 transitions. [2024-11-22 20:59:24,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 20:59:24,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:24,306 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, 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, 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-22 20:59:24,315 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 20:59:24,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:24,511 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:24,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:24,512 INFO L85 PathProgramCache]: Analyzing trace with hash -89061485, now seen corresponding path program 1 times [2024-11-22 20:59:24,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:24,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982416338] [2024-11-22 20:59:24,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:24,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:24,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:25,278 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-22 20:59:25,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:25,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982416338] [2024-11-22 20:59:25,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982416338] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:59:25,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:59:25,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-22 20:59:25,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [913710100] [2024-11-22 20:59:25,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:59:25,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-22 20:59:25,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:25,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-22 20:59:25,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2024-11-22 20:59:25,283 INFO L87 Difference]: Start difference. First operand 1554 states and 1988 transitions. Second operand has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:27,427 INFO L93 Difference]: Finished difference Result 1585 states and 2029 transitions. [2024-11-22 20:59:27,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 20:59:27,428 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-22 20:59:27,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:27,430 INFO L225 Difference]: With dead ends: 1585 [2024-11-22 20:59:27,430 INFO L226 Difference]: Without dead ends: 1585 [2024-11-22 20:59:27,430 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=491, Unknown=0, NotChecked=0, Total=600 [2024-11-22 20:59:27,431 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1174 mSDsluCounter, 6547 mSDsCounter, 0 mSdLazyCounter, 5026 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1184 SdHoareTripleChecker+Valid, 7292 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 5026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:27,432 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1184 Valid, 7292 Invalid, 5046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 5026 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 20:59:27,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2024-11-22 20:59:27,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1581. [2024-11-22 20:59:27,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1200 states have (on average 1.6658333333333333) internal successors, (1999), 1567 states have internal predecessors, (1999), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-22 20:59:27,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2019 transitions. [2024-11-22 20:59:27,452 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2019 transitions. Word has length 95 [2024-11-22 20:59:27,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:27,452 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2019 transitions. [2024-11-22 20:59:27,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.642857142857143) internal successors, (93), 15 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:27,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2019 transitions. [2024-11-22 20:59:27,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-22 20:59:27,457 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:27,457 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, 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, 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-22 20:59:27,457 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-22 20:59:27,457 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:27,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:27,457 INFO L85 PathProgramCache]: Analyzing trace with hash -89061484, now seen corresponding path program 1 times [2024-11-22 20:59:27,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:27,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714042000] [2024-11-22 20:59:27,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:27,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:28,173 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-22 20:59:28,173 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:28,173 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714042000] [2024-11-22 20:59:28,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714042000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:59:28,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:59:28,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-22 20:59:28,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470283017] [2024-11-22 20:59:28,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:59:28,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 20:59:28,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:28,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 20:59:28,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-22 20:59:28,175 INFO L87 Difference]: Start difference. First operand 1581 states and 2019 transitions. Second operand has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:30,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:30,289 INFO L93 Difference]: Finished difference Result 1584 states and 2027 transitions. [2024-11-22 20:59:30,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-22 20:59:30,290 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 95 [2024-11-22 20:59:30,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:30,292 INFO L225 Difference]: With dead ends: 1584 [2024-11-22 20:59:30,292 INFO L226 Difference]: Without dead ends: 1584 [2024-11-22 20:59:30,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=274, Unknown=0, NotChecked=0, Total=342 [2024-11-22 20:59:30,293 INFO L432 NwaCegarLoop]: 752 mSDtfsCounter, 1154 mSDsluCounter, 4368 mSDsCounter, 0 mSdLazyCounter, 4718 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1164 SdHoareTripleChecker+Valid, 5120 SdHoareTripleChecker+Invalid, 4737 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 4718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:30,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1164 Valid, 5120 Invalid, 4737 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 4718 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-22 20:59:30,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2024-11-22 20:59:30,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1581. [2024-11-22 20:59:30,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1581 states, 1200 states have (on average 1.6641666666666666) internal successors, (1997), 1567 states have internal predecessors, (1997), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-22 20:59:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1581 states to 1581 states and 2017 transitions. [2024-11-22 20:59:30,304 INFO L78 Accepts]: Start accepts. Automaton has 1581 states and 2017 transitions. Word has length 95 [2024-11-22 20:59:30,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:30,304 INFO L471 AbstractCegarLoop]: Abstraction has 1581 states and 2017 transitions. [2024-11-22 20:59:30,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.75) internal successors, (93), 13 states have internal predecessors, (93), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 1581 states and 2017 transitions. [2024-11-22 20:59:30,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 20:59:30,305 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:30,305 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, 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, 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-22 20:59:30,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-22 20:59:30,305 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:30,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:30,306 INFO L85 PathProgramCache]: Analyzing trace with hash 269601246, now seen corresponding path program 1 times [2024-11-22 20:59:30,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:30,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886173614] [2024-11-22 20:59:30,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:30,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:30,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:30,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:30,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:30,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886173614] [2024-11-22 20:59:30,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886173614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:30,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [7355545] [2024-11-22 20:59:30,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:30,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:30,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:59:30,736 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 20:59:30,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 20:59:30,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:30,931 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 20:59:30,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:30,937 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-22 20:59:31,001 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:31,002 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-22 20:59:31,006 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-22 20:59:31,070 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:31,070 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-22 20:59:31,102 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:31,102 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-22 20:59:31,135 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:31,135 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-22 20:59:31,168 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:31,168 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-22 20:59:31,175 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-22 20:59:31,176 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:31,176 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:31,224 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1759))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 20:59:31,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= (select |c_#valid| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1758))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-22 20:59:31,310 INFO L349 Elim1Store]: treesize reduction 5, result has 95.0 percent of original size [2024-11-22 20:59:31,311 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 105 treesize of output 104 [2024-11-22 20:59:31,315 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1758 (Array Int Int)) (v_ArrVal_1763 (Array Int Int)) (v_ArrVal_1760 (Array Int Int)) (v_ArrVal_1759 (Array Int Int))) (= |c_ULTIMATE.start_main_#t~mem50#1.base| (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (let ((.cse0 (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1763))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1758)))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1759)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1760)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) is different from false [2024-11-22 20:59:31,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [7355545] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:31,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:31,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 21 [2024-11-22 20:59:31,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321556480] [2024-11-22 20:59:31,319 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:31,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 20:59:31,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:31,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 20:59:31,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=536, Unknown=25, NotChecked=150, Total=812 [2024-11-22 20:59:31,320 INFO L87 Difference]: Start difference. First operand 1581 states and 2017 transitions. Second operand has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:59:34,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:34,084 INFO L93 Difference]: Finished difference Result 1583 states and 2025 transitions. [2024-11-22 20:59:34,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 20:59:34,084 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 96 [2024-11-22 20:59:34,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:34,086 INFO L225 Difference]: With dead ends: 1583 [2024-11-22 20:59:34,086 INFO L226 Difference]: Without dead ends: 1583 [2024-11-22 20:59:34,087 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 265 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=985, Unknown=25, NotChecked=204, Total=1406 [2024-11-22 20:59:34,087 INFO L432 NwaCegarLoop]: 745 mSDtfsCounter, 1143 mSDsluCounter, 10144 mSDsCounter, 0 mSdLazyCounter, 7480 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1153 SdHoareTripleChecker+Valid, 10889 SdHoareTripleChecker+Invalid, 7500 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 7480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:34,087 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1153 Valid, 10889 Invalid, 7500 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 7480 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-22 20:59:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1583 states. [2024-11-22 20:59:34,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1583 to 1580. [2024-11-22 20:59:34,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1580 states, 1200 states have (on average 1.6625) internal successors, (1995), 1566 states have internal predecessors, (1995), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-22 20:59:34,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1580 states to 1580 states and 2015 transitions. [2024-11-22 20:59:34,101 INFO L78 Accepts]: Start accepts. Automaton has 1580 states and 2015 transitions. Word has length 96 [2024-11-22 20:59:34,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:34,101 INFO L471 AbstractCegarLoop]: Abstraction has 1580 states and 2015 transitions. [2024-11-22 20:59:34,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 19 states have (on average 7.684210526315789) internal successors, (146), 22 states have internal predecessors, (146), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-22 20:59:34,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1580 states and 2015 transitions. [2024-11-22 20:59:34,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-22 20:59:34,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:34,102 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, 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, 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-22 20:59:34,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-22 20:59:34,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:34,304 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:34,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:34,304 INFO L85 PathProgramCache]: Analyzing trace with hash 269601247, now seen corresponding path program 1 times [2024-11-22 20:59:34,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:34,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464668247] [2024-11-22 20:59:34,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:34,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:35,009 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464668247] [2024-11-22 20:59:35,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464668247] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:35,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799586897] [2024-11-22 20:59:35,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:35,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:35,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:59:35,012 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 20:59:35,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 20:59:35,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:35,220 INFO L255 TraceCheckSpWp]: Trace formula consists of 479 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-22 20:59:35,224 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:35,227 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-22 20:59:35,295 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-22 20:59:35,301 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:35,301 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-22 20:59:35,309 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-22 20:59:35,313 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-22 20:59:35,353 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 22 treesize of output 10 [2024-11-22 20:59:35,356 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-22 20:59:35,430 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:35,431 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-22 20:59:35,434 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-22 20:59:35,489 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:35,489 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-22 20:59:35,495 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-22 20:59:35,538 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:35,539 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-22 20:59:35,542 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-22 20:59:35,587 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:35,587 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-22 20:59:35,590 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-22 20:59:35,603 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-22 20:59:35,608 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-22 20:59:35,610 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:35,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:35,708 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1929 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20)))))) is different from false [2024-11-22 20:59:35,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) .cse0 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 24) (select |c_#length| (select (select (store .cse2 .cse0 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 20))))) is different from false [2024-11-22 20:59:35,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) .cse1 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20)))))) is different from false [2024-11-22 20:59:35,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse0 v_ArrVal_1927) (select (select (store .cse1 .cse0 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1925))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_1926))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1924) .cse3 v_ArrVal_1927) .cse4 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 24) (select |c_#length| (select (select (store .cse5 .cse4 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))) is different from false [2024-11-22 20:59:35,764 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (and (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 20))) (forall ((v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse7 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1925))) (let ((.cse4 (select (select .cse7 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse6 (store .cse7 .cse4 v_ArrVal_1926))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1924) .cse4 v_ArrVal_1927) .cse5 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse6 .cse5 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))))))))))) is different from false [2024-11-22 20:59:35,826 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (<= 0 (+ 20 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse2 (store .cse4 .cse0 v_ArrVal_1925))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse0 v_ArrVal_1924) .cse1 v_ArrVal_1927) (select (select (store .cse2 .cse1 v_ArrVal_1926) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) v_ArrVal_1929))))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))) (forall ((v_ArrVal_1934 (Array Int Int)) (v_ArrVal_1929 (Array Int Int)) (v_ArrVal_1928 (Array Int Int)) (v_ArrVal_1927 (Array Int Int)) (v_ArrVal_1926 (Array Int Int)) (v_ArrVal_1925 (Array Int Int)) (v_ArrVal_1935 (Array Int Int)) (v_ArrVal_1924 (Array Int Int))) (let ((.cse10 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1934))) (let ((.cse5 (select (select .cse10 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse9 (store .cse10 .cse5 v_ArrVal_1925))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (let ((.cse8 (store .cse9 .cse6 v_ArrVal_1926))) (let ((.cse7 (select (select .cse8 |c_ULTIMATE.start_main_~user~0#1.base|) .cse3))) (<= (+ (select (select (store (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1935) .cse5 v_ArrVal_1924) .cse6 v_ArrVal_1927) .cse7 v_ArrVal_1929) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3) 24) (select |c_#length| (select (select (store .cse8 .cse7 v_ArrVal_1928) |c_ULTIMATE.start_main_~user~0#1.base|) .cse3)))))))))))) is different from false [2024-11-22 20:59:35,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799586897] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:35,829 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 20:59:35,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 19 [2024-11-22 20:59:35,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713384699] [2024-11-22 20:59:35,830 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 20:59:35,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 20:59:35,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:35,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 20:59:35,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=421, Unknown=18, NotChecked=282, Total=812 [2024-11-22 20:59:35,832 INFO L87 Difference]: Start difference. First operand 1580 states and 2015 transitions. Second operand has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:59:37,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:37,954 INFO L93 Difference]: Finished difference Result 1582 states and 2023 transitions. [2024-11-22 20:59:37,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-22 20:59:37,955 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 96 [2024-11-22 20:59:37,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:37,957 INFO L225 Difference]: With dead ends: 1582 [2024-11-22 20:59:37,957 INFO L226 Difference]: Without dead ends: 1582 [2024-11-22 20:59:37,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 96 SyntacticMatches, 2 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=146, Invalid=727, Unknown=21, NotChecked=366, Total=1260 [2024-11-22 20:59:37,958 INFO L432 NwaCegarLoop]: 750 mSDtfsCounter, 1140 mSDsluCounter, 3868 mSDsCounter, 0 mSdLazyCounter, 4053 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 4618 SdHoareTripleChecker+Invalid, 4075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 4053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:37,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 4618 Invalid, 4075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 4053 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-22 20:59:37,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2024-11-22 20:59:37,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1552. [2024-11-22 20:59:37,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 1174 states have (on average 1.6746166950596253) internal successors, (1966), 1540 states have internal predecessors, (1966), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-22 20:59:37,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1984 transitions. [2024-11-22 20:59:37,974 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1984 transitions. Word has length 96 [2024-11-22 20:59:37,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:37,975 INFO L471 AbstractCegarLoop]: Abstraction has 1552 states and 1984 transitions. [2024-11-22 20:59:37,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 8.0) internal successors, (144), 20 states have internal predecessors, (144), 1 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-22 20:59:37,975 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1984 transitions. [2024-11-22 20:59:37,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-22 20:59:37,975 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:37,976 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, 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, 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-22 20:59:37,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 20:59:38,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-22 20:59:38,177 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:38,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:38,179 INFO L85 PathProgramCache]: Analyzing trace with hash -1508421354, now seen corresponding path program 1 times [2024-11-22 20:59:38,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:38,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335925128] [2024-11-22 20:59:38,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:38,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:38,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:39,097 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-22 20:59:39,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:39,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335925128] [2024-11-22 20:59:39,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335925128] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 20:59:39,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 20:59:39,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-11-22 20:59:39,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377025504] [2024-11-22 20:59:39,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 20:59:39,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 20:59:39,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 20:59:39,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 20:59:39,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2024-11-22 20:59:39,099 INFO L87 Difference]: Start difference. First operand 1552 states and 1984 transitions. Second operand has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 20:59:42,056 INFO L93 Difference]: Finished difference Result 1590 states and 2031 transitions. [2024-11-22 20:59:42,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-22 20:59:42,056 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 99 [2024-11-22 20:59:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 20:59:42,059 INFO L225 Difference]: With dead ends: 1590 [2024-11-22 20:59:42,059 INFO L226 Difference]: Without dead ends: 1590 [2024-11-22 20:59:42,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=629, Unknown=0, NotChecked=0, Total=756 [2024-11-22 20:59:42,059 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 1178 mSDsluCounter, 6517 mSDsCounter, 0 mSdLazyCounter, 6223 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1188 SdHoareTripleChecker+Valid, 7261 SdHoareTripleChecker+Invalid, 6249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 6223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-22 20:59:42,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1188 Valid, 7261 Invalid, 6249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 6223 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-22 20:59:42,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1590 states. [2024-11-22 20:59:42,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1590 to 1587. [2024-11-22 20:59:42,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1587 states, 1208 states have (on average 1.656456953642384) internal successors, (2001), 1573 states have internal predecessors, (2001), 9 states have call successors, (9), 2 states have call predecessors, (9), 3 states have return successors, (11), 11 states have call predecessors, (11), 9 states have call successors, (11) [2024-11-22 20:59:42,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1587 states to 1587 states and 2021 transitions. [2024-11-22 20:59:42,071 INFO L78 Accepts]: Start accepts. Automaton has 1587 states and 2021 transitions. Word has length 99 [2024-11-22 20:59:42,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 20:59:42,071 INFO L471 AbstractCegarLoop]: Abstraction has 1587 states and 2021 transitions. [2024-11-22 20:59:42,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 6.0625) internal successors, (97), 17 states have internal predecessors, (97), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-22 20:59:42,071 INFO L276 IsEmpty]: Start isEmpty. Operand 1587 states and 2021 transitions. [2024-11-22 20:59:42,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-22 20:59:42,072 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 20:59:42,072 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, 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, 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, 1] [2024-11-22 20:59:42,072 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-22 20:59:42,072 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr87REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-22 20:59:42,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 20:59:42,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1117260319, now seen corresponding path program 1 times [2024-11-22 20:59:42,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 20:59:42,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048669590] [2024-11-22 20:59:42,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:42,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 20:59:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:42,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:42,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 20:59:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048669590] [2024-11-22 20:59:42,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048669590] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 20:59:42,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1261671578] [2024-11-22 20:59:42,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 20:59:42,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 20:59:42,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 20:59:42,969 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 20:59:42,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 20:59:43,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 20:59:43,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-22 20:59:43,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 20:59:43,198 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-22 20:59:43,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:43,274 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-22 20:59:43,278 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-22 20:59:43,298 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-22 20:59:43,301 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-22 20:59:43,363 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 22 treesize of output 10 [2024-11-22 20:59:43,366 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-22 20:59:43,481 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:43,481 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 73 treesize of output 66 [2024-11-22 20:59:43,485 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-22 20:59:43,579 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:43,579 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 73 treesize of output 66 [2024-11-22 20:59:43,583 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-22 20:59:43,654 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:43,655 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 73 treesize of output 66 [2024-11-22 20:59:43,659 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-22 20:59:43,730 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:43,731 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 73 treesize of output 66 [2024-11-22 20:59:43,735 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-22 20:59:43,819 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-22 20:59:43,819 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 73 treesize of output 66 [2024-11-22 20:59:43,825 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-22 20:59:43,845 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 42 treesize of output 18 [2024-11-22 20:59:43,850 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-22 20:59:43,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 20:59:43,893 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-22 20:59:43,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 21 [2024-11-22 20:59:43,900 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 20:59:43,900 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-22 20:59:43,923 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 20:59:43,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 20:59:44,377 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (or (forall ((v_ArrVal_2193 (Array Int Int)) (v_ArrVal_2192 (Array Int Int)) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (< 0 (+ (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2192))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2193) .cse0 v_ArrVal_2195) (select (select (store .cse1 .cse0 v_ArrVal_2194) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_2197))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 1))) (forall ((|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int)) (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)))) (forall ((v_ArrVal_2193 (Array Int Int)) (v_ArrVal_2192 (Array Int Int)) (|v_ULTIMATE.start_main_#t~malloc57#1.base_6| Int) (v_ArrVal_2197 (Array Int Int)) (v_ArrVal_2196 (Array Int Int)) (v_ArrVal_2195 (Array Int Int)) (v_ArrVal_2194 (Array Int Int))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc57#1.base_6|) 0)) (forall ((v_ArrVal_2198 Int)) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2192))) (let ((.cse3 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse5 (store .cse6 .cse3 v_ArrVal_2194))) (let ((.cse4 (select (select .cse5 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_2193) .cse3 v_ArrVal_2195) .cse4 v_ArrVal_2197) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) 4) (select (store |c_#length| |v_ULTIMATE.start_main_#t~malloc57#1.base_6| v_ArrVal_2198) (select (select (store .cse5 .cse4 v_ArrVal_2196) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))))))) is different from false