./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/busybox-1.22.0/basename-1.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:55:45,283 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:55:45,321 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-19 08:55:45,324 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:55:45,325 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:55:45,341 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:55:45,342 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:55:45,342 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:55:45,342 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:55:45,343 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:55:45,343 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:55:45,343 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:55:45,344 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:55:45,344 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:55:45,344 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:55:45,345 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:55:45,345 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:55:45,345 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:55:45,345 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:55:45,346 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:55:45,346 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:55:45,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:55:45,352 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:55:45,352 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:55:45,352 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:55:45,352 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:55:45,352 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:55:45,353 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:55:45,353 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:55:45,353 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:55:45,353 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:55:45,353 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:55:45,354 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:55:45,354 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 08:55:45,354 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 08:55:45,354 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:55:45,354 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:55:45,354 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:55:45,355 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:55:45,355 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2024-11-19 08:55:45,584 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:55:45,616 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:55:45,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:55:45,619 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:55:45,620 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:55:45,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-19 08:55:47,264 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:55:47,533 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:55:47,537 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-19 08:55:47,561 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b362c8e2e/67cd9ed2c7be49118c4b581be3231038/FLAG8946e2de8 [2024-11-19 08:55:47,813 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b362c8e2e/67cd9ed2c7be49118c4b581be3231038 [2024-11-19 08:55:47,815 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:55:47,816 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:55:47,817 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:55:47,817 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:55:47,821 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:55:47,822 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:55:47" (1/1) ... [2024-11-19 08:55:47,822 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@95fe3c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:47, skipping insertion in model container [2024-11-19 08:55:47,822 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:55:47" (1/1) ... [2024-11-19 08:55:47,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:55:48,383 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-19 08:55:48,403 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-19 08:55:48,414 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-19 08:55:48,421 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-19 08:55:48,425 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-19 08:55:48,432 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-19 08:55:48,433 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-19 08:55:48,433 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-19 08:55:48,435 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-19 08:55:48,439 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-19 08:55:48,458 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-19 08:55:48,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:55:48,515 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 08:55:48,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:55:48,906 INFO L204 MainTranslator]: Completed translation [2024-11-19 08:55:48,910 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48 WrapperNode [2024-11-19 08:55:48,911 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:55:48,912 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 08:55:48,915 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 08:55:48,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 08:55:48,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:48,988 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,120 INFO L138 Inliner]: procedures = 346, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 743 [2024-11-19 08:55:49,121 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 08:55:49,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 08:55:49,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 08:55:49,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 08:55:49,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,251 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 3, 3, 3, 4, 4, 4, 3, 355, 12, 12, 2, 1, 2]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 3, 3, 3, 3, 3, 3, 3, 355, 0, 0, 0, 0, 0]. The 10 writes are split as follows [0, 0, 0, 0, 0, 0, 0, 0, 0, 5, 2, 1, 0, 2]. [2024-11-19 08:55:49,253 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,253 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,303 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,313 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,334 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,349 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,370 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 08:55:49,377 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 08:55:49,377 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 08:55:49,377 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 08:55:49,378 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (1/1) ... [2024-11-19 08:55:49,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:55:49,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:55:49,419 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-19 08:55:49,429 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-19 08:55:49,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 08:55:49,468 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-19 08:55:49,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-19 08:55:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-19 08:55:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-19 08:55:49,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-19 08:55:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-19 08:55:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-19 08:55:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-19 08:55:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 08:55:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 08:55:49,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 08:55:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 08:55:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-19 08:55:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-19 08:55:49,471 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-19 08:55:49,472 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-19 08:55:49,473 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 08:55:49,474 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 08:55:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 08:55:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 08:55:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 08:55:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 08:55:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-19 08:55:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-19 08:55:49,475 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-19 08:55:49,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-19 08:55:49,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-19 08:55:49,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-19 08:55:49,476 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-19 08:55:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-19 08:55:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 08:55:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 08:55:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 08:55:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-19 08:55:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-19 08:55:49,477 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-19 08:55:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-19 08:55:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-19 08:55:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-19 08:55:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-19 08:55:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-19 08:55:49,478 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-19 08:55:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-19 08:55:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-19 08:55:49,479 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 08:55:49,479 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 08:55:49,790 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 08:55:49,792 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 08:55:50,566 INFO L? ?]: Removed 261 outVars from TransFormulas that were not future-live. [2024-11-19 08:55:50,566 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 08:55:50,593 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 08:55:50,593 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-19 08:55:50,594 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:50 BoogieIcfgContainer [2024-11-19 08:55:50,594 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 08:55:50,595 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 08:55:50,595 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 08:55:50,602 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 08:55:50,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:55:47" (1/3) ... [2024-11-19 08:55:50,602 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1190c618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:55:50, skipping insertion in model container [2024-11-19 08:55:50,602 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:55:48" (2/3) ... [2024-11-19 08:55:50,603 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1190c618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:55:50, skipping insertion in model container [2024-11-19 08:55:50,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:50" (3/3) ... [2024-11-19 08:55:50,603 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-1.i [2024-11-19 08:55:50,633 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 08:55:50,633 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2024-11-19 08:55:50,700 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 08:55:50,705 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;@786824f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 08:55:50,706 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-19 08:55:50,709 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:50,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:55:50,713 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:50,713 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:55:50,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:50,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:50,718 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2024-11-19 08:55:50,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:50,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23261665] [2024-11-19 08:55:50,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:50,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:51,147 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-19 08:55:51,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:51,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23261665] [2024-11-19 08:55:51,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [23261665] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:51,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:51,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:55:51,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684827420] [2024-11-19 08:55:51,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:51,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:55:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:51,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:55:51,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:55:51,270 INFO L87 Difference]: Start difference. First operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:55:51,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:51,466 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2024-11-19 08:55:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:55:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 08:55:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:51,485 INFO L225 Difference]: With dead ends: 258 [2024-11-19 08:55:51,486 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 08:55:51,487 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-19 08:55:51,492 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 240 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:51,493 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 209 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:55:51,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 08:55:51,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 239. [2024-11-19 08:55:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 146 states have (on average 1.821917808219178) internal successors, (266), 235 states have internal predecessors, (266), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:51,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2024-11-19 08:55:51,543 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 3 [2024-11-19 08:55:51,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:51,544 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2024-11-19 08:55:51,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:55:51,544 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2024-11-19 08:55:51,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:55:51,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:51,544 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:55:51,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 08:55:51,545 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:51,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:51,545 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2024-11-19 08:55:51,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:51,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054771966] [2024-11-19 08:55:51,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:51,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:51,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:51,852 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-19 08:55:51,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:51,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054771966] [2024-11-19 08:55:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2054771966] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:51,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:51,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:55:51,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049342476] [2024-11-19 08:55:51,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:51,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:55:51,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:51,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:55:51,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:55:51,859 INFO L87 Difference]: Start difference. First operand 239 states and 270 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:55:52,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:52,051 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2024-11-19 08:55:52,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:55:52,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 08:55:52,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:52,053 INFO L225 Difference]: With dead ends: 238 [2024-11-19 08:55:52,053 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 08:55:52,054 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-19 08:55:52,054 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:52,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 438 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:55:52,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 08:55:52,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-19 08:55:52,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 146 states have (on average 1.8150684931506849) internal successors, (265), 234 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:52,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 269 transitions. [2024-11-19 08:55:52,097 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 269 transitions. Word has length 3 [2024-11-19 08:55:52,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:52,097 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 269 transitions. [2024-11-19 08:55:52,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:55:52,098 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 269 transitions. [2024-11-19 08:55:52,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 08:55:52,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:52,100 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 08:55:52,100 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 08:55:52,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:52,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:52,100 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2024-11-19 08:55:52,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:52,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973962697] [2024-11-19 08:55:52,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:52,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:52,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:52,729 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-19 08:55:52,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:52,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973962697] [2024-11-19 08:55:52,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973962697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:52,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:52,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:55:52,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306610476] [2024-11-19 08:55:52,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:52,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:55:52,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:52,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:55:52,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:55:52,735 INFO L87 Difference]: Start difference. First operand 238 states and 269 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-19 08:55:53,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:53,110 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2024-11-19 08:55:53,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:55:53,111 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-19 08:55:53,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:53,117 INFO L225 Difference]: With dead ends: 241 [2024-11-19 08:55:53,117 INFO L226 Difference]: Without dead ends: 241 [2024-11-19 08:55:53,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:55:53,119 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 7 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:53,123 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 610 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:55:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-19 08:55:53,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2024-11-19 08:55:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 148 states have (on average 1.804054054054054) internal successors, (267), 236 states have internal predecessors, (267), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:53,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2024-11-19 08:55:53,144 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 6 [2024-11-19 08:55:53,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:53,144 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2024-11-19 08:55:53,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-19 08:55:53,145 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2024-11-19 08:55:53,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 08:55:53,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:53,145 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:53,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 08:55:53,152 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:53,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:53,153 INFO L85 PathProgramCache]: Analyzing trace with hash 71430167, now seen corresponding path program 1 times [2024-11-19 08:55:53,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:53,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1142389086] [2024-11-19 08:55:53,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:53,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:53,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:53,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1142389086] [2024-11-19 08:55:53,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1142389086] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:55:53,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [53795262] [2024-11-19 08:55:53,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:53,731 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:55:53,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:55:53,736 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-19 08:55:53,740 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-19 08:55:53,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:53,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 08:55:53,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:55:54,070 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:54,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:55:54,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2024-11-19 08:55:54,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [53795262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:55:54,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:55:54,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 13 [2024-11-19 08:55:54,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668087795] [2024-11-19 08:55:54,168 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:55:54,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 08:55:54,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:54,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 08:55:54,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-19 08:55:54,170 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:55:54,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:54,545 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2024-11-19 08:55:54,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 08:55:54,550 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 08:55:54,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:54,551 INFO L225 Difference]: With dead ends: 244 [2024-11-19 08:55:54,551 INFO L226 Difference]: Without dead ends: 244 [2024-11-19 08:55:54,551 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=150, Unknown=0, NotChecked=0, Total=240 [2024-11-19 08:55:54,552 INFO L432 NwaCegarLoop]: 259 mSDtfsCounter, 511 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:54,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 784 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 08:55:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-19 08:55:54,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-19 08:55:54,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 153 states have (on average 1.7712418300653594) internal successors, (271), 240 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2024-11-19 08:55:54,563 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 9 [2024-11-19 08:55:54,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:54,564 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2024-11-19 08:55:54,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 14 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:55:54,564 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2024-11-19 08:55:54,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 08:55:54,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:54,564 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:54,586 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-19 08:55:54,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:55:54,766 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:54,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:54,767 INFO L85 PathProgramCache]: Analyzing trace with hash -1803865808, now seen corresponding path program 1 times [2024-11-19 08:55:54,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:54,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980445330] [2024-11-19 08:55:54,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:54,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:54,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:54,993 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:54,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980445330] [2024-11-19 08:55:54,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980445330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:55:54,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [637873847] [2024-11-19 08:55:54,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:54,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:55:54,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:55:55,000 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-19 08:55:55,011 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-19 08:55:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:55,235 INFO L255 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:55:55,237 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:55:55,270 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:55,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:55:55,330 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:55,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [637873847] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:55:55,333 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:55:55,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-19 08:55:55,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914118266] [2024-11-19 08:55:55,334 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:55:55,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 08:55:55,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:55,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 08:55:55,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:55:55,335 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-19 08:55:55,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:55,393 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2024-11-19 08:55:55,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:55:55,393 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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 22 [2024-11-19 08:55:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:55,394 INFO L225 Difference]: With dead ends: 259 [2024-11-19 08:55:55,395 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 08:55:55,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:55:55,396 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 4 mSDsluCounter, 1305 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1570 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:55,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1570 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:55:55,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 08:55:55,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-19 08:55:55,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 168 states have (on average 1.7023809523809523) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:55,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-19 08:55:55,401 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 22 [2024-11-19 08:55:55,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:55,402 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-19 08:55:55,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 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-19 08:55:55,402 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-19 08:55:55,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 08:55:55,403 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:55,403 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:55,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 08:55:55,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:55:55,604 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:55,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:55,605 INFO L85 PathProgramCache]: Analyzing trace with hash 1046446110, now seen corresponding path program 2 times [2024-11-19 08:55:55,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:55,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809242375] [2024-11-19 08:55:55,606 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:55:55,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:55,637 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 08:55:55,637 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:55:55,800 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-19 08:55:55,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:55,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809242375] [2024-11-19 08:55:55,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809242375] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:55,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:55,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:55:55,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219467929] [2024-11-19 08:55:55,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:55,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:55:55,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:55,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:55:55,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:55:55,803 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 08:55:55,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:55,949 INFO L93 Difference]: Finished difference Result 271 states and 303 transitions. [2024-11-19 08:55:55,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:55:55,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 37 [2024-11-19 08:55:55,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:55,950 INFO L225 Difference]: With dead ends: 271 [2024-11-19 08:55:55,950 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 08:55:55,951 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-19 08:55:55,951 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 223 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:55,951 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 211 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:55:55,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 08:55:55,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2024-11-19 08:55:55,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 168 states have (on average 1.6726190476190477) internal successors, (281), 250 states have internal predecessors, (281), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:55,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2024-11-19 08:55:55,956 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 37 [2024-11-19 08:55:55,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:55,958 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2024-11-19 08:55:55,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 08:55:55,958 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2024-11-19 08:55:55,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 08:55:55,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:55,959 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:55,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 08:55:55,959 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:55,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:55,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1046446111, now seen corresponding path program 1 times [2024-11-19 08:55:55,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:55,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911172776] [2024-11-19 08:55:55,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:55,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:56,230 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:56,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911172776] [2024-11-19 08:55:56,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911172776] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:55:56,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915767033] [2024-11-19 08:55:56,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:56,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:55:56,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:55:56,233 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-19 08:55:56,240 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-19 08:55:56,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:56,510 INFO L255 TraceCheckSpWp]: Trace formula consists of 1057 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 08:55:56,512 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:55:56,570 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:56,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:55:56,676 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:55:56,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915767033] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:55:56,677 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:55:56,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-19 08:55:56,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062843682] [2024-11-19 08:55:56,677 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:55:56,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 08:55:56,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:56,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 08:55:56,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:55:56,679 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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-19 08:55:56,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:56,740 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2024-11-19 08:55:56,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:55:56,741 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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 37 [2024-11-19 08:55:56,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:56,742 INFO L225 Difference]: With dead ends: 260 [2024-11-19 08:55:56,742 INFO L226 Difference]: Without dead ends: 260 [2024-11-19 08:55:56,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 64 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:55:56,743 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 2 mSDsluCounter, 768 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1028 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:56,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1028 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:55:56,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-19 08:55:56,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-19 08:55:56,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 256 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2024-11-19 08:55:56,751 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 37 [2024-11-19 08:55:56,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:56,752 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2024-11-19 08:55:56,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6153846153846154) internal successors, (47), 13 states have internal predecessors, (47), 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-19 08:55:56,752 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2024-11-19 08:55:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 08:55:56,756 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:56,756 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:56,773 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-19 08:55:56,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:55:56,957 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:56,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:56,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1137674529, now seen corresponding path program 2 times [2024-11-19 08:55:56,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:56,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [837979506] [2024-11-19 08:55:56,957 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:55:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:57,070 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 08:55:57,070 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:55:57,659 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:55:57,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:57,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [837979506] [2024-11-19 08:55:57,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [837979506] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:57,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:57,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:55:57,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158493938] [2024-11-19 08:55:57,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:57,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:55:57,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:57,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:55:57,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:55:57,666 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-19 08:55:58,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:58,090 INFO L93 Difference]: Finished difference Result 425 states and 486 transitions. [2024-11-19 08:55:58,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:55:58,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2024-11-19 08:55:58,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:58,093 INFO L225 Difference]: With dead ends: 425 [2024-11-19 08:55:58,093 INFO L226 Difference]: Without dead ends: 425 [2024-11-19 08:55:58,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:55:58,094 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 610 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:58,094 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 754 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:55:58,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-19 08:55:58,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 259. [2024-11-19 08:55:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:58,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-19 08:55:58,103 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 43 [2024-11-19 08:55:58,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:58,104 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-19 08:55:58,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-19 08:55:58,104 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-19 08:55:58,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 08:55:58,105 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:58,105 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:58,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 08:55:58,105 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:58,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:58,106 INFO L85 PathProgramCache]: Analyzing trace with hash -874983285, now seen corresponding path program 1 times [2024-11-19 08:55:58,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:58,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054371175] [2024-11-19 08:55:58,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:58,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:58,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:58,487 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:55:58,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:58,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054371175] [2024-11-19 08:55:58,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054371175] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:58,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:58,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:55:58,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732470098] [2024-11-19 08:55:58,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:58,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:55:58,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:58,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:55:58,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:55:58,489 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-19 08:55:58,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:58,955 INFO L93 Difference]: Finished difference Result 289 states and 324 transitions. [2024-11-19 08:55:58,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:55:58,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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 46 [2024-11-19 08:55:58,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:58,957 INFO L225 Difference]: With dead ends: 289 [2024-11-19 08:55:58,958 INFO L226 Difference]: Without dead ends: 289 [2024-11-19 08:55:58,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:55:58,959 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 298 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:58,960 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 416 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:55:58,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2024-11-19 08:55:58,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 272. [2024-11-19 08:55:58,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 188 states have (on average 1.6329787234042554) internal successors, (307), 268 states have internal predecessors, (307), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:58,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 311 transitions. [2024-11-19 08:55:58,969 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 311 transitions. Word has length 46 [2024-11-19 08:55:58,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:58,970 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 311 transitions. [2024-11-19 08:55:58,970 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 states have internal predecessors, (17), 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-19 08:55:58,970 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 311 transitions. [2024-11-19 08:55:58,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 08:55:58,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:58,971 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:58,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 08:55:58,971 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:58,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:58,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1354678587, now seen corresponding path program 1 times [2024-11-19 08:55:58,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:58,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592547285] [2024-11-19 08:55:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:58,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:55:59,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:59,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592547285] [2024-11-19 08:55:59,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592547285] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:59,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:59,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:55:59,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386092536] [2024-11-19 08:55:59,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:59,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:55:59,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:59,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:55:59,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:55:59,302 INFO L87 Difference]: Start difference. First operand 272 states and 311 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-19 08:55:59,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:59,521 INFO L93 Difference]: Finished difference Result 306 states and 352 transitions. [2024-11-19 08:55:59,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:55:59,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 47 [2024-11-19 08:55:59,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:59,523 INFO L225 Difference]: With dead ends: 306 [2024-11-19 08:55:59,523 INFO L226 Difference]: Without dead ends: 306 [2024-11-19 08:55:59,523 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-19 08:55:59,523 INFO L432 NwaCegarLoop]: 171 mSDtfsCounter, 396 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:59,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 271 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:55:59,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2024-11-19 08:55:59,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 265. [2024-11-19 08:55:59,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.5957446808510638) internal successors, (300), 261 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:59,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 304 transitions. [2024-11-19 08:55:59,529 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 304 transitions. Word has length 47 [2024-11-19 08:55:59,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:59,529 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 304 transitions. [2024-11-19 08:55:59,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-19 08:55:59,530 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 304 transitions. [2024-11-19 08:55:59,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-19 08:55:59,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:59,531 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:59,531 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 08:55:59,531 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:59,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:59,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1354678586, now seen corresponding path program 1 times [2024-11-19 08:55:59,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:59,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172745697] [2024-11-19 08:55:59,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:59,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:59,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:55:59,828 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:55:59,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:55:59,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172745697] [2024-11-19 08:55:59,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172745697] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:55:59,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:55:59,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 08:55:59,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179543745] [2024-11-19 08:55:59,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:55:59,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:55:59,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:55:59,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:55:59,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:55:59,830 INFO L87 Difference]: Start difference. First operand 265 states and 304 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-19 08:55:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:55:59,943 INFO L93 Difference]: Finished difference Result 272 states and 305 transitions. [2024-11-19 08:55:59,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:55:59,944 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 47 [2024-11-19 08:55:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:55:59,945 INFO L225 Difference]: With dead ends: 272 [2024-11-19 08:55:59,945 INFO L226 Difference]: Without dead ends: 272 [2024-11-19 08:55:59,945 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:55:59,945 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 259 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:55:59,946 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 934 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:55:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2024-11-19 08:55:59,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 265. [2024-11-19 08:55:59,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 265 states, 188 states have (on average 1.5904255319148937) internal successors, (299), 261 states have internal predecessors, (299), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:55:59,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 303 transitions. [2024-11-19 08:55:59,951 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 303 transitions. Word has length 47 [2024-11-19 08:55:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:55:59,952 INFO L471 AbstractCegarLoop]: Abstraction has 265 states and 303 transitions. [2024-11-19 08:55:59,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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-19 08:55:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 303 transitions. [2024-11-19 08:55:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 08:55:59,954 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:55:59,954 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:55:59,954 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 08:55:59,954 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:55:59,955 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:55:59,955 INFO L85 PathProgramCache]: Analyzing trace with hash -470534900, now seen corresponding path program 1 times [2024-11-19 08:55:59,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:55:59,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167742674] [2024-11-19 08:55:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:55:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:55:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:00,177 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:00,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:00,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167742674] [2024-11-19 08:56:00,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167742674] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:00,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:00,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:56:00,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693727633] [2024-11-19 08:56:00,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:00,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:56:00,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:00,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:56:00,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:56:00,179 INFO L87 Difference]: Start difference. First operand 265 states and 303 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-19 08:56:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:00,265 INFO L93 Difference]: Finished difference Result 271 states and 311 transitions. [2024-11-19 08:56:00,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:56:00,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2024-11-19 08:56:00,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:00,267 INFO L225 Difference]: With dead ends: 271 [2024-11-19 08:56:00,267 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 08:56:00,267 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-19 08:56:00,267 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 209 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:00,267 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 207 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:00,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 08:56:00,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 270. [2024-11-19 08:56:00,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 194 states have (on average 1.5824742268041236) internal successors, (307), 266 states have internal predecessors, (307), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:00,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 311 transitions. [2024-11-19 08:56:00,271 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 311 transitions. Word has length 49 [2024-11-19 08:56:00,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:00,271 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 311 transitions. [2024-11-19 08:56:00,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-19 08:56:00,272 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 311 transitions. [2024-11-19 08:56:00,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 08:56:00,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:00,272 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:00,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 08:56:00,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:00,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:00,273 INFO L85 PathProgramCache]: Analyzing trace with hash -470534899, now seen corresponding path program 1 times [2024-11-19 08:56:00,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:00,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083818994] [2024-11-19 08:56:00,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:00,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:00,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:01,052 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:01,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:01,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083818994] [2024-11-19 08:56:01,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083818994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:01,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:01,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 08:56:01,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584865683] [2024-11-19 08:56:01,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:01,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 08:56:01,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:01,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 08:56:01,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:56:01,055 INFO L87 Difference]: Start difference. First operand 270 states and 311 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-19 08:56:01,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:01,275 INFO L93 Difference]: Finished difference Result 276 states and 312 transitions. [2024-11-19 08:56:01,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:56:01,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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 49 [2024-11-19 08:56:01,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:01,277 INFO L225 Difference]: With dead ends: 276 [2024-11-19 08:56:01,277 INFO L226 Difference]: Without dead ends: 276 [2024-11-19 08:56:01,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:56:01,277 INFO L432 NwaCegarLoop]: 241 mSDtfsCounter, 33 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:01,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 522 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:56:01,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2024-11-19 08:56:01,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 270. [2024-11-19 08:56:01,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 194 states have (on average 1.577319587628866) internal successors, (306), 266 states have internal predecessors, (306), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 310 transitions. [2024-11-19 08:56:01,281 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 310 transitions. Word has length 49 [2024-11-19 08:56:01,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:01,281 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 310 transitions. [2024-11-19 08:56:01,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 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-19 08:56:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 310 transitions. [2024-11-19 08:56:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 08:56:01,282 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:01,282 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:01,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 08:56:01,282 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:01,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1068074097, now seen corresponding path program 1 times [2024-11-19 08:56:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:01,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137483693] [2024-11-19 08:56:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:01,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:01,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:01,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137483693] [2024-11-19 08:56:01,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137483693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:01,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:01,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:56:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112226340] [2024-11-19 08:56:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:01,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:56:01,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:01,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:56:01,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:56:01,491 INFO L87 Difference]: Start difference. First operand 270 states and 310 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-19 08:56:01,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:01,668 INFO L93 Difference]: Finished difference Result 269 states and 308 transitions. [2024-11-19 08:56:01,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:56:01,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2024-11-19 08:56:01,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:01,669 INFO L225 Difference]: With dead ends: 269 [2024-11-19 08:56:01,670 INFO L226 Difference]: Without dead ends: 269 [2024-11-19 08:56:01,670 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-19 08:56:01,670 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 14 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 729 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:01,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 729 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:56:01,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2024-11-19 08:56:01,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2024-11-19 08:56:01,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 194 states have (on average 1.5670103092783505) internal successors, (304), 265 states have internal predecessors, (304), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:01,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 308 transitions. [2024-11-19 08:56:01,674 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 308 transitions. Word has length 52 [2024-11-19 08:56:01,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:01,674 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 308 transitions. [2024-11-19 08:56:01,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-19 08:56:01,674 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 308 transitions. [2024-11-19 08:56:01,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 08:56:01,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:01,675 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:01,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 08:56:01,675 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:01,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:01,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1068074098, now seen corresponding path program 1 times [2024-11-19 08:56:01,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:01,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150981617] [2024-11-19 08:56:01,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:01,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:01,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:02,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:02,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150981617] [2024-11-19 08:56:02,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150981617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:02,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:02,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:56:02,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589725733] [2024-11-19 08:56:02,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:02,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:56:02,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:02,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:56:02,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:56:02,145 INFO L87 Difference]: Start difference. First operand 269 states and 308 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-19 08:56:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:02,366 INFO L93 Difference]: Finished difference Result 268 states and 306 transitions. [2024-11-19 08:56:02,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:56:02,367 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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 52 [2024-11-19 08:56:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:02,368 INFO L225 Difference]: With dead ends: 268 [2024-11-19 08:56:02,368 INFO L226 Difference]: Without dead ends: 268 [2024-11-19 08:56:02,368 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-19 08:56:02,369 INFO L432 NwaCegarLoop]: 237 mSDtfsCounter, 13 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:02,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 731 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 08:56:02,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2024-11-19 08:56:02,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2024-11-19 08:56:02,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 194 states have (on average 1.556701030927835) internal successors, (302), 264 states have internal predecessors, (302), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:02,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 306 transitions. [2024-11-19 08:56:02,382 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 306 transitions. Word has length 52 [2024-11-19 08:56:02,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:02,383 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 306 transitions. [2024-11-19 08:56:02,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 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-19 08:56:02,383 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 306 transitions. [2024-11-19 08:56:02,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 08:56:02,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:02,384 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 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-19 08:56:02,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 08:56:02,384 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:02,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:02,388 INFO L85 PathProgramCache]: Analyzing trace with hash 610330706, now seen corresponding path program 1 times [2024-11-19 08:56:02,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:02,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384852087] [2024-11-19 08:56:02,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:02,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:02,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384852087] [2024-11-19 08:56:02,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384852087] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:02,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:02,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:56:02,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109062292] [2024-11-19 08:56:02,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:02,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 08:56:02,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:02,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 08:56:02,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 08:56:02,598 INFO L87 Difference]: Start difference. First operand 268 states and 306 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-19 08:56:02,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:02,735 INFO L93 Difference]: Finished difference Result 267 states and 304 transitions. [2024-11-19 08:56:02,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 08:56:02,735 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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 57 [2024-11-19 08:56:02,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:02,736 INFO L225 Difference]: With dead ends: 267 [2024-11-19 08:56:02,736 INFO L226 Difference]: Without dead ends: 267 [2024-11-19 08:56:02,736 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-19 08:56:02,737 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 7 mSDsluCounter, 543 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 787 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:02,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 787 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:02,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-11-19 08:56:02,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2024-11-19 08:56:02,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 194 states have (on average 1.5463917525773196) internal successors, (300), 263 states have internal predecessors, (300), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:02,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 304 transitions. [2024-11-19 08:56:02,741 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 304 transitions. Word has length 57 [2024-11-19 08:56:02,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:02,741 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 304 transitions. [2024-11-19 08:56:02,741 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 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-19 08:56:02,741 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 304 transitions. [2024-11-19 08:56:02,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-19 08:56:02,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:02,741 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 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-19 08:56:02,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 08:56:02,742 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:02,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:02,742 INFO L85 PathProgramCache]: Analyzing trace with hash 610330707, now seen corresponding path program 1 times [2024-11-19 08:56:02,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:02,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159419785] [2024-11-19 08:56:02,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:02,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:03,293 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:03,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:03,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159419785] [2024-11-19 08:56:03,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159419785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:03,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:03,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 08:56:03,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910793288] [2024-11-19 08:56:03,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:03,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 08:56:03,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:03,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 08:56:03,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:56:03,296 INFO L87 Difference]: Start difference. First operand 267 states and 304 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-19 08:56:03,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:03,585 INFO L93 Difference]: Finished difference Result 277 states and 315 transitions. [2024-11-19 08:56:03,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 08:56:03,586 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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 57 [2024-11-19 08:56:03,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:03,587 INFO L225 Difference]: With dead ends: 277 [2024-11-19 08:56:03,587 INFO L226 Difference]: Without dead ends: 277 [2024-11-19 08:56:03,588 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-19 08:56:03,588 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 13 mSDsluCounter, 648 mSDsCounter, 0 mSdLazyCounter, 364 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 882 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:03,588 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 882 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 364 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 08:56:03,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2024-11-19 08:56:03,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2024-11-19 08:56:03,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 275 states, 202 states have (on average 1.5297029702970297) internal successors, (309), 271 states have internal predecessors, (309), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:03,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 313 transitions. [2024-11-19 08:56:03,614 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 313 transitions. Word has length 57 [2024-11-19 08:56:03,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:03,614 INFO L471 AbstractCegarLoop]: Abstraction has 275 states and 313 transitions. [2024-11-19 08:56:03,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 7 states have internal predecessors, (28), 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-19 08:56:03,615 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 313 transitions. [2024-11-19 08:56:03,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2024-11-19 08:56:03,615 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:03,615 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:03,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 08:56:03,615 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:03,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:03,616 INFO L85 PathProgramCache]: Analyzing trace with hash 179394723, now seen corresponding path program 1 times [2024-11-19 08:56:03,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:03,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48582489] [2024-11-19 08:56:03,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:03,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:04,420 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:04,421 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48582489] [2024-11-19 08:56:04,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48582489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:04,421 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994831931] [2024-11-19 08:56:04,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:04,421 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:04,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:04,423 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-19 08:56:04,425 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-19 08:56:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:04,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 1238 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-19 08:56:04,783 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:04,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 08:56:04,828 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 23 treesize of output 1 [2024-11-19 08:56:04,835 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 23 treesize of output 1 [2024-11-19 08:56:05,028 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 25 treesize of output 9 [2024-11-19 08:56:05,037 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 36 treesize of output 12 [2024-11-19 08:56:05,067 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:05,067 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:05,326 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:05,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994831931] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:05,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:05,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 21 [2024-11-19 08:56:05,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084282942] [2024-11-19 08:56:05,327 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:05,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 08:56:05,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:05,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 08:56:05,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=374, Unknown=0, NotChecked=0, Total=462 [2024-11-19 08:56:05,329 INFO L87 Difference]: Start difference. First operand 275 states and 313 transitions. Second operand has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 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-19 08:56:06,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:06,003 INFO L93 Difference]: Finished difference Result 288 states and 326 transitions. [2024-11-19 08:56:06,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:56:06,004 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 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 62 [2024-11-19 08:56:06,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:06,005 INFO L225 Difference]: With dead ends: 288 [2024-11-19 08:56:06,005 INFO L226 Difference]: Without dead ends: 288 [2024-11-19 08:56:06,005 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=166, Invalid=590, Unknown=0, NotChecked=0, Total=756 [2024-11-19 08:56:06,005 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 40 mSDsluCounter, 1761 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 1018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:06,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1995 Invalid, 1018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 08:56:06,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-19 08:56:06,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 288. [2024-11-19 08:56:06,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 216 states have (on average 1.4907407407407407) internal successors, (322), 284 states have internal predecessors, (322), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:06,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 326 transitions. [2024-11-19 08:56:06,009 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 326 transitions. Word has length 62 [2024-11-19 08:56:06,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:06,009 INFO L471 AbstractCegarLoop]: Abstraction has 288 states and 326 transitions. [2024-11-19 08:56:06,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 3.2857142857142856) internal successors, (69), 22 states have internal predecessors, (69), 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-19 08:56:06,010 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 326 transitions. [2024-11-19 08:56:06,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-19 08:56:06,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:06,010 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:06,025 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 08:56:06,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-19 08:56:06,211 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:06,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:06,212 INFO L85 PathProgramCache]: Analyzing trace with hash -1625335637, now seen corresponding path program 1 times [2024-11-19 08:56:06,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:06,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045564010] [2024-11-19 08:56:06,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:06,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:06,436 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:06,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045564010] [2024-11-19 08:56:06,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045564010] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:06,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1454874700] [2024-11-19 08:56:06,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:06,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:06,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:06,439 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-19 08:56:06,440 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-19 08:56:06,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:06,791 INFO L255 TraceCheckSpWp]: Trace formula consists of 1302 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:56:06,794 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:06,827 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:06,828 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:06,882 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1454874700] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:06,884 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:06,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-19 08:56:06,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995949687] [2024-11-19 08:56:06,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:06,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 08:56:06,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:06,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 08:56:06,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:56:06,887 INFO L87 Difference]: Start difference. First operand 288 states and 326 transitions. Second operand has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-19 08:56:06,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:06,933 INFO L93 Difference]: Finished difference Result 345 states and 381 transitions. [2024-11-19 08:56:06,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:56:06,934 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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 73 [2024-11-19 08:56:06,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:06,935 INFO L225 Difference]: With dead ends: 345 [2024-11-19 08:56:06,936 INFO L226 Difference]: Without dead ends: 345 [2024-11-19 08:56:06,936 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2024-11-19 08:56:06,936 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 24 mSDsluCounter, 741 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:06,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 987 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:56:06,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-11-19 08:56:06,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 338. [2024-11-19 08:56:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 266 states have (on average 1.4172932330827068) internal successors, (377), 334 states have internal predecessors, (377), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 381 transitions. [2024-11-19 08:56:06,944 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 381 transitions. Word has length 73 [2024-11-19 08:56:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:06,944 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 381 transitions. [2024-11-19 08:56:06,944 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.090909090909091) internal successors, (67), 11 states have internal predecessors, (67), 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-19 08:56:06,944 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 381 transitions. [2024-11-19 08:56:06,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-19 08:56:06,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:06,945 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 8, 8, 8, 8, 8, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:06,967 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-19 08:56:07,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:07,146 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:07,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:07,146 INFO L85 PathProgramCache]: Analyzing trace with hash -1346452229, now seen corresponding path program 2 times [2024-11-19 08:56:07,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:07,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094913530] [2024-11-19 08:56:07,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:56:07,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:07,280 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 08:56:07,281 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:56:07,707 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:07,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094913530] [2024-11-19 08:56:07,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094913530] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:07,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2113142029] [2024-11-19 08:56:07,712 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:56:07,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:07,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:07,714 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-19 08:56:07,715 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-19 08:56:08,296 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 08:56:08,296 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:56:08,304 INFO L255 TraceCheckSpWp]: Trace formula consists of 1447 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 08:56:08,307 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:08,384 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:08,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:08,537 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 2 proven. 148 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:08,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2113142029] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:08,540 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:08,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 13 [2024-11-19 08:56:08,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999932176] [2024-11-19 08:56:08,541 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:08,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 08:56:08,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:08,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 08:56:08,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:56:08,542 INFO L87 Difference]: Start difference. First operand 338 states and 381 transitions. Second operand has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-19 08:56:08,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:08,632 INFO L93 Difference]: Finished difference Result 367 states and 403 transitions. [2024-11-19 08:56:08,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:56:08,633 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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 98 [2024-11-19 08:56:08,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:08,634 INFO L225 Difference]: With dead ends: 367 [2024-11-19 08:56:08,638 INFO L226 Difference]: Without dead ends: 367 [2024-11-19 08:56:08,638 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 186 SyntacticMatches, 8 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:56:08,639 INFO L432 NwaCegarLoop]: 246 mSDtfsCounter, 22 mSDsluCounter, 983 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 1229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:08,639 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 1229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:08,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-19 08:56:08,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 358. [2024-11-19 08:56:08,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 286 states have (on average 1.3951048951048952) internal successors, (399), 354 states have internal predecessors, (399), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:08,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 403 transitions. [2024-11-19 08:56:08,653 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 403 transitions. Word has length 98 [2024-11-19 08:56:08,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:08,654 INFO L471 AbstractCegarLoop]: Abstraction has 358 states and 403 transitions. [2024-11-19 08:56:08,654 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 13 states have internal predecessors, (82), 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-19 08:56:08,654 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 403 transitions. [2024-11-19 08:56:08,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-19 08:56:08,654 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:08,655 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:08,698 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-19 08:56:08,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:08,860 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:08,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash 998593275, now seen corresponding path program 3 times [2024-11-19 08:56:08,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:08,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [214325172] [2024-11-19 08:56:08,861 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 08:56:08,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:09,067 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 08:56:09,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:56:10,024 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:10,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:10,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [214325172] [2024-11-19 08:56:10,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [214325172] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:10,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1180427642] [2024-11-19 08:56:10,026 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 08:56:10,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:10,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:10,029 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-19 08:56:10,032 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-19 08:56:10,579 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 08:56:10,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:56:10,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 1026 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-19 08:56:10,591 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:10,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:56:10,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-19 08:56:10,715 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:56:10,715 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-19 08:56:11,267 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:56:11,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-19 08:56:11,274 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:56:11,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:56:11,291 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:11,292 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:12,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:56:12,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 54 treesize of output 72 [2024-11-19 08:56:12,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-19 08:56:12,514 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-19 08:56:12,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 46 treesize of output 59 [2024-11-19 08:56:12,582 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:12,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1180427642] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:12,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:12,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 7, 7] total 22 [2024-11-19 08:56:12,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510809578] [2024-11-19 08:56:12,582 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:12,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 08:56:12,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:12,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 08:56:12,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=406, Unknown=0, NotChecked=0, Total=506 [2024-11-19 08:56:12,584 INFO L87 Difference]: Start difference. First operand 358 states and 403 transitions. Second operand has 23 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:56:13,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:13,621 INFO L93 Difference]: Finished difference Result 363 states and 398 transitions. [2024-11-19 08:56:13,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:56:13,622 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 108 [2024-11-19 08:56:13,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:13,623 INFO L225 Difference]: With dead ends: 363 [2024-11-19 08:56:13,623 INFO L226 Difference]: Without dead ends: 363 [2024-11-19 08:56:13,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 204 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=185, Invalid=571, Unknown=0, NotChecked=0, Total=756 [2024-11-19 08:56:13,624 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 834 mSDsluCounter, 1127 mSDsCounter, 0 mSdLazyCounter, 1157 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 834 SdHoareTripleChecker+Valid, 1271 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:13,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [834 Valid, 1271 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1157 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 08:56:13,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 363 states. [2024-11-19 08:56:13,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 363 to 299. [2024-11-19 08:56:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 299 states, 231 states have (on average 1.4285714285714286) internal successors, (330), 295 states have internal predecessors, (330), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:13,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 334 transitions. [2024-11-19 08:56:13,628 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 334 transitions. Word has length 108 [2024-11-19 08:56:13,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:13,628 INFO L471 AbstractCegarLoop]: Abstraction has 299 states and 334 transitions. [2024-11-19 08:56:13,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.6818181818181817) internal successors, (81), 22 states have internal predecessors, (81), 1 states have call successors, (1), 1 states have call predecessors, (1), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 08:56:13,629 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 334 transitions. [2024-11-19 08:56:13,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-19 08:56:13,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:13,629 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 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-19 08:56:13,645 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 08:56:13,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:13,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:13,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:13,831 INFO L85 PathProgramCache]: Analyzing trace with hash 891619926, now seen corresponding path program 1 times [2024-11-19 08:56:13,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:13,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434210566] [2024-11-19 08:56:13,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:13,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:13,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:14,486 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:14,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:14,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434210566] [2024-11-19 08:56:14,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434210566] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:14,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1832802901] [2024-11-19 08:56:14,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:14,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:14,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:14,489 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:56:14,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 08:56:14,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:14,925 INFO L255 TraceCheckSpWp]: Trace formula consists of 1505 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 08:56:14,928 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:14,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:56:14,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-19 08:56:14,984 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:56:14,984 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-19 08:56:15,186 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:15,186 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:15,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 45 [2024-11-19 08:56:15,514 INFO L349 Elim1Store]: treesize reduction 5, result has 80.0 percent of original size [2024-11-19 08:56:15,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 36 treesize of output 49 [2024-11-19 08:56:15,548 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:15,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1832802901] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:15,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:15,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2024-11-19 08:56:15,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179441633] [2024-11-19 08:56:15,549 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:15,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 08:56:15,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:15,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 08:56:15,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2024-11-19 08:56:15,550 INFO L87 Difference]: Start difference. First operand 299 states and 334 transitions. Second operand has 19 states, 18 states have (on average 4.5) internal successors, (81), 19 states have internal predecessors, (81), 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-19 08:56:16,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:16,058 INFO L93 Difference]: Finished difference Result 366 states and 400 transitions. [2024-11-19 08:56:16,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:56:16,058 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 19 states have internal predecessors, (81), 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 109 [2024-11-19 08:56:16,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:16,059 INFO L225 Difference]: With dead ends: 366 [2024-11-19 08:56:16,059 INFO L226 Difference]: Without dead ends: 366 [2024-11-19 08:56:16,059 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2024-11-19 08:56:16,060 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 1017 mSDsluCounter, 708 mSDsCounter, 0 mSdLazyCounter, 697 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 846 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 697 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:16,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 846 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 697 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:56:16,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-19 08:56:16,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 296. [2024-11-19 08:56:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 231 states have (on average 1.4155844155844155) internal successors, (327), 292 states have internal predecessors, (327), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 331 transitions. [2024-11-19 08:56:16,064 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 331 transitions. Word has length 109 [2024-11-19 08:56:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:16,064 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 331 transitions. [2024-11-19 08:56:16,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 4.5) internal successors, (81), 19 states have internal predecessors, (81), 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-19 08:56:16,064 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 331 transitions. [2024-11-19 08:56:16,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-19 08:56:16,065 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:16,065 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:16,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-19 08:56:16,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-19 08:56:16,270 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:16,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:16,270 INFO L85 PathProgramCache]: Analyzing trace with hash -2146214755, now seen corresponding path program 1 times [2024-11-19 08:56:16,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:16,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419718180] [2024-11-19 08:56:16,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:16,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:16,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:17,448 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:17,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:17,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419718180] [2024-11-19 08:56:17,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419718180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:17,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [855575064] [2024-11-19 08:56:17,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:17,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:17,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:17,452 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:56:17,453 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 08:56:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:17,831 INFO L255 TraceCheckSpWp]: Trace formula consists of 1530 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-19 08:56:17,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:17,867 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 08:56:17,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2024-11-19 08:56:17,883 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 13 treesize of output 1 [2024-11-19 08:56:18,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:56:18,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:56:18,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 36 [2024-11-19 08:56:18,045 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-19 08:56:18,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-19 08:56:19,404 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:56:19,416 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 08:56:19,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 63 [2024-11-19 08:56:19,435 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 08:56:19,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 08:56:19,519 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:19,519 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:20,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 08:56:20,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2024-11-19 08:56:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 385 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:21,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [855575064] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:21,101 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:21,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 21 [2024-11-19 08:56:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562812249] [2024-11-19 08:56:21,101 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:21,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 08:56:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:21,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 08:56:21,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2024-11-19 08:56:21,104 INFO L87 Difference]: Start difference. First operand 296 states and 331 transitions. Second operand has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:56:22,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:22,663 INFO L93 Difference]: Finished difference Result 420 states and 457 transitions. [2024-11-19 08:56:22,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 08:56:22,664 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 111 [2024-11-19 08:56:22,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:22,665 INFO L225 Difference]: With dead ends: 420 [2024-11-19 08:56:22,666 INFO L226 Difference]: Without dead ends: 420 [2024-11-19 08:56:22,666 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 208 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=212, Invalid=658, Unknown=0, NotChecked=0, Total=870 [2024-11-19 08:56:22,666 INFO L432 NwaCegarLoop]: 148 mSDtfsCounter, 1036 mSDsluCounter, 829 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1036 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 976 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:22,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1036 Valid, 977 Invalid, 976 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 08:56:22,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-11-19 08:56:22,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 291. [2024-11-19 08:56:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 227 states have (on average 1.4140969162995596) internal successors, (321), 287 states have internal predecessors, (321), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:22,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 325 transitions. [2024-11-19 08:56:22,671 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 325 transitions. Word has length 111 [2024-11-19 08:56:22,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:22,671 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 325 transitions. [2024-11-19 08:56:22,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 4.142857142857143) internal successors, (87), 22 states have internal predecessors, (87), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-19 08:56:22,671 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 325 transitions. [2024-11-19 08:56:22,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-19 08:56:22,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:22,672 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:22,689 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-19 08:56:22,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:22,877 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:22,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:22,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1399714849, now seen corresponding path program 1 times [2024-11-19 08:56:22,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:22,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349348380] [2024-11-19 08:56:22,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:22,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:23,370 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-19 08:56:23,371 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:23,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349348380] [2024-11-19 08:56:23,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349348380] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:23,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:23,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:56:23,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967144425] [2024-11-19 08:56:23,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:23,372 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:56:23,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:23,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:56:23,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:56:23,373 INFO L87 Difference]: Start difference. First operand 291 states and 325 transitions. Second operand has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-19 08:56:23,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:23,548 INFO L93 Difference]: Finished difference Result 338 states and 383 transitions. [2024-11-19 08:56:23,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:56:23,548 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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 113 [2024-11-19 08:56:23,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:23,550 INFO L225 Difference]: With dead ends: 338 [2024-11-19 08:56:23,550 INFO L226 Difference]: Without dead ends: 338 [2024-11-19 08:56:23,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 08:56:23,550 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 419 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:23,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 544 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:23,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-11-19 08:56:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 296. [2024-11-19 08:56:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 296 states, 232 states have (on average 1.4094827586206897) internal successors, (327), 292 states have internal predecessors, (327), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 331 transitions. [2024-11-19 08:56:23,556 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 331 transitions. Word has length 113 [2024-11-19 08:56:23,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:23,556 INFO L471 AbstractCegarLoop]: Abstraction has 296 states and 331 transitions. [2024-11-19 08:56:23,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.8) internal successors, (39), 6 states have internal predecessors, (39), 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-19 08:56:23,557 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 331 transitions. [2024-11-19 08:56:23,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-19 08:56:23,557 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:23,557 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:23,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-11-19 08:56:23,558 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:23,558 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:23,558 INFO L85 PathProgramCache]: Analyzing trace with hash 148263721, now seen corresponding path program 1 times [2024-11-19 08:56:23,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:23,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610214140] [2024-11-19 08:56:23,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:23,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:25,175 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:25,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610214140] [2024-11-19 08:56:25,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610214140] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:25,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1787358949] [2024-11-19 08:56:25,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:25,177 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:25,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:25,179 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:56:25,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 08:56:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:25,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 1527 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-19 08:56:25,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:25,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 08:56:25,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-19 08:56:25,754 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2024-11-19 08:56:25,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 08:56:25,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:56:25,762 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 08:56:26,262 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:26,262 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:26,686 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:26,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1787358949] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:26,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:26,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 22 [2024-11-19 08:56:26,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020565033] [2024-11-19 08:56:26,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:26,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 08:56:26,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:26,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 08:56:26,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=369, Unknown=0, NotChecked=0, Total=462 [2024-11-19 08:56:26,688 INFO L87 Difference]: Start difference. First operand 296 states and 331 transitions. Second operand has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 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-19 08:56:27,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:27,131 INFO L93 Difference]: Finished difference Result 482 states and 543 transitions. [2024-11-19 08:56:27,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:56:27,132 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 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 115 [2024-11-19 08:56:27,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:27,133 INFO L225 Difference]: With dead ends: 482 [2024-11-19 08:56:27,134 INFO L226 Difference]: Without dead ends: 482 [2024-11-19 08:56:27,134 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 219 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=195, Invalid=675, Unknown=0, NotChecked=0, Total=870 [2024-11-19 08:56:27,135 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 502 mSDsluCounter, 2680 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 504 SdHoareTripleChecker+Valid, 2901 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:27,135 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [504 Valid, 2901 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 08:56:27,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2024-11-19 08:56:27,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 361. [2024-11-19 08:56:27,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 361 states, 297 states have (on average 1.3265993265993266) internal successors, (394), 357 states have internal predecessors, (394), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:27,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 398 transitions. [2024-11-19 08:56:27,142 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 398 transitions. Word has length 115 [2024-11-19 08:56:27,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:27,142 INFO L471 AbstractCegarLoop]: Abstraction has 361 states and 398 transitions. [2024-11-19 08:56:27,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.8636363636363638) internal successors, (85), 22 states have internal predecessors, (85), 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-19 08:56:27,142 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 398 transitions. [2024-11-19 08:56:27,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-19 08:56:27,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:27,144 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:27,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-19 08:56:27,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-19 08:56:27,348 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:27,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:27,348 INFO L85 PathProgramCache]: Analyzing trace with hash 932572260, now seen corresponding path program 1 times [2024-11-19 08:56:27,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:27,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699446019] [2024-11-19 08:56:27,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:27,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:27,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-19 08:56:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:27,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699446019] [2024-11-19 08:56:27,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699446019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:27,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:27,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 08:56:27,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798553227] [2024-11-19 08:56:27,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:27,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 08:56:27,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:27,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 08:56:27,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-19 08:56:27,950 INFO L87 Difference]: Start difference. First operand 361 states and 398 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-19 08:56:28,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:28,054 INFO L93 Difference]: Finished difference Result 398 states and 443 transitions. [2024-11-19 08:56:28,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 08:56:28,054 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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 116 [2024-11-19 08:56:28,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:28,056 INFO L225 Difference]: With dead ends: 398 [2024-11-19 08:56:28,056 INFO L226 Difference]: Without dead ends: 398 [2024-11-19 08:56:28,056 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 08:56:28,056 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 42 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 1336 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:28,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 1336 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:28,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2024-11-19 08:56:28,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 367. [2024-11-19 08:56:28,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 303 states have (on average 1.3234323432343233) internal successors, (401), 363 states have internal predecessors, (401), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:28,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2024-11-19 08:56:28,063 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 116 [2024-11-19 08:56:28,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:28,063 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2024-11-19 08:56:28,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 7 states have internal predecessors, (42), 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-19 08:56:28,063 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2024-11-19 08:56:28,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-19 08:56:28,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:28,064 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:28,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-11-19 08:56:28,065 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:28,065 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:28,065 INFO L85 PathProgramCache]: Analyzing trace with hash -1861062658, now seen corresponding path program 1 times [2024-11-19 08:56:28,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:28,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077271360] [2024-11-19 08:56:28,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:28,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:28,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-19 08:56:28,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:28,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077271360] [2024-11-19 08:56:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077271360] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:28,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:56:28,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280262593] [2024-11-19 08:56:28,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:56:28,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:28,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:56:28,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:56:28,316 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-19 08:56:28,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:28,343 INFO L93 Difference]: Finished difference Result 369 states and 407 transitions. [2024-11-19 08:56:28,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:56:28,343 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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 119 [2024-11-19 08:56:28,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:28,344 INFO L225 Difference]: With dead ends: 369 [2024-11-19 08:56:28,344 INFO L226 Difference]: Without dead ends: 369 [2024-11-19 08:56:28,345 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:56:28,345 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 0 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:28,345 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 706 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:56:28,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-19 08:56:28,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 369. [2024-11-19 08:56:28,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 305 states have (on average 1.321311475409836) internal successors, (403), 365 states have internal predecessors, (403), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:28,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 407 transitions. [2024-11-19 08:56:28,352 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 407 transitions. Word has length 119 [2024-11-19 08:56:28,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:28,352 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 407 transitions. [2024-11-19 08:56:28,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 4 states have internal predecessors, (45), 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-19 08:56:28,353 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 407 transitions. [2024-11-19 08:56:28,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 08:56:28,353 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:28,353 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:28,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-19 08:56:28,353 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:28,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:28,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1774044067, now seen corresponding path program 1 times [2024-11-19 08:56:28,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:28,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717861383] [2024-11-19 08:56:28,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:28,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:28,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:28,573 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-19 08:56:28,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:28,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717861383] [2024-11-19 08:56:28,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717861383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:28,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:28,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:56:28,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923039146] [2024-11-19 08:56:28,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:28,576 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:56:28,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:28,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:56:28,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:56:28,578 INFO L87 Difference]: Start difference. First operand 369 states and 407 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-19 08:56:28,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:28,665 INFO L93 Difference]: Finished difference Result 369 states and 407 transitions. [2024-11-19 08:56:28,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:56:28,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 121 [2024-11-19 08:56:28,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:28,666 INFO L225 Difference]: With dead ends: 369 [2024-11-19 08:56:28,666 INFO L226 Difference]: Without dead ends: 369 [2024-11-19 08:56:28,667 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-19 08:56:28,667 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 1 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:28,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 399 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:28,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-11-19 08:56:28,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 368. [2024-11-19 08:56:28,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 305 states have (on average 1.318032786885246) internal successors, (402), 364 states have internal predecessors, (402), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:28,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 406 transitions. [2024-11-19 08:56:28,673 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 406 transitions. Word has length 121 [2024-11-19 08:56:28,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:28,674 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 406 transitions. [2024-11-19 08:56:28,674 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-19 08:56:28,674 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 406 transitions. [2024-11-19 08:56:28,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-19 08:56:28,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:28,675 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:28,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-11-19 08:56:28,679 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:28,680 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:28,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1774044066, now seen corresponding path program 1 times [2024-11-19 08:56:28,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:28,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220639783] [2024-11-19 08:56:28,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:28,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-19 08:56:28,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:28,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220639783] [2024-11-19 08:56:28,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220639783] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:28,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:28,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:56:28,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306377776] [2024-11-19 08:56:28,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:28,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:56:28,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:28,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:56:28,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:56:28,980 INFO L87 Difference]: Start difference. First operand 368 states and 406 transitions. Second operand has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-19 08:56:29,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:29,086 INFO L93 Difference]: Finished difference Result 367 states and 405 transitions. [2024-11-19 08:56:29,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:56:29,087 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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 121 [2024-11-19 08:56:29,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:29,088 INFO L225 Difference]: With dead ends: 367 [2024-11-19 08:56:29,089 INFO L226 Difference]: Without dead ends: 367 [2024-11-19 08:56:29,089 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-19 08:56:29,089 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:29,090 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 404 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-19 08:56:29,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 367. [2024-11-19 08:56:29,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 367 states, 305 states have (on average 1.3147540983606558) internal successors, (401), 363 states have internal predecessors, (401), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:29,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 367 states to 367 states and 405 transitions. [2024-11-19 08:56:29,095 INFO L78 Accepts]: Start accepts. Automaton has 367 states and 405 transitions. Word has length 121 [2024-11-19 08:56:29,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:29,096 INFO L471 AbstractCegarLoop]: Abstraction has 367 states and 405 transitions. [2024-11-19 08:56:29,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 23.5) internal successors, (47), 3 states have internal predecessors, (47), 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-19 08:56:29,096 INFO L276 IsEmpty]: Start isEmpty. Operand 367 states and 405 transitions. [2024-11-19 08:56:29,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-19 08:56:29,097 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:29,097 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:29,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-11-19 08:56:29,098 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:29,098 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:29,098 INFO L85 PathProgramCache]: Analyzing trace with hash -975684373, now seen corresponding path program 1 times [2024-11-19 08:56:29,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:29,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400813129] [2024-11-19 08:56:29,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:29,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:29,321 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-19 08:56:29,322 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:29,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400813129] [2024-11-19 08:56:29,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400813129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:29,322 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:29,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 08:56:29,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3591105] [2024-11-19 08:56:29,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:29,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:56:29,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:29,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:56:29,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:56:29,324 INFO L87 Difference]: Start difference. First operand 367 states and 405 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-19 08:56:29,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:29,345 INFO L93 Difference]: Finished difference Result 371 states and 410 transitions. [2024-11-19 08:56:29,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:56:29,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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 124 [2024-11-19 08:56:29,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:29,347 INFO L225 Difference]: With dead ends: 371 [2024-11-19 08:56:29,348 INFO L226 Difference]: Without dead ends: 371 [2024-11-19 08:56:29,348 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:56:29,352 INFO L432 NwaCegarLoop]: 236 mSDtfsCounter, 2 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:29,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 695 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 08:56:29,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2024-11-19 08:56:29,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2024-11-19 08:56:29,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 369 states, 307 states have (on average 1.3127035830618892) internal successors, (403), 365 states have internal predecessors, (403), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:29,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 407 transitions. [2024-11-19 08:56:29,359 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 407 transitions. Word has length 124 [2024-11-19 08:56:29,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:29,359 INFO L471 AbstractCegarLoop]: Abstraction has 369 states and 407 transitions. [2024-11-19 08:56:29,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 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-19 08:56:29,360 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 407 transitions. [2024-11-19 08:56:29,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-19 08:56:29,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:29,361 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:29,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-11-19 08:56:29,362 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:29,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:29,362 INFO L85 PathProgramCache]: Analyzing trace with hash -128031900, now seen corresponding path program 1 times [2024-11-19 08:56:29,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:29,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501146580] [2024-11-19 08:56:29,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:29,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:29,704 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 381 trivial. 0 not checked. [2024-11-19 08:56:29,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:29,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501146580] [2024-11-19 08:56:29,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501146580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:29,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:29,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 08:56:29,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571570334] [2024-11-19 08:56:29,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:29,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 08:56:29,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:29,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 08:56:29,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 08:56:29,706 INFO L87 Difference]: Start difference. First operand 369 states and 407 transitions. Second operand has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-19 08:56:29,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:29,814 INFO L93 Difference]: Finished difference Result 384 states and 426 transitions. [2024-11-19 08:56:29,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 08:56:29,815 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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 125 [2024-11-19 08:56:29,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:29,816 INFO L225 Difference]: With dead ends: 384 [2024-11-19 08:56:29,816 INFO L226 Difference]: Without dead ends: 384 [2024-11-19 08:56:29,816 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 08:56:29,817 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 15 mSDsluCounter, 1301 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 1523 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:29,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 1523 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:29,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2024-11-19 08:56:29,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 378. [2024-11-19 08:56:29,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 378 states, 316 states have (on average 1.3101265822784811) internal successors, (414), 374 states have internal predecessors, (414), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:29,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 418 transitions. [2024-11-19 08:56:29,833 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 418 transitions. Word has length 125 [2024-11-19 08:56:29,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:29,834 INFO L471 AbstractCegarLoop]: Abstraction has 378 states and 418 transitions. [2024-11-19 08:56:29,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.375) internal successors, (51), 8 states have internal predecessors, (51), 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-19 08:56:29,834 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 418 transitions. [2024-11-19 08:56:29,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-19 08:56:29,835 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:29,835 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:29,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-11-19 08:56:29,835 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:29,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:29,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1331278773, now seen corresponding path program 1 times [2024-11-19 08:56:29,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:29,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389086940] [2024-11-19 08:56:29,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:29,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:30,662 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:30,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 08:56:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389086940] [2024-11-19 08:56:30,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389086940] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 08:56:30,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325870624] [2024-11-19 08:56:30,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:30,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 08:56:30,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:30,665 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 08:56:30,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-19 08:56:31,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:31,242 INFO L255 TraceCheckSpWp]: Trace formula consists of 1605 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 08:56:31,248 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:31,518 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:31,518 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 381 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 380 trivial. 0 not checked. [2024-11-19 08:56:31,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325870624] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:31,989 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 08:56:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 12 [2024-11-19 08:56:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649535226] [2024-11-19 08:56:31,990 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:31,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 08:56:31,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 08:56:31,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 08:56:31,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2024-11-19 08:56:31,995 INFO L87 Difference]: Start difference. First operand 378 states and 418 transitions. Second operand has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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-19 08:56:32,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:32,139 INFO L93 Difference]: Finished difference Result 523 states and 579 transitions. [2024-11-19 08:56:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 08:56:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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 126 [2024-11-19 08:56:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:32,141 INFO L225 Difference]: With dead ends: 523 [2024-11-19 08:56:32,141 INFO L226 Difference]: Without dead ends: 523 [2024-11-19 08:56:32,141 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:56:32,142 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 233 mSDsluCounter, 1442 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1669 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:32,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [234 Valid, 1669 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:32,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2024-11-19 08:56:32,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 379. [2024-11-19 08:56:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 317 states have (on average 1.3091482649842272) internal successors, (415), 375 states have internal predecessors, (415), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 419 transitions. [2024-11-19 08:56:32,156 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 419 transitions. Word has length 126 [2024-11-19 08:56:32,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:32,156 INFO L471 AbstractCegarLoop]: Abstraction has 379 states and 419 transitions. [2024-11-19 08:56:32,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.25) internal successors, (75), 12 states have internal predecessors, (75), 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-19 08:56:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 419 transitions. [2024-11-19 08:56:32,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-19 08:56:32,157 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:32,160 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 08:56:32,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-19 08:56:32,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2024-11-19 08:56:32,361 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:32,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:32,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1733043960, now seen corresponding path program 1 times [2024-11-19 08:56:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 08:56:32,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643270830] [2024-11-19 08:56:32,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:32,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 08:56:32,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 08:56:32,556 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 08:56:32,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 08:56:32,891 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 08:56:32,894 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 08:56:32,895 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_DEREFERENCE (93 of 94 remaining) [2024-11-19 08:56:32,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 94 remaining) [2024-11-19 08:56:32,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (91 of 94 remaining) [2024-11-19 08:56:32,900 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (90 of 94 remaining) [2024-11-19 08:56:32,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 94 remaining) [2024-11-19 08:56:32,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 94 remaining) [2024-11-19 08:56:32,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 94 remaining) [2024-11-19 08:56:32,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 94 remaining) [2024-11-19 08:56:32,904 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 94 remaining) [2024-11-19 08:56:32,905 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 94 remaining) [2024-11-19 08:56:32,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE (70 of 94 remaining) [2024-11-19 08:56:32,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE (69 of 94 remaining) [2024-11-19 08:56:32,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 94 remaining) [2024-11-19 08:56:32,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 94 remaining) [2024-11-19 08:56:32,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 94 remaining) [2024-11-19 08:56:32,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 94 remaining) [2024-11-19 08:56:32,906 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 94 remaining) [2024-11-19 08:56:32,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 94 remaining) [2024-11-19 08:56:32,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 94 remaining) [2024-11-19 08:56:32,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 94 remaining) [2024-11-19 08:56:32,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 94 remaining) [2024-11-19 08:56:32,907 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_LEAK (54 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 94 remaining) [2024-11-19 08:56:32,908 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_DEREFERENCE (51 of 94 remaining) [2024-11-19 08:56:32,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE (50 of 94 remaining) [2024-11-19 08:56:32,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE (49 of 94 remaining) [2024-11-19 08:56:32,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE (48 of 94 remaining) [2024-11-19 08:56:32,909 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 94 remaining) [2024-11-19 08:56:32,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 94 remaining) [2024-11-19 08:56:32,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 94 remaining) [2024-11-19 08:56:32,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 94 remaining) [2024-11-19 08:56:32,913 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_DEREFERENCE (43 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_DEREFERENCE (42 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_DEREFERENCE (31 of 94 remaining) [2024-11-19 08:56:32,914 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_DEREFERENCE (26 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68ASSERT_VIOLATIONMEMORY_DEREFERENCE (25 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 94 remaining) [2024-11-19 08:56:32,915 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73ASSERT_VIOLATIONMEMORY_DEREFERENCE (20 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74ASSERT_VIOLATIONMEMORY_DEREFERENCE (19 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (12 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (11 of 94 remaining) [2024-11-19 08:56:32,916 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (10 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84ASSERT_VIOLATIONMEMORY_FREE (9 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85ASSERT_VIOLATIONMEMORY_FREE (8 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (7 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (6 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (5 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_FREE (4 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90ASSERT_VIOLATIONMEMORY_FREE (3 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91ASSERT_VIOLATIONMEMORY_FREE (2 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92ASSERT_VIOLATIONMEMORY_FREE (1 of 94 remaining) [2024-11-19 08:56:32,917 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93ASSERT_VIOLATIONMEMORY_LEAK (0 of 94 remaining) [2024-11-19 08:56:32,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-11-19 08:56:32,930 INFO L407 BasicCegarLoop]: Path program histogram: [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:33,105 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 08:56:33,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 08:56:33 BoogieIcfgContainer [2024-11-19 08:56:33,115 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 08:56:33,116 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 08:56:33,119 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 08:56:33,119 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 08:56:33,120 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:55:50" (3/4) ... [2024-11-19 08:56:33,122 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 08:56:33,129 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 08:56:33,130 INFO L158 Benchmark]: Toolchain (without parser) took 45313.59ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 851.4MB). Free memory was 187.9MB in the beginning and 499.3MB in the end (delta: -311.4MB). Peak memory consumption was 539.9MB. Max. memory is 16.1GB. [2024-11-19 08:56:33,130 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory was 112.4MB in the beginning and 112.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 08:56:33,130 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1094.23ms. Allocated memory is still 218.1MB. Free memory was 187.9MB in the beginning and 136.4MB in the end (delta: 51.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-19 08:56:33,130 INFO L158 Benchmark]: Boogie Procedure Inliner took 214.00ms. Allocated memory is still 218.1MB. Free memory was 136.4MB in the beginning and 129.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-19 08:56:33,130 INFO L158 Benchmark]: Boogie Preprocessor took 249.33ms. Allocated memory is still 218.1MB. Free memory was 129.1MB in the beginning and 117.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-19 08:56:33,130 INFO L158 Benchmark]: RCFGBuilder took 1217.12ms. Allocated memory is still 218.1MB. Free memory was 117.5MB in the beginning and 149.1MB in the end (delta: -31.6MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. [2024-11-19 08:56:33,131 INFO L158 Benchmark]: TraceAbstraction took 42519.96ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 851.4MB). Free memory was 149.1MB in the beginning and 500.4MB in the end (delta: -351.3MB). Peak memory consumption was 499.1MB. Max. memory is 16.1GB. [2024-11-19 08:56:33,131 INFO L158 Benchmark]: Witness Printer took 13.86ms. Allocated memory is still 1.1GB. Free memory was 500.4MB in the beginning and 499.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 08:56:33,131 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 153.1MB. Free memory was 112.4MB in the beginning and 112.2MB in the end (delta: 139.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1094.23ms. Allocated memory is still 218.1MB. Free memory was 187.9MB in the beginning and 136.4MB in the end (delta: 51.5MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 214.00ms. Allocated memory is still 218.1MB. Free memory was 136.4MB in the beginning and 129.1MB in the end (delta: 7.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 249.33ms. Allocated memory is still 218.1MB. Free memory was 129.1MB in the beginning and 117.5MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1217.12ms. Allocated memory is still 218.1MB. Free memory was 117.5MB in the beginning and 149.1MB in the end (delta: -31.6MB). Peak memory consumption was 69.2MB. Max. memory is 16.1GB. * TraceAbstraction took 42519.96ms. Allocated memory was 218.1MB in the beginning and 1.1GB in the end (delta: 851.4MB). Free memory was 149.1MB in the beginning and 500.4MB in the end (delta: -351.3MB). Peak memory consumption was 499.1MB. Max. memory is 16.1GB. * Witness Printer took 13.86ms. Allocated memory is still 1.1GB. Free memory was 500.4MB in the beginning and 499.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: overapproximation of strrchr at line 1424. Possible FailurePath: [L1318] static const char *applet_name; [L1319] static signed int bb_errno_location; [L1320] static signed int * const bb_errno; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; [L1512] static struct utmp dummy_utmp; VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1575] char *a = malloc(11); [L1576] a[10] = 0 VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] int i=0; VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=1] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=2] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=3] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=4] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=5] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=6] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=7] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=8] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=9] [L1577] COND TRUE i<10 [L1578] a[i]=__VERIFIER_nondet_char() VAL [applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1577] ++i VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=10] [L1577] COND FALSE !(i<10) VAL [a={-1:0}, applet_name={0:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}] [L1579] applet_name = a [L1580] bb_errno_location = __VERIFIER_nondet_int() [L1581] optind = 1 [L1582] int argc = __VERIFIER_nondet_int(); [L1583] CALL assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1583] RET assume_abort_if_not(argc >= 1 && argc <= 10000) VAL [a={-1:0}, applet_name={-1:0}, argc=1, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1584] char **argv=malloc((argc+1)*sizeof(char*)); [L1585] char **mem_track=malloc((argc+1)*sizeof(char*)); [L1586] argv[argc]=0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1587] int i=0; VAL [a={-1:0}, applet_name={-1:0}, argc=1, argv={-12:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, i=0, mem_track={-13:0}, optind=1] [L1587] COND TRUE i= 2u [L1394] FCALL bb_show_usage() [L1395] argv = argv + 1l VAL [applet_name={-1:0}, argv={-12:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] EXPR \read(**argv) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] CALL, EXPR bb_get_last_path_component_strip(*argv) [L1443] char *slash; [L1444] CALL, EXPR last_char_is(path, 47) [L1482] COND FALSE !(!(s == ((const char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1495] return (char *)((void *)0); VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, c=47, dummy_utmp={10:0}, optind=1] [L1444] RET, EXPR last_char_is(path, 47) [L1444] slash=last_char_is(path, 47) [L1445] char *tmp_post$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1446] COND FALSE !(!(slash == ((char *)((void *)0)))) VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1454] char *return_value_bb_get_last_path_component_nostrip$2; [L1455] CALL, EXPR bb_get_last_path_component_nostrip(path) [L1423] char *slash; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}] [L1424] slash=strrchr(path, 47) [L1425] _Bool tmp_if_expr$2; [L1426] _Bool tmp_if_expr$1; VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}] [L1427] COND TRUE slash == ((char *)((void *)0)) [L1428] tmp_if_expr$2 = 1 != 0 VAL [applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, path={0:0}, slash={0:0}, tmp_if_expr$2=1] [L1437] COND TRUE !(tmp_if_expr$2 == (_Bool)0) [L1438] return (char *)path; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1, slash={0:0}] [L1455] RET, EXPR bb_get_last_path_component_nostrip(path) [L1455] return_value_bb_get_last_path_component_nostrip$2=bb_get_last_path_component_nostrip(path) [L1456] return return_value_bb_get_last_path_component_nostrip$2; VAL [\result={0:0}, applet_name={-1:0}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] [L1396] RET, EXPR bb_get_last_path_component_strip(*argv) [L1396] s=bb_get_last_path_component_strip(*argv) [L1397] strlen(s) VAL [applet_name={-1:0}, argv={-12:8}, bb_errno={0:0}, bb_errno_location=0, dummy_utmp={10:0}, optind=1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1342]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 22]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1383]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1488]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1397]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1402]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1408]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1597]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1598]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1599]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1600]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1573]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 248 locations, 94 error locations. Started 1 CEGAR loops. OverallTime: 42.3s, OverallIterations: 33, TraceHistogramMax: 10, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 9.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7050 SdHoareTripleChecker+Valid, 7.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7033 mSDsluCounter, 28565 SdHoareTripleChecker+Invalid, 6.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 21555 mSDsCounter, 145 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 8203 IncrementalHoareTripleChecker+Invalid, 8348 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 145 mSolverCounterUnsat, 7010 mSDtfsCounter, 8203 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1948 GetRequests, 1661 SyntacticMatches, 19 SemanticMatches, 268 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1075 ImplicationChecksByTransitivity, 4.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=379occurred in iteration=32, InterpolantAutomatonStates: 220, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 32 MinimizatonAttempts, 901 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.7s SsaConstructionTime, 3.1s SatisfiabilityAnalysisTime, 22.6s InterpolantComputationTime, 3254 NumberOfCodeBlocks, 3046 NumberOfCodeBlocksAsserted, 48 NumberOfCheckSat, 3943 ConstructedInterpolants, 192 QuantifiedInterpolants, 30348 SizeOfPredicates, 46 NumberOfNonLiveVariables, 14060 ConjunctsInSsa, 156 ConjunctsInUnsatCore, 54 InterpolantComputations, 21 PerfectInterpolantSequences, 11227/12084 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 08:56:33,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/busybox-1.22.0/basename-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 08:56:35,863 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 08:56:35,921 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Bitvector.epf [2024-11-19 08:56:35,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 08:56:35,928 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 08:56:35,956 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 08:56:35,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 08:56:35,958 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 08:56:35,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 08:56:35,959 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 08:56:35,959 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 08:56:35,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 08:56:35,960 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 08:56:35,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 08:56:35,962 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 08:56:35,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 08:56:35,963 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 08:56:35,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 08:56:35,964 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 08:56:35,964 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 08:56:35,967 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 08:56:35,968 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 08:56:35,968 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 08:56:35,969 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 08:56:35,969 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 08:56:35,969 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 08:56:35,969 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 08:56:35,970 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 08:56:35,970 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 08:56:35,970 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 08:56:35,970 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 08:56:35,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 08:56:35,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:56:35,971 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 08:56:35,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 08:56:35,972 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 08:56:35,972 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 08:56:35,989 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 08:56:35,989 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 08:56:35,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 08:56:35,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 08:56:35,990 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 320ae3d03464475ecb206e8b20150b073c01ab68d3174adb5b7045f5bdb20751 [2024-11-19 08:56:36,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 08:56:36,333 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 08:56:36,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 08:56:36,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 08:56:36,338 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 08:56:36,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-19 08:56:38,222 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 08:56:38,604 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 08:56:38,605 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/busybox-1.22.0/basename-1.i [2024-11-19 08:56:38,630 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3976bb3b5/be0d71f9123d43fa85f2f89db4ce57b6/FLAG59b1eeccc [2024-11-19 08:56:38,837 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3976bb3b5/be0d71f9123d43fa85f2f89db4ce57b6 [2024-11-19 08:56:38,839 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 08:56:38,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 08:56:38,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 08:56:38,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 08:56:38,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 08:56:38,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:56:38" (1/1) ... [2024-11-19 08:56:38,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79bea5dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:38, skipping insertion in model container [2024-11-19 08:56:38,858 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 08:56:38" (1/1) ... [2024-11-19 08:56:39,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 08:56:39,871 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-19 08:56:39,907 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-19 08:56:39,919 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-19 08:56:39,928 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-19 08:56:39,939 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-19 08:56:39,955 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-19 08:56:39,960 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-19 08:56:39,961 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-19 08:56:39,963 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-19 08:56:39,970 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-19 08:56:39,992 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-19 08:56:40,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:56:40,058 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 08:56:40,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 08:56:40,389 INFO L204 MainTranslator]: Completed translation [2024-11-19 08:56:40,394 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40 WrapperNode [2024-11-19 08:56:40,394 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 08:56:40,395 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 08:56:40,395 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 08:56:40,395 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 08:56:40,405 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,470 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,577 INFO L138 Inliner]: procedures = 353, calls = 461, calls flagged for inlining = 12, calls inlined = 11, statements flattened = 735 [2024-11-19 08:56:40,577 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 08:56:40,578 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 08:56:40,582 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 08:56:40,582 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 08:56:40,599 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,599 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,606 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,659 INFO L175 MemorySlicer]: Split 410 memory accesses to 14 slices as follows [2, 12, 3, 3, 3, 4, 1, 12, 4, 4, 3, 355, 2, 2]. 87 percent of accesses are in the largest equivalence class. The 378 initializations are split as follows [2, 0, 3, 3, 3, 3, 0, 0, 3, 3, 3, 355, 0, 0]. The 10 writes are split as follows [0, 2, 0, 0, 0, 0, 0, 5, 0, 0, 0, 0, 2, 1]. [2024-11-19 08:56:40,659 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,659 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,704 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,710 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,722 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 08:56:40,723 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 08:56:40,723 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 08:56:40,723 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 08:56:40,723 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (1/1) ... [2024-11-19 08:56:40,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 08:56:40,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 08:56:40,756 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-19 08:56:40,767 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-19 08:56:40,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 08:56:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 08:56:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2024-11-19 08:56:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2024-11-19 08:56:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2024-11-19 08:56:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2024-11-19 08:56:40,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2024-11-19 08:56:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2024-11-19 08:56:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2024-11-19 08:56:40,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2024-11-19 08:56:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2024-11-19 08:56:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2024-11-19 08:56:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2024-11-19 08:56:40,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2024-11-19 08:56:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 08:56:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 08:56:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 08:56:40,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2024-11-19 08:56:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2024-11-19 08:56:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2024-11-19 08:56:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#6 [2024-11-19 08:56:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#7 [2024-11-19 08:56:40,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#8 [2024-11-19 08:56:40,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#9 [2024-11-19 08:56:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#10 [2024-11-19 08:56:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#11 [2024-11-19 08:56:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#12 [2024-11-19 08:56:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#13 [2024-11-19 08:56:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 08:56:40,810 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 08:56:40,810 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-19 08:56:40,811 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2024-11-19 08:56:40,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2024-11-19 08:56:40,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#6 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#7 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#8 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#9 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#10 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#11 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#12 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#13 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-19 08:56:40,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2024-11-19 08:56:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2024-11-19 08:56:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2024-11-19 08:56:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2024-11-19 08:56:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2024-11-19 08:56:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2024-11-19 08:56:40,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2024-11-19 08:56:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2024-11-19 08:56:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2024-11-19 08:56:40,819 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2024-11-19 08:56:40,820 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#6 [2024-11-19 08:56:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#7 [2024-11-19 08:56:40,821 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#8 [2024-11-19 08:56:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#9 [2024-11-19 08:56:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#10 [2024-11-19 08:56:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#11 [2024-11-19 08:56:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#12 [2024-11-19 08:56:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#13 [2024-11-19 08:56:40,822 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 08:56:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 08:56:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 08:56:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 08:56:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 08:56:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-19 08:56:40,823 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-19 08:56:40,824 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-19 08:56:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-19 08:56:40,825 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 08:56:40,825 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 08:56:41,280 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 08:56:41,282 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 08:56:42,389 INFO L? ?]: Removed 261 outVars from TransFormulas that were not future-live. [2024-11-19 08:56:42,389 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 08:56:42,415 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 08:56:42,419 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-19 08:56:42,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:56:42 BoogieIcfgContainer [2024-11-19 08:56:42,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 08:56:42,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 08:56:42,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 08:56:42,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 08:56:42,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 08:56:38" (1/3) ... [2024-11-19 08:56:42,432 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8fe67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:56:42, skipping insertion in model container [2024-11-19 08:56:42,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 08:56:40" (2/3) ... [2024-11-19 08:56:42,433 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d8fe67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 08:56:42, skipping insertion in model container [2024-11-19 08:56:42,433 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 08:56:42" (3/3) ... [2024-11-19 08:56:42,434 INFO L112 eAbstractionObserver]: Analyzing ICFG basename-1.i [2024-11-19 08:56:42,463 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 08:56:42,464 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 94 error locations. [2024-11-19 08:56:42,538 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 08:56:42,550 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;@351e6c7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 08:56:42,550 INFO L334 AbstractCegarLoop]: Starting to check reachability of 94 error locations. [2024-11-19 08:56:42,561 INFO L276 IsEmpty]: Start isEmpty. Operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:42,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:56:42,567 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:42,568 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:56:42,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:42,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:42,573 INFO L85 PathProgramCache]: Analyzing trace with hash 37801, now seen corresponding path program 1 times [2024-11-19 08:56:42,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:42,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2053954315] [2024-11-19 08:56:42,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:42,594 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:42,594 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:42,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:42,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 08:56:42,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:42,883 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 08:56:42,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:42,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 08:56:42,941 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-19 08:56:42,941 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:56:42,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:42,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2053954315] [2024-11-19 08:56:42,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2053954315] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:42,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:42,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:56:42,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243917485] [2024-11-19 08:56:42,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:42,948 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:56:42,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:42,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:56:42,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:56:42,974 INFO L87 Difference]: Start difference. First operand has 248 states, 150 states have (on average 1.9133333333333333) internal successors, (287), 244 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:56:43,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:43,377 INFO L93 Difference]: Finished difference Result 258 states and 290 transitions. [2024-11-19 08:56:43,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:56:43,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 08:56:43,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:43,390 INFO L225 Difference]: With dead ends: 258 [2024-11-19 08:56:43,390 INFO L226 Difference]: Without dead ends: 256 [2024-11-19 08:56:43,391 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-19 08:56:43,396 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 240 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:43,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 209 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 08:56:43,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2024-11-19 08:56:43,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 239. [2024-11-19 08:56:43,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 146 states have (on average 1.821917808219178) internal successors, (266), 235 states have internal predecessors, (266), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:43,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 270 transitions. [2024-11-19 08:56:43,435 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 270 transitions. Word has length 3 [2024-11-19 08:56:43,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:43,435 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 270 transitions. [2024-11-19 08:56:43,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:56:43,435 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 270 transitions. [2024-11-19 08:56:43,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-11-19 08:56:43,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:43,436 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-11-19 08:56:43,448 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-19 08:56:43,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:43,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:43,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:43,638 INFO L85 PathProgramCache]: Analyzing trace with hash 37802, now seen corresponding path program 1 times [2024-11-19 08:56:43,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:43,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636731792] [2024-11-19 08:56:43,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:43,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:43,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:43,645 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:43,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 08:56:43,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:43,875 INFO L255 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:56:43,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:43,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:56:43,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:56:43,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:56:43,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:43,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [636731792] [2024-11-19 08:56:43,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [636731792] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:43,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:43,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:56:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537073581] [2024-11-19 08:56:43,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:43,896 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:56:43,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:43,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:56:43,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:56:43,897 INFO L87 Difference]: Start difference. First operand 239 states and 270 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:56:44,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:44,371 INFO L93 Difference]: Finished difference Result 238 states and 269 transitions. [2024-11-19 08:56:44,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:56:44,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-11-19 08:56:44,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:44,373 INFO L225 Difference]: With dead ends: 238 [2024-11-19 08:56:44,373 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 08:56:44,373 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-19 08:56:44,374 INFO L432 NwaCegarLoop]: 264 mSDtfsCounter, 7 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:44,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 438 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:56:44,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 08:56:44,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 238. [2024-11-19 08:56:44,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 146 states have (on average 1.8150684931506849) internal successors, (265), 234 states have internal predecessors, (265), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:44,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 269 transitions. [2024-11-19 08:56:44,384 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 269 transitions. Word has length 3 [2024-11-19 08:56:44,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:44,384 INFO L471 AbstractCegarLoop]: Abstraction has 238 states and 269 transitions. [2024-11-19 08:56:44,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:56:44,384 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 269 transitions. [2024-11-19 08:56:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 08:56:44,385 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:44,385 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 08:56:44,416 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 08:56:44,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:44,590 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:44,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:44,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1126113961, now seen corresponding path program 1 times [2024-11-19 08:56:44,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:44,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [536366010] [2024-11-19 08:56:44,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:44,596 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:44,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:44,599 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:44,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 08:56:44,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:44,896 INFO L255 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:56:44,898 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:44,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:56:44,975 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-19 08:56:44,976 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:56:44,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:44,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [536366010] [2024-11-19 08:56:44,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [536366010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:44,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:44,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 08:56:44,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055802496] [2024-11-19 08:56:44,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:44,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 08:56:44,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:44,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 08:56:44,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:56:44,980 INFO L87 Difference]: Start difference. First operand 238 states and 269 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-19 08:56:45,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:45,542 INFO L93 Difference]: Finished difference Result 241 states and 272 transitions. [2024-11-19 08:56:45,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 08:56:45,543 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-19 08:56:45,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:45,544 INFO L225 Difference]: With dead ends: 241 [2024-11-19 08:56:45,544 INFO L226 Difference]: Without dead ends: 241 [2024-11-19 08:56:45,544 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 08:56:45,549 INFO L432 NwaCegarLoop]: 262 mSDtfsCounter, 7 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:45,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 610 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 08:56:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2024-11-19 08:56:45,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 240. [2024-11-19 08:56:45,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 240 states, 148 states have (on average 1.804054054054054) internal successors, (267), 236 states have internal predecessors, (267), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:45,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 271 transitions. [2024-11-19 08:56:45,566 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 271 transitions. Word has length 6 [2024-11-19 08:56:45,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:45,568 INFO L471 AbstractCegarLoop]: Abstraction has 240 states and 271 transitions. [2024-11-19 08:56:45,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 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-19 08:56:45,568 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 271 transitions. [2024-11-19 08:56:45,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-19 08:56:45,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:45,575 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:45,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 08:56:45,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:45,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:45,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:45,779 INFO L85 PathProgramCache]: Analyzing trace with hash 71430167, now seen corresponding path program 1 times [2024-11-19 08:56:45,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:45,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [699469262] [2024-11-19 08:56:45,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:45,780 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:45,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:45,783 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:45,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 08:56:46,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:46,047 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 08:56:46,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:46,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 08:56:46,170 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:56:46,171 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:46,547 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:56:46,547 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:46,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [699469262] [2024-11-19 08:56:46,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [699469262] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:46,548 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:56:46,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2024-11-19 08:56:46,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644331945] [2024-11-19 08:56:46,548 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:46,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 08:56:46,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:46,549 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 08:56:46,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-11-19 08:56:46,549 INFO L87 Difference]: Start difference. First operand 240 states and 271 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:56:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:49,332 INFO L93 Difference]: Finished difference Result 244 states and 275 transitions. [2024-11-19 08:56:49,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 08:56:49,334 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-19 08:56:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:49,335 INFO L225 Difference]: With dead ends: 244 [2024-11-19 08:56:49,335 INFO L226 Difference]: Without dead ends: 244 [2024-11-19 08:56:49,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2024-11-19 08:56:49,337 INFO L432 NwaCegarLoop]: 261 mSDtfsCounter, 10 mSDsluCounter, 696 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:49,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 957 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-19 08:56:49,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-19 08:56:49,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 244. [2024-11-19 08:56:49,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 153 states have (on average 1.7712418300653594) internal successors, (271), 240 states have internal predecessors, (271), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:49,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 275 transitions. [2024-11-19 08:56:49,370 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 275 transitions. Word has length 9 [2024-11-19 08:56:49,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:49,371 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 275 transitions. [2024-11-19 08:56:49,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 08:56:49,371 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 275 transitions. [2024-11-19 08:56:49,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-19 08:56:49,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:49,372 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:49,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 08:56:49,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:49,572 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:49,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:49,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1803865808, now seen corresponding path program 1 times [2024-11-19 08:56:49,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:49,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1547627777] [2024-11-19 08:56:49,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:49,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:49,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:49,579 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:49,580 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 08:56:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:49,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 504 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:56:49,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:49,876 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:56:49,877 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:49,941 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:56:49,942 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:49,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1547627777] [2024-11-19 08:56:49,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1547627777] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:49,942 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:56:49,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-19 08:56:49,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023176575] [2024-11-19 08:56:49,942 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:49,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 08:56:49,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:49,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 08:56:49,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-11-19 08:56:49,944 INFO L87 Difference]: Start difference. First operand 244 states and 275 transitions. Second operand has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-19 08:56:50,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:50,115 INFO L93 Difference]: Finished difference Result 259 states and 290 transitions. [2024-11-19 08:56:50,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:56:50,116 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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 22 [2024-11-19 08:56:50,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:50,116 INFO L225 Difference]: With dead ends: 259 [2024-11-19 08:56:50,116 INFO L226 Difference]: Without dead ends: 259 [2024-11-19 08:56:50,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=93, Unknown=0, NotChecked=0, Total=156 [2024-11-19 08:56:50,117 INFO L432 NwaCegarLoop]: 265 mSDtfsCounter, 12 mSDsluCounter, 1566 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1831 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:50,117 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1831 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 08:56:50,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-19 08:56:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2024-11-19 08:56:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 168 states have (on average 1.7023809523809523) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:50,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-19 08:56:50,123 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 22 [2024-11-19 08:56:50,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:50,123 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-19 08:56:50,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.4) internal successors, (34), 10 states have internal predecessors, (34), 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-19 08:56:50,123 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-19 08:56:50,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 08:56:50,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:50,124 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:50,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 08:56:50,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:50,325 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:50,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:50,326 INFO L85 PathProgramCache]: Analyzing trace with hash 1046446110, now seen corresponding path program 2 times [2024-11-19 08:56:50,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:50,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1193830607] [2024-11-19 08:56:50,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:56:50,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:50,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:50,329 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:50,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 08:56:52,159 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 08:56:52,159 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:56:52,165 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 08:56:52,167 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:52,187 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 08:56:52,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-19 08:56:52,208 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-19 08:56:52,208 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:56:52,209 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:52,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1193830607] [2024-11-19 08:56:52,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1193830607] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:52,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:52,209 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:56:52,209 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960780285] [2024-11-19 08:56:52,209 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:52,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:56:52,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:52,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:56:52,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:56:52,210 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 08:56:52,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:52,689 INFO L93 Difference]: Finished difference Result 271 states and 303 transitions. [2024-11-19 08:56:52,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:56:52,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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 37 [2024-11-19 08:56:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:52,691 INFO L225 Difference]: With dead ends: 271 [2024-11-19 08:56:52,691 INFO L226 Difference]: Without dead ends: 271 [2024-11-19 08:56:52,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 35 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-19 08:56:52,693 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 223 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:52,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 211 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 08:56:52,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2024-11-19 08:56:52,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 254. [2024-11-19 08:56:52,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 168 states have (on average 1.6726190476190477) internal successors, (281), 250 states have internal predecessors, (281), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:52,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 285 transitions. [2024-11-19 08:56:52,700 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 285 transitions. Word has length 37 [2024-11-19 08:56:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:52,701 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 285 transitions. [2024-11-19 08:56:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 7.0) internal successors, (14), 3 states have internal predecessors, (14), 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-19 08:56:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 285 transitions. [2024-11-19 08:56:52,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-19 08:56:52,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:52,702 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:52,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 08:56:52,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:52,903 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:52,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:52,904 INFO L85 PathProgramCache]: Analyzing trace with hash 1046446111, now seen corresponding path program 1 times [2024-11-19 08:56:52,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:52,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [387414009] [2024-11-19 08:56:52,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:52,905 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:52,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:52,907 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:52,908 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 08:56:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:56:53,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 08:56:53,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:53,383 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:56:53,383 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 08:56:53,565 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 08:56:53,565 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:53,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [387414009] [2024-11-19 08:56:53,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [387414009] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 08:56:53,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 08:56:53,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2024-11-19 08:56:53,566 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144942142] [2024-11-19 08:56:53,566 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 08:56:53,566 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 08:56:53,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:53,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 08:56:53,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-19 08:56:53,567 INFO L87 Difference]: Start difference. First operand 254 states and 285 transitions. Second operand has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 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-19 08:56:53,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:53,939 INFO L93 Difference]: Finished difference Result 260 states and 291 transitions. [2024-11-19 08:56:53,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 08:56:53,940 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 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 37 [2024-11-19 08:56:53,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:53,941 INFO L225 Difference]: With dead ends: 260 [2024-11-19 08:56:53,941 INFO L226 Difference]: Without dead ends: 260 [2024-11-19 08:56:53,941 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2024-11-19 08:56:53,941 INFO L432 NwaCegarLoop]: 260 mSDtfsCounter, 6 mSDsluCounter, 2816 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3076 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:53,941 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3076 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:56:53,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2024-11-19 08:56:53,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2024-11-19 08:56:53,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 174 states have (on average 1.6494252873563218) internal successors, (287), 256 states have internal predecessors, (287), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 291 transitions. [2024-11-19 08:56:53,946 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 291 transitions. Word has length 37 [2024-11-19 08:56:53,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:53,946 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 291 transitions. [2024-11-19 08:56:53,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 3.2) internal successors, (64), 20 states have internal predecessors, (64), 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-19 08:56:53,947 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 291 transitions. [2024-11-19 08:56:53,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-19 08:56:53,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:53,949 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:53,961 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2024-11-19 08:56:54,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:54,150 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:54,150 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:54,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1137674529, now seen corresponding path program 2 times [2024-11-19 08:56:54,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:54,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1963046639] [2024-11-19 08:56:54,151 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 08:56:54,151 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:54,154 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:54,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 08:56:56,194 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-19 08:56:56,194 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 08:56:56,203 INFO L255 TraceCheckSpWp]: Trace formula consists of 459 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 08:56:56,205 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:56:56,272 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 08:56:56,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2024-11-19 08:56:56,365 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:56:56,365 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:56:56,365 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:56:56,366 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1963046639] [2024-11-19 08:56:56,366 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1963046639] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:56:56,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:56:56,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 08:56:56,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853526789] [2024-11-19 08:56:56,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:56:56,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 08:56:56,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:56:56,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 08:56:56,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:56:56,367 INFO L87 Difference]: Start difference. First operand 260 states and 291 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-19 08:56:58,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:56:58,464 INFO L93 Difference]: Finished difference Result 425 states and 486 transitions. [2024-11-19 08:56:58,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 08:56:58,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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 43 [2024-11-19 08:56:58,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:56:58,471 INFO L225 Difference]: With dead ends: 425 [2024-11-19 08:56:58,471 INFO L226 Difference]: Without dead ends: 425 [2024-11-19 08:56:58,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 08:56:58,472 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 610 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-19 08:56:58,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 754 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-19 08:56:58,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-11-19 08:56:58,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 259. [2024-11-19 08:56:58,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 174 states have (on average 1.6436781609195403) internal successors, (286), 255 states have internal predecessors, (286), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:56:58,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 290 transitions. [2024-11-19 08:56:58,495 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 290 transitions. Word has length 43 [2024-11-19 08:56:58,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:56:58,496 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 290 transitions. [2024-11-19 08:56:58,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 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-19 08:56:58,497 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 290 transitions. [2024-11-19 08:56:58,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-19 08:56:58,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:56:58,501 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:56:58,528 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 08:56:58,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:58,702 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:56:58,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:56:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash -874983285, now seen corresponding path program 1 times [2024-11-19 08:56:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:56:58,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [254309027] [2024-11-19 08:56:58,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:56:58,704 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:56:58,704 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:56:58,705 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:56:58,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 08:57:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:00,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 632 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 08:57:00,743 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:00,838 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 08:57:00,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 21 [2024-11-19 08:57:01,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:57:01,220 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-19 08:57:01,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 31 [2024-11-19 08:57:01,246 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 08:57:01,246 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 13 treesize of output 13 [2024-11-19 08:57:01,388 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:57:01,388 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:01,388 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:01,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [254309027] [2024-11-19 08:57:01,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [254309027] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:01,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:01,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 08:57:01,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122517629] [2024-11-19 08:57:01,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:01,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 08:57:01,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:01,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 08:57:01,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-19 08:57:01,389 INFO L87 Difference]: Start difference. First operand 259 states and 290 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-19 08:57:05,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:05,282 INFO L93 Difference]: Finished difference Result 296 states and 330 transitions. [2024-11-19 08:57:05,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 08:57:05,283 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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 46 [2024-11-19 08:57:05,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:05,285 INFO L225 Difference]: With dead ends: 296 [2024-11-19 08:57:05,285 INFO L226 Difference]: Without dead ends: 296 [2024-11-19 08:57:05,285 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2024-11-19 08:57:05,286 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 562 mSDsluCounter, 446 mSDsCounter, 0 mSdLazyCounter, 576 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 576 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:05,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 579 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 576 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-11-19 08:57:05,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2024-11-19 08:57:05,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 272. [2024-11-19 08:57:05,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 272 states, 188 states have (on average 1.627659574468085) internal successors, (306), 268 states have internal predecessors, (306), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:57:05,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 310 transitions. [2024-11-19 08:57:05,293 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 310 transitions. Word has length 46 [2024-11-19 08:57:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:05,293 INFO L471 AbstractCegarLoop]: Abstraction has 272 states and 310 transitions. [2024-11-19 08:57:05,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 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-19 08:57:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 310 transitions. [2024-11-19 08:57:05,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 08:57:05,294 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:05,294 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:05,314 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 08:57:05,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:57:05,499 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:57:05,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:05,500 INFO L85 PathProgramCache]: Analyzing trace with hash -470534900, now seen corresponding path program 1 times [2024-11-19 08:57:05,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:05,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832788335] [2024-11-19 08:57:05,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:05,501 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:57:05,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:05,505 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:57:05,507 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 08:57:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:07,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 08:57:07,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:07,192 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 11 treesize of output 7 [2024-11-19 08:57:07,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:57:07,203 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 6 treesize of output 1 [2024-11-19 08:57:07,229 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 08:57:07,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 08:57:07,254 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:57:07,254 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:07,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:07,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832788335] [2024-11-19 08:57:07,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832788335] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:07,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:07,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 08:57:07,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564799178] [2024-11-19 08:57:07,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:07,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 08:57:07,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:07,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 08:57:07,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:07,257 INFO L87 Difference]: Start difference. First operand 272 states and 310 transitions. Second operand has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-19 08:57:07,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 08:57:07,624 INFO L93 Difference]: Finished difference Result 278 states and 318 transitions. [2024-11-19 08:57:07,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 08:57:07,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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 49 [2024-11-19 08:57:07,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 08:57:07,630 INFO L225 Difference]: With dead ends: 278 [2024-11-19 08:57:07,630 INFO L226 Difference]: Without dead ends: 278 [2024-11-19 08:57:07,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 08:57:07,631 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 216 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 08:57:07,632 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 207 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 08:57:07,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2024-11-19 08:57:07,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2024-11-19 08:57:07,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 194 states have (on average 1.6185567010309279) internal successors, (314), 273 states have internal predecessors, (314), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 08:57:07,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 318 transitions. [2024-11-19 08:57:07,639 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 318 transitions. Word has length 49 [2024-11-19 08:57:07,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 08:57:07,640 INFO L471 AbstractCegarLoop]: Abstraction has 277 states and 318 transitions. [2024-11-19 08:57:07,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 10.0) internal successors, (20), 3 states have internal predecessors, (20), 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-19 08:57:07,640 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 318 transitions. [2024-11-19 08:57:07,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 08:57:07,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 08:57:07,642 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 08:57:07,662 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 08:57:07,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:57:07,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 91 more)] === [2024-11-19 08:57:07,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 08:57:07,844 INFO L85 PathProgramCache]: Analyzing trace with hash -470534899, now seen corresponding path program 1 times [2024-11-19 08:57:07,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 08:57:07,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2115351248] [2024-11-19 08:57:07,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 08:57:07,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 08:57:07,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 08:57:07,849 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 08:57:07,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 08:57:09,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 08:57:09,832 INFO L255 TraceCheckSpWp]: Trace formula consists of 652 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 08:57:09,834 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 08:57:09,865 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 10 [2024-11-19 08:57:09,876 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 08:57:09,883 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 16 treesize of output 10 [2024-11-19 08:57:09,896 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 11 treesize of output 7 [2024-11-19 08:57:10,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 08:57:10,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 14 [2024-11-19 08:57:10,086 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 08:57:10,086 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 13 treesize of output 13 [2024-11-19 08:57:10,179 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 145 trivial. 0 not checked. [2024-11-19 08:57:10,180 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 08:57:10,180 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 08:57:10,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2115351248] [2024-11-19 08:57:10,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2115351248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 08:57:10,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 08:57:10,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 08:57:10,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15678470] [2024-11-19 08:57:10,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 08:57:10,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 08:57:10,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 08:57:10,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 08:57:10,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-19 08:57:10,181 INFO L87 Difference]: Start difference. First operand 277 states and 318 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 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)