./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 76cdad16cb8577e2fa2738f5c22f29ef30a5ca1ee31bc621195c1ea9243fa2ae --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-27 19:50:21,157 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-27 19:50:21,254 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-27 19:50:21,259 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-27 19:50:21,260 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-27 19:50:21,289 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-27 19:50:21,289 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-27 19:50:21,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-27 19:50:21,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-27 19:50:21,290 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-27 19:50:21,290 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-27 19:50:21,290 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-27 19:50:21,291 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-27 19:50:21,291 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-27 19:50:21,291 INFO L153 SettingsManager]: * Use SBE=true [2024-11-27 19:50:21,291 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-27 19:50:21,291 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-27 19:50:21,291 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-27 19:50:21,291 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-27 19:50:21,291 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-27 19:50:21,291 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-27 19:50:21,292 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-27 19:50:21,293 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-27 19:50:21,293 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-27 19:50:21,294 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-27 19:50:21,294 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-27 19:50:21,294 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-27 19:50:21,294 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:21,294 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:21,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:21,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:21,295 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-27 19:50:21,295 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-27 19:50:21,295 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-27 19:50:21,295 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-27 19:50:21,295 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:21,295 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-27 19:50:21,295 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-27 19:50:21,295 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-27 19:50:21,296 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-27 19:50:21,296 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-27 19:50:21,296 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-27 19:50:21,296 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-27 19:50:21,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-27 19:50:21,296 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 76cdad16cb8577e2fa2738f5c22f29ef30a5ca1ee31bc621195c1ea9243fa2ae [2024-11-27 19:50:21,627 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-27 19:50:21,640 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-27 19:50:21,643 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-27 19:50:21,644 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-27 19:50:21,644 INFO L274 PluginConnector]: CDTParser initialized [2024-11-27 19:50:21,646 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i [2024-11-27 19:50:24,656 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/data/f5d9af1e1/a549a4776eb0471d839fc63260b308f5/FLAG11e0f9673 [2024-11-27 19:50:25,039 INFO L384 CDTParser]: Found 1 translation units. [2024-11-27 19:50:25,040 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/sv-benchmarks/c/termination-15/cstrpbrk_mixed_alloca.i [2024-11-27 19:50:25,057 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/data/f5d9af1e1/a549a4776eb0471d839fc63260b308f5/FLAG11e0f9673 [2024-11-27 19:50:25,081 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/data/f5d9af1e1/a549a4776eb0471d839fc63260b308f5 [2024-11-27 19:50:25,084 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-27 19:50:25,086 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-27 19:50:25,087 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:25,087 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-27 19:50:25,096 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-27 19:50:25,097 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,098 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cc2e6ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25, skipping insertion in model container [2024-11-27 19:50:25,098 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,135 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-27 19:50:25,527 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:50:25,529 WARN L1063 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-27 19:50:25,537 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:25,553 INFO L200 MainTranslator]: Completed pre-run [2024-11-27 19:50:25,635 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-27 19:50:25,676 INFO L204 MainTranslator]: Completed translation [2024-11-27 19:50:25,678 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25 WrapperNode [2024-11-27 19:50:25,678 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-27 19:50:25,679 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:25,679 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-27 19:50:25,680 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-27 19:50:25,688 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,727 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 78 [2024-11-27 19:50:25,729 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-27 19:50:25,730 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-27 19:50:25,731 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-27 19:50:25,731 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-27 19:50:25,740 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,740 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,744 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,768 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [4, 3]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-27 19:50:25,772 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,772 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,780 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,784 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,787 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,792 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,792 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,798 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-27 19:50:25,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-27 19:50:25,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-27 19:50:25,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-27 19:50:25,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (1/1) ... [2024-11-27 19:50:25,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-27 19:50:25,826 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:25,844 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-27 19:50:25,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-27 19:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-27 19:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-27 19:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-27 19:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-27 19:50:25,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-27 19:50:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-27 19:50:25,882 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-27 19:50:25,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-27 19:50:25,987 INFO L234 CfgBuilder]: Building ICFG [2024-11-27 19:50:25,989 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-27 19:50:26,272 INFO L? ?]: Removed 55 outVars from TransFormulas that were not future-live. [2024-11-27 19:50:26,272 INFO L283 CfgBuilder]: Performing block encoding [2024-11-27 19:50:26,283 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-27 19:50:26,283 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-27 19:50:26,284 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:26 BoogieIcfgContainer [2024-11-27 19:50:26,284 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-27 19:50:26,288 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-27 19:50:26,289 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-27 19:50:26,295 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-27 19:50:26,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.11 07:50:25" (1/3) ... [2024-11-27 19:50:26,296 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b65d94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:26, skipping insertion in model container [2024-11-27 19:50:26,296 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.11 07:50:25" (2/3) ... [2024-11-27 19:50:26,298 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b65d94a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.11 07:50:26, skipping insertion in model container [2024-11-27 19:50:26,298 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.11 07:50:26" (3/3) ... [2024-11-27 19:50:26,299 INFO L128 eAbstractionObserver]: Analyzing ICFG cstrpbrk_mixed_alloca.i [2024-11-27 19:50:26,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-27 19:50:26,324 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cstrpbrk_mixed_alloca.i that has 1 procedures, 42 locations, 1 initial locations, 2 loop locations, and 15 error locations. [2024-11-27 19:50:26,377 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-27 19:50:26,397 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;@12f50d4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-27 19:50:26,397 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-27 19:50:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand has 42 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 41 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-11-27 19:50:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 19:50:26,407 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:26,408 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 19:50:26,409 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:26,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:26,415 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-27 19:50:26,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:26,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611043109] [2024-11-27 19:50:26,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:26,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:26,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:26,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:26,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611043109] [2024-11-27 19:50:26,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611043109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:26,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:26,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:26,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102103806] [2024-11-27 19:50:26,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:26,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:26,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:26,908 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:26,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:26,911 INFO L87 Difference]: Start difference. First operand has 42 states, 26 states have (on average 1.8846153846153846) internal successors, (49), 41 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) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:27,009 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-27 19:50:27,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:27,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 19:50:27,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:27,022 INFO L225 Difference]: With dead ends: 41 [2024-11-27 19:50:27,022 INFO L226 Difference]: Without dead ends: 39 [2024-11-27 19:50:27,024 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:27,029 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 4 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:27,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 65 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:27,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-27 19:50:27,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-27 19:50:27,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 25 states have (on average 1.76) internal successors, (44), 38 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-27 19:50:27,070 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 6 [2024-11-27 19:50:27,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:27,071 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-27 19:50:27,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,072 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-27 19:50:27,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 19:50:27,072 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:27,072 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 19:50:27,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-27 19:50:27,073 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:27,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-27 19:50:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:27,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207373463] [2024-11-27 19:50:27,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:27,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:27,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207373463] [2024-11-27 19:50:27,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207373463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:27,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:27,452 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:27,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201752406] [2024-11-27 19:50:27,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:27,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:27,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:27,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:27,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:27,454 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:27,482 INFO L93 Difference]: Finished difference Result 42 states and 48 transitions. [2024-11-27 19:50:27,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 19:50:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:27,483 INFO L225 Difference]: With dead ends: 42 [2024-11-27 19:50:27,483 INFO L226 Difference]: Without dead ends: 42 [2024-11-27 19:50:27,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:27,484 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:27,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 82 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:27,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2024-11-27 19:50:27,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2024-11-27 19:50:27,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 28 states have (on average 1.7142857142857142) internal successors, (48), 41 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-11-27 19:50:27,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 48 transitions. [2024-11-27 19:50:27,490 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 48 transitions. Word has length 6 [2024-11-27 19:50:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:27,491 INFO L471 AbstractCegarLoop]: Abstraction has 42 states and 48 transitions. [2024-11-27 19:50:27,491 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,491 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 48 transitions. [2024-11-27 19:50:27,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-27 19:50:27,492 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:27,492 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-27 19:50:27,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-27 19:50:27,492 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:27,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:27,493 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-27 19:50:27,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:27,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767322812] [2024-11-27 19:50:27,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:27,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:27,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:27,716 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:27,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:27,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767322812] [2024-11-27 19:50:27,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767322812] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:27,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:27,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:50:27,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709896606] [2024-11-27 19:50:27,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:27,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:27,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:27,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:27,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:27,718 INFO L87 Difference]: Start difference. First operand 42 states and 48 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:27,778 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-27 19:50:27,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:50:27,779 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-27 19:50:27,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:27,780 INFO L225 Difference]: With dead ends: 41 [2024-11-27 19:50:27,780 INFO L226 Difference]: Without dead ends: 41 [2024-11-27 19:50:27,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:27,781 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 2 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:27,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 100 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:27,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-27 19:50:27,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2024-11-27 19:50:27,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.72) internal successors, (43), 37 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-11-27 19:50:27,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-27 19:50:27,786 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2024-11-27 19:50:27,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:27,786 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-27 19:50:27,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-27 19:50:27,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 19:50:27,787 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:27,787 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:27,787 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-27 19:50:27,787 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:27,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:27,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2024-11-27 19:50:27,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:27,788 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275560028] [2024-11-27 19:50:27,788 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:27,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:27,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:27,875 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:27,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:27,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275560028] [2024-11-27 19:50:27,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275560028] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:27,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:27,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-27 19:50:27,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173962691] [2024-11-27 19:50:27,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:27,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:27,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:27,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:27,877 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:27,931 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2024-11-27 19:50:27,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:27,932 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-27 19:50:27,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:27,932 INFO L225 Difference]: With dead ends: 37 [2024-11-27 19:50:27,933 INFO L226 Difference]: Without dead ends: 37 [2024-11-27 19:50:27,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:27,934 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:27,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 61 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:27,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-27 19:50:27,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-27 19:50:27,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 25 states have (on average 1.68) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-27 19:50:27,944 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 7 [2024-11-27 19:50:27,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:27,944 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-27 19:50:27,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-27 19:50:27,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 19:50:27,945 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:27,945 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:27,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-27 19:50:27,946 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:27,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:27,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2024-11-27 19:50:27,946 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:27,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875442610] [2024-11-27 19:50:27,946 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:27,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:27,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:28,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875442610] [2024-11-27 19:50:28,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875442610] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:28,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:28,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:28,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663890035] [2024-11-27 19:50:28,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:28,140 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:28,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:28,141 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:28,141 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:28,141 INFO L87 Difference]: Start difference. First operand 37 states and 42 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:28,211 INFO L93 Difference]: Finished difference Result 41 states and 46 transitions. [2024-11-27 19:50:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:28,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-27 19:50:28,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:28,212 INFO L225 Difference]: With dead ends: 41 [2024-11-27 19:50:28,212 INFO L226 Difference]: Without dead ends: 41 [2024-11-27 19:50:28,213 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:28,214 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 4 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:28,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 101 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-27 19:50:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2024-11-27 19:50:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 28 states have (on average 1.6071428571428572) internal successors, (45), 39 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 45 transitions. [2024-11-27 19:50:28,218 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 45 transitions. Word has length 7 [2024-11-27 19:50:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:28,219 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 45 transitions. [2024-11-27 19:50:28,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,219 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 45 transitions. [2024-11-27 19:50:28,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-27 19:50:28,220 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:28,220 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:28,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-27 19:50:28,220 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:28,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:28,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2024-11-27 19:50:28,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:28,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650296998] [2024-11-27 19:50:28,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:28,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:28,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:28,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:28,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:28,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650296998] [2024-11-27 19:50:28,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650296998] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:28,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:28,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:50:28,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662644014] [2024-11-27 19:50:28,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:28,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:28,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:28,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:28,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:28,389 INFO L87 Difference]: Start difference. First operand 40 states and 45 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:28,463 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-27 19:50:28,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:50:28,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-27 19:50:28,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:28,465 INFO L225 Difference]: With dead ends: 39 [2024-11-27 19:50:28,465 INFO L226 Difference]: Without dead ends: 39 [2024-11-27 19:50:28,465 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:28,466 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 8 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:28,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 93 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:28,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-27 19:50:28,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2024-11-27 19:50:28,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 25 states have (on average 1.64) internal successors, (41), 35 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-11-27 19:50:28,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-27 19:50:28,470 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2024-11-27 19:50:28,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:28,470 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-27 19:50:28,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,470 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-27 19:50:28,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 19:50:28,470 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:28,470 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:28,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-27 19:50:28,471 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:28,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:28,471 INFO L85 PathProgramCache]: Analyzing trace with hash -534039922, now seen corresponding path program 1 times [2024-11-27 19:50:28,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:28,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003532006] [2024-11-27 19:50:28,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:28,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:28,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:28,558 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:28,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:28,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003532006] [2024-11-27 19:50:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003532006] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:28,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:28,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:28,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [290534309] [2024-11-27 19:50:28,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:28,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:28,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:28,560 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:28,560 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:28,560 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:28,643 INFO L93 Difference]: Finished difference Result 35 states and 40 transitions. [2024-11-27 19:50:28,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:28,644 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-27 19:50:28,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:28,645 INFO L225 Difference]: With dead ends: 35 [2024-11-27 19:50:28,646 INFO L226 Difference]: Without dead ends: 35 [2024-11-27 19:50:28,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:28,648 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:28,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 46 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:28,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-27 19:50:28,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2024-11-27 19:50:28,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 25 states have (on average 1.56) internal successors, (39), 33 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-11-27 19:50:28,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 39 transitions. [2024-11-27 19:50:28,655 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 39 transitions. Word has length 9 [2024-11-27 19:50:28,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:28,655 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 39 transitions. [2024-11-27 19:50:28,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,655 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 39 transitions. [2024-11-27 19:50:28,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-27 19:50:28,656 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:28,656 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:28,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-27 19:50:28,656 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:28,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:28,657 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2024-11-27 19:50:28,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:28,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650532606] [2024-11-27 19:50:28,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:28,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:28,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:28,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:28,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:28,828 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650532606] [2024-11-27 19:50:28,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650532606] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:28,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:28,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-27 19:50:28,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524147372] [2024-11-27 19:50:28,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:28,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-27 19:50:28,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:28,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-27 19:50:28,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:28,831 INFO L87 Difference]: Start difference. First operand 34 states and 39 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:28,917 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2024-11-27 19:50:28,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-27 19:50:28,918 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-27 19:50:28,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:28,918 INFO L225 Difference]: With dead ends: 56 [2024-11-27 19:50:28,919 INFO L226 Difference]: Without dead ends: 56 [2024-11-27 19:50:28,919 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:28,920 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:28,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 91 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:28,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-27 19:50:28,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 38. [2024-11-27 19:50:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 29 states have (on average 1.5172413793103448) internal successors, (44), 37 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-27 19:50:28,925 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 9 [2024-11-27 19:50:28,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:28,925 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-27 19:50:28,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:28,925 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-27 19:50:28,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-27 19:50:28,926 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:28,926 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:28,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-27 19:50:28,926 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:28,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:28,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1693101284, now seen corresponding path program 1 times [2024-11-27 19:50:28,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:28,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474470086] [2024-11-27 19:50:28,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:28,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:28,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:29,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:29,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474470086] [2024-11-27 19:50:29,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474470086] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:29,144 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:29,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:29,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201634769] [2024-11-27 19:50:29,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:29,145 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-27 19:50:29,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:29,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-27 19:50:29,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:29,149 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:29,203 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2024-11-27 19:50:29,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-27 19:50:29,203 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-27 19:50:29,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:29,204 INFO L225 Difference]: With dead ends: 37 [2024-11-27 19:50:29,204 INFO L226 Difference]: Without dead ends: 34 [2024-11-27 19:50:29,204 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-27 19:50:29,205 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 26 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 50 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.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:29,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 50 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:29,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-27 19:50:29,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-27 19:50:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 33 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-11-27 19:50:29,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2024-11-27 19:50:29,212 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 13 [2024-11-27 19:50:29,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:29,212 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2024-11-27 19:50:29,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,213 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2024-11-27 19:50:29,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-27 19:50:29,213 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:29,213 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:29,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-27 19:50:29,213 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:29,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash -949703880, now seen corresponding path program 1 times [2024-11-27 19:50:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223386212] [2024-11-27 19:50:29,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:29,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223386212] [2024-11-27 19:50:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223386212] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:29,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:29,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-27 19:50:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503387095] [2024-11-27 19:50:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:29,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-27 19:50:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:29,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-27 19:50:29,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-27 19:50:29,320 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:29,394 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-27 19:50:29,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-27 19:50:29,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-27 19:50:29,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:29,396 INFO L225 Difference]: With dead ends: 31 [2024-11-27 19:50:29,396 INFO L226 Difference]: Without dead ends: 31 [2024-11-27 19:50:29,396 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-27 19:50:29,397 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 29 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:29,397 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 44 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:29,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-27 19:50:29,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-27 19:50:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-27 19:50:29,403 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 14 [2024-11-27 19:50:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:29,405 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-27 19:50:29,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-27 19:50:29,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-27 19:50:29,406 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:29,406 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:29,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-27 19:50:29,406 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:29,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:29,407 INFO L85 PathProgramCache]: Analyzing trace with hash -949703879, now seen corresponding path program 1 times [2024-11-27 19:50:29,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:29,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411417977] [2024-11-27 19:50:29,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:29,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:29,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:29,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:29,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411417977] [2024-11-27 19:50:29,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411417977] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:29,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:29,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:50:29,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480065758] [2024-11-27 19:50:29,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:29,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:50:29,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:29,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:50:29,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:50:29,767 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:29,895 INFO L93 Difference]: Finished difference Result 55 states and 61 transitions. [2024-11-27 19:50:29,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:29,897 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-27 19:50:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:29,898 INFO L225 Difference]: With dead ends: 55 [2024-11-27 19:50:29,898 INFO L226 Difference]: Without dead ends: 55 [2024-11-27 19:50:29,898 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:50:29,899 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:29,899 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 67 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:29,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-27 19:50:29,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2024-11-27 19:50:29,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 49 states have (on average 1.2448979591836735) internal successors, (61), 51 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 61 transitions. [2024-11-27 19:50:29,905 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 61 transitions. Word has length 14 [2024-11-27 19:50:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:29,905 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 61 transitions. [2024-11-27 19:50:29,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:29,905 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 61 transitions. [2024-11-27 19:50:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-27 19:50:29,906 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:29,906 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:29,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-27 19:50:29,906 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:29,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:29,907 INFO L85 PathProgramCache]: Analyzing trace with hash -248639301, now seen corresponding path program 1 times [2024-11-27 19:50:29,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:29,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189241155] [2024-11-27 19:50:29,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:29,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:29,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:30,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:30,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189241155] [2024-11-27 19:50:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189241155] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:30,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:30,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-27 19:50:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529428894] [2024-11-27 19:50:30,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:30,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:50:30,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:30,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:50:30,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:50:30,283 INFO L87 Difference]: Start difference. First operand 52 states and 61 transitions. Second operand has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:30,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:30,365 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-27 19:50:30,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:30,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2024-11-27 19:50:30,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:30,367 INFO L225 Difference]: With dead ends: 53 [2024-11-27 19:50:30,367 INFO L226 Difference]: Without dead ends: 53 [2024-11-27 19:50:30,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:50:30,368 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:30,368 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 45 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:30,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-27 19:50:30,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 30. [2024-11-27 19:50:30,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 29 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:30,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2024-11-27 19:50:30,374 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 14 [2024-11-27 19:50:30,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:30,374 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2024-11-27 19:50:30,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.3333333333333335) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:30,374 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2024-11-27 19:50:30,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-27 19:50:30,375 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:30,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:30,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-27 19:50:30,375 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:30,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:30,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1682628105, now seen corresponding path program 1 times [2024-11-27 19:50:30,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:30,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1934685099] [2024-11-27 19:50:30,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:30,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:30,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:30,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:30,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1934685099] [2024-11-27 19:50:30,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1934685099] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:30,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:30,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-27 19:50:30,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1713266247] [2024-11-27 19:50:30,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:30,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-27 19:50:30,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:30,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-27 19:50:30,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:30,436 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11-27 19:50:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:30,444 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2024-11-27 19:50:30,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-27 19:50:30,445 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11-27 19:50:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:30,445 INFO L225 Difference]: With dead ends: 31 [2024-11-27 19:50:30,445 INFO L226 Difference]: Without dead ends: 31 [2024-11-27 19:50:30,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-27 19:50:30,446 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:30,446 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:30,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2024-11-27 19:50:30,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2024-11-27 19:50:30,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 28 states have (on average 1.25) internal successors, (35), 30 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2024-11-27 19:50:30,448 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 19 [2024-11-27 19:50:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:30,448 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2024-11-27 19:50:30,448 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 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-11-27 19:50:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2024-11-27 19:50:30,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-27 19:50:30,452 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:30,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:30,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-27 19:50:30,453 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:30,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash 621928056, now seen corresponding path program 1 times [2024-11-27 19:50:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:30,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525031720] [2024-11-27 19:50:30,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:30,627 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:30,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:30,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525031720] [2024-11-27 19:50:30,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525031720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:30,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:30,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-27 19:50:30,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072819149] [2024-11-27 19:50:30,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:30,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-27 19:50:30,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:30,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-27 19:50:30,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-11-27 19:50:30,630 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:30,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:30,848 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2024-11-27 19:50:30,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-27 19:50:30,848 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-11-27 19:50:30,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:30,849 INFO L225 Difference]: With dead ends: 33 [2024-11-27 19:50:30,849 INFO L226 Difference]: Without dead ends: 30 [2024-11-27 19:50:30,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2024-11-27 19:50:30,850 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:30,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 122 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:30,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-27 19:50:30,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-27 19:50:30,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:30,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-27 19:50:30,856 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 20 [2024-11-27 19:50:30,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:30,856 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-27 19:50:30,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:30,857 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-27 19:50:30,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-27 19:50:30,857 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:30,857 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:30,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-27 19:50:30,857 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:30,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:30,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1917536556, now seen corresponding path program 1 times [2024-11-27 19:50:30,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:30,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1046072197] [2024-11-27 19:50:30,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:30,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:30,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:31,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-27 19:50:31,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:31,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1046072197] [2024-11-27 19:50:31,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1046072197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:31,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:31,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-27 19:50:31,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399757046] [2024-11-27 19:50:31,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:31,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-27 19:50:31,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:31,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-27 19:50:31,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-27 19:50:31,137 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:31,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:31,183 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2024-11-27 19:50:31,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-27 19:50:31,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-27 19:50:31,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:31,184 INFO L225 Difference]: With dead ends: 37 [2024-11-27 19:50:31,184 INFO L226 Difference]: Without dead ends: 30 [2024-11-27 19:50:31,186 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-27 19:50:31,187 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 2 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:31,189 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 112 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-27 19:50:31,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-27 19:50:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-27 19:50:31,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:31,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2024-11-27 19:50:31,193 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 21 [2024-11-27 19:50:31,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:31,193 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2024-11-27 19:50:31,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 7 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2024-11-27 19:50:31,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-27 19:50:31,193 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:31,193 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:31,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-27 19:50:31,194 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:31,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:31,194 INFO L85 PathProgramCache]: Analyzing trace with hash 228592814, now seen corresponding path program 1 times [2024-11-27 19:50:31,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:31,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672188645] [2024-11-27 19:50:31,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:31,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:31,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:31,557 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:31,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:31,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672188645] [2024-11-27 19:50:31,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672188645] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-27 19:50:31,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-27 19:50:31,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-27 19:50:31,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444423089] [2024-11-27 19:50:31,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-27 19:50:31,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-27 19:50:31,562 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:31,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-27 19:50:31,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-27 19:50:31,562 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:31,699 INFO L93 Difference]: Finished difference Result 42 states and 43 transitions. [2024-11-27 19:50:31,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-27 19:50:31,699 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-27 19:50:31,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:31,699 INFO L225 Difference]: With dead ends: 42 [2024-11-27 19:50:31,700 INFO L226 Difference]: Without dead ends: 30 [2024-11-27 19:50:31,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-27 19:50:31,700 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:31,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 107 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:31,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-27 19:50:31,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-27 19:50:31,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 29 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:31,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2024-11-27 19:50:31,705 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 21 [2024-11-27 19:50:31,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:31,705 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2024-11-27 19:50:31,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2024-11-27 19:50:31,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-27 19:50:31,706 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:31,706 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:31,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-27 19:50:31,707 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:31,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:31,707 INFO L85 PathProgramCache]: Analyzing trace with hash -1765551892, now seen corresponding path program 1 times [2024-11-27 19:50:31,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:31,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819916798] [2024-11-27 19:50:31,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:31,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:31,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:32,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:32,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819916798] [2024-11-27 19:50:32,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819916798] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:32,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1352592135] [2024-11-27 19:50:32,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:32,236 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:32,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:32,239 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:50:32,245 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-27 19:50:32,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:32,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-27 19:50:32,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:32,428 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-27 19:50:32,522 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:50:32,523 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 15 treesize of output 15 [2024-11-27 19:50:32,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:32,628 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:50:32,794 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 5 treesize of output 3 [2024-11-27 19:50:32,814 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 10 treesize of output 8 [2024-11-27 19:50:32,818 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 14 treesize of output 12 [2024-11-27 19:50:32,825 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:32,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1352592135] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:50:32,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:50:32,825 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2024-11-27 19:50:32,825 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844718464] [2024-11-27 19:50:32,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:50:32,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-27 19:50:32,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:32,827 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-27 19:50:32,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2024-11-27 19:50:32,827 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 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-11-27 19:50:33,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:33,186 INFO L93 Difference]: Finished difference Result 36 states and 38 transitions. [2024-11-27 19:50:33,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-27 19:50:33,187 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 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) Word has length 21 [2024-11-27 19:50:33,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:33,188 INFO L225 Difference]: With dead ends: 36 [2024-11-27 19:50:33,188 INFO L226 Difference]: Without dead ends: 36 [2024-11-27 19:50:33,189 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 32 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=152, Invalid=498, Unknown=0, NotChecked=0, Total=650 [2024-11-27 19:50:33,190 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 50 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:33,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 106 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-27 19:50:33,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-27 19:50:33,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 28. [2024-11-27 19:50:33,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 27 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:33,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2024-11-27 19:50:33,193 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 21 [2024-11-27 19:50:33,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:33,194 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2024-11-27 19:50:33,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 18 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-11-27 19:50:33,194 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2024-11-27 19:50:33,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-27 19:50:33,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:33,195 INFO L218 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-11-27 19:50:33,206 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-27 19:50:33,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:33,396 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:33,396 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:33,396 INFO L85 PathProgramCache]: Analyzing trace with hash 1102530549, now seen corresponding path program 1 times [2024-11-27 19:50:33,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:33,397 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437846986] [2024-11-27 19:50:33,397 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:33,397 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:33,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:33,790 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:33,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:33,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437846986] [2024-11-27 19:50:33,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437846986] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:33,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1512182805] [2024-11-27 19:50:33,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:50:33,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:33,791 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:33,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:50:33,798 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-27 19:50:33,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:50:33,891 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-27 19:50:33,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:33,925 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 14 treesize of output 10 [2024-11-27 19:50:34,357 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-27 19:50:34,357 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 26 treesize of output 19 [2024-11-27 19:50:34,523 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 7 treesize of output 3 [2024-11-27 19:50:34,563 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:34,563 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:50:34,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-27 19:50:35,070 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 13 treesize of output 11 [2024-11-27 19:50:35,080 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 22 treesize of output 20 [2024-11-27 19:50:35,093 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 13 treesize of output 9 [2024-11-27 19:50:35,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:35,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1512182805] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:50:35,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:50:35,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 23 [2024-11-27 19:50:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783423407] [2024-11-27 19:50:35,112 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:50:35,112 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-27 19:50:35,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:50:35,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-27 19:50:35,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=449, Unknown=0, NotChecked=0, Total=552 [2024-11-27 19:50:35,114 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:35,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:50:35,670 INFO L93 Difference]: Finished difference Result 65 states and 69 transitions. [2024-11-27 19:50:35,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-27 19:50:35,671 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 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-11-27 19:50:35,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:50:35,672 INFO L225 Difference]: With dead ends: 65 [2024-11-27 19:50:35,672 INFO L226 Difference]: Without dead ends: 65 [2024-11-27 19:50:35,673 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=173, Invalid=757, Unknown=0, NotChecked=0, Total=930 [2024-11-27 19:50:35,675 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 95 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 249 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-27 19:50:35,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 215 Invalid, 249 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-27 19:50:35,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-27 19:50:35,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 52. [2024-11-27 19:50:35,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 51 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:35,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2024-11-27 19:50:35,679 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 22 [2024-11-27 19:50:35,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:50:35,679 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2024-11-27 19:50:35,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.5652173913043477) internal successors, (59), 24 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:50:35,679 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2024-11-27 19:50:35,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-27 19:50:35,680 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:50:35,681 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:50:35,695 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-27 19:50:35,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-27 19:50:35,881 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:50:35,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:50:35,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1143194165, now seen corresponding path program 2 times [2024-11-27 19:50:35,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:50:35,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001489844] [2024-11-27 19:50:35,882 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:50:35,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:50:35,928 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:50:35,929 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:50:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:50:37,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:50:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001489844] [2024-11-27 19:50:37,491 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001489844] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:50:37,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157443085] [2024-11-27 19:50:37,491 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:50:37,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:50:37,492 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:50:37,494 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:50:37,497 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-27 19:50:37,614 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:50:37,614 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:50:37,617 INFO L256 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 94 conjuncts are in the unsatisfiable core [2024-11-27 19:50:37,622 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:50:37,721 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 14 treesize of output 10 [2024-11-27 19:50:37,814 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 8 treesize of output 1 [2024-11-27 19:51:16,250 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-27 19:51:16,251 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 37 [2024-11-27 19:51:16,623 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 16 treesize of output 8 [2024-11-27 19:51:16,732 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 9 proven. 25 refuted. 8 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:16,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:19,335 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 40 treesize of output 32 [2024-11-27 19:51:19,482 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 21 treesize of output 17 [2024-11-27 19:51:19,491 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 70 treesize of output 60 [2024-11-27 19:51:19,502 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 94 [2024-11-27 19:51:19,653 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:19,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157443085] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:51:19,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:51:19,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23, 24] total 62 [2024-11-27 19:51:19,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896407805] [2024-11-27 19:51:19,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:19,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2024-11-27 19:51:19,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:19,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2024-11-27 19:51:19,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=3617, Unknown=8, NotChecked=0, Total=3906 [2024-11-27 19:51:19,658 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 63 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:30,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:51:38,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:51:38,161 INFO L93 Difference]: Finished difference Result 376 states and 410 transitions. [2024-11-27 19:51:38,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2024-11-27 19:51:38,162 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 63 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 48 [2024-11-27 19:51:38,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:51:38,165 INFO L225 Difference]: With dead ends: 376 [2024-11-27 19:51:38,165 INFO L226 Difference]: Without dead ends: 376 [2024-11-27 19:51:38,177 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8488 ImplicationChecksByTransitivity, 51.9s TimeCoverageRelationStatistics Valid=3221, Invalid=24493, Unknown=8, NotChecked=0, Total=27722 [2024-11-27 19:51:38,179 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 993 mSDsluCounter, 752 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 59 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 993 SdHoareTripleChecker+Valid, 770 SdHoareTripleChecker+Invalid, 2422 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2024-11-27 19:51:38,180 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [993 Valid, 770 Invalid, 2422 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 2362 Invalid, 1 Unknown, 0 Unchecked, 6.8s Time] [2024-11-27 19:51:38,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-11-27 19:51:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 189. [2024-11-27 19:51:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 188 states have (on average 1.101063829787234) internal successors, (207), 188 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:38,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 207 transitions. [2024-11-27 19:51:38,198 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 207 transitions. Word has length 48 [2024-11-27 19:51:38,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:51:38,198 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 207 transitions. [2024-11-27 19:51:38,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 62 states have (on average 2.2096774193548385) internal successors, (137), 63 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:38,198 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 207 transitions. [2024-11-27 19:51:38,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-27 19:51:38,200 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:51:38,200 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:51:38,214 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-27 19:51:38,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:38,401 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:51:38,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:51:38,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1529092136, now seen corresponding path program 1 times [2024-11-27 19:51:38,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:51:38,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [269170445] [2024-11-27 19:51:38,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:38,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:51:38,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:39,392 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-27 19:51:39,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:51:39,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [269170445] [2024-11-27 19:51:39,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [269170445] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:51:39,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368989264] [2024-11-27 19:51:39,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-27 19:51:39,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:51:39,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:51:39,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:51:39,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-27 19:51:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-27 19:51:39,517 INFO L256 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 93 conjuncts are in the unsatisfiable core [2024-11-27 19:51:39,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:51:39,561 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 14 treesize of output 10 [2024-11-27 19:51:39,629 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 8 treesize of output 1 [2024-11-27 19:51:43,443 INFO L349 Elim1Store]: treesize reduction 12, result has 64.7 percent of original size [2024-11-27 19:51:43,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 46 [2024-11-27 19:51:43,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:43,945 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 18 treesize of output 8 [2024-11-27 19:51:44,006 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 11 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:44,006 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:51:47,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 34 [2024-11-27 19:51:47,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:51:47,145 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 62 treesize of output 52 [2024-11-27 19:51:47,326 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 57 treesize of output 49 [2024-11-27 19:51:47,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 104 [2024-11-27 19:51:47,354 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 5 treesize of output 3 [2024-11-27 19:51:47,407 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:51:47,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368989264] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:51:47,407 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:51:47,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 27, 28] total 61 [2024-11-27 19:51:47,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288917124] [2024-11-27 19:51:47,408 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:51:47,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2024-11-27 19:51:47,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:51:47,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2024-11-27 19:51:47,411 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=3362, Unknown=0, NotChecked=0, Total=3782 [2024-11-27 19:51:47,411 INFO L87 Difference]: Start difference. First operand 189 states and 207 transitions. Second operand has 62 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 62 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:51:52,485 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:51:56,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:52:23,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-27 19:52:23,371 INFO L93 Difference]: Finished difference Result 558 states and 607 transitions. [2024-11-27 19:52:23,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2024-11-27 19:52:23,372 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 62 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2024-11-27 19:52:23,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-27 19:52:23,375 INFO L225 Difference]: With dead ends: 558 [2024-11-27 19:52:23,375 INFO L226 Difference]: Without dead ends: 558 [2024-11-27 19:52:23,385 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13373 ImplicationChecksByTransitivity, 31.4s TimeCoverageRelationStatistics Valid=5552, Invalid=34246, Unknown=2, NotChecked=0, Total=39800 [2024-11-27 19:52:23,385 INFO L435 NwaCegarLoop]: 28 mSDtfsCounter, 1438 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 3207 mSolverCounterSat, 83 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 3207 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2024-11-27 19:52:23,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 1035 Invalid, 3291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 3207 Invalid, 1 Unknown, 0 Unchecked, 10.2s Time] [2024-11-27 19:52:23,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2024-11-27 19:52:23,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 266. [2024-11-27 19:52:23,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.0943396226415094) internal successors, (290), 265 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:52:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 290 transitions. [2024-11-27 19:52:23,399 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 290 transitions. Word has length 55 [2024-11-27 19:52:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-27 19:52:23,400 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 290 transitions. [2024-11-27 19:52:23,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 61 states have (on average 2.4918032786885247) internal successors, (152), 62 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:52:23,400 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 290 transitions. [2024-11-27 19:52:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-27 19:52:23,403 INFO L210 NwaCegarLoop]: Found error trace [2024-11-27 19:52:23,403 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-27 19:52:23,419 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-27 19:52:23,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:52:23,607 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-27 19:52:23,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-27 19:52:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash -745138367, now seen corresponding path program 2 times [2024-11-27 19:52:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-27 19:52:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557475705] [2024-11-27 19:52:23,608 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:52:23,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-27 19:52:23,655 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:52:23,656 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:52:25,799 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2024-11-27 19:52:25,799 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-27 19:52:25,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557475705] [2024-11-27 19:52:25,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [557475705] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-27 19:52:25,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1601459707] [2024-11-27 19:52:25,800 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-27 19:52:25,800 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-27 19:52:25,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-27 19:52:25,802 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-27 19:52:25,807 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cf1ed1ee-f564-463e-877b-6652771f3ebb/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-27 19:52:25,973 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-27 19:52:25,973 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-27 19:52:25,980 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 130 conjuncts are in the unsatisfiable core [2024-11-27 19:52:25,987 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-27 19:52:26,105 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 14 treesize of output 10 [2024-11-27 19:52:26,209 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 8 treesize of output 1 [2024-11-27 19:53:43,245 INFO L349 Elim1Store]: treesize reduction 12, result has 63.6 percent of original size [2024-11-27 19:53:43,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 79 treesize of output 60 [2024-11-27 19:53:43,649 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:53:43,650 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 39 treesize of output 25 [2024-11-27 19:53:43,776 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 121 refuted. 16 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:53:43,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-27 19:53:49,190 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:53:49,191 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 51 treesize of output 39 [2024-11-27 19:53:49,381 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 83 treesize of output 71 [2024-11-27 19:53:49,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-27 19:53:49,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 105 [2024-11-27 19:53:49,405 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 21 treesize of output 17 [2024-11-27 19:53:49,614 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 0 proven. 137 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-27 19:53:49,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1601459707] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-27 19:53:49,615 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-27 19:53:49,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 31, 32] total 79 [2024-11-27 19:53:49,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759067110] [2024-11-27 19:53:49,615 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-27 19:53:49,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 80 states [2024-11-27 19:53:49,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-27 19:53:49,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2024-11-27 19:53:49,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=498, Invalid=5796, Unknown=26, NotChecked=0, Total=6320 [2024-11-27 19:53:49,618 INFO L87 Difference]: Start difference. First operand 266 states and 290 transitions. Second operand has 80 states, 79 states have (on average 2.632911392405063) internal successors, (208), 80 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-27 19:53:57,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:54:04,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:54:17,148 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:54:45,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:08,390 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:12,929 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:17,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:22,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:28,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:32,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:37,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:55:54,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:56:33,809 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:56:37,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:56:41,823 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:56:49,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:56:54,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:57:57,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:58:01,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:58:05,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:58:09,466 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:58:29,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:58:35,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:58:37,792 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:58:41,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:08,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 19:59:13,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:17,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:21,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:25,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:28,160 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:32,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:36,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:40,180 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:41,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:44,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.48s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:46,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:50,195 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:54,200 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:56,287 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 19:59:59,135 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:00:04,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:00:10,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:00:14,662 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:00:18,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:00:22,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:00:27,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:00:35,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:08,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:10,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:16,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.69s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:20,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:24,587 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:29,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:33,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:37,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:41,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:46,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:51,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:53,094 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:54,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:01:59,755 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:02:03,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:02:07,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:02:11,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:02:22,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:02:42,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:02:44,245 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:02:58,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:03:02,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:03:10,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:03:46,517 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:03:47,612 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:04:10,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:04:34,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:04:50,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:04:57,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:05:04,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-27 20:05:05,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:05:07,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:05:09,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:05:13,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:05:15,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2024-11-27 20:05:21,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1]