./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4fc63b2a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:12:57,671 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:12:57,765 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-31 22:12:57,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:12:57,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:12:57,809 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:12:57,809 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:12:57,810 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:12:57,811 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:12:57,811 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:12:57,812 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:12:57,812 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:12:57,813 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:12:57,813 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:12:57,814 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:12:57,814 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:12:57,815 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:12:57,815 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:12:57,816 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:12:57,816 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:12:57,817 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:12:57,818 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:12:57,818 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:12:57,819 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:12:57,819 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:12:57,819 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:12:57,820 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:12:57,820 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:12:57,821 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:12:57,821 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:12:57,822 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:12:57,822 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:12:57,823 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:12:57,823 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:12:57,824 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:12:57,824 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:12:57,825 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-31 22:12:57,825 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-31 22:12:57,825 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:12:57,826 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:12:57,826 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:12:57,827 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:12:57,827 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 [2024-10-31 22:12:58,243 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:12:58,271 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:12:58,277 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:12:58,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:12:58,280 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:12:58,282 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i Unable to find full path for "g++" [2024-10-31 22:13:00,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:13:00,823 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:13:00,824 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2024-10-31 22:13:00,844 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data/e9518a320/0e037232f62e4462a4aaca8286e12ab0/FLAG17c716e7b [2024-10-31 22:13:00,864 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data/e9518a320/0e037232f62e4462a4aaca8286e12ab0 [2024-10-31 22:13:00,868 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:13:00,869 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:13:00,871 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:00,872 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:13:00,877 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:13:00,880 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:00" (1/1) ... [2024-10-31 22:13:00,881 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cdcff4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:00, skipping insertion in model container [2024-10-31 22:13:00,882 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:00" (1/1) ... [2024-10-31 22:13:00,935 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:13:01,293 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:13:01,294 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:13:01,301 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:01,314 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:13:01,373 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:01,405 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:13:01,405 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01 WrapperNode [2024-10-31 22:13:01,406 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:01,407 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:01,407 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:13:01,407 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:01,415 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,432 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,455 INFO L138 Inliner]: procedures = 125, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 54 [2024-10-31 22:13:01,456 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:01,456 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:01,457 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:01,457 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:01,468 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,471 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,488 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 8, 4]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 4, 2]. [2024-10-31 22:13:01,489 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,489 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,499 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,500 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,502 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,503 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,506 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:01,507 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:01,507 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:01,507 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:01,508 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (1/1) ... [2024-10-31 22:13:01,519 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:01,529 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:01,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:01,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:13:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-31 22:13:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-31 22:13:01,580 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-31 22:13:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-31 22:13:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-31 22:13:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-31 22:13:01,581 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:13:01,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:01,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:13:01,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:13:01,596 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:13:01,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:13:01,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:13:01,598 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:13:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 22:13:01,599 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:13:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-31 22:13:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-31 22:13:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-31 22:13:01,600 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:01,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:01,737 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:01,740 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:02,016 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-31 22:13:02,016 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:02,033 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:02,034 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:13:02,034 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:02 BoogieIcfgContainer [2024-10-31 22:13:02,034 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:02,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:13:02,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:13:02,046 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:13:02,047 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:13:00" (1/3) ... [2024-10-31 22:13:02,048 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389a3d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:02, skipping insertion in model container [2024-10-31 22:13:02,048 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:01" (2/3) ... [2024-10-31 22:13:02,049 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@389a3d06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:02, skipping insertion in model container [2024-10-31 22:13:02,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:02" (3/3) ... [2024-10-31 22:13:02,051 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1-1.i [2024-10-31 22:13:02,072 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:13:02,073 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-10-31 22:13:02,133 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:02,139 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;@76a37bbb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:02,139 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-10-31 22:13:02,144 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 31 states have (on average 2.032258064516129) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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-10-31 22:13:02,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:13:02,151 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:02,151 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:13:02,152 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:02,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:02,158 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-10-31 22:13:02,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:02,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283560458] [2024-10-31 22:13:02,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:02,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:02,596 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:02,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283560458] [2024-10-31 22:13:02,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283560458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:02,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:02,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:02,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872132131] [2024-10-31 22:13:02,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:02,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:02,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:02,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:02,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:02,647 INFO L87 Difference]: Start difference. First operand has 63 states, 31 states have (on average 2.032258064516129) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:02,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:02,762 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2024-10-31 22:13:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:02,765 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-10-31 22:13:02,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:02,772 INFO L225 Difference]: With dead ends: 59 [2024-10-31 22:13:02,773 INFO L226 Difference]: Without dead ends: 57 [2024-10-31 22:13:02,774 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-10-31 22:13:02,778 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:02,779 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:02,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-31 22:13:02,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-31 22:13:02,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:02,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-10-31 22:13:02,813 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 3 [2024-10-31 22:13:02,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:02,813 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-10-31 22:13:02,813 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-10-31 22:13:02,814 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-10-31 22:13:02,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:13:02,814 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:02,814 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:13:02,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-31 22:13:02,815 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:02,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:02,816 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-10-31 22:13:02,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:02,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5767391] [2024-10-31 22:13:02,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:02,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:02,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:03,076 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:03,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:03,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5767391] [2024-10-31 22:13:03,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5767391] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:03,077 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:03,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:03,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002245335] [2024-10-31 22:13:03,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:03,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:03,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:03,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:03,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:03,084 INFO L87 Difference]: Start difference. First operand 57 states and 57 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-10-31 22:13:03,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:03,185 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2024-10-31 22:13:03,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:03,186 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-10-31 22:13:03,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:03,188 INFO L225 Difference]: With dead ends: 56 [2024-10-31 22:13:03,189 INFO L226 Difference]: Without dead ends: 56 [2024-10-31 22:13:03,190 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-10-31 22:13:03,192 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:03,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-31 22:13:03,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-31 22:13:03,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-31 22:13:03,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2024-10-31 22:13:03,207 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 3 [2024-10-31 22:13:03,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:03,208 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2024-10-31 22:13:03,208 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-10-31 22:13:03,208 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2024-10-31 22:13:03,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:13:03,209 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:03,209 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:13:03,209 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-31 22:13:03,209 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:03,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:03,211 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2024-10-31 22:13:03,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:03,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051961305] [2024-10-31 22:13:03,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:03,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:03,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:03,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:03,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:03,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051961305] [2024-10-31 22:13:03,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2051961305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:03,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:03,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:13:03,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657473097] [2024-10-31 22:13:03,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:03,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:13:03,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:03,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:03,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:03,506 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:03,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:03,632 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2024-10-31 22:13:03,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:03,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-31 22:13:03,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:03,634 INFO L225 Difference]: With dead ends: 53 [2024-10-31 22:13:03,635 INFO L226 Difference]: Without dead ends: 53 [2024-10-31 22:13:03,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-31 22:13:03,636 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:03,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:03,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-31 22:13:03,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-31 22:13:03,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-31 22:13:03,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-10-31 22:13:03,647 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 5 [2024-10-31 22:13:03,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:03,648 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2024-10-31 22:13:03,648 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:03,649 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-10-31 22:13:03,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:13:03,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:03,649 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:03,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-31 22:13:03,650 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:03,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:03,651 INFO L85 PathProgramCache]: Analyzing trace with hash 59199982, now seen corresponding path program 1 times [2024-10-31 22:13:03,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:03,655 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783860620] [2024-10-31 22:13:03,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:03,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:04,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:04,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:04,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783860620] [2024-10-31 22:13:04,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783860620] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:04,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:04,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:04,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2112342414] [2024-10-31 22:13:04,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:04,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:13:04,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:04,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:13:04,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:04,035 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:04,184 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2024-10-31 22:13:04,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:04,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-31 22:13:04,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:04,185 INFO L225 Difference]: With dead ends: 52 [2024-10-31 22:13:04,185 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 22:13:04,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:13:04,186 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:04,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 113 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:04,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 22:13:04,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 22:13:04,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2024-10-31 22:13:04,194 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 8 [2024-10-31 22:13:04,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:04,194 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2024-10-31 22:13:04,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 6 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,195 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2024-10-31 22:13:04,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:13:04,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:04,198 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:04,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-31 22:13:04,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:04,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:04,200 INFO L85 PathProgramCache]: Analyzing trace with hash 59199981, now seen corresponding path program 1 times [2024-10-31 22:13:04,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:04,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320715161] [2024-10-31 22:13:04,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:04,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:04,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:04,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:04,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320715161] [2024-10-31 22:13:04,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320715161] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:04,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:04,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:04,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1427151526] [2024-10-31 22:13:04,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:04,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:04,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:04,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:04,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:04,359 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:04,457 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-10-31 22:13:04,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:04,458 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-31 22:13:04,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:04,458 INFO L225 Difference]: With dead ends: 51 [2024-10-31 22:13:04,458 INFO L226 Difference]: Without dead ends: 51 [2024-10-31 22:13:04,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 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-10-31 22:13:04,460 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 3 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:04,460 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 108 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:04,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-31 22:13:04,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-31 22:13:04,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 22:13:04,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-10-31 22:13:04,468 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 8 [2024-10-31 22:13:04,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:04,471 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-10-31 22:13:04,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,471 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-10-31 22:13:04,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-31 22:13:04,472 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:04,472 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:04,472 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-31 22:13:04,473 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:04,473 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:04,473 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937559, now seen corresponding path program 1 times [2024-10-31 22:13:04,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:04,473 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192520814] [2024-10-31 22:13:04,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:04,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:04,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:04,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:04,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:04,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192520814] [2024-10-31 22:13:04,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192520814] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:04,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:04,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:04,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070276970] [2024-10-31 22:13:04,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:04,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:04,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:04,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:04,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:04,614 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:04,747 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2024-10-31 22:13:04,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:04,748 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-31 22:13:04,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:04,748 INFO L225 Difference]: With dead ends: 50 [2024-10-31 22:13:04,748 INFO L226 Difference]: Without dead ends: 50 [2024-10-31 22:13:04,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:04,750 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:04,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:04,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-31 22:13:04,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-31 22:13:04,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2024-10-31 22:13:04,758 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 11 [2024-10-31 22:13:04,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:04,759 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2024-10-31 22:13:04,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:04,760 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2024-10-31 22:13:04,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-31 22:13:04,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:04,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:04,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-31 22:13:04,761 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:04,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:04,761 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937558, now seen corresponding path program 1 times [2024-10-31 22:13:04,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:04,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108550093] [2024-10-31 22:13:04,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:04,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,010 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108550093] [2024-10-31 22:13:05,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108550093] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:05,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77576269] [2024-10-31 22:13:05,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:05,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:05,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:05,016 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:05,105 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2024-10-31 22:13:05,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:05,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-31 22:13:05,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:05,106 INFO L225 Difference]: With dead ends: 49 [2024-10-31 22:13:05,107 INFO L226 Difference]: Without dead ends: 49 [2024-10-31 22:13:05,108 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:05,109 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:05,109 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:05,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-31 22:13:05,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-31 22:13:05,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 22:13:05,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-10-31 22:13:05,118 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2024-10-31 22:13:05,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:05,119 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2024-10-31 22:13:05,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,119 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-10-31 22:13:05,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:13:05,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:05,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:05,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-31 22:13:05,120 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:05,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,121 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886990, now seen corresponding path program 1 times [2024-10-31 22:13:05,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1055350071] [2024-10-31 22:13:05,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1055350071] [2024-10-31 22:13:05,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1055350071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:05,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601758272] [2024-10-31 22:13:05,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,266 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:13:05,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:13:05,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:05,267 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:05,391 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-10-31 22:13:05,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:05,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-31 22:13:05,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:05,393 INFO L225 Difference]: With dead ends: 51 [2024-10-31 22:13:05,393 INFO L226 Difference]: Without dead ends: 51 [2024-10-31 22:13:05,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:13:05,394 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 44 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:05,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 55 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:05,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-31 22:13:05,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-31 22:13:05,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-31 22:13:05,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-10-31 22:13:05,404 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 14 [2024-10-31 22:13:05,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:05,404 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-10-31 22:13:05,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,405 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-10-31 22:13:05,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:13:05,407 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:05,407 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:05,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-31 22:13:05,408 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:05,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886989, now seen corresponding path program 1 times [2024-10-31 22:13:05,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595445207] [2024-10-31 22:13:05,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595445207] [2024-10-31 22:13:05,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595445207] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-31 22:13:05,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711908630] [2024-10-31 22:13:05,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,641 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-31 22:13:05,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-31 22:13:05,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:05,642 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:05,719 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-10-31 22:13:05,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:05,720 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-31 22:13:05,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:05,721 INFO L225 Difference]: With dead ends: 43 [2024-10-31 22:13:05,721 INFO L226 Difference]: Without dead ends: 43 [2024-10-31 22:13:05,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-31 22:13:05,722 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 27 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:05,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 70 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:05,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-31 22:13:05,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-31 22:13:05,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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-10-31 22:13:05,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-10-31 22:13:05,726 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 14 [2024-10-31 22:13:05,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:05,727 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2024-10-31 22:13:05,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 6 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:05,728 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-10-31 22:13:05,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:13:05,728 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:05,728 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:05,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-31 22:13:05,729 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:05,729 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:05,729 INFO L85 PathProgramCache]: Analyzing trace with hash 1959919348, now seen corresponding path program 1 times [2024-10-31 22:13:05,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:05,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1589082310] [2024-10-31 22:13:05,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:05,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:05,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:05,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:05,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:05,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1589082310] [2024-10-31 22:13:05,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1589082310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:05,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:05,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:13:05,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951380234] [2024-10-31 22:13:05,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:05,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:13:05,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:05,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:13:05,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:13:05,987 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:06,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:06,144 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-10-31 22:13:06,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:06,145 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-31 22:13:06,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:06,146 INFO L225 Difference]: With dead ends: 43 [2024-10-31 22:13:06,147 INFO L226 Difference]: Without dead ends: 43 [2024-10-31 22:13:06,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:06,148 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:06,149 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 77 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:06,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-31 22:13:06,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-10-31 22:13:06,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:06,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2024-10-31 22:13:06,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2024-10-31 22:13:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:06,155 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2024-10-31 22:13:06,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 9 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:06,155 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2024-10-31 22:13:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:13:06,156 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:06,156 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:06,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-31 22:13:06,157 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:06,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:06,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1959919349, now seen corresponding path program 1 times [2024-10-31 22:13:06,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:06,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122203480] [2024-10-31 22:13:06,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,160 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:06,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:06,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:06,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:06,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122203480] [2024-10-31 22:13:06,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122203480] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:06,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:06,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-31 22:13:06,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833093206] [2024-10-31 22:13:06,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:06,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-31 22:13:06,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:06,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-31 22:13:06,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:13:06,616 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:06,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:06,816 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-10-31 22:13:06,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-31 22:13:06,816 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-31 22:13:06,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:06,817 INFO L225 Difference]: With dead ends: 41 [2024-10-31 22:13:06,817 INFO L226 Difference]: Without dead ends: 41 [2024-10-31 22:13:06,817 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:13:06,818 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 28 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:06,818 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 135 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:06,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-31 22:13:06,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-31 22:13:06,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:06,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-10-31 22:13:06,821 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 18 [2024-10-31 22:13:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:06,821 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-10-31 22:13:06,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 10 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:06,822 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-10-31 22:13:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:13:06,822 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:06,822 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:06,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-31 22:13:06,823 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:06,823 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash 627957652, now seen corresponding path program 1 times [2024-10-31 22:13:06,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:06,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66681138] [2024-10-31 22:13:06,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:07,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:07,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:07,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66681138] [2024-10-31 22:13:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66681138] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:07,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:07,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:13:07,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452436355] [2024-10-31 22:13:07,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:07,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:13:07,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:07,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:13:07,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:13:07,180 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:07,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:07,319 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2024-10-31 22:13:07,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:07,320 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:13:07,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:07,321 INFO L225 Difference]: With dead ends: 40 [2024-10-31 22:13:07,321 INFO L226 Difference]: Without dead ends: 40 [2024-10-31 22:13:07,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:07,322 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:07,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 73 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-10-31 22:13:07,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2024-10-31 22:13:07,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 37 states have internal predecessors, (38), 0 states have call successors, (0), 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-10-31 22:13:07,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2024-10-31 22:13:07,325 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 19 [2024-10-31 22:13:07,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:07,326 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2024-10-31 22:13:07,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:07,326 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2024-10-31 22:13:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:13:07,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:07,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:07,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-31 22:13:07,327 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:07,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:07,328 INFO L85 PathProgramCache]: Analyzing trace with hash 627957653, now seen corresponding path program 1 times [2024-10-31 22:13:07,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:07,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1547058345] [2024-10-31 22:13:07,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:07,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:07,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:07,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:07,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:07,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1547058345] [2024-10-31 22:13:07,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1547058345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:07,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:07,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:13:07,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679532917] [2024-10-31 22:13:07,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:07,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:13:07,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:07,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:13:07,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:13:07,751 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:07,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:07,918 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2024-10-31 22:13:07,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:07,918 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:13:07,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:07,919 INFO L225 Difference]: With dead ends: 38 [2024-10-31 22:13:07,919 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 22:13:07,919 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:07,920 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:07,920 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 96 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:07,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 22:13:07,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-31 22:13:07,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 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-10-31 22:13:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-10-31 22:13:07,923 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 19 [2024-10-31 22:13:07,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:07,923 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-10-31 22:13:07,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:07,923 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-10-31 22:13:07,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:13:07,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:07,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:07,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-31 22:13:07,925 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:07,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:07,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1391117671, now seen corresponding path program 1 times [2024-10-31 22:13:07,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:07,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376498860] [2024-10-31 22:13:07,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:07,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:08,199 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:08,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-31 22:13:08,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376498860] [2024-10-31 22:13:08,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376498860] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:08,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:08,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:13:08,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108394632] [2024-10-31 22:13:08,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:08,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:08,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-31 22:13:08,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:08,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:08,202 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:08,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:08,321 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-10-31 22:13:08,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:13:08,322 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-31 22:13:08,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:08,322 INFO L225 Difference]: With dead ends: 37 [2024-10-31 22:13:08,323 INFO L226 Difference]: Without dead ends: 37 [2024-10-31 22:13:08,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:13:08,323 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 20 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:08,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 75 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:08,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-31 22:13:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-10-31 22:13:08,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-10-31 22:13:08,326 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 22 [2024-10-31 22:13:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:08,327 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-10-31 22:13:08,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:08,327 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-10-31 22:13:08,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:13:08,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:08,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:08,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-31 22:13:08,328 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:08,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:08,329 INFO L85 PathProgramCache]: Analyzing trace with hash -1115888917, now seen corresponding path program 1 times [2024-10-31 22:13:08,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-31 22:13:08,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224525054] [2024-10-31 22:13:08,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:08,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-31 22:13:08,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:08,377 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:08,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:08,421 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-31 22:13:08,422 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:13:08,423 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (30 of 31 remaining) [2024-10-31 22:13:08,425 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2024-10-31 22:13:08,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2024-10-31 22:13:08,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2024-10-31 22:13:08,426 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2024-10-31 22:13:08,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2024-10-31 22:13:08,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2024-10-31 22:13:08,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2024-10-31 22:13:08,427 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2024-10-31 22:13:08,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2024-10-31 22:13:08,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2024-10-31 22:13:08,428 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2024-10-31 22:13:08,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2024-10-31 22:13:08,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2024-10-31 22:13:08,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2024-10-31 22:13:08,429 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2024-10-31 22:13:08,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2024-10-31 22:13:08,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2024-10-31 22:13:08,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2024-10-31 22:13:08,430 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2024-10-31 22:13:08,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2024-10-31 22:13:08,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (9 of 31 remaining) [2024-10-31 22:13:08,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (8 of 31 remaining) [2024-10-31 22:13:08,431 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (7 of 31 remaining) [2024-10-31 22:13:08,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (6 of 31 remaining) [2024-10-31 22:13:08,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (5 of 31 remaining) [2024-10-31 22:13:08,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (4 of 31 remaining) [2024-10-31 22:13:08,432 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2024-10-31 22:13:08,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2024-10-31 22:13:08,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2024-10-31 22:13:08,433 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2024-10-31 22:13:08,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-31 22:13:08,437 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:08,465 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:13:08,469 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:13:08 BoogieIcfgContainer [2024-10-31 22:13:08,470 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:13:08,471 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:13:08,471 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:13:08,471 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:13:08,472 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:02" (3/4) ... [2024-10-31 22:13:08,475 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:13:08,476 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:13:08,476 INFO L158 Benchmark]: Toolchain (without parser) took 7607.44ms. Allocated memory was 117.4MB in the beginning and 180.4MB in the end (delta: 62.9MB). Free memory was 78.4MB in the beginning and 138.8MB in the end (delta: -60.4MB). Peak memory consumption was 4.0MB. Max. memory is 16.1GB. [2024-10-31 22:13:08,477 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 117.4MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:08,477 INFO L158 Benchmark]: CACSL2BoogieTranslator took 534.65ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 59.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-31 22:13:08,477 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.15ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:08,478 INFO L158 Benchmark]: Boogie Preprocessor took 50.03ms. Allocated memory is still 117.4MB. Free memory was 57.5MB in the beginning and 55.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:08,478 INFO L158 Benchmark]: RCFGBuilder took 527.54ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 55.0MB in the beginning and 107.2MB in the end (delta: -52.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. [2024-10-31 22:13:08,479 INFO L158 Benchmark]: TraceAbstraction took 6427.92ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 107.2MB in the beginning and 139.8MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:08,479 INFO L158 Benchmark]: Witness Printer took 5.28ms. Allocated memory is still 180.4MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:08,485 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.26ms. Allocated memory is still 117.4MB. Free memory is still 64.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 534.65ms. Allocated memory is still 117.4MB. Free memory was 78.4MB in the beginning and 59.5MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.15ms. Allocated memory is still 117.4MB. Free memory was 59.5MB in the beginning and 57.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.03ms. Allocated memory is still 117.4MB. Free memory was 57.5MB in the beginning and 55.0MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 527.54ms. Allocated memory was 117.4MB in the beginning and 148.9MB in the end (delta: 31.5MB). Free memory was 55.0MB in the beginning and 107.2MB in the end (delta: -52.2MB). Peak memory consumption was 12.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6427.92ms. Allocated memory was 148.9MB in the beginning and 180.4MB in the end (delta: 31.5MB). Free memory was 107.2MB in the beginning and 139.8MB in the end (delta: -32.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 5.28ms. Allocated memory is still 180.4MB. Free memory is still 138.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 545]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 545. Possible FailurePath: [L546] TData data; [L547] CALL alloc_data(&data) [L529] pdata->lo = (int *)malloc(sizeof(int)) [L530] pdata->hi = (int *)malloc(sizeof(int)) [L531] EXPR pdata->lo [L531] *(pdata->lo) = 4 [L532] EXPR pdata->hi [L532] *(pdata->hi) = 8 [L547] RET alloc_data(&data) [L548] CALL free_data(&data) [L536] EXPR data->lo [L536] int *lo = data->lo; [L537] EXPR data->hi [L537] int *hi = data->hi; [L538] EXPR \read(*lo) [L538] EXPR \read(*hi) [L538] COND FALSE !(*lo >= *hi) [L542] data->lo = ((void *)0) [L543] data->hi = ((void *)0) [L548] RET free_data(&data) [L549] return 0; [L549] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that free always succeeds Unable to prove that free 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 6.3s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 215 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 215 mSDsluCounter, 1262 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 791 mSDsCounter, 30 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1218 IncrementalHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 30 mSolverCounterUnsat, 471 mSDtfsCounter, 1218 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 94 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 91, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 14 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 197 NumberOfCodeBlocks, 197 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 159 ConstructedInterpolants, 0 QuantifiedInterpolants, 1725 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 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-10-31 22:13:08,526 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4fc63b2 [2024-10-31 22:13:11,126 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-31 22:13:11,244 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-10-31 22:13:11,252 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-31 22:13:11,253 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-31 22:13:11,310 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-31 22:13:11,311 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-31 22:13:11,312 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-31 22:13:11,313 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-31 22:13:11,315 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-31 22:13:11,315 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-31 22:13:11,316 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-31 22:13:11,317 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-31 22:13:11,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-31 22:13:11,319 INFO L153 SettingsManager]: * Use SBE=true [2024-10-31 22:13:11,320 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-31 22:13:11,321 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-31 22:13:11,321 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-31 22:13:11,321 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-31 22:13:11,322 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-31 22:13:11,322 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-31 22:13:11,326 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-31 22:13:11,327 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-31 22:13:11,327 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-31 22:13:11,327 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-31 22:13:11,328 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-31 22:13:11,328 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-31 22:13:11,328 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-31 22:13:11,329 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-31 22:13:11,329 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-31 22:13:11,329 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-31 22:13:11,330 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-31 22:13:11,331 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-31 22:13:11,331 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-31 22:13:11,331 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-31 22:13:11,332 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:11,332 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-31 22:13:11,332 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-31 22:13:11,332 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-31 22:13:11,333 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-31 22:13:11,333 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-31 22:13:11,334 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-31 22:13:11,334 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-31 22:13:11,335 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-31 22:13:11,335 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-31 22:13:11,335 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e7870b42a63b59b364c5190e807226b403761bdc30acb17e66a1329fa0ed9e16 [2024-10-31 22:13:11,778 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-31 22:13:11,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-31 22:13:11,814 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-31 22:13:11,815 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-31 22:13:11,816 INFO L274 PluginConnector]: CDTParser initialized [2024-10-31 22:13:11,819 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/../../sv-benchmarks/c/list-ext-properties/test-0019_1-1.i Unable to find full path for "g++" [2024-10-31 22:13:13,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-31 22:13:14,209 INFO L384 CDTParser]: Found 1 translation units. [2024-10-31 22:13:14,210 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/sv-benchmarks/c/list-ext-properties/test-0019_1-1.i [2024-10-31 22:13:14,226 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data/0c2c9c68b/00da5e4c43b24ccbafa6570339dcf55c/FLAG79e1671b7 [2024-10-31 22:13:14,452 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/data/0c2c9c68b/00da5e4c43b24ccbafa6570339dcf55c [2024-10-31 22:13:14,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-31 22:13:14,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-31 22:13:14,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:14,461 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-31 22:13:14,469 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-31 22:13:14,470 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:14" (1/1) ... [2024-10-31 22:13:14,471 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58910502 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:14, skipping insertion in model container [2024-10-31 22:13:14,471 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.10 10:13:14" (1/1) ... [2024-10-31 22:13:14,534 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-31 22:13:14,974 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:13:14,975 WARN L1053 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-10-31 22:13:14,989 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:15,033 INFO L200 MainTranslator]: Completed pre-run [2024-10-31 22:13:15,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-31 22:13:15,143 INFO L204 MainTranslator]: Completed translation [2024-10-31 22:13:15,144 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15 WrapperNode [2024-10-31 22:13:15,144 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-31 22:13:15,145 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:15,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-31 22:13:15,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-31 22:13:15,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,180 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,211 INFO L138 Inliner]: procedures = 128, calls = 27, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2024-10-31 22:13:15,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-31 22:13:15,213 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-31 22:13:15,213 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-31 22:13:15,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-31 22:13:15,225 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,228 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,245 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 8, 4]. 57 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 6 writes are split as follows [0, 4, 2]. [2024-10-31 22:13:15,245 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,246 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,257 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,259 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,261 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,263 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-31 22:13:15,267 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-31 22:13:15,268 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-31 22:13:15,268 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-31 22:13:15,269 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (1/1) ... [2024-10-31 22:13:15,284 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-31 22:13:15,298 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/z3 [2024-10-31 22:13:15,310 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-31 22:13:15,323 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-31 22:13:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-10-31 22:13:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-10-31 22:13:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-10-31 22:13:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-31 22:13:15,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-31 22:13:15,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-31 22:13:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-10-31 22:13:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-10-31 22:13:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-10-31 22:13:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-31 22:13:15,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-10-31 22:13:15,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-10-31 22:13:15,349 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-31 22:13:15,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-31 22:13:15,500 INFO L238 CfgBuilder]: Building ICFG [2024-10-31 22:13:15,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-31 22:13:15,974 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2024-10-31 22:13:15,974 INFO L287 CfgBuilder]: Performing block encoding [2024-10-31 22:13:15,991 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-31 22:13:15,994 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-31 22:13:15,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:15 BoogieIcfgContainer [2024-10-31 22:13:15,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-31 22:13:15,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-31 22:13:15,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-31 22:13:16,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-31 22:13:16,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.10 10:13:14" (1/3) ... [2024-10-31 22:13:16,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6caa7394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:16, skipping insertion in model container [2024-10-31 22:13:16,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.10 10:13:15" (2/3) ... [2024-10-31 22:13:16,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6caa7394 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.10 10:13:16, skipping insertion in model container [2024-10-31 22:13:16,005 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:15" (3/3) ... [2024-10-31 22:13:16,006 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0019_1-1.i [2024-10-31 22:13:16,025 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-31 22:13:16,026 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-10-31 22:13:16,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-31 22:13:16,093 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;@7de7c245, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-31 22:13:16,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-10-31 22:13:16,098 INFO L276 IsEmpty]: Start isEmpty. Operand has 63 states, 31 states have (on average 2.032258064516129) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 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-10-31 22:13:16,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:13:16,105 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:16,105 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:13:16,106 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:16,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:16,114 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2024-10-31 22:13:16,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:16,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [311382269] [2024-10-31 22:13:16,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:16,134 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-10-31 22:13:16,134 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:16,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:16,139 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:16,245 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 22:13:16,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:16,362 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-10-31 22:13:16,363 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-10-31 22:13:16,409 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:16,410 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:16,411 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:16,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [311382269] [2024-10-31 22:13:16,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [311382269] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:16,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:16,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:16,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009180176] [2024-10-31 22:13:16,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:16,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:16,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:16,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:16,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:16,473 INFO L87 Difference]: Start difference. First operand has 63 states, 31 states have (on average 2.032258064516129) internal successors, (63), 62 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:16,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:16,708 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2024-10-31 22:13:16,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:16,711 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-10-31 22:13:16,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:16,719 INFO L225 Difference]: With dead ends: 59 [2024-10-31 22:13:16,719 INFO L226 Difference]: Without dead ends: 57 [2024-10-31 22:13:16,721 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-10-31 22:13:16,724 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 8 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:16,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 69 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:16,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2024-10-31 22:13:16,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2024-10-31 22:13:16,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 30 states have (on average 1.9) internal successors, (57), 56 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:16,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2024-10-31 22:13:16,759 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 3 [2024-10-31 22:13:16,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:16,760 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2024-10-31 22:13:16,760 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-10-31 22:13:16,760 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2024-10-31 22:13:16,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-31 22:13:16,761 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:16,761 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-31 22:13:16,765 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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)] Forceful destruction successful, exit code 0 [2024-10-31 22:13:16,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:16,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:16,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:16,964 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2024-10-31 22:13:16,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:16,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1313636243] [2024-10-31 22:13:16,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:16,965 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-10-31 22:13:16,965 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:16,968 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:16,969 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:17,044 INFO L255 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-31 22:13:17,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:17,092 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:13:17,093 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 5 [2024-10-31 22:13:17,105 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 10 treesize of output 8 [2024-10-31 22:13:17,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:17,123 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:17,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:17,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1313636243] [2024-10-31 22:13:17,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1313636243] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:17,124 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:17,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-31 22:13:17,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810651092] [2024-10-31 22:13:17,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:17,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-31 22:13:17,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:17,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-31 22:13:17,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-31 22:13:17,127 INFO L87 Difference]: Start difference. First operand 57 states and 57 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-10-31 22:13:17,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:17,273 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2024-10-31 22:13:17,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:17,276 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-10-31 22:13:17,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:17,279 INFO L225 Difference]: With dead ends: 56 [2024-10-31 22:13:17,279 INFO L226 Difference]: Without dead ends: 56 [2024-10-31 22:13:17,280 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-10-31 22:13:17,283 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 1 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:17,284 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 83 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-31 22:13:17,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-31 22:13:17,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2024-10-31 22:13:17,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 55 states have internal predecessors, (56), 0 states have call successors, (0), 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-10-31 22:13:17,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2024-10-31 22:13:17,294 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 3 [2024-10-31 22:13:17,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:17,294 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2024-10-31 22:13:17,294 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-10-31 22:13:17,294 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2024-10-31 22:13:17,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-10-31 22:13:17,295 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:17,295 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-10-31 22:13:17,299 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:13:17,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:17,499 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:17,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2024-10-31 22:13:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:17,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567616730] [2024-10-31 22:13:17,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:17,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-10-31 22:13:17,501 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:17,504 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:17,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:17,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:17,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 22:13:17,601 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:17,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:13:17,648 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 5 [2024-10-31 22:13:17,657 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 10 treesize of output 8 [2024-10-31 22:13:17,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:13:17,762 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 14 treesize of output 9 [2024-10-31 22:13:17,779 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-10-31 22:13:17,779 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-10-31 22:13:17,790 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:17,791 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:17,791 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:17,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567616730] [2024-10-31 22:13:17,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567616730] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:17,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:17,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-31 22:13:17,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919930683] [2024-10-31 22:13:17,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:17,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-31 22:13:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:17,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-31 22:13:17,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-31 22:13:17,798 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:18,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:18,007 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2024-10-31 22:13:18,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-31 22:13:18,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-10-31 22:13:18,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:18,008 INFO L225 Difference]: With dead ends: 53 [2024-10-31 22:13:18,009 INFO L226 Difference]: Without dead ends: 53 [2024-10-31 22:13:18,009 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-31 22:13:18,010 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:18,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:18,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-10-31 22:13:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2024-10-31 22:13:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 30 states have (on average 1.7666666666666666) internal successors, (53), 52 states have internal predecessors, (53), 0 states have call successors, (0), 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-10-31 22:13:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2024-10-31 22:13:18,020 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 5 [2024-10-31 22:13:18,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:18,021 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2024-10-31 22:13:18,021 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:18,022 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2024-10-31 22:13:18,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:13:18,022 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:18,022 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:18,025 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:13:18,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:18,223 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:18,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:18,224 INFO L85 PathProgramCache]: Analyzing trace with hash 59199982, now seen corresponding path program 1 times [2024-10-31 22:13:18,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:18,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1696431625] [2024-10-31 22:13:18,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:18,225 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-10-31 22:13:18,225 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:18,228 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:18,231 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:18,327 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-10-31 22:13:18,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:18,358 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-10-31 22:13:18,366 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-10-31 22:13:18,390 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-31 22:13:18,391 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-10-31 22:13:18,429 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 1 [2024-10-31 22:13:18,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 22:13:18,517 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-10-31 22:13:18,517 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 18 treesize of output 21 [2024-10-31 22:13:18,550 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-10-31 22:13:18,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-10-31 22:13:18,627 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-31 22:13:18,638 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 43 treesize of output 23 [2024-10-31 22:13:18,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-10-31 22:13:18,766 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:18,766 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:18,767 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:18,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1696431625] [2024-10-31 22:13:18,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1696431625] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:18,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:18,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:13:18,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245034240] [2024-10-31 22:13:18,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:18,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-31 22:13:18,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:18,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-31 22:13:18,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:13:18,769 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:19,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:19,339 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2024-10-31 22:13:19,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-31 22:13:19,340 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-31 22:13:19,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:19,341 INFO L225 Difference]: With dead ends: 52 [2024-10-31 22:13:19,341 INFO L226 Difference]: Without dead ends: 52 [2024-10-31 22:13:19,341 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:13:19,342 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 9 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:19,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 153 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:13:19,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-10-31 22:13:19,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2024-10-31 22:13:19,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 30 states have (on average 1.7333333333333334) internal successors, (52), 51 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:19,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2024-10-31 22:13:19,347 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 8 [2024-10-31 22:13:19,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:19,348 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2024-10-31 22:13:19,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:19,348 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2024-10-31 22:13:19,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-31 22:13:19,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:19,349 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:19,355 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:19,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:19,550 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:19,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:19,550 INFO L85 PathProgramCache]: Analyzing trace with hash 59199981, now seen corresponding path program 1 times [2024-10-31 22:13:19,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:19,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621403191] [2024-10-31 22:13:19,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:19,551 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-10-31 22:13:19,551 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:19,563 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:19,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:19,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:19,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-31 22:13:19,712 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:19,750 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-10-31 22:13:19,751 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 12 treesize of output 22 [2024-10-31 22:13:19,806 INFO L349 Elim1Store]: treesize reduction 41, result has 6.8 percent of original size [2024-10-31 22:13:19,807 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 1 case distinctions, treesize of input 17 treesize of output 14 [2024-10-31 22:13:19,856 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 1 [2024-10-31 22:13:19,890 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-10-31 22:13:19,891 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 18 treesize of output 24 [2024-10-31 22:13:19,931 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 31 treesize of output 15 [2024-10-31 22:13:19,983 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-31 22:13:19,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 18 [2024-10-31 22:13:20,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:20,014 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:20,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:20,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621403191] [2024-10-31 22:13:20,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621403191] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:20,014 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:20,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-31 22:13:20,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865843507] [2024-10-31 22:13:20,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:20,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:20,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:20,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:20,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:20,017 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:20,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:20,484 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-10-31 22:13:20,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-31 22:13:20,485 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2024-10-31 22:13:20,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:20,485 INFO L225 Difference]: With dead ends: 51 [2024-10-31 22:13:20,486 INFO L226 Difference]: Without dead ends: 51 [2024-10-31 22:13:20,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2024-10-31 22:13:20,487 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 51 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:20,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 88 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:13:20,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-31 22:13:20,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2024-10-31 22:13:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 30 states have (on average 1.7) internal successors, (51), 50 states have internal predecessors, (51), 0 states have call successors, (0), 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-10-31 22:13:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2024-10-31 22:13:20,492 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 8 [2024-10-31 22:13:20,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:20,492 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2024-10-31 22:13:20,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 7 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:20,493 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2024-10-31 22:13:20,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-31 22:13:20,493 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:20,494 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:20,498 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:20,694 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:20,695 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:20,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:20,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937559, now seen corresponding path program 1 times [2024-10-31 22:13:20,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:20,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [216025819] [2024-10-31 22:13:20,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:20,698 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-10-31 22:13:20,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:20,701 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:20,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:20,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:20,893 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 22:13:20,895 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:20,904 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-10-31 22:13:20,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-31 22:13:20,967 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 23 treesize of output 11 [2024-10-31 22:13:20,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:20,980 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:20,980 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:20,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [216025819] [2024-10-31 22:13:20,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [216025819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:20,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:20,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:20,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771139138] [2024-10-31 22:13:20,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:20,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:20,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:20,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:20,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:20,983 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:21,233 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2024-10-31 22:13:21,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:21,234 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-31 22:13:21,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:21,235 INFO L225 Difference]: With dead ends: 50 [2024-10-31 22:13:21,235 INFO L226 Difference]: Without dead ends: 50 [2024-10-31 22:13:21,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:21,236 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:21,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 103 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:21,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-10-31 22:13:21,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-10-31 22:13:21,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 49 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:21,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2024-10-31 22:13:21,240 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 11 [2024-10-31 22:13:21,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:21,241 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2024-10-31 22:13:21,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:21,241 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2024-10-31 22:13:21,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-31 22:13:21,242 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:21,242 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:21,246 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:13:21,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:21,443 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:21,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:21,444 INFO L85 PathProgramCache]: Analyzing trace with hash -1604937558, now seen corresponding path program 1 times [2024-10-31 22:13:21,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:21,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1450729387] [2024-10-31 22:13:21,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:21,444 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-10-31 22:13:21,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:21,446 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:21,447 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:21,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:21,535 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-31 22:13:21,537 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:21,546 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-10-31 22:13:21,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-31 22:13:21,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-31 22:13:21,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-31 22:13:21,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:21,675 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:21,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:21,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1450729387] [2024-10-31 22:13:21,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1450729387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:21,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:21,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:21,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771660804] [2024-10-31 22:13:21,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:21,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:21,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:21,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:21,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:21,677 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:21,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:21,931 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2024-10-31 22:13:21,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-31 22:13:21,933 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-31 22:13:21,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:21,933 INFO L225 Difference]: With dead ends: 49 [2024-10-31 22:13:21,933 INFO L226 Difference]: Without dead ends: 49 [2024-10-31 22:13:21,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:21,934 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:21,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 121 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:21,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-10-31 22:13:21,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-10-31 22:13:21,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 30 states have (on average 1.6333333333333333) internal successors, (49), 48 states have internal predecessors, (49), 0 states have call successors, (0), 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-10-31 22:13:21,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2024-10-31 22:13:21,939 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 11 [2024-10-31 22:13:21,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:21,939 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2024-10-31 22:13:21,940 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:21,940 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2024-10-31 22:13:21,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:13:21,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:21,941 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:21,949 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:13:22,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:22,142 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:22,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:22,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886990, now seen corresponding path program 1 times [2024-10-31 22:13:22,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:22,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1156013453] [2024-10-31 22:13:22,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:22,143 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-10-31 22:13:22,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:22,146 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:22,148 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:22,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:22,257 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-31 22:13:22,259 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:22,319 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:22,319 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:22,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:22,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1156013453] [2024-10-31 22:13:22,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1156013453] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:22,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:22,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:22,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675584180] [2024-10-31 22:13:22,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:22,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:22,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:22,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:22,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:22,322 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:22,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:22,536 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2024-10-31 22:13:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:22,537 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-31 22:13:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:22,538 INFO L225 Difference]: With dead ends: 51 [2024-10-31 22:13:22,538 INFO L226 Difference]: Without dead ends: 51 [2024-10-31 22:13:22,539 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-31 22:13:22,539 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 48 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:22,540 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 55 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:22,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2024-10-31 22:13:22,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 47. [2024-10-31 22:13:22,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 31 states have (on average 1.5483870967741935) internal successors, (48), 46 states have internal predecessors, (48), 0 states have call successors, (0), 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-10-31 22:13:22,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2024-10-31 22:13:22,549 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 14 [2024-10-31 22:13:22,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:22,549 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2024-10-31 22:13:22,550 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:22,550 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2024-10-31 22:13:22,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-10-31 22:13:22,550 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:22,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:22,556 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:22,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:22,754 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:22,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:22,754 INFO L85 PathProgramCache]: Analyzing trace with hash -1118886989, now seen corresponding path program 1 times [2024-10-31 22:13:22,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:22,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [858060092] [2024-10-31 22:13:22,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:22,755 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-10-31 22:13:22,755 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:22,756 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:22,757 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:22,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:22,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-10-31 22:13:22,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:23,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:23,016 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:23,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:23,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [858060092] [2024-10-31 22:13:23,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [858060092] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:23,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:23,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-31 22:13:23,017 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229591830] [2024-10-31 22:13:23,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:23,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-31 22:13:23,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:23,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-31 22:13:23,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-31 22:13:23,019 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:23,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:23,240 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-10-31 22:13:23,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-31 22:13:23,240 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-10-31 22:13:23,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:23,241 INFO L225 Difference]: With dead ends: 43 [2024-10-31 22:13:23,241 INFO L226 Difference]: Without dead ends: 43 [2024-10-31 22:13:23,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 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-10-31 22:13:23,242 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 31 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:23,242 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 69 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:23,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-31 22:13:23,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-31 22:13:23,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 42 states have internal predecessors, (43), 0 states have call successors, (0), 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-10-31 22:13:23,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2024-10-31 22:13:23,246 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 14 [2024-10-31 22:13:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:23,248 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2024-10-31 22:13:23,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:23,248 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2024-10-31 22:13:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:13:23,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:23,249 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:23,255 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:23,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:23,452 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:23,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:23,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1959919348, now seen corresponding path program 1 times [2024-10-31 22:13:23,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:23,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1407210934] [2024-10-31 22:13:23,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:23,453 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-10-31 22:13:23,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:23,457 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:23,458 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:23,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:23,559 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-31 22:13:23,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:23,675 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 19 treesize of output 11 [2024-10-31 22:13:23,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:23,725 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:23,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:23,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1407210934] [2024-10-31 22:13:23,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1407210934] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:23,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:23,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:13:23,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977318782] [2024-10-31 22:13:23,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:23,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:23,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:23,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:23,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:23,727 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:24,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:24,172 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2024-10-31 22:13:24,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:24,174 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-31 22:13:24,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:24,175 INFO L225 Difference]: With dead ends: 43 [2024-10-31 22:13:24,176 INFO L226 Difference]: Without dead ends: 43 [2024-10-31 22:13:24,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:13:24,177 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:24,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 92 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:13:24,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-31 22:13:24,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2024-10-31 22:13:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 31 states have (on average 1.3225806451612903) internal successors, (41), 40 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:24,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2024-10-31 22:13:24,182 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 18 [2024-10-31 22:13:24,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:24,183 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2024-10-31 22:13:24,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:24,183 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2024-10-31 22:13:24,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-31 22:13:24,184 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:24,185 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:24,189 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:24,385 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:24,386 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:24,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:24,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1959919349, now seen corresponding path program 1 times [2024-10-31 22:13:24,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:24,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1961908022] [2024-10-31 22:13:24,387 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:24,387 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-10-31 22:13:24,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:24,388 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:24,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:24,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-31 22:13:24,509 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:24,712 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 23 treesize of output 15 [2024-10-31 22:13:24,717 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 32 treesize of output 16 [2024-10-31 22:13:24,869 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:24,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:24,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:24,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1961908022] [2024-10-31 22:13:24,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1961908022] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:24,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:24,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:13:24,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518301571] [2024-10-31 22:13:24,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:24,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:24,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:24,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:24,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:24,872 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:25,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:25,628 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2024-10-31 22:13:25,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:25,629 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-10-31 22:13:25,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:25,630 INFO L225 Difference]: With dead ends: 42 [2024-10-31 22:13:25,630 INFO L226 Difference]: Without dead ends: 42 [2024-10-31 22:13:25,630 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2024-10-31 22:13:25,631 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 32 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:25,631 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 101 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-31 22:13:25,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-10-31 22:13:25,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 40. [2024-10-31 22:13:25,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 31 states have (on average 1.2903225806451613) internal successors, (40), 39 states have internal predecessors, (40), 0 states have call successors, (0), 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-10-31 22:13:25,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2024-10-31 22:13:25,635 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 18 [2024-10-31 22:13:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:25,635 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2024-10-31 22:13:25,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:25,636 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2024-10-31 22:13:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:13:25,636 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:25,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:25,643 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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)] Ended with exit code 0 [2024-10-31 22:13:25,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:25,837 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:25,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:25,838 INFO L85 PathProgramCache]: Analyzing trace with hash 627957652, now seen corresponding path program 1 times [2024-10-31 22:13:25,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:25,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1889861047] [2024-10-31 22:13:25,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:25,839 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-10-31 22:13:25,839 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:25,840 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:25,841 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (13)] Waiting until timeout for monitored process [2024-10-31 22:13:25,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:25,963 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-31 22:13:25,965 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:25,998 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-10-31 22:13:26,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-31 22:13:26,189 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 23 treesize of output 11 [2024-10-31 22:13:26,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:26,225 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:26,226 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:26,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1889861047] [2024-10-31 22:13:26,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1889861047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:26,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:26,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:13:26,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055081238] [2024-10-31 22:13:26,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:26,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:13:26,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:26,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:13:26,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:13:26,229 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:26,548 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2024-10-31 22:13:26,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:26,549 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:13:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:26,550 INFO L225 Difference]: With dead ends: 41 [2024-10-31 22:13:26,550 INFO L226 Difference]: Without dead ends: 41 [2024-10-31 22:13:26,550 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:26,551 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:26,551 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 77 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:13:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-10-31 22:13:26,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2024-10-31 22:13:26,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 38 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2024-10-31 22:13:26,554 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 19 [2024-10-31 22:13:26,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:26,554 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2024-10-31 22:13:26,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2024-10-31 22:13:26,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-10-31 22:13:26,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:26,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:26,560 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (13)] Ended with exit code 0 [2024-10-31 22:13:26,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:26,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:26,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 627957653, now seen corresponding path program 1 times [2024-10-31 22:13:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481874749] [2024-10-31 22:13:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:26,759 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-10-31 22:13:26,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:26,760 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:26,762 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (14)] Waiting until timeout for monitored process [2024-10-31 22:13:26,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:26,866 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-10-31 22:13:26,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:26,907 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-10-31 22:13:26,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-31 22:13:26,961 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-31 22:13:27,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-10-31 22:13:27,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:27,251 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:27,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:27,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481874749] [2024-10-31 22:13:27,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481874749] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:27,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:27,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-31 22:13:27,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [810354644] [2024-10-31 22:13:27,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:27,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-31 22:13:27,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:27,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-31 22:13:27,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-31 22:13:27,253 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:27,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:27,662 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2024-10-31 22:13:27,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-31 22:13:27,663 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-10-31 22:13:27,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:27,663 INFO L225 Difference]: With dead ends: 39 [2024-10-31 22:13:27,663 INFO L226 Difference]: Without dead ends: 39 [2024-10-31 22:13:27,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-10-31 22:13:27,664 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 26 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:27,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 102 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-31 22:13:27,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-31 22:13:27,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2024-10-31 22:13:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 36 states have internal predecessors, (37), 0 states have call successors, (0), 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-10-31 22:13:27,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2024-10-31 22:13:27,667 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 19 [2024-10-31 22:13:27,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:27,668 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2024-10-31 22:13:27,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.375) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:27,668 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2024-10-31 22:13:27,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-31 22:13:27,668 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:27,669 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:27,676 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (14)] Ended with exit code 0 [2024-10-31 22:13:27,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:27,869 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:27,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:27,870 INFO L85 PathProgramCache]: Analyzing trace with hash -2123084748, now seen corresponding path program 1 times [2024-10-31 22:13:27,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:27,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [392038450] [2024-10-31 22:13:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:27,871 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-10-31 22:13:27,871 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:27,874 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:27,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (15)] Waiting until timeout for monitored process [2024-10-31 22:13:28,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:28,014 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-31 22:13:28,016 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:28,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-31 22:13:28,094 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 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-31 22:13:28,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:28,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:28,192 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:28,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [392038450] [2024-10-31 22:13:28,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [392038450] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:28,193 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:28,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:13:28,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862511281] [2024-10-31 22:13:28,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:28,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:28,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:28,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:28,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:28,194 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:28,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:28,403 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2024-10-31 22:13:28,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:13:28,405 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-10-31 22:13:28,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:28,406 INFO L225 Difference]: With dead ends: 38 [2024-10-31 22:13:28,406 INFO L226 Difference]: Without dead ends: 38 [2024-10-31 22:13:28,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:13:28,407 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 24 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:28,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 104 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-31 22:13:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-31 22:13:28,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 36. [2024-10-31 22:13:28,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 35 states have internal predecessors, (36), 0 states have call successors, (0), 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-10-31 22:13:28,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2024-10-31 22:13:28,411 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 21 [2024-10-31 22:13:28,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:28,412 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2024-10-31 22:13:28,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:28,412 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2024-10-31 22:13:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-31 22:13:28,412 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:28,412 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:28,417 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (15)] Ended with exit code 0 [2024-10-31 22:13:28,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:28,616 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:28,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:28,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1391117671, now seen corresponding path program 1 times [2024-10-31 22:13:28,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:28,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1236459452] [2024-10-31 22:13:28,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:28,618 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-10-31 22:13:28,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:28,620 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:28,621 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (16)] Waiting until timeout for monitored process [2024-10-31 22:13:28,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-31 22:13:28,833 INFO L255 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-31 22:13:28,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-31 22:13:28,882 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 1 [2024-10-31 22:13:28,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-31 22:13:28,978 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 15 treesize of output 7 [2024-10-31 22:13:29,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-31 22:13:29,027 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-31 22:13:29,027 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-31 22:13:29,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1236459452] [2024-10-31 22:13:29,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1236459452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-31 22:13:29,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-31 22:13:29,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-31 22:13:29,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862653134] [2024-10-31 22:13:29,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-31 22:13:29,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-31 22:13:29,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-31 22:13:29,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-31 22:13:29,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-31 22:13:29,029 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:29,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-31 22:13:29,355 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2024-10-31 22:13:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-31 22:13:29,357 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-10-31 22:13:29,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-31 22:13:29,357 INFO L225 Difference]: With dead ends: 37 [2024-10-31 22:13:29,357 INFO L226 Difference]: Without dead ends: 37 [2024-10-31 22:13:29,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-31 22:13:29,358 INFO L432 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-31 22:13:29,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 80 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-31 22:13:29,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-10-31 22:13:29,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2024-10-31 22:13:29,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:29,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2024-10-31 22:13:29,361 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 22 [2024-10-31 22:13:29,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-31 22:13:29,361 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2024-10-31 22:13:29,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-31 22:13:29,362 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2024-10-31 22:13:29,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-31 22:13:29,362 INFO L207 NwaCegarLoop]: Found error trace [2024-10-31 22:13:29,363 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:29,370 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (16)] Ended with exit code 0 [2024-10-31 22:13:29,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:29,564 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-10-31 22:13:29,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-31 22:13:29,564 INFO L85 PathProgramCache]: Analyzing trace with hash -1115888917, now seen corresponding path program 1 times [2024-10-31 22:13:29,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-31 22:13:29,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1714090385] [2024-10-31 22:13:29,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-31 22:13:29,565 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-10-31 22:13:29,565 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/mathsat [2024-10-31 22:13:29,568 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:29,572 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (17)] Waiting until timeout for monitored process [2024-10-31 22:13:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:29,818 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-31 22:13:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-31 22:13:30,052 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-10-31 22:13:30,052 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-31 22:13:30,053 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (30 of 31 remaining) [2024-10-31 22:13:30,055 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 31 remaining) [2024-10-31 22:13:30,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 31 remaining) [2024-10-31 22:13:30,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 31 remaining) [2024-10-31 22:13:30,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 31 remaining) [2024-10-31 22:13:30,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 31 remaining) [2024-10-31 22:13:30,056 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 31 remaining) [2024-10-31 22:13:30,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 31 remaining) [2024-10-31 22:13:30,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 31 remaining) [2024-10-31 22:13:30,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 31 remaining) [2024-10-31 22:13:30,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 31 remaining) [2024-10-31 22:13:30,057 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 31 remaining) [2024-10-31 22:13:30,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 31 remaining) [2024-10-31 22:13:30,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 31 remaining) [2024-10-31 22:13:30,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 31 remaining) [2024-10-31 22:13:30,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 31 remaining) [2024-10-31 22:13:30,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 31 remaining) [2024-10-31 22:13:30,058 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 31 remaining) [2024-10-31 22:13:30,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 31 remaining) [2024-10-31 22:13:30,059 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 31 remaining) [2024-10-31 22:13:30,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 31 remaining) [2024-10-31 22:13:30,074 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_FREE (9 of 31 remaining) [2024-10-31 22:13:30,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE (8 of 31 remaining) [2024-10-31 22:13:30,075 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE (7 of 31 remaining) [2024-10-31 22:13:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_FREE (6 of 31 remaining) [2024-10-31 22:13:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE (5 of 31 remaining) [2024-10-31 22:13:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE (4 of 31 remaining) [2024-10-31 22:13:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 31 remaining) [2024-10-31 22:13:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 31 remaining) [2024-10-31 22:13:30,076 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 31 remaining) [2024-10-31 22:13:30,077 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 31 remaining) [2024-10-31 22:13:30,083 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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 (17)] Ended with exit code 0 [2024-10-31 22:13:30,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/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-10-31 22:13:30,281 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-31 22:13:30,303 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-10-31 22:13:30,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.10 10:13:30 BoogieIcfgContainer [2024-10-31 22:13:30,306 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-31 22:13:30,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-31 22:13:30,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-31 22:13:30,307 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-31 22:13:30,307 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.10 10:13:15" (3/4) ... [2024-10-31 22:13:30,310 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-10-31 22:13:30,311 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-31 22:13:30,311 INFO L158 Benchmark]: Toolchain (without parser) took 15854.04ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 53.8MB in the beginning and 89.1MB in the end (delta: -35.3MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2024-10-31 22:13:30,311 INFO L158 Benchmark]: CDTParser took 1.24ms. Allocated memory is still 56.6MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:30,312 INFO L158 Benchmark]: CACSL2BoogieTranslator took 685.79ms. Allocated memory is still 79.7MB. Free memory was 53.7MB in the beginning and 50.9MB in the end (delta: 2.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-31 22:13:30,312 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.24ms. Allocated memory is still 79.7MB. Free memory was 50.9MB in the beginning and 49.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:30,312 INFO L158 Benchmark]: Boogie Preprocessor took 53.76ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 46.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-31 22:13:30,312 INFO L158 Benchmark]: RCFGBuilder took 727.45ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 45.5MB in the end (delta: 281.5kB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. [2024-10-31 22:13:30,313 INFO L158 Benchmark]: TraceAbstraction took 14309.30ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 45.1MB in the beginning and 89.1MB in the end (delta: -44.0MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. [2024-10-31 22:13:30,313 INFO L158 Benchmark]: Witness Printer took 4.39ms. Allocated memory is still 117.4MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-31 22:13:30,314 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.24ms. Allocated memory is still 56.6MB. Free memory is still 32.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 685.79ms. Allocated memory is still 79.7MB. Free memory was 53.7MB in the beginning and 50.9MB in the end (delta: 2.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.24ms. Allocated memory is still 79.7MB. Free memory was 50.9MB in the beginning and 49.0MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 53.76ms. Allocated memory is still 79.7MB. Free memory was 49.0MB in the beginning and 46.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 727.45ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 45.5MB in the end (delta: 281.5kB). Peak memory consumption was 14.8MB. Max. memory is 16.1GB. * TraceAbstraction took 14309.30ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 45.1MB in the beginning and 89.1MB in the end (delta: -44.0MB). Peak memory consumption was 47.9MB. Max. memory is 16.1GB. * Witness Printer took 4.39ms. Allocated memory is still 117.4MB. Free memory is still 89.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 545]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 545. Possible FailurePath: [L546] TData data; [L547] CALL alloc_data(&data) [L529] pdata->lo = (int *)malloc(sizeof(int)) [L530] pdata->hi = (int *)malloc(sizeof(int)) [L531] EXPR pdata->lo [L531] *(pdata->lo) = 4 [L532] EXPR pdata->hi [L532] *(pdata->hi) = 8 [L547] RET alloc_data(&data) [L548] CALL free_data(&data) [L536] EXPR data->lo [L536] int *lo = data->lo; [L537] EXPR data->hi [L537] int *hi = data->hi; [L538] EXPR \read(*lo) [L538] EXPR \read(*hi) [L538] COND FALSE !(*lo >= *hi) [L542] data->lo = ((void *)0) [L543] data->hi = ((void *)0) [L548] RET free_data(&data) [L549] return 0; [L549] return 0; VAL [\result=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 540]: Unable to prove that free always succeeds Unable to prove that free 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 63 locations, 31 error locations. Started 1 CEGAR loops. OverallTime: 14.2s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 310 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 310 mSDsluCounter, 1381 SdHoareTripleChecker+Invalid, 3.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 908 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 473 mSDtfsCounter, 1367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 206 GetRequests, 114 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, InterpolantAutomatonStates: 104, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 16 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 3.2s InterpolantComputationTime, 218 NumberOfCodeBlocks, 218 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 179 ConstructedInterpolants, 2 QuantifiedInterpolants, 1905 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1451 ConjunctsInSsa, 194 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 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-10-31 22:13:30,341 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_050cff6b-b08b-4a25-84da-b02a42caccb9/bin/uautomizer-verify-4GaUIPS5ZU/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample