./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_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 b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 17:11:17,439 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 17:11:17,492 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 17:11:17,496 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 17:11:17,497 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 17:11:17,520 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 17:11:17,521 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 17:11:17,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 17:11:17,522 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 17:11:17,522 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 17:11:17,522 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 17:11:17,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 17:11:17,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 17:11:17,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 17:11:17,524 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 17:11:17,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 17:11:17,525 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 17:11:17,525 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 17:11:17,526 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 17:11:17,526 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 17:11:17,526 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 17:11:17,527 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 17:11:17,527 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 17:11:17,528 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 17:11:17,528 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 17:11:17,528 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 17:11:17,528 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 17:11:17,529 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 17:11:17,529 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 17:11:17,529 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 17:11:17,530 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 17:11:17,533 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 17:11:17,533 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 17:11:17,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:11:17,534 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 17:11:17,534 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 17:11:17,534 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 17:11:17,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 17:11:17,537 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 17:11:17,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 17:11:17,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 17:11:17,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 17:11:17,538 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 -> b9bf0bad0cbe69b5d3c479fc9571d5ea3a755c149f856a4942bf9e49854dfec3 [2024-11-20 17:11:17,769 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 17:11:17,793 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 17:11:17,797 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 17:11:17,798 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 17:11:17,798 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 17:11:17,799 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-11-20 17:11:19,183 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 17:11:19,487 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 17:11:19,488 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SFH_test4-1.i [2024-11-20 17:11:19,515 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302419bf9/8f841e4d79de44da9961efcaaa364207/FLAGed7e304aa [2024-11-20 17:11:19,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/302419bf9/8f841e4d79de44da9961efcaaa364207 [2024-11-20 17:11:19,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 17:11:19,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 17:11:19,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 17:11:19,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 17:11:19,552 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 17:11:19,553 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:11:19" (1/1) ... [2024-11-20 17:11:19,556 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2bd5af94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:19, skipping insertion in model container [2024-11-20 17:11:19,556 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 05:11:19" (1/1) ... [2024-11-20 17:11:19,618 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 17:11:20,065 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,103 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,109 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,116 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,121 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,145 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,153 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,156 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,161 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,172 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-20 17:11:20,181 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:11:20,192 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 17:11:20,324 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 17:11:20,369 INFO L204 MainTranslator]: Completed translation [2024-11-20 17:11:20,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20 WrapperNode [2024-11-20 17:11:20,369 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 17:11:20,370 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 17:11:20,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 17:11:20,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 17:11:20,377 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,485 INFO L138 Inliner]: procedures = 176, calls = 336, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1603 [2024-11-20 17:11:20,486 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 17:11:20,486 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 17:11:20,486 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 17:11:20,487 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 17:11:20,497 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,498 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,516 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,622 INFO L175 MemorySlicer]: Split 309 memory accesses to 2 slices as follows [307, 2]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [0, 2]. The 82 writes are split as follows [82, 0]. [2024-11-20 17:11:20,626 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,626 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,697 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,707 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,715 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,734 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 17:11:20,735 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 17:11:20,736 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 17:11:20,737 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 17:11:20,737 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (1/1) ... [2024-11-20 17:11:20,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 17:11:20,756 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:11:20,771 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-20 17:11:20,774 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-20 17:11:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 17:11:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 17:11:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-20 17:11:20,823 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-20 17:11:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 17:11:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 17:11:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-11-20 17:11:20,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-11-20 17:11:20,823 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-11-20 17:11:20,824 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-11-20 17:11:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 17:11:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 17:11:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-20 17:11:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-20 17:11:20,824 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-20 17:11:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-20 17:11:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 17:11:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 17:11:20,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-20 17:11:20,826 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 17:11:20,827 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 17:11:21,036 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 17:11:21,039 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 17:11:21,043 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:11:21,095 WARN L781 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2024-11-20 17:11:23,571 INFO L? ?]: Removed 1502 outVars from TransFormulas that were not future-live. [2024-11-20 17:11:23,572 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 17:11:23,616 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 17:11:23,619 INFO L316 CfgBuilder]: Removed 60 assume(true) statements. [2024-11-20 17:11:23,619 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:11:23 BoogieIcfgContainer [2024-11-20 17:11:23,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 17:11:23,621 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 17:11:23,621 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 17:11:23,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 17:11:23,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 05:11:19" (1/3) ... [2024-11-20 17:11:23,626 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30183902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:11:23, skipping insertion in model container [2024-11-20 17:11:23,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 05:11:20" (2/3) ... [2024-11-20 17:11:23,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30183902 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 05:11:23, skipping insertion in model container [2024-11-20 17:11:23,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 05:11:23" (3/3) ... [2024-11-20 17:11:23,629 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SFH_test4-1.i [2024-11-20 17:11:23,642 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 17:11:23,642 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 628 error locations. [2024-11-20 17:11:23,712 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 17:11:23,719 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;@8dfddc5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 17:11:23,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 628 error locations. [2024-11-20 17:11:23,730 INFO L276 IsEmpty]: Start isEmpty. Operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:23,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:11:23,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:23,739 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:11:23,740 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash 45876316, now seen corresponding path program 1 times [2024-11-20 17:11:23,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:23,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783758073] [2024-11-20 17:11:23,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:23,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:23,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:23,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:23,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:23,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783758073] [2024-11-20 17:11:23,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783758073] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:23,998 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:23,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:11:24,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905191683] [2024-11-20 17:11:24,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:24,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:11:24,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:24,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:11:24,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:11:24,041 INFO L87 Difference]: Start difference. First operand has 1452 states, 811 states have (on average 2.0752157829839706) internal successors, (1683), 1443 states have internal predecessors, (1683), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:25,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:25,143 INFO L93 Difference]: Finished difference Result 1341 states and 1536 transitions. [2024-11-20 17:11:25,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:11:25,146 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 17:11:25,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:25,181 INFO L225 Difference]: With dead ends: 1341 [2024-11-20 17:11:25,181 INFO L226 Difference]: Without dead ends: 1339 [2024-11-20 17:11:25,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:11:25,188 INFO L432 NwaCegarLoop]: 922 mSDtfsCounter, 1366 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1382 SdHoareTripleChecker+Valid, 935 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:25,192 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1382 Valid, 935 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 743 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:11:25,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1339 states. [2024-11-20 17:11:25,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1339 to 1337. [2024-11-20 17:11:25,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1337 states, 801 states have (on average 1.8714107365792758) internal successors, (1499), 1328 states have internal predecessors, (1499), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:25,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1337 states to 1337 states and 1531 transitions. [2024-11-20 17:11:25,299 INFO L78 Accepts]: Start accepts. Automaton has 1337 states and 1531 transitions. Word has length 5 [2024-11-20 17:11:25,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:25,299 INFO L471 AbstractCegarLoop]: Abstraction has 1337 states and 1531 transitions. [2024-11-20 17:11:25,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:25,300 INFO L276 IsEmpty]: Start isEmpty. Operand 1337 states and 1531 transitions. [2024-11-20 17:11:25,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-20 17:11:25,302 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:25,302 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-20 17:11:25,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 17:11:25,303 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:25,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:25,303 INFO L85 PathProgramCache]: Analyzing trace with hash 45876317, now seen corresponding path program 1 times [2024-11-20 17:11:25,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:25,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960571739] [2024-11-20 17:11:25,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:25,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:25,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:25,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:25,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:25,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960571739] [2024-11-20 17:11:25,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960571739] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:25,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:25,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 17:11:25,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734474531] [2024-11-20 17:11:25,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:25,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:11:25,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:25,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:11:25,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:11:25,443 INFO L87 Difference]: Start difference. First operand 1337 states and 1531 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:26,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:26,392 INFO L93 Difference]: Finished difference Result 1753 states and 2025 transitions. [2024-11-20 17:11:26,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:11:26,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-20 17:11:26,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:26,400 INFO L225 Difference]: With dead ends: 1753 [2024-11-20 17:11:26,400 INFO L226 Difference]: Without dead ends: 1753 [2024-11-20 17:11:26,401 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:11:26,402 INFO L432 NwaCegarLoop]: 1286 mSDtfsCounter, 820 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 776 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 820 SdHoareTripleChecker+Valid, 1947 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.9s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:26,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [820 Valid, 1947 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 776 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 17:11:26,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2024-11-20 17:11:26,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1600. [2024-11-20 17:11:26,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1600 states, 1074 states have (on average 1.8370577281191807) internal successors, (1973), 1591 states have internal predecessors, (1973), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:26,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1600 states to 1600 states and 2005 transitions. [2024-11-20 17:11:26,481 INFO L78 Accepts]: Start accepts. Automaton has 1600 states and 2005 transitions. Word has length 5 [2024-11-20 17:11:26,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:26,481 INFO L471 AbstractCegarLoop]: Abstraction has 1600 states and 2005 transitions. [2024-11-20 17:11:26,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:26,482 INFO L276 IsEmpty]: Start isEmpty. Operand 1600 states and 2005 transitions. [2024-11-20 17:11:26,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 17:11:26,482 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:26,482 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 17:11:26,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 17:11:26,483 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr620REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:26,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:26,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1424554157, now seen corresponding path program 1 times [2024-11-20 17:11:26,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:26,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216200627] [2024-11-20 17:11:26,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:26,486 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:26,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:26,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:26,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:26,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216200627] [2024-11-20 17:11:26,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216200627] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:26,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:26,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:11:26,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135227134] [2024-11-20 17:11:26,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:26,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:11:26,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:26,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:11:26,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:11:26,515 INFO L87 Difference]: Start difference. First operand 1600 states and 2005 transitions. Second operand has 3 states, 3 states have (on average 2.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-20 17:11:26,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:26,567 INFO L93 Difference]: Finished difference Result 3150 states and 3940 transitions. [2024-11-20 17:11:26,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:11:26,568 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.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-20 17:11:26,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:26,580 INFO L225 Difference]: With dead ends: 3150 [2024-11-20 17:11:26,580 INFO L226 Difference]: Without dead ends: 3150 [2024-11-20 17:11:26,580 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-20 17:11:26,581 INFO L432 NwaCegarLoop]: 2030 mSDtfsCounter, 1438 mSDsluCounter, 1516 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1444 SdHoareTripleChecker+Valid, 3546 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:26,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1444 Valid, 3546 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:11:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3150 states. [2024-11-20 17:11:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3150 to 1601. [2024-11-20 17:11:26,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1601 states, 1075 states have (on average 1.8362790697674418) internal successors, (1974), 1592 states have internal predecessors, (1974), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1601 states to 1601 states and 2006 transitions. [2024-11-20 17:11:26,633 INFO L78 Accepts]: Start accepts. Automaton has 1601 states and 2006 transitions. Word has length 6 [2024-11-20 17:11:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:26,634 INFO L471 AbstractCegarLoop]: Abstraction has 1601 states and 2006 transitions. [2024-11-20 17:11:26,634 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.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-20 17:11:26,634 INFO L276 IsEmpty]: Start isEmpty. Operand 1601 states and 2006 transitions. [2024-11-20 17:11:26,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 17:11:26,634 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:26,635 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:11:26,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 17:11:26,635 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:26,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:26,636 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610650, now seen corresponding path program 1 times [2024-11-20 17:11:26,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:26,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971496839] [2024-11-20 17:11:26,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:26,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:26,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:26,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:26,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:26,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971496839] [2024-11-20 17:11:26,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971496839] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:26,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:26,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:11:26,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270374746] [2024-11-20 17:11:26,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:26,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:11:26,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:26,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:11:26,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:11:26,736 INFO L87 Difference]: Start difference. First operand 1601 states and 2006 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:27,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:27,780 INFO L93 Difference]: Finished difference Result 1627 states and 2059 transitions. [2024-11-20 17:11:27,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:11:27,781 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 17:11:27,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:27,787 INFO L225 Difference]: With dead ends: 1627 [2024-11-20 17:11:27,787 INFO L226 Difference]: Without dead ends: 1627 [2024-11-20 17:11:27,788 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:11:27,789 INFO L432 NwaCegarLoop]: 894 mSDtfsCounter, 1634 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1347 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1650 SdHoareTripleChecker+Valid, 1633 SdHoareTripleChecker+Invalid, 1380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 1347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:27,789 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1650 Valid, 1633 Invalid, 1380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 1347 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:11:27,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1627 states. [2024-11-20 17:11:27,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1627 to 1578. [2024-11-20 17:11:27,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1578 states, 1075 states have (on average 1.8148837209302326) internal successors, (1951), 1569 states have internal predecessors, (1951), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:27,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1578 states to 1578 states and 1983 transitions. [2024-11-20 17:11:27,819 INFO L78 Accepts]: Start accepts. Automaton has 1578 states and 1983 transitions. Word has length 11 [2024-11-20 17:11:27,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:27,819 INFO L471 AbstractCegarLoop]: Abstraction has 1578 states and 1983 transitions. [2024-11-20 17:11:27,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 1578 states and 1983 transitions. [2024-11-20 17:11:27,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-20 17:11:27,820 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:27,820 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:11:27,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 17:11:27,821 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:27,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:27,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1344610649, now seen corresponding path program 1 times [2024-11-20 17:11:27,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:27,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545257051] [2024-11-20 17:11:27,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:27,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:27,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:27,927 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:27,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:27,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545257051] [2024-11-20 17:11:27,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545257051] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:27,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:27,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:11:27,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21984177] [2024-11-20 17:11:27,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:27,929 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:11:27,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:27,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:11:27,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:11:27,930 INFO L87 Difference]: Start difference. First operand 1578 states and 1983 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:27,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:27,964 INFO L93 Difference]: Finished difference Result 1503 states and 1880 transitions. [2024-11-20 17:11:27,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:11:27,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-20 17:11:27,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:27,970 INFO L225 Difference]: With dead ends: 1503 [2024-11-20 17:11:27,970 INFO L226 Difference]: Without dead ends: 1503 [2024-11-20 17:11:27,971 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-20 17:11:27,971 INFO L432 NwaCegarLoop]: 1383 mSDtfsCounter, 61 mSDsluCounter, 1330 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 2713 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-20 17:11:27,972 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 2713 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:11:27,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1503 states. [2024-11-20 17:11:27,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1503 to 1503. [2024-11-20 17:11:27,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1503 states, 1012 states have (on average 1.826086956521739) internal successors, (1848), 1494 states have internal predecessors, (1848), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:27,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1503 states to 1503 states and 1880 transitions. [2024-11-20 17:11:27,998 INFO L78 Accepts]: Start accepts. Automaton has 1503 states and 1880 transitions. Word has length 11 [2024-11-20 17:11:27,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:27,998 INFO L471 AbstractCegarLoop]: Abstraction has 1503 states and 1880 transitions. [2024-11-20 17:11:27,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:27,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1503 states and 1880 transitions. [2024-11-20 17:11:27,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 17:11:27,999 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:28,000 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:11:28,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 17:11:28,003 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:28,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:28,003 INFO L85 PathProgramCache]: Analyzing trace with hash 614478435, now seen corresponding path program 1 times [2024-11-20 17:11:28,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:28,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442770091] [2024-11-20 17:11:28,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:28,069 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:28,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:28,070 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442770091] [2024-11-20 17:11:28,070 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442770091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:28,070 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:28,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:11:28,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916775382] [2024-11-20 17:11:28,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:28,071 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:11:28,071 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:28,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:11:28,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:11:28,072 INFO L87 Difference]: Start difference. First operand 1503 states and 1880 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:28,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:28,135 INFO L93 Difference]: Finished difference Result 1485 states and 1855 transitions. [2024-11-20 17:11:28,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:11:28,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 17:11:28,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:28,142 INFO L225 Difference]: With dead ends: 1485 [2024-11-20 17:11:28,142 INFO L226 Difference]: Without dead ends: 1485 [2024-11-20 17:11:28,142 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-20 17:11:28,144 INFO L432 NwaCegarLoop]: 1348 mSDtfsCounter, 41 mSDsluCounter, 2668 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 4016 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-20 17:11:28,145 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 4016 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:11:28,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1485 states. [2024-11-20 17:11:28,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1485 to 1482. [2024-11-20 17:11:28,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1482 states, 998 states have (on average 1.8236472945891784) internal successors, (1820), 1473 states have internal predecessors, (1820), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1482 states to 1482 states and 1852 transitions. [2024-11-20 17:11:28,172 INFO L78 Accepts]: Start accepts. Automaton has 1482 states and 1852 transitions. Word has length 13 [2024-11-20 17:11:28,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:28,172 INFO L471 AbstractCegarLoop]: Abstraction has 1482 states and 1852 transitions. [2024-11-20 17:11:28,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:28,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1482 states and 1852 transitions. [2024-11-20 17:11:28,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-20 17:11:28,173 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:28,174 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:11:28,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 17:11:28,174 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:28,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:28,174 INFO L85 PathProgramCache]: Analyzing trace with hash 530126353, now seen corresponding path program 1 times [2024-11-20 17:11:28,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:28,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381504118] [2024-11-20 17:11:28,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:28,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:28,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:28,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:28,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381504118] [2024-11-20 17:11:28,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381504118] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:28,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:28,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:11:28,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802670100] [2024-11-20 17:11:28,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:28,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:11:28,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:28,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:11:28,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:11:28,352 INFO L87 Difference]: Start difference. First operand 1482 states and 1852 transitions. Second operand has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:29,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:29,506 INFO L93 Difference]: Finished difference Result 1680 states and 1944 transitions. [2024-11-20 17:11:29,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 17:11:29,506 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2024-11-20 17:11:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:29,511 INFO L225 Difference]: With dead ends: 1680 [2024-11-20 17:11:29,511 INFO L226 Difference]: Without dead ends: 1680 [2024-11-20 17:11:29,513 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:11:29,513 INFO L432 NwaCegarLoop]: 1168 mSDtfsCounter, 825 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1296 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 825 SdHoareTripleChecker+Valid, 2596 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:29,514 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [825 Valid, 2596 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1296 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-20 17:11:29,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2024-11-20 17:11:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1478. [2024-11-20 17:11:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8196392785571143) internal successors, (1816), 1469 states have internal predecessors, (1816), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:29,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1848 transitions. [2024-11-20 17:11:29,538 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1848 transitions. Word has length 27 [2024-11-20 17:11:29,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:29,538 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1848 transitions. [2024-11-20 17:11:29,538 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.0) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1848 transitions. [2024-11-20 17:11:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-20 17:11:29,540 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:29,540 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] [2024-11-20 17:11:29,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 17:11:29,541 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr107REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:29,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:29,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1653190907, now seen corresponding path program 1 times [2024-11-20 17:11:29,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:29,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408736358] [2024-11-20 17:11:29,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:29,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:29,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:29,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408736358] [2024-11-20 17:11:29,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408736358] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:29,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:29,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:11:29,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975885117] [2024-11-20 17:11:29,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:29,626 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 17:11:29,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:29,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 17:11:29,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 17:11:29,627 INFO L87 Difference]: Start difference. First operand 1478 states and 1848 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:29,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:29,677 INFO L93 Difference]: Finished difference Result 1478 states and 1844 transitions. [2024-11-20 17:11:29,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:11:29,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-20 17:11:29,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:29,683 INFO L225 Difference]: With dead ends: 1478 [2024-11-20 17:11:29,683 INFO L226 Difference]: Without dead ends: 1478 [2024-11-20 17:11:29,683 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-20 17:11:29,684 INFO L432 NwaCegarLoop]: 1343 mSDtfsCounter, 21 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 3998 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-20 17:11:29,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 3998 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:11:29,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1478 states. [2024-11-20 17:11:29,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1478 to 1478. [2024-11-20 17:11:29,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1478 states, 998 states have (on average 1.8156312625250501) internal successors, (1812), 1469 states have internal predecessors, (1812), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:29,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1478 states to 1478 states and 1844 transitions. [2024-11-20 17:11:29,712 INFO L78 Accepts]: Start accepts. Automaton has 1478 states and 1844 transitions. Word has length 61 [2024-11-20 17:11:29,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:29,713 INFO L471 AbstractCegarLoop]: Abstraction has 1478 states and 1844 transitions. [2024-11-20 17:11:29,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 1478 states and 1844 transitions. [2024-11-20 17:11:29,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-11-20 17:11:29,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:29,716 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] [2024-11-20 17:11:29,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 17:11:29,717 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-20 17:11:29,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:29,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1854806959, now seen corresponding path program 1 times [2024-11-20 17:11:29,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:29,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811354304] [2024-11-20 17:11:29,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:29,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811354304] [2024-11-20 17:11:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811354304] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:29,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:29,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 17:11:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [568660791] [2024-11-20 17:11:29,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:29,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 17:11:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:29,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 17:11:29,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 17:11:29,821 INFO L87 Difference]: Start difference. First operand 1478 states and 1844 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:29,863 INFO L93 Difference]: Finished difference Result 1570 states and 1963 transitions. [2024-11-20 17:11:29,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 17:11:29,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-11-20 17:11:29,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:29,869 INFO L225 Difference]: With dead ends: 1570 [2024-11-20 17:11:29,869 INFO L226 Difference]: Without dead ends: 1570 [2024-11-20 17:11:29,870 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-20 17:11:29,870 INFO L432 NwaCegarLoop]: 1358 mSDtfsCounter, 54 mSDsluCounter, 1331 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 2689 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-20 17:11:29,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 2689 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 17:11:29,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1570 states. [2024-11-20 17:11:29,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1570 to 1570. [2024-11-20 17:11:29,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1090 states have (on average 1.771559633027523) internal successors, (1931), 1561 states have internal predecessors, (1931), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:29,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 1963 transitions. [2024-11-20 17:11:29,894 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 1963 transitions. Word has length 69 [2024-11-20 17:11:29,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:29,895 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 1963 transitions. [2024-11-20 17:11:29,895 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:29,895 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 1963 transitions. [2024-11-20 17:11:29,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-11-20 17:11:29,896 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:29,896 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] [2024-11-20 17:11:29,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 17:11:29,896 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:29,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:29,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1907003630, now seen corresponding path program 1 times [2024-11-20 17:11:29,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:29,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832225190] [2024-11-20 17:11:29,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:29,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:29,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:30,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:30,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832225190] [2024-11-20 17:11:30,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832225190] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:11:30,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160734474] [2024-11-20 17:11:30,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:11:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:11:30,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:11:30,371 INFO L87 Difference]: Start difference. First operand 1570 states and 1963 transitions. Second operand has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:31,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:31,613 INFO L93 Difference]: Finished difference Result 1486 states and 1879 transitions. [2024-11-20 17:11:31,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 17:11:31,614 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 72 [2024-11-20 17:11:31,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:31,619 INFO L225 Difference]: With dead ends: 1486 [2024-11-20 17:11:31,619 INFO L226 Difference]: Without dead ends: 1486 [2024-11-20 17:11:31,620 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-20 17:11:31,620 INFO L432 NwaCegarLoop]: 611 mSDtfsCounter, 2272 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 1378 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2278 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 1378 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:31,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2278 Valid, 1223 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 1378 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 17:11:31,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1486 states. [2024-11-20 17:11:31,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1486 to 1213. [2024-11-20 17:11:31,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1213 states, 817 states have (on average 1.6682986536107711) internal successors, (1363), 1204 states have internal predecessors, (1363), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:31,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1213 states to 1213 states and 1395 transitions. [2024-11-20 17:11:31,643 INFO L78 Accepts]: Start accepts. Automaton has 1213 states and 1395 transitions. Word has length 72 [2024-11-20 17:11:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:31,643 INFO L471 AbstractCegarLoop]: Abstraction has 1213 states and 1395 transitions. [2024-11-20 17:11:31,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 12.0) internal successors, (72), 7 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:31,643 INFO L276 IsEmpty]: Start isEmpty. Operand 1213 states and 1395 transitions. [2024-11-20 17:11:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 17:11:31,645 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:31,645 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] [2024-11-20 17:11:31,645 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 17:11:31,645 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:31,646 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:31,646 INFO L85 PathProgramCache]: Analyzing trace with hash -954300764, now seen corresponding path program 1 times [2024-11-20 17:11:31,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:31,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687194310] [2024-11-20 17:11:31,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:31,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:31,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:31,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:31,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687194310] [2024-11-20 17:11:31,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687194310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:31,880 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:31,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:11:31,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211248500] [2024-11-20 17:11:31,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:31,881 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:11:31,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:31,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:11:31,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:11:31,882 INFO L87 Difference]: Start difference. First operand 1213 states and 1395 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:32,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:32,799 INFO L93 Difference]: Finished difference Result 1212 states and 1394 transitions. [2024-11-20 17:11:32,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:11:32,799 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-20 17:11:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:32,803 INFO L225 Difference]: With dead ends: 1212 [2024-11-20 17:11:32,804 INFO L226 Difference]: Without dead ends: 1212 [2024-11-20 17:11:32,804 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:11:32,805 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 2 mSDsluCounter, 2350 mSDsCounter, 0 mSdLazyCounter, 1467 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 3620 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.9s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:32,805 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 3620 Invalid, 1468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1467 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 17:11:32,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1212 states. [2024-11-20 17:11:32,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1212 to 1212. [2024-11-20 17:11:32,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 817 states have (on average 1.6670746634026927) internal successors, (1362), 1203 states have internal predecessors, (1362), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:32,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-20 17:11:32,821 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 77 [2024-11-20 17:11:32,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:32,821 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-20 17:11:32,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:32,822 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-20 17:11:32,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-20 17:11:32,822 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:32,823 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] [2024-11-20 17:11:32,823 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 17:11:32,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr67REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:32,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:32,823 INFO L85 PathProgramCache]: Analyzing trace with hash -954300763, now seen corresponding path program 1 times [2024-11-20 17:11:32,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:32,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772797350] [2024-11-20 17:11:32,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:32,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:32,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:33,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:33,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:33,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772797350] [2024-11-20 17:11:33,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772797350] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:33,185 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:33,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 17:11:33,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856124532] [2024-11-20 17:11:33,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:33,185 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 17:11:33,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:33,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 17:11:33,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 17:11:33,186 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:34,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:34,176 INFO L93 Difference]: Finished difference Result 1211 states and 1393 transitions. [2024-11-20 17:11:34,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:11:34,177 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 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 77 [2024-11-20 17:11:34,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:34,182 INFO L225 Difference]: With dead ends: 1211 [2024-11-20 17:11:34,182 INFO L226 Difference]: Without dead ends: 1211 [2024-11-20 17:11:34,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 17:11:34,183 INFO L432 NwaCegarLoop]: 1270 mSDtfsCounter, 1 mSDsluCounter, 2365 mSDsCounter, 0 mSdLazyCounter, 1449 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 3635 SdHoareTripleChecker+Invalid, 1450 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:34,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 3635 Invalid, 1450 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1449 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-20 17:11:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1211 states. [2024-11-20 17:11:34,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1211 to 1211. [2024-11-20 17:11:34,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1211 states, 816 states have (on average 1.6678921568627452) internal successors, (1361), 1202 states have internal predecessors, (1361), 16 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:34,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1211 states to 1211 states and 1393 transitions. [2024-11-20 17:11:34,200 INFO L78 Accepts]: Start accepts. Automaton has 1211 states and 1393 transitions. Word has length 77 [2024-11-20 17:11:34,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:34,200 INFO L471 AbstractCegarLoop]: Abstraction has 1211 states and 1393 transitions. [2024-11-20 17:11:34,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 17:11:34,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1211 states and 1393 transitions. [2024-11-20 17:11:34,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-20 17:11:34,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:34,201 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] [2024-11-20 17:11:34,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 17:11:34,202 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:34,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:34,202 INFO L85 PathProgramCache]: Analyzing trace with hash 144891403, now seen corresponding path program 1 times [2024-11-20 17:11:34,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:34,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [306742172] [2024-11-20 17:11:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:34,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:34,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:34,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:34,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:34,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:34,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [306742172] [2024-11-20 17:11:34,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [306742172] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:34,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:34,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:11:34,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330803212] [2024-11-20 17:11:34,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:34,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:11:34,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:34,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:11:34,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:11:34,443 INFO L87 Difference]: Start difference. First operand 1211 states and 1393 transitions. Second operand has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-20 17:11:35,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:35,888 INFO L93 Difference]: Finished difference Result 1223 states and 1411 transitions. [2024-11-20 17:11:35,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 17:11:35,889 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-20 17:11:35,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:35,894 INFO L225 Difference]: With dead ends: 1223 [2024-11-20 17:11:35,894 INFO L226 Difference]: Without dead ends: 1223 [2024-11-20 17:11:35,894 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 17:11:35,895 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 16 mSDsluCounter, 4251 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 5504 SdHoareTripleChecker+Invalid, 2124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:35,895 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 5504 Invalid, 2124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-20 17:11:35,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-20 17:11:35,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1217. [2024-11-20 17:11:35,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.66626065773447) internal successors, (1368), 1207 states have internal predecessors, (1368), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-20 17:11:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1406 transitions. [2024-11-20 17:11:35,916 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1406 transitions. Word has length 85 [2024-11-20 17:11:35,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:35,916 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1406 transitions. [2024-11-20 17:11:35,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 16.6) internal successors, (83), 6 states have internal predecessors, (83), 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-20 17:11:35,917 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1406 transitions. [2024-11-20 17:11:35,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-11-20 17:11:35,918 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:35,918 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] [2024-11-20 17:11:35,918 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 17:11:35,918 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:35,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash 144891404, now seen corresponding path program 1 times [2024-11-20 17:11:35,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:35,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997244923] [2024-11-20 17:11:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:35,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:36,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:36,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:36,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:36,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:36,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997244923] [2024-11-20 17:11:36,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997244923] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:36,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:36,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 17:11:36,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084348188] [2024-11-20 17:11:36,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:36,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 17:11:36,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:36,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 17:11:36,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 17:11:36,416 INFO L87 Difference]: Start difference. First operand 1217 states and 1406 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-20 17:11:37,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:37,716 INFO L93 Difference]: Finished difference Result 1217 states and 1405 transitions. [2024-11-20 17:11:37,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 17:11:37,717 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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 85 [2024-11-20 17:11:37,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:37,722 INFO L225 Difference]: With dead ends: 1217 [2024-11-20 17:11:37,722 INFO L226 Difference]: Without dead ends: 1217 [2024-11-20 17:11:37,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 17:11:37,723 INFO L432 NwaCegarLoop]: 1260 mSDtfsCounter, 17 mSDsluCounter, 3348 mSDsCounter, 0 mSdLazyCounter, 1727 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 4608 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 1727 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:37,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 4608 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 1727 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-20 17:11:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1217 states. [2024-11-20 17:11:37,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1217 to 1217. [2024-11-20 17:11:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1217 states, 821 states have (on average 1.6650426309378807) internal successors, (1367), 1207 states have internal predecessors, (1367), 16 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (22), 8 states have call predecessors, (22), 16 states have call successors, (22) [2024-11-20 17:11:37,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1217 states to 1217 states and 1405 transitions. [2024-11-20 17:11:37,743 INFO L78 Accepts]: Start accepts. Automaton has 1217 states and 1405 transitions. Word has length 85 [2024-11-20 17:11:37,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:37,743 INFO L471 AbstractCegarLoop]: Abstraction has 1217 states and 1405 transitions. [2024-11-20 17:11:37,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 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-20 17:11:37,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1217 states and 1405 transitions. [2024-11-20 17:11:37,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-20 17:11:37,744 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:37,744 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-20 17:11:37,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 17:11:37,744 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr70REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:37,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:37,744 INFO L85 PathProgramCache]: Analyzing trace with hash 353126907, now seen corresponding path program 1 times [2024-11-20 17:11:37,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:37,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15439525] [2024-11-20 17:11:37,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:37,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:37,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:38,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:38,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:38,240 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-20 17:11:38,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15439525] [2024-11-20 17:11:38,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15439525] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:38,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369095988] [2024-11-20 17:11:38,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:38,241 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:11:38,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:11:38,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:11:38,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 17:11:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:38,463 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-20 17:11:38,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:11:38,633 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 17:11:38,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 17:11:38,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:11:38,757 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-20 17:11:38,921 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:11:38,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:11:38,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 17:11:39,000 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-20 17:11:39,000 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:11:39,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_506) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-20 17:11:39,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369095988] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:39,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:11:39,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-20 17:11:39,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128707443] [2024-11-20 17:11:39,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:11:39,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 17:11:39,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:39,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 17:11:39,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=292, Unknown=1, NotChecked=34, Total=380 [2024-11-20 17:11:39,038 INFO L87 Difference]: Start difference. First operand 1217 states and 1405 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-20 17:11:42,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:42,529 INFO L93 Difference]: Finished difference Result 1224 states and 1412 transitions. [2024-11-20 17:11:42,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:11:42,530 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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 86 [2024-11-20 17:11:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:42,534 INFO L225 Difference]: With dead ends: 1224 [2024-11-20 17:11:42,534 INFO L226 Difference]: Without dead ends: 1224 [2024-11-20 17:11:42,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 82 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=469, Unknown=1, NotChecked=44, Total=600 [2024-11-20 17:11:42,535 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1181 mSDsluCounter, 8890 mSDsCounter, 0 mSdLazyCounter, 6766 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1201 SdHoareTripleChecker+Valid, 9669 SdHoareTripleChecker+Invalid, 6801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 6766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:42,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1201 Valid, 9669 Invalid, 6801 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [35 Valid, 6766 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-20 17:11:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-20 17:11:42,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1221. [2024-11-20 17:11:42,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1221 states, 825 states have (on average 1.6618181818181819) internal successors, (1371), 1210 states have internal predecessors, (1371), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:11:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1221 states to 1221 states and 1404 transitions. [2024-11-20 17:11:42,555 INFO L78 Accepts]: Start accepts. Automaton has 1221 states and 1404 transitions. Word has length 86 [2024-11-20 17:11:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:42,555 INFO L471 AbstractCegarLoop]: Abstraction has 1221 states and 1404 transitions. [2024-11-20 17:11:42,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-20 17:11:42,555 INFO L276 IsEmpty]: Start isEmpty. Operand 1221 states and 1404 transitions. [2024-11-20 17:11:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-20 17:11:42,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:42,556 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-20 17:11:42,565 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-20 17:11:42,756 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,SelfDestructingSolverStorable14 [2024-11-20 17:11:42,757 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:42,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:42,757 INFO L85 PathProgramCache]: Analyzing trace with hash 353126908, now seen corresponding path program 1 times [2024-11-20 17:11:42,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:42,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391602783] [2024-11-20 17:11:42,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:42,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:42,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:43,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:43,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:43,503 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-20 17:11:43,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391602783] [2024-11-20 17:11:43,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391602783] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:43,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572944850] [2024-11-20 17:11:43,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:43,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:11:43,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:11:43,506 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:11:43,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 17:11:43,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:43,723 INFO L255 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-20 17:11:43,732 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:11:43,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:11:43,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 17:11:43,838 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-20 17:11:43,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 17:11:43,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:11:43,983 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-20 17:11:43,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 17:11:44,092 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:11:44,093 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 17:11:44,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-20 17:11:44,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 17:11:44,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 17:11:44,170 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-20 17:11:44,172 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:11:44,266 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_639 (Array Int Int)) (v_ArrVal_640 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 20) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_639) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))) (forall ((v_ArrVal_640 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_640) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 16))))) is different from false [2024-11-20 17:11:44,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572944850] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:44,269 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:11:44,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-20 17:11:44,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1333451515] [2024-11-20 17:11:44,269 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:11:44,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-20 17:11:44,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:44,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-20 17:11:44,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=360, Unknown=1, NotChecked=38, Total=462 [2024-11-20 17:11:44,271 INFO L87 Difference]: Start difference. First operand 1221 states and 1404 transitions. Second operand has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-20 17:11:47,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:47,615 INFO L93 Difference]: Finished difference Result 1223 states and 1411 transitions. [2024-11-20 17:11:47,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-20 17:11:47,615 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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 86 [2024-11-20 17:11:47,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:47,619 INFO L225 Difference]: With dead ends: 1223 [2024-11-20 17:11:47,620 INFO L226 Difference]: Without dead ends: 1223 [2024-11-20 17:11:47,620 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=103, Invalid=550, Unknown=1, NotChecked=48, Total=702 [2024-11-20 17:11:47,620 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 1203 mSDsluCounter, 6376 mSDsCounter, 0 mSdLazyCounter, 6740 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1223 SdHoareTripleChecker+Valid, 7161 SdHoareTripleChecker+Invalid, 6792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 6740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:47,621 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1223 Valid, 7161 Invalid, 6792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 6740 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-20 17:11:47,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1223 states. [2024-11-20 17:11:47,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1223 to 1214. [2024-11-20 17:11:47,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1214 states, 820 states have (on average 1.6634146341463414) internal successors, (1364), 1204 states have internal predecessors, (1364), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:11:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1214 states to 1214 states and 1396 transitions. [2024-11-20 17:11:47,642 INFO L78 Accepts]: Start accepts. Automaton has 1214 states and 1396 transitions. Word has length 86 [2024-11-20 17:11:47,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:47,642 INFO L471 AbstractCegarLoop]: Abstraction has 1214 states and 1396 transitions. [2024-11-20 17:11:47,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.9375) internal successors, (111), 18 states have internal predecessors, (111), 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-20 17:11:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1214 states and 1396 transitions. [2024-11-20 17:11:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 17:11:47,643 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:47,643 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] [2024-11-20 17:11:47,652 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-20 17:11:47,847 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,SelfDestructingSolverStorable15 [2024-11-20 17:11:47,850 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:47,851 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:47,851 INFO L85 PathProgramCache]: Analyzing trace with hash 18259065, now seen corresponding path program 1 times [2024-11-20 17:11:47,851 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:47,852 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497894258] [2024-11-20 17:11:47,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:47,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:48,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:48,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:48,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:48,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:48,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497894258] [2024-11-20 17:11:48,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497894258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:48,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:48,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 17:11:48,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241323061] [2024-11-20 17:11:48,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:48,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 17:11:48,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:48,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 17:11:48,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-20 17:11:48,338 INFO L87 Difference]: Start difference. First operand 1214 states and 1396 transitions. Second operand has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-20 17:11:50,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:50,437 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-20 17:11:50,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 17:11:50,437 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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 88 [2024-11-20 17:11:50,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:50,445 INFO L225 Difference]: With dead ends: 1227 [2024-11-20 17:11:50,445 INFO L226 Difference]: Without dead ends: 1227 [2024-11-20 17:11:50,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2024-11-20 17:11:50,446 INFO L432 NwaCegarLoop]: 779 mSDtfsCounter, 1199 mSDsluCounter, 5951 mSDsCounter, 0 mSdLazyCounter, 4715 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 6730 SdHoareTripleChecker+Invalid, 4746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 4715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:50,446 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 6730 Invalid, 4746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 4715 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-20 17:11:50,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-20 17:11:50,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1223. [2024-11-20 17:11:50,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 828 states have (on average 1.6594202898550725) internal successors, (1374), 1212 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:11:50,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1407 transitions. [2024-11-20 17:11:50,464 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1407 transitions. Word has length 88 [2024-11-20 17:11:50,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:50,465 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1407 transitions. [2024-11-20 17:11:50,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 7.166666666666667) internal successors, (86), 13 states have internal predecessors, (86), 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-20 17:11:50,465 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1407 transitions. [2024-11-20 17:11:50,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-11-20 17:11:50,466 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:50,466 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] [2024-11-20 17:11:50,466 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-20 17:11:50,466 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:50,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash 18259066, now seen corresponding path program 1 times [2024-11-20 17:11:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354237911] [2024-11-20 17:11:50,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:50,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:51,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:51,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:11:51,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:51,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354237911] [2024-11-20 17:11:51,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354237911] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:11:51,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:11:51,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-20 17:11:51,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980224375] [2024-11-20 17:11:51,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:11:51,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-20 17:11:51,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:51,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-20 17:11:51,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-20 17:11:51,232 INFO L87 Difference]: Start difference. First operand 1223 states and 1407 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-20 17:11:53,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:53,416 INFO L93 Difference]: Finished difference Result 1226 states and 1414 transitions. [2024-11-20 17:11:53,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 17:11:53,417 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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 88 [2024-11-20 17:11:53,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:53,420 INFO L225 Difference]: With dead ends: 1226 [2024-11-20 17:11:53,420 INFO L226 Difference]: Without dead ends: 1226 [2024-11-20 17:11:53,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=191, Unknown=0, NotChecked=0, Total=240 [2024-11-20 17:11:53,421 INFO L432 NwaCegarLoop]: 786 mSDtfsCounter, 1199 mSDsluCounter, 3783 mSDsCounter, 0 mSdLazyCounter, 4324 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1219 SdHoareTripleChecker+Valid, 4569 SdHoareTripleChecker+Invalid, 4368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 4324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:53,421 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1219 Valid, 4569 Invalid, 4368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 4324 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-20 17:11:53,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-20 17:11:53,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1223. [2024-11-20 17:11:53,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 828 states have (on average 1.6582125603864735) internal successors, (1373), 1212 states have internal predecessors, (1373), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:11:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1406 transitions. [2024-11-20 17:11:53,437 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1406 transitions. Word has length 88 [2024-11-20 17:11:53,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:53,438 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1406 transitions. [2024-11-20 17:11:53,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 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-20 17:11:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1406 transitions. [2024-11-20 17:11:53,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 17:11:53,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:53,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 17:11:53,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-20 17:11:53,439 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr74REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:53,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:53,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1629383305, now seen corresponding path program 1 times [2024-11-20 17:11:53,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:53,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1232327327] [2024-11-20 17:11:53,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:53,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:53,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:53,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:53,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:53,925 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-20 17:11:53,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:53,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1232327327] [2024-11-20 17:11:53,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1232327327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:53,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765330846] [2024-11-20 17:11:53,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:53,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:11:53,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:11:53,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:11:53,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 17:11:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:54,145 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 17:11:54,150 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:11:54,241 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 17:11:54,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 17:11:54,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:11:54,348 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-20 17:11:54,472 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:11:54,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:11:54,556 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:11:54,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:11:54,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 17:11:54,604 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-20 17:11:54,604 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:11:54,614 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_894 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_894) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-20 17:11:54,674 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_897 (Array Int Int)) (v_ArrVal_894 (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$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_897))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_894)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:11:54,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765330846] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:54,675 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:11:54,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 20 [2024-11-20 17:11:54,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682617566] [2024-11-20 17:11:54,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:11:54,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-11-20 17:11:54,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:54,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-11-20 17:11:54,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=385, Unknown=10, NotChecked=82, Total=552 [2024-11-20 17:11:54,677 INFO L87 Difference]: Start difference. First operand 1223 states and 1406 transitions. Second operand has 21 states, 18 states have (on average 6.5) internal successors, (117), 20 states have internal predecessors, (117), 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-20 17:11:57,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:11:57,643 INFO L93 Difference]: Finished difference Result 1225 states and 1413 transitions. [2024-11-20 17:11:57,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-20 17:11:57,644 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 6.5) internal successors, (117), 20 states have internal predecessors, (117), 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 89 [2024-11-20 17:11:57,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:11:57,647 INFO L225 Difference]: With dead ends: 1225 [2024-11-20 17:11:57,647 INFO L226 Difference]: Without dead ends: 1225 [2024-11-20 17:11:57,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 86 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=91, Invalid=459, Unknown=10, NotChecked=90, Total=650 [2024-11-20 17:11:57,648 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1184 mSDsluCounter, 8911 mSDsCounter, 0 mSdLazyCounter, 6684 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1204 SdHoareTripleChecker+Valid, 9695 SdHoareTripleChecker+Invalid, 6713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-20 17:11:57,649 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1204 Valid, 9695 Invalid, 6713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6684 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-20 17:11:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-20 17:11:57,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1222. [2024-11-20 17:11:57,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1222 states, 828 states have (on average 1.6570048309178744) internal successors, (1372), 1211 states have internal predecessors, (1372), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:11:57,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1222 states to 1222 states and 1405 transitions. [2024-11-20 17:11:57,666 INFO L78 Accepts]: Start accepts. Automaton has 1222 states and 1405 transitions. Word has length 89 [2024-11-20 17:11:57,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:11:57,666 INFO L471 AbstractCegarLoop]: Abstraction has 1222 states and 1405 transitions. [2024-11-20 17:11:57,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 6.5) internal successors, (117), 20 states have internal predecessors, (117), 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-20 17:11:57,667 INFO L276 IsEmpty]: Start isEmpty. Operand 1222 states and 1405 transitions. [2024-11-20 17:11:57,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2024-11-20 17:11:57,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:11:57,668 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-20 17:11:57,677 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-20 17:11:57,871 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:11:57,872 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:11:57,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:11:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 1629383306, now seen corresponding path program 1 times [2024-11-20 17:11:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:11:57,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783726288] [2024-11-20 17:11:57,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:57,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:11:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:58,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:11:58,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:58,726 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-20 17:11:58,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:11:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783726288] [2024-11-20 17:11:58,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783726288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:58,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799478072] [2024-11-20 17:11:58,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:11:58,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:11:58,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:11:58,729 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:11:58,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 17:11:58,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:11:58,950 INFO L255 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-20 17:11:58,954 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:11:59,050 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:11:59,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 17:11:59,059 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-20 17:11:59,067 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 17:11:59,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:11:59,114 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-20 17:11:59,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 17:11:59,228 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:11:59,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 17:11:59,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-20 17:11:59,317 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:11:59,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 17:11:59,322 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-20 17:11:59,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 17:11:59,345 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 17:11:59,350 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-20 17:11:59,350 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:11:59,503 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1)))) (forall ((v_ArrVal_1039 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 4)))))) is different from false [2024-11-20 17:11:59,553 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1044) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1045) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 4))) (forall ((v_ArrVal_1039 (Array Int Int)) (v_ArrVal_1038 (Array Int Int)) (v_ArrVal_1045 (Array Int Int)) (v_ArrVal_1044 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1045))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1044) .cse1 v_ArrVal_1039) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1038) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-20 17:11:59,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799478072] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:11:59,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:11:59,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 10] total 16 [2024-11-20 17:11:59,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662983148] [2024-11-20 17:11:59,554 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:11:59,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 17:11:59,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:11:59,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 17:11:59,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=319, Unknown=9, NotChecked=74, Total=462 [2024-11-20 17:11:59,556 INFO L87 Difference]: Start difference. First operand 1222 states and 1405 transitions. Second operand has 17 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 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-20 17:12:03,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:12:03,407 INFO L93 Difference]: Finished difference Result 1224 states and 1412 transitions. [2024-11-20 17:12:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:12:03,408 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 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 89 [2024-11-20 17:12:03,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:12:03,411 INFO L225 Difference]: With dead ends: 1224 [2024-11-20 17:12:03,411 INFO L226 Difference]: Without dead ends: 1224 [2024-11-20 17:12:03,411 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 87 SyntacticMatches, 2 SemanticMatches, 28 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=640, Unknown=9, NotChecked=106, Total=870 [2024-11-20 17:12:03,412 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1175 mSDsluCounter, 6725 mSDsCounter, 0 mSdLazyCounter, 7689 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1195 SdHoareTripleChecker+Valid, 7502 SdHoareTripleChecker+Invalid, 7724 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 7689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-20 17:12:03,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1195 Valid, 7502 Invalid, 7724 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 7689 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-20 17:12:03,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2024-11-20 17:12:03,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1212. [2024-11-20 17:12:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 820 states have (on average 1.6609756097560975) internal successors, (1362), 1202 states have internal predecessors, (1362), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:12:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1394 transitions. [2024-11-20 17:12:03,430 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1394 transitions. Word has length 89 [2024-11-20 17:12:03,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:12:03,431 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1394 transitions. [2024-11-20 17:12:03,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 7.266666666666667) internal successors, (109), 16 states have internal predecessors, (109), 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-20 17:12:03,431 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1394 transitions. [2024-11-20 17:12:03,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 17:12:03,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:12:03,432 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] [2024-11-20 17:12:03,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 17:12:03,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:12:03,633 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:12:03,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:12:03,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1504429454, now seen corresponding path program 1 times [2024-11-20 17:12:03,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:12:03,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190165716] [2024-11-20 17:12:03,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:03,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:12:03,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:04,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:12:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:04,230 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:12:04,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:12:04,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190165716] [2024-11-20 17:12:04,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190165716] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:12:04,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:12:04,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-20 17:12:04,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710123146] [2024-11-20 17:12:04,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:12:04,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-20 17:12:04,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:12:04,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-20 17:12:04,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2024-11-20 17:12:04,233 INFO L87 Difference]: Start difference. First operand 1212 states and 1394 transitions. Second operand has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-20 17:12:06,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:12:06,851 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-20 17:12:06,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:12:06,852 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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 91 [2024-11-20 17:12:06,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:12:06,855 INFO L225 Difference]: With dead ends: 1228 [2024-11-20 17:12:06,855 INFO L226 Difference]: Without dead ends: 1228 [2024-11-20 17:12:06,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=98, Invalid=454, Unknown=0, NotChecked=0, Total=552 [2024-11-20 17:12:06,856 INFO L432 NwaCegarLoop]: 778 mSDtfsCounter, 1202 mSDsluCounter, 8132 mSDsCounter, 0 mSdLazyCounter, 6237 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1222 SdHoareTripleChecker+Valid, 8910 SdHoareTripleChecker+Invalid, 6268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 6237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:12:06,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1222 Valid, 8910 Invalid, 6268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 6237 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 17:12:06,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-20 17:12:06,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1224. [2024-11-20 17:12:06,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.654632972322503) internal successors, (1375), 1213 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:12:06,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1408 transitions. [2024-11-20 17:12:06,874 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1408 transitions. Word has length 91 [2024-11-20 17:12:06,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:12:06,874 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1408 transitions. [2024-11-20 17:12:06,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.846153846153846) internal successors, (89), 14 states have internal predecessors, (89), 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-20 17:12:06,874 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1408 transitions. [2024-11-20 17:12:06,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-20 17:12:06,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:12:06,875 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] [2024-11-20 17:12:06,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-20 17:12:06,876 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:12:06,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:12:06,876 INFO L85 PathProgramCache]: Analyzing trace with hash -1504429453, now seen corresponding path program 1 times [2024-11-20 17:12:06,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:12:06,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900054775] [2024-11-20 17:12:06,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:06,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:12:06,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:07,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:12:07,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:07,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:12:07,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:12:07,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900054775] [2024-11-20 17:12:07,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900054775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:12:07,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:12:07,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-20 17:12:07,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243609689] [2024-11-20 17:12:07,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:12:07,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 17:12:07,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:12:07,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 17:12:07,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=126, Unknown=0, NotChecked=0, Total=156 [2024-11-20 17:12:07,622 INFO L87 Difference]: Start difference. First operand 1224 states and 1408 transitions. Second operand has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-20 17:12:10,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:12:10,593 INFO L93 Difference]: Finished difference Result 1227 states and 1415 transitions. [2024-11-20 17:12:10,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 17:12:10,594 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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 91 [2024-11-20 17:12:10,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:12:10,596 INFO L225 Difference]: With dead ends: 1227 [2024-11-20 17:12:10,596 INFO L226 Difference]: Without dead ends: 1227 [2024-11-20 17:12:10,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=246, Unknown=0, NotChecked=0, Total=306 [2024-11-20 17:12:10,597 INFO L432 NwaCegarLoop]: 785 mSDtfsCounter, 1194 mSDsluCounter, 6376 mSDsCounter, 0 mSdLazyCounter, 6690 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1214 SdHoareTripleChecker+Valid, 7161 SdHoareTripleChecker+Invalid, 6719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 6690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-20 17:12:10,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1214 Valid, 7161 Invalid, 6719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 6690 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-20 17:12:10,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2024-11-20 17:12:10,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1224. [2024-11-20 17:12:10,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1224 states, 831 states have (on average 1.6534296028880866) internal successors, (1374), 1213 states have internal predecessors, (1374), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:12:10,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1224 states to 1224 states and 1407 transitions. [2024-11-20 17:12:10,619 INFO L78 Accepts]: Start accepts. Automaton has 1224 states and 1407 transitions. Word has length 91 [2024-11-20 17:12:10,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:12:10,620 INFO L471 AbstractCegarLoop]: Abstraction has 1224 states and 1407 transitions. [2024-11-20 17:12:10,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.416666666666667) internal successors, (89), 12 states have internal predecessors, (89), 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-20 17:12:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 1224 states and 1407 transitions. [2024-11-20 17:12:10,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 17:12:10,621 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:12:10,622 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-20 17:12:10,622 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-20 17:12:10,622 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:12:10,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:12:10,622 INFO L85 PathProgramCache]: Analyzing trace with hash -761728414, now seen corresponding path program 1 times [2024-11-20 17:12:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:12:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930201609] [2024-11-20 17:12:10,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:10,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:12:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:11,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:12:11,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:11,197 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-20 17:12:11,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:12:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930201609] [2024-11-20 17:12:11,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930201609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:12:11,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1065930228] [2024-11-20 17:12:11,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:11,197 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:12:11,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:12:11,200 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 17:12:11,201 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-20 17:12:11,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:11,448 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-11-20 17:12:11,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:12:11,546 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 17:12:11,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 17:12:11,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:12:11,661 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-20 17:12:11,796 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:11,796 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:12:11,884 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:11,885 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:12:11,933 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:11,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:12:11,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 17:12:11,976 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-20 17:12:11,976 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:12:11,984 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1324) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-20 17:12:11,988 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (select (select (store |c_#memory_$Pointer$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1324) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) 1)) is different from false [2024-11-20 17:12:11,995 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (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$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1324)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:12:11,999 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (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$#0.base| (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1324)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:12:12,022 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1327 (Array Int Int)) (v_ArrVal_1324 (Array Int Int)) (v_ArrVal_1323 (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$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1327))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1323)))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1324)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false [2024-11-20 17:12:12,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1065930228] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:12:12,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:12:12,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 23 [2024-11-20 17:12:12,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707343292] [2024-11-20 17:12:12,025 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:12:12,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-20 17:12:12,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:12:12,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-20 17:12:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=476, Unknown=5, NotChecked=240, Total=812 [2024-11-20 17:12:12,027 INFO L87 Difference]: Start difference. First operand 1224 states and 1407 transitions. Second operand has 24 states, 21 states have (on average 5.857142857142857) internal successors, (123), 23 states have internal predecessors, (123), 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-20 17:12:15,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:12:15,168 INFO L93 Difference]: Finished difference Result 1226 states and 1414 transitions. [2024-11-20 17:12:15,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 17:12:15,168 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 21 states have (on average 5.857142857142857) internal successors, (123), 23 states have internal predecessors, (123), 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 92 [2024-11-20 17:12:15,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:12:15,171 INFO L225 Difference]: With dead ends: 1226 [2024-11-20 17:12:15,171 INFO L226 Difference]: Without dead ends: 1226 [2024-11-20 17:12:15,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 89 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=118, Invalid=653, Unknown=5, NotChecked=280, Total=1056 [2024-11-20 17:12:15,172 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1187 mSDsluCounter, 8886 mSDsCounter, 0 mSdLazyCounter, 6764 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1207 SdHoareTripleChecker+Valid, 9663 SdHoareTripleChecker+Invalid, 6797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 6764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-20 17:12:15,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1207 Valid, 9663 Invalid, 6797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 6764 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-20 17:12:15,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1226 states. [2024-11-20 17:12:15,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1226 to 1223. [2024-11-20 17:12:15,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1223 states, 831 states have (on average 1.6522262334536704) internal successors, (1373), 1212 states have internal predecessors, (1373), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:12:15,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1223 states to 1223 states and 1406 transitions. [2024-11-20 17:12:15,186 INFO L78 Accepts]: Start accepts. Automaton has 1223 states and 1406 transitions. Word has length 92 [2024-11-20 17:12:15,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:12:15,186 INFO L471 AbstractCegarLoop]: Abstraction has 1223 states and 1406 transitions. [2024-11-20 17:12:15,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 21 states have (on average 5.857142857142857) internal successors, (123), 23 states have internal predecessors, (123), 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-20 17:12:15,187 INFO L276 IsEmpty]: Start isEmpty. Operand 1223 states and 1406 transitions. [2024-11-20 17:12:15,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2024-11-20 17:12:15,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:12:15,188 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-20 17:12:15,198 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-20 17:12:15,388 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,SelfDestructingSolverStorable22 [2024-11-20 17:12:15,389 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:12:15,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:12:15,389 INFO L85 PathProgramCache]: Analyzing trace with hash -761728413, now seen corresponding path program 1 times [2024-11-20 17:12:15,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:12:15,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794962223] [2024-11-20 17:12:15,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:15,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:12:15,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:16,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:12:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:16,210 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-20 17:12:16,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:12:16,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [794962223] [2024-11-20 17:12:16,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [794962223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:12:16,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1270422114] [2024-11-20 17:12:16,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:16,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:12:16,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:12:16,212 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-20 17:12:16,213 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-20 17:12:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:16,458 INFO L255 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-20 17:12:16,462 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:12:16,550 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-20 17:12:16,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-20 17:12:16,556 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-20 17:12:16,580 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-20 17:12:16,585 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:12:16,661 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-20 17:12:16,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 17:12:16,757 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:16,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 17:12:16,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-20 17:12:16,822 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:16,823 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 17:12:16,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-20 17:12:16,874 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:16,874 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-20 17:12:16,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-20 17:12:16,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 17:12:16,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-20 17:12:16,922 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-20 17:12:16,923 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:12:16,976 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1482 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))) is different from false [2024-11-20 17:12:16,987 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$#0.base| |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1482 (Array Int Int))) (<= 0 (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 8))) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) 12) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))))))) is different from false [2024-11-20 17:12:17,010 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (<= 0 (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1480) (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 8))) (forall ((v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse2 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1481))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~user~0#1.base|) .cse0))) (<= (+ (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem52#1.base| v_ArrVal_1480) .cse1 v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0) 12) (select |c_#length| (select (select (store .cse2 .cse1 v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse0)))))))) is different from false [2024-11-20 17:12:17,129 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) (and (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1483 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1488))) (let ((.cse0 (select (select .cse4 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (let ((.cse3 (store .cse4 .cse0 v_ArrVal_1481))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (<= (+ 12 (select (select (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1489) .cse0 v_ArrVal_1480) .cse1 v_ArrVal_1482) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_1483) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))))) (forall ((v_ArrVal_1489 (Array Int Int)) (v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1482 (Array Int Int)) (v_ArrVal_1481 (Array Int Int)) (v_ArrVal_1480 (Array Int Int))) (<= 0 (+ 8 (select (select (let ((.cse6 (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1488))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_main_~user~0#1.base|) .cse2))) (store (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_#t~mem50#1.base| v_ArrVal_1489) .cse5 v_ArrVal_1480) (select (select (store .cse6 .cse5 v_ArrVal_1481) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2) v_ArrVal_1482))) |c_ULTIMATE.start_main_~user~0#1.base|) .cse2)))))) is different from false [2024-11-20 17:12:17,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1270422114] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:12:17,131 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 17:12:17,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11] total 22 [2024-11-20 17:12:17,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58872928] [2024-11-20 17:12:17,131 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 17:12:17,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-20 17:12:17,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:12:17,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-20 17:12:17,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=556, Unknown=11, NotChecked=204, Total=870 [2024-11-20 17:12:17,133 INFO L87 Difference]: Start difference. First operand 1223 states and 1406 transitions. Second operand has 23 states, 20 states have (on average 6.15) internal successors, (123), 22 states have internal predecessors, (123), 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-20 17:12:19,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:12:19,591 INFO L93 Difference]: Finished difference Result 1225 states and 1413 transitions. [2024-11-20 17:12:19,591 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-20 17:12:19,591 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 6.15) internal successors, (123), 22 states have internal predecessors, (123), 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 92 [2024-11-20 17:12:19,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:12:19,594 INFO L225 Difference]: With dead ends: 1225 [2024-11-20 17:12:19,594 INFO L226 Difference]: Without dead ends: 1225 [2024-11-20 17:12:19,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 88 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 250 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=164, Invalid=897, Unknown=11, NotChecked=260, Total=1332 [2024-11-20 17:12:19,597 INFO L432 NwaCegarLoop]: 783 mSDtfsCounter, 1197 mSDsluCounter, 4358 mSDsCounter, 0 mSdLazyCounter, 5042 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 5141 SdHoareTripleChecker+Invalid, 5093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 5042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-20 17:12:19,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 5141 Invalid, 5093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 5042 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-20 17:12:19,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1225 states. [2024-11-20 17:12:19,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1225 to 1210. [2024-11-20 17:12:19,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1210 states, 820 states have (on average 1.6585365853658536) internal successors, (1360), 1200 states have internal predecessors, (1360), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (16), 7 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-20 17:12:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1210 states to 1210 states and 1392 transitions. [2024-11-20 17:12:19,617 INFO L78 Accepts]: Start accepts. Automaton has 1210 states and 1392 transitions. Word has length 92 [2024-11-20 17:12:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:12:19,618 INFO L471 AbstractCegarLoop]: Abstraction has 1210 states and 1392 transitions. [2024-11-20 17:12:19,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 6.15) internal successors, (123), 22 states have internal predecessors, (123), 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-20 17:12:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1210 states and 1392 transitions. [2024-11-20 17:12:19,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 17:12:19,619 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:12:19,619 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] [2024-11-20 17:12:19,630 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-20 17:12:19,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:12:19,820 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:12:19,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:12:19,821 INFO L85 PathProgramCache]: Analyzing trace with hash -473511680, now seen corresponding path program 1 times [2024-11-20 17:12:19,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:12:19,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362602715] [2024-11-20 17:12:19,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:19,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:12:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:12:20,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:20,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:12:20,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:12:20,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [362602715] [2024-11-20 17:12:20,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [362602715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:12:20,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:12:20,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-11-20 17:12:20,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613695330] [2024-11-20 17:12:20,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:12:20,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-20 17:12:20,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:12:20,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-20 17:12:20,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=199, Unknown=0, NotChecked=0, Total=240 [2024-11-20 17:12:20,443 INFO L87 Difference]: Start difference. First operand 1210 states and 1392 transitions. Second operand has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-20 17:12:23,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:12:23,005 INFO L93 Difference]: Finished difference Result 1229 states and 1417 transitions. [2024-11-20 17:12:23,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 17:12:23,006 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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 94 [2024-11-20 17:12:23,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:12:23,008 INFO L225 Difference]: With dead ends: 1229 [2024-11-20 17:12:23,008 INFO L226 Difference]: Without dead ends: 1229 [2024-11-20 17:12:23,008 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=112, Invalid=538, Unknown=0, NotChecked=0, Total=650 [2024-11-20 17:12:23,009 INFO L432 NwaCegarLoop]: 777 mSDtfsCounter, 1179 mSDsluCounter, 7385 mSDsCounter, 0 mSdLazyCounter, 5778 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1199 SdHoareTripleChecker+Valid, 8162 SdHoareTripleChecker+Invalid, 5808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 5778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-20 17:12:23,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1199 Valid, 8162 Invalid, 5808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 5778 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-20 17:12:23,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1229 states. [2024-11-20 17:12:23,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1229 to 1225. [2024-11-20 17:12:23,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6498800959232613) internal successors, (1376), 1214 states have internal predecessors, (1376), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:12:23,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1409 transitions. [2024-11-20 17:12:23,025 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1409 transitions. Word has length 94 [2024-11-20 17:12:23,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:12:23,025 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1409 transitions. [2024-11-20 17:12:23,026 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 6.571428571428571) internal successors, (92), 15 states have internal predecessors, (92), 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-20 17:12:23,026 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1409 transitions. [2024-11-20 17:12:23,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-20 17:12:23,027 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:12:23,027 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] [2024-11-20 17:12:23,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-11-20 17:12:23,027 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr83REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:12:23,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:12:23,029 INFO L85 PathProgramCache]: Analyzing trace with hash -473511679, now seen corresponding path program 1 times [2024-11-20 17:12:23,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:12:23,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291911455] [2024-11-20 17:12:23,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:23,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:12:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:23,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:12:23,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:23,905 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 17:12:23,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:12:23,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291911455] [2024-11-20 17:12:23,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291911455] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 17:12:23,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 17:12:23,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-20 17:12:23,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971061266] [2024-11-20 17:12:23,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 17:12:23,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 17:12:23,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 17:12:23,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 17:12:23,908 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-11-20 17:12:23,909 INFO L87 Difference]: Start difference. First operand 1225 states and 1409 transitions. Second operand has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-20 17:12:26,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 17:12:26,759 INFO L93 Difference]: Finished difference Result 1228 states and 1416 transitions. [2024-11-20 17:12:26,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 17:12:26,760 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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 94 [2024-11-20 17:12:26,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 17:12:26,761 INFO L225 Difference]: With dead ends: 1228 [2024-11-20 17:12:26,761 INFO L226 Difference]: Without dead ends: 1228 [2024-11-20 17:12:26,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=309, Unknown=0, NotChecked=0, Total=380 [2024-11-20 17:12:26,762 INFO L432 NwaCegarLoop]: 784 mSDtfsCounter, 1201 mSDsluCounter, 5629 mSDsCounter, 0 mSdLazyCounter, 6188 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1221 SdHoareTripleChecker+Valid, 6413 SdHoareTripleChecker+Invalid, 6232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 6188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-20 17:12:26,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1221 Valid, 6413 Invalid, 6232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 6188 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-20 17:12:26,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1228 states. [2024-11-20 17:12:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1228 to 1225. [2024-11-20 17:12:26,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1225 states, 834 states have (on average 1.6486810551558753) internal successors, (1375), 1214 states have internal predecessors, (1375), 16 states have call successors, (16), 3 states have call predecessors, (16), 4 states have return successors, (17), 8 states have call predecessors, (17), 16 states have call successors, (17) [2024-11-20 17:12:26,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1225 states to 1225 states and 1408 transitions. [2024-11-20 17:12:26,773 INFO L78 Accepts]: Start accepts. Automaton has 1225 states and 1408 transitions. Word has length 94 [2024-11-20 17:12:26,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 17:12:26,774 INFO L471 AbstractCegarLoop]: Abstraction has 1225 states and 1408 transitions. [2024-11-20 17:12:26,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.076923076923077) internal successors, (92), 13 states have internal predecessors, (92), 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-20 17:12:26,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1225 states and 1408 transitions. [2024-11-20 17:12:26,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-20 17:12:26,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 17:12:26,775 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-20 17:12:26,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-20 17:12:26,775 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr82REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 625 more)] === [2024-11-20 17:12:26,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 17:12:26,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1956629264, now seen corresponding path program 1 times [2024-11-20 17:12:26,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 17:12:26,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719013256] [2024-11-20 17:12:26,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:26,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 17:12:26,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:27,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-20 17:12:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:27,389 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-20 17:12:27,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 17:12:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719013256] [2024-11-20 17:12:27,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719013256] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 17:12:27,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105599994] [2024-11-20 17:12:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 17:12:27,390 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 17:12:27,390 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 17:12:27,393 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-20 17:12:27,394 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-20 17:12:27,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 17:12:27,665 INFO L255 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 17:12:27,669 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 17:12:27,757 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-20 17:12:27,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-20 17:12:27,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-20 17:12:27,872 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-20 17:12:27,995 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:27,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:12:28,080 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:28,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:12:28,124 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:28,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:12:28,172 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-20 17:12:28,172 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2024-11-20 17:12:28,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-20 17:12:28,209 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-20 17:12:28,210 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 17:12:28,216 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1793 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_#t~mem54#1.base| v_ArrVal_1793) |c_ULTIMATE.start_main_~user~0#1.base|) (+ |c_ULTIMATE.start_main_~user~0#1.offset| 8))) 1)) is different from false [2024-11-20 17:12:28,255 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1793 (Array Int Int)) (v_ArrVal_1792 (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$#0.base| |c_ULTIMATE.start_main_#t~mem53#1.base| v_ArrVal_1792))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~user~0#1.base|) .cse1) v_ArrVal_1793)) |c_ULTIMATE.start_main_~user~0#1.base|) .cse1))) 1)) is different from false