./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:30:13,868 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:30:13,932 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:30:13,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:30:13,937 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:30:13,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:30:13,971 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:30:13,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:30:13,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:30:13,974 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:30:13,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:30:13,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:30:13,975 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:30:13,977 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:30:13,977 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:30:13,978 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:30:13,978 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:30:13,978 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:30:13,978 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:30:13,979 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:30:13,979 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:30:13,983 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:30:13,983 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:30:13,984 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:30:13,984 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:30:13,984 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:30:13,984 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:30:13,985 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:30:13,985 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:30:13,985 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:30:13,985 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:30:13,986 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:30:13,986 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:30:13,986 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:30:13,986 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:30:13,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:30:13,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:30:13,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:30:13,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:30:13,988 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:30:13,989 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:30:13,989 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:30:13,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> b06fba6fbf61d996c1af57497d908c6dba492febf0212a36ee7b28f5806d365e [2024-10-11 16:30:14,289 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:30:14,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:30:14,315 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:30:14,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:30:14,316 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:30:14,318 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2024-10-11 16:30:15,742 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:30:16,083 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:30:16,085 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i [2024-10-11 16:30:16,108 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/457f20119/72dd0ff85659481888f38f4564b01992/FLAGb9f1e59eb [2024-10-11 16:30:16,123 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/457f20119/72dd0ff85659481888f38f4564b01992 [2024-10-11 16:30:16,125 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:30:16,127 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:30:16,129 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:30:16,129 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:30:16,135 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:30:16,136 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:30:16" (1/1) ... [2024-10-11 16:30:16,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2279f05d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:16, skipping insertion in model container [2024-10-11 16:30:16,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:30:16" (1/1) ... [2024-10-11 16:30:16,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:30:16,605 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i[33022,33035] [2024-10-11 16:30:16,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:30:16,832 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:30:16,878 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-1.i[33022,33035] [2024-10-11 16:30:16,997 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:30:17,028 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:30:17,029 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17 WrapperNode [2024-10-11 16:30:17,029 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:30:17,030 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:30:17,031 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:30:17,031 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:30:17,038 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,087 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,220 INFO L138 Inliner]: procedures = 177, calls = 506, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3410 [2024-10-11 16:30:17,221 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:30:17,222 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:30:17,222 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:30:17,222 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:30:17,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,300 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,431 INFO L175 MemorySlicer]: Split 480 memory accesses to 3 slices as follows [2, 372, 106]. 78 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 86 writes are split as follows [0, 82, 4]. [2024-10-11 16:30:17,431 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,431 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,518 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,529 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,546 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,570 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:30:17,572 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:30:17,572 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:30:17,573 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:30:17,574 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (1/1) ... [2024-10-11 16:30:17,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:30:17,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:17,611 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:30:17,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:30:17,741 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-11 16:30:17,742 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-11 16:30:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:30:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:30:17,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:30:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:30:17,746 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:30:17,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:30:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:30:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:30:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-11 16:30:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-11 16:30:17,747 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-11 16:30:17,747 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-11 16:30:17,747 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-11 16:30:17,748 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-11 16:30:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:30:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:30:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:30:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:30:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:30:17,748 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:30:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:30:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:30:17,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:30:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:30:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:30:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:30:17,753 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:30:17,754 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:30:17,754 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:30:18,064 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:30:18,066 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:30:20,799 INFO L? ?]: Removed 780 outVars from TransFormulas that were not future-live. [2024-10-11 16:30:20,800 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:30:20,893 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:30:20,894 INFO L314 CfgBuilder]: Removed 151 assume(true) statements. [2024-10-11 16:30:20,894 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:30:20 BoogieIcfgContainer [2024-10-11 16:30:20,894 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:30:20,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:30:20,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:30:20,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:30:20,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:30:16" (1/3) ... [2024-10-11 16:30:20,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c915070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:30:20, skipping insertion in model container [2024-10-11 16:30:20,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:30:17" (2/3) ... [2024-10-11 16:30:20,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c915070 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:30:20, skipping insertion in model container [2024-10-11 16:30:20,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:30:20" (3/3) ... [2024-10-11 16:30:20,903 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-1.i [2024-10-11 16:30:20,921 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:30:20,922 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 16:30:21,023 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:30:21,031 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=LoopHeads, 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;@4c24ebca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:30:21,031 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 16:30:21,042 INFO L276 IsEmpty]: Start isEmpty. Operand has 1025 states, 1006 states have (on average 1.6312127236580516) internal successors, (1641), 1011 states have internal predecessors, (1641), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 16:30:21,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 16:30:21,050 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:21,051 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:21,052 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:21,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:21,057 INFO L85 PathProgramCache]: Analyzing trace with hash 76532746, now seen corresponding path program 1 times [2024-10-11 16:30:21,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:21,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922827337] [2024-10-11 16:30:21,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:21,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:21,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:21,249 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:30:21,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:21,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922827337] [2024-10-11 16:30:21,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922827337] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:21,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:21,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:30:21,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056597214] [2024-10-11 16:30:21,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:21,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:30:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:21,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:30:21,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:30:21,301 INFO L87 Difference]: Start difference. First operand has 1025 states, 1006 states have (on average 1.6312127236580516) internal successors, (1641), 1011 states have internal predecessors, (1641), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:21,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:21,418 INFO L93 Difference]: Finished difference Result 2049 states and 3345 transitions. [2024-10-11 16:30:21,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:30:21,421 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-11 16:30:21,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:21,444 INFO L225 Difference]: With dead ends: 2049 [2024-10-11 16:30:21,444 INFO L226 Difference]: Without dead ends: 1023 [2024-10-11 16:30:21,450 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:30:21,453 INFO L432 NwaCegarLoop]: 1506 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1506 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:21,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1506 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:30:21,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-10-11 16:30:21,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2024-10-11 16:30:21,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1023 states, 1005 states have (on average 1.4736318407960198) internal successors, (1481), 1010 states have internal predecessors, (1481), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:30:21,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2024-10-11 16:30:21,551 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 12 [2024-10-11 16:30:21,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:21,552 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2024-10-11 16:30:21,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:21,553 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2024-10-11 16:30:21,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:30:21,559 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:21,559 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:21,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:30:21,560 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:21,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:21,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1351663222, now seen corresponding path program 1 times [2024-10-11 16:30:21,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:21,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922844991] [2024-10-11 16:30:21,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:21,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:21,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:21,963 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:30:21,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:21,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922844991] [2024-10-11 16:30:21,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922844991] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:21,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:21,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:30:21,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682655049] [2024-10-11 16:30:21,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:21,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:21,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:21,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:21,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:30:21,970 INFO L87 Difference]: Start difference. First operand 1023 states and 1508 transitions. Second operand has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:22,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:22,185 INFO L93 Difference]: Finished difference Result 2042 states and 3012 transitions. [2024-10-11 16:30:22,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:30:22,186 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-11 16:30:22,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:22,219 INFO L225 Difference]: With dead ends: 2042 [2024-10-11 16:30:22,219 INFO L226 Difference]: Without dead ends: 1409 [2024-10-11 16:30:22,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:30:22,222 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 548 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 554 SdHoareTripleChecker+Valid, 4525 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:22,223 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [554 Valid, 4525 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:30:22,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-11 16:30:22,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1025. [2024-10-11 16:30:22,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1025 states, 1007 states have (on average 1.4726911618669314) internal successors, (1483), 1012 states have internal predecessors, (1483), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:30:22,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1510 transitions. [2024-10-11 16:30:22,264 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1510 transitions. Word has length 67 [2024-10-11 16:30:22,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:22,264 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1510 transitions. [2024-10-11 16:30:22,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.25) internal successors, (65), 3 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:22,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1510 transitions. [2024-10-11 16:30:22,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-11 16:30:22,273 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:22,273 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:22,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:30:22,274 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:22,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:22,275 INFO L85 PathProgramCache]: Analyzing trace with hash 24463117, now seen corresponding path program 1 times [2024-10-11 16:30:22,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:22,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308426634] [2024-10-11 16:30:22,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:22,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:22,899 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:30:22,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:22,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308426634] [2024-10-11 16:30:22,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308426634] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:22,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:22,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:30:22,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911184461] [2024-10-11 16:30:22,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:22,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:22,905 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:22,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:22,906 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:30:22,907 INFO L87 Difference]: Start difference. First operand 1025 states and 1510 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:23,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:23,114 INFO L93 Difference]: Finished difference Result 2431 states and 3576 transitions. [2024-10-11 16:30:23,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:30:23,115 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-10-11 16:30:23,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:23,124 INFO L225 Difference]: With dead ends: 2431 [2024-10-11 16:30:23,124 INFO L226 Difference]: Without dead ends: 1409 [2024-10-11 16:30:23,127 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:30:23,128 INFO L432 NwaCegarLoop]: 1501 mSDtfsCounter, 544 mSDsluCounter, 2938 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4439 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:23,129 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4439 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:30:23,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-11 16:30:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1028. [2024-10-11 16:30:23,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1028 states, 1010 states have (on average 1.4712871287128713) internal successors, (1486), 1015 states have internal predecessors, (1486), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:30:23,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1513 transitions. [2024-10-11 16:30:23,159 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1513 transitions. Word has length 144 [2024-10-11 16:30:23,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:23,159 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1513 transitions. [2024-10-11 16:30:23,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:23,160 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1513 transitions. [2024-10-11 16:30:23,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 16:30:23,164 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:23,164 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:23,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:30:23,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:23,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:23,165 INFO L85 PathProgramCache]: Analyzing trace with hash 532320615, now seen corresponding path program 1 times [2024-10-11 16:30:23,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:23,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049536070] [2024-10-11 16:30:23,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:23,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:23,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:23,613 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:30:23,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049536070] [2024-10-11 16:30:23,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049536070] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:23,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:23,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:30:23,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833356529] [2024-10-11 16:30:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:23,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:23,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:23,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:30:23,617 INFO L87 Difference]: Start difference. First operand 1028 states and 1513 transitions. Second operand has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:23,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:23,748 INFO L93 Difference]: Finished difference Result 2008 states and 2954 transitions. [2024-10-11 16:30:23,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:30:23,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-10-11 16:30:23,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:23,753 INFO L225 Difference]: With dead ends: 2008 [2024-10-11 16:30:23,753 INFO L226 Difference]: Without dead ends: 986 [2024-10-11 16:30:23,757 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 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-10-11 16:30:23,758 INFO L432 NwaCegarLoop]: 1403 mSDtfsCounter, 30 mSDsluCounter, 2789 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 4192 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:23,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 4192 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:30:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-10-11 16:30:23,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2024-10-11 16:30:23,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 986 states, 968 states have (on average 1.4555785123966942) internal successors, (1409), 973 states have internal predecessors, (1409), 14 states have call successors, (14), 3 states have call predecessors, (14), 3 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2024-10-11 16:30:23,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1436 transitions. [2024-10-11 16:30:23,783 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1436 transitions. Word has length 215 [2024-10-11 16:30:23,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:23,785 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1436 transitions. [2024-10-11 16:30:23,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.25) internal successors, (213), 4 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:23,785 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1436 transitions. [2024-10-11 16:30:23,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-11 16:30:23,789 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:23,789 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:23,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:30:23,790 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:23,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1783554395, now seen corresponding path program 1 times [2024-10-11 16:30:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789376790] [2024-10-11 16:30:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:23,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:24,052 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:30:24,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:24,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789376790] [2024-10-11 16:30:24,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789376790] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:24,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:24,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:30:24,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993024889] [2024-10-11 16:30:24,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:24,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 16:30:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:24,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 16:30:24,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:30:24,057 INFO L87 Difference]: Start difference. First operand 986 states and 1436 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:24,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:24,161 INFO L93 Difference]: Finished difference Result 2497 states and 3649 transitions. [2024-10-11 16:30:24,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 16:30:24,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 215 [2024-10-11 16:30:24,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:24,168 INFO L225 Difference]: With dead ends: 2497 [2024-10-11 16:30:24,168 INFO L226 Difference]: Without dead ends: 1517 [2024-10-11 16:30:24,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 16:30:24,170 INFO L432 NwaCegarLoop]: 1420 mSDtfsCounter, 716 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 719 SdHoareTripleChecker+Valid, 2823 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:24,173 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [719 Valid, 2823 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:30:24,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-11 16:30:24,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1358. [2024-10-11 16:30:24,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1358 states, 1338 states have (on average 1.4581464872944694) internal successors, (1951), 1343 states have internal predecessors, (1951), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:30:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1982 transitions. [2024-10-11 16:30:24,242 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1982 transitions. Word has length 215 [2024-10-11 16:30:24,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:24,244 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1982 transitions. [2024-10-11 16:30:24,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:30:24,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1982 transitions. [2024-10-11 16:30:24,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:30:24,247 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:24,247 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:24,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:30:24,249 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:24,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:24,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1015366202, now seen corresponding path program 1 times [2024-10-11 16:30:24,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:24,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41347430] [2024-10-11 16:30:24,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:24,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:24,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:24,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:24,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:24,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:24,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:24,718 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:30:24,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:24,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41347430] [2024-10-11 16:30:24,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41347430] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:24,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:24,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:30:24,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123368045] [2024-10-11 16:30:24,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:24,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:30:24,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:24,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:30:24,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:30:24,721 INFO L87 Difference]: Start difference. First operand 1358 states and 1982 transitions. Second operand has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:30:25,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:25,217 INFO L93 Difference]: Finished difference Result 2585 states and 3784 transitions. [2024-10-11 16:30:25,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:30:25,218 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:30:25,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:25,224 INFO L225 Difference]: With dead ends: 2585 [2024-10-11 16:30:25,224 INFO L226 Difference]: Without dead ends: 1318 [2024-10-11 16:30:25,226 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:30:25,227 INFO L432 NwaCegarLoop]: 1297 mSDtfsCounter, 51 mSDsluCounter, 3741 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 5038 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:25,227 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 5038 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:30:25,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-11 16:30:25,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-11 16:30:25,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1296 states have (on average 1.4459876543209877) internal successors, (1874), 1301 states have internal predecessors, (1874), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:30:25,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1905 transitions. [2024-10-11 16:30:25,255 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1905 transitions. Word has length 228 [2024-10-11 16:30:25,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:25,256 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1905 transitions. [2024-10-11 16:30:25,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 44.0) internal successors, (220), 4 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:30:25,256 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1905 transitions. [2024-10-11 16:30:25,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:30:25,259 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:25,259 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:25,259 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:30:25,259 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:25,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:25,260 INFO L85 PathProgramCache]: Analyzing trace with hash 639559238, now seen corresponding path program 1 times [2024-10-11 16:30:25,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:25,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047994522] [2024-10-11 16:30:25,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:25,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:25,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:25,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:25,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:25,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:25,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:30:25,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:25,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047994522] [2024-10-11 16:30:25,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047994522] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:25,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:25,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:30:25,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961886326] [2024-10-11 16:30:25,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:25,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:25,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:25,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:25,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:30:25,656 INFO L87 Difference]: Start difference. First operand 1316 states and 1905 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:30:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:26,151 INFO L93 Difference]: Finished difference Result 2543 states and 3696 transitions. [2024-10-11 16:30:26,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:30:26,152 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:30:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:26,158 INFO L225 Difference]: With dead ends: 2543 [2024-10-11 16:30:26,158 INFO L226 Difference]: Without dead ends: 1318 [2024-10-11 16:30:26,160 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 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-10-11 16:30:26,161 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 22 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3782 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:26,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3782 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:30:26,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-11 16:30:26,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-11 16:30:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 1296 states have (on average 1.4436728395061729) internal successors, (1871), 1301 states have internal predecessors, (1871), 16 states have call successors, (16), 3 states have call predecessors, (16), 3 states have return successors, (15), 12 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-11 16:30:26,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1902 transitions. [2024-10-11 16:30:26,189 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1902 transitions. Word has length 228 [2024-10-11 16:30:26,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:26,190 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1902 transitions. [2024-10-11 16:30:26,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:30:26,191 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1902 transitions. [2024-10-11 16:30:26,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-11 16:30:26,193 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:26,194 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:26,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:30:26,194 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:26,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:26,195 INFO L85 PathProgramCache]: Analyzing trace with hash -1087585724, now seen corresponding path program 1 times [2024-10-11 16:30:26,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:26,195 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455604653] [2024-10-11 16:30:26,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:26,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:26,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:26,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:26,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:26,577 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 16:30:26,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:26,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455604653] [2024-10-11 16:30:26,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455604653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:26,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:26,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:30:26,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493451317] [2024-10-11 16:30:26,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:26,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:26,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:26,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:26,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:30:26,581 INFO L87 Difference]: Start difference. First operand 1316 states and 1902 transitions. Second operand has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:30:27,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:27,109 INFO L93 Difference]: Finished difference Result 3114 states and 4524 transitions. [2024-10-11 16:30:27,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:30:27,110 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 228 [2024-10-11 16:30:27,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:27,118 INFO L225 Difference]: With dead ends: 3114 [2024-10-11 16:30:27,120 INFO L226 Difference]: Without dead ends: 1889 [2024-10-11 16:30:27,124 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-10-11 16:30:27,125 INFO L432 NwaCegarLoop]: 1539 mSDtfsCounter, 617 mSDsluCounter, 2698 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 625 SdHoareTripleChecker+Valid, 4237 SdHoareTripleChecker+Invalid, 219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:27,126 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [625 Valid, 4237 Invalid, 219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:30:27,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-10-11 16:30:27,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1882. [2024-10-11 16:30:27,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1882 states, 1856 states have (on average 1.4455818965517242) internal successors, (2683), 1861 states have internal predecessors, (2683), 22 states have call successors, (22), 3 states have call predecessors, (22), 3 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2024-10-11 16:30:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2726 transitions. [2024-10-11 16:30:27,182 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2726 transitions. Word has length 228 [2024-10-11 16:30:27,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:27,183 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2726 transitions. [2024-10-11 16:30:27,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.0) internal successors, (220), 3 states have internal predecessors, (220), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-10-11 16:30:27,184 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2726 transitions. [2024-10-11 16:30:27,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-11 16:30:27,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:27,189 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:27,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:30:27,190 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:27,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:27,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2135614678, now seen corresponding path program 1 times [2024-10-11 16:30:27,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:27,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1252877322] [2024-10-11 16:30:27,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:27,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:27,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:27,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:27,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:27,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:27,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:27,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:27,635 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:27,635 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:27,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1252877322] [2024-10-11 16:30:27,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1252877322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:27,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:27,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:30:27,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168022132] [2024-10-11 16:30:27,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:27,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:30:27,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:27,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:30:27,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:30:27,639 INFO L87 Difference]: Start difference. First operand 1882 states and 2726 transitions. Second operand has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:28,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:28,677 INFO L93 Difference]: Finished difference Result 4067 states and 5941 transitions. [2024-10-11 16:30:28,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:30:28,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 241 [2024-10-11 16:30:28,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:28,689 INFO L225 Difference]: With dead ends: 4067 [2024-10-11 16:30:28,689 INFO L226 Difference]: Without dead ends: 2422 [2024-10-11 16:30:28,692 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:30:28,693 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 5658 mSDsluCounter, 2644 mSDsCounter, 0 mSdLazyCounter, 367 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5669 SdHoareTripleChecker+Valid, 3998 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:28,693 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5669 Valid, 3998 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 367 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-11 16:30:28,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-10-11 16:30:28,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1453. [2024-10-11 16:30:28,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1453 states, 1432 states have (on average 1.4301675977653632) internal successors, (2048), 1437 states have internal predecessors, (2048), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:30:28,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2081 transitions. [2024-10-11 16:30:28,749 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2081 transitions. Word has length 241 [2024-10-11 16:30:28,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:28,750 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2081 transitions. [2024-10-11 16:30:28,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.5) internal successors, (225), 5 states have internal predecessors, (225), 3 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-11 16:30:28,750 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2081 transitions. [2024-10-11 16:30:28,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:30:28,753 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:28,754 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:28,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:30:28,754 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:28,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:28,755 INFO L85 PathProgramCache]: Analyzing trace with hash -550417174, now seen corresponding path program 1 times [2024-10-11 16:30:28,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:28,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088636344] [2024-10-11 16:30:28,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:28,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:28,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:29,200 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 16:30:29,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:29,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088636344] [2024-10-11 16:30:29,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088636344] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:29,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:29,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 16:30:29,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643686571] [2024-10-11 16:30:29,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:29,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 16:30:29,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:29,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 16:30:29,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:30:29,203 INFO L87 Difference]: Start difference. First operand 1453 states and 2081 transitions. Second operand has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:29,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:29,680 INFO L93 Difference]: Finished difference Result 2329 states and 3389 transitions. [2024-10-11 16:30:29,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:30:29,680 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2024-10-11 16:30:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:29,688 INFO L225 Difference]: With dead ends: 2329 [2024-10-11 16:30:29,688 INFO L226 Difference]: Without dead ends: 1413 [2024-10-11 16:30:29,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:30:29,690 INFO L432 NwaCegarLoop]: 1211 mSDtfsCounter, 51 mSDsluCounter, 3484 mSDsCounter, 0 mSdLazyCounter, 265 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 4695 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:29,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 4695 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 265 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:30:29,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-11 16:30:29,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1411. [2024-10-11 16:30:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1390 states have (on average 1.4179856115107914) internal successors, (1971), 1395 states have internal predecessors, (1971), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:30:29,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2004 transitions. [2024-10-11 16:30:29,796 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2004 transitions. Word has length 251 [2024-10-11 16:30:29,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:29,797 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2004 transitions. [2024-10-11 16:30:29,797 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 46.8) internal successors, (234), 4 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:29,797 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2004 transitions. [2024-10-11 16:30:29,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:30:29,800 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:29,801 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:29,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:30:29,801 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:29,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:29,802 INFO L85 PathProgramCache]: Analyzing trace with hash -1328749668, now seen corresponding path program 1 times [2024-10-11 16:30:29,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:29,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399884890] [2024-10-11 16:30:29,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:29,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:29,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:30,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:30,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:30,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:30,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:30,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:30,161 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-10-11 16:30:30,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:30,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399884890] [2024-10-11 16:30:30,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399884890] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:30:30,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:30:30,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:30:30,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792693427] [2024-10-11 16:30:30,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:30:30,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:30:30,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:30,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:30:30,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:30:30,164 INFO L87 Difference]: Start difference. First operand 1411 states and 2004 transitions. Second operand has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:30,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:30,663 INFO L93 Difference]: Finished difference Result 2262 states and 3272 transitions. [2024-10-11 16:30:30,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:30:30,664 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 251 [2024-10-11 16:30:30,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:30,670 INFO L225 Difference]: With dead ends: 2262 [2024-10-11 16:30:30,671 INFO L226 Difference]: Without dead ends: 1413 [2024-10-11 16:30:30,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 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-10-11 16:30:30,673 INFO L432 NwaCegarLoop]: 1225 mSDtfsCounter, 22 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3524 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:30,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3524 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:30:30,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-11 16:30:30,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1411. [2024-10-11 16:30:30,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1411 states, 1390 states have (on average 1.4158273381294963) internal successors, (1968), 1395 states have internal predecessors, (1968), 17 states have call successors, (17), 3 states have call predecessors, (17), 3 states have return successors, (16), 13 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-11 16:30:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2001 transitions. [2024-10-11 16:30:30,720 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2001 transitions. Word has length 251 [2024-10-11 16:30:30,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:30,720 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2001 transitions. [2024-10-11 16:30:30,721 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.5) internal successors, (234), 3 states have internal predecessors, (234), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:30:30,721 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2001 transitions. [2024-10-11 16:30:30,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-11 16:30:30,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:30,724 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:30,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:30:30,725 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:30,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:30,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1508135840, now seen corresponding path program 1 times [2024-10-11 16:30:30,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:30,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528301252] [2024-10-11 16:30:30,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:30,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:31,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:32,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:32,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:32,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:32,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:32,021 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:32,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528301252] [2024-10-11 16:30:32,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528301252] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:32,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [494197145] [2024-10-11 16:30:32,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:32,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:32,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:32,025 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:32,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 16:30:32,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:32,733 INFO L255 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:30:32,761 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:32,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:30:33,283 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:30:33,306 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:33,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:30:33,686 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:33,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [494197145] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:30:33,687 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:30:33,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2024-10-11 16:30:33,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586434585] [2024-10-11 16:30:33,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:30:33,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-11 16:30:33,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:33,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-11 16:30:33,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-11 16:30:33,691 INFO L87 Difference]: Start difference. First operand 1411 states and 2001 transitions. Second operand has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 12 states have internal predecessors, (558), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:30:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:35,108 INFO L93 Difference]: Finished difference Result 3237 states and 4580 transitions. [2024-10-11 16:30:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 16:30:35,109 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 12 states have internal predecessors, (558), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 251 [2024-10-11 16:30:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:35,118 INFO L225 Difference]: With dead ends: 3237 [2024-10-11 16:30:35,118 INFO L226 Difference]: Without dead ends: 2359 [2024-10-11 16:30:35,120 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 519 GetRequests, 497 SyntacticMatches, 7 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=200, Unknown=0, NotChecked=0, Total=272 [2024-10-11 16:30:35,121 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 2815 mSDsluCounter, 9113 mSDsCounter, 0 mSdLazyCounter, 813 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2846 SdHoareTripleChecker+Valid, 10657 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 813 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:35,121 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2846 Valid, 10657 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 813 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-11 16:30:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-10-11 16:30:35,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2064. [2024-10-11 16:30:35,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 2031 states have (on average 1.3870014771048744) internal successors, (2817), 2036 states have internal predecessors, (2817), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 16:30:35,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2872 transitions. [2024-10-11 16:30:35,181 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2872 transitions. Word has length 251 [2024-10-11 16:30:35,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:35,181 INFO L471 AbstractCegarLoop]: Abstraction has 2064 states and 2872 transitions. [2024-10-11 16:30:35,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 42.92307692307692) internal successors, (558), 12 states have internal predecessors, (558), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:30:35,182 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2872 transitions. [2024-10-11 16:30:35,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-11 16:30:35,189 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:35,190 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:35,210 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-11 16:30:35,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-11 16:30:35,391 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:35,391 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:35,392 INFO L85 PathProgramCache]: Analyzing trace with hash 1327197621, now seen corresponding path program 1 times [2024-10-11 16:30:35,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:35,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771982382] [2024-10-11 16:30:35,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:35,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:37,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:37,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:37,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:37,749 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 5 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 16:30:37,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771982382] [2024-10-11 16:30:37,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771982382] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:37,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128442416] [2024-10-11 16:30:37,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:37,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:37,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:37,752 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:37,754 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 16:30:38,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:38,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 16:30:38,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:38,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:30:39,127 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:30:39,153 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 5 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 16:30:39,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:30:39,478 INFO L134 CoverageAnalysis]: Checked inductivity of 482 backedges. 234 proven. 5 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-10-11 16:30:39,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128442416] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:30:39,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:30:39,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-11 16:30:39,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642888299] [2024-10-11 16:30:39,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:30:39,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-11 16:30:39,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-11 16:30:39,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-11 16:30:39,483 INFO L87 Difference]: Start difference. First operand 2064 states and 2872 transitions. Second operand has 14 states, 14 states have (on average 46.07142857142857) internal successors, (645), 13 states have internal predecessors, (645), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:30:41,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:41,029 INFO L93 Difference]: Finished difference Result 3977 states and 5565 transitions. [2024-10-11 16:30:41,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 16:30:41,030 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 46.07142857142857) internal successors, (645), 13 states have internal predecessors, (645), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 482 [2024-10-11 16:30:41,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:41,041 INFO L225 Difference]: With dead ends: 3977 [2024-10-11 16:30:41,041 INFO L226 Difference]: Without dead ends: 2359 [2024-10-11 16:30:41,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 985 GetRequests, 960 SyntacticMatches, 7 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2024-10-11 16:30:41,047 INFO L432 NwaCegarLoop]: 1570 mSDtfsCounter, 1796 mSDsluCounter, 10365 mSDsCounter, 0 mSdLazyCounter, 937 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1826 SdHoareTripleChecker+Valid, 11935 SdHoareTripleChecker+Invalid, 964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 937 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:41,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1826 Valid, 11935 Invalid, 964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 937 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-11 16:30:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-10-11 16:30:41,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2067. [2024-10-11 16:30:41,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2067 states, 2034 states have (on average 1.3854473942969519) internal successors, (2818), 2039 states have internal predecessors, (2818), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (27), 24 states have call predecessors, (27), 27 states have call successors, (27) [2024-10-11 16:30:41,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2873 transitions. [2024-10-11 16:30:41,181 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2873 transitions. Word has length 482 [2024-10-11 16:30:41,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:41,182 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 2873 transitions. [2024-10-11 16:30:41,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 46.07142857142857) internal successors, (645), 13 states have internal predecessors, (645), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:30:41,187 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2873 transitions. [2024-10-11 16:30:41,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2024-10-11 16:30:41,208 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:41,209 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:41,234 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 16:30:41,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:41,410 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:41,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:41,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1397164687, now seen corresponding path program 1 times [2024-10-11 16:30:41,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:41,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097160450] [2024-10-11 16:30:41,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:41,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:42,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:30:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:30:47,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:30:47,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:30:47,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:47,750 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:47,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:30:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097160450] [2024-10-11 16:30:47,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097160450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:30:47,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1586846536] [2024-10-11 16:30:47,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:47,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:47,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:30:47,753 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:30:47,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 16:30:49,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:30:49,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 3384 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 16:30:49,121 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:30:49,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:30:49,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:30:49,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:30:49,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:30:50,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:30:50,181 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:50,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:30:51,004 INFO L134 CoverageAnalysis]: Checked inductivity of 902 backedges. 0 proven. 884 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-10-11 16:30:51,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1586846536] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:30:51,005 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:30:51,006 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 25 [2024-10-11 16:30:51,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639983626] [2024-10-11 16:30:51,006 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:30:51,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 16:30:51,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:30:51,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 16:30:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2024-10-11 16:30:51,019 INFO L87 Difference]: Start difference. First operand 2067 states and 2873 transitions. Second operand has 25 states, 25 states have (on average 75.6) internal successors, (1890), 24 states have internal predecessors, (1890), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:30:53,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:30:53,223 INFO L93 Difference]: Finished difference Result 4995 states and 6956 transitions. [2024-10-11 16:30:53,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-11 16:30:53,224 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 75.6) internal successors, (1890), 24 states have internal predecessors, (1890), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 695 [2024-10-11 16:30:53,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:30:53,242 INFO L225 Difference]: With dead ends: 4995 [2024-10-11 16:30:53,242 INFO L226 Difference]: Without dead ends: 4117 [2024-10-11 16:30:53,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1422 GetRequests, 1382 SyntacticMatches, 7 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=324, Invalid=866, Unknown=0, NotChecked=0, Total=1190 [2024-10-11 16:30:53,247 INFO L432 NwaCegarLoop]: 2678 mSDtfsCounter, 5239 mSDsluCounter, 25287 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5318 SdHoareTripleChecker+Valid, 27965 SdHoareTripleChecker+Invalid, 1830 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 16:30:53,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5318 Valid, 27965 Invalid, 1830 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [92 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 16:30:53,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2024-10-11 16:30:53,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3822. [2024-10-11 16:30:53,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3822 states, 3765 states have (on average 1.3593625498007968) internal successors, (5118), 3770 states have internal predecessors, (5118), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 16:30:53,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3822 states to 3822 states and 5221 transitions. [2024-10-11 16:30:53,366 INFO L78 Accepts]: Start accepts. Automaton has 3822 states and 5221 transitions. Word has length 695 [2024-10-11 16:30:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:30:53,367 INFO L471 AbstractCegarLoop]: Abstraction has 3822 states and 5221 transitions. [2024-10-11 16:30:53,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 75.6) internal successors, (1890), 24 states have internal predecessors, (1890), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:30:53,368 INFO L276 IsEmpty]: Start isEmpty. Operand 3822 states and 5221 transitions. [2024-10-11 16:30:53,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2024-10-11 16:30:53,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:30:53,383 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:30:53,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-11 16:30:53,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:30:53,585 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:30:53,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:30:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -171854319, now seen corresponding path program 1 times [2024-10-11 16:30:53,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:30:53,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273217975] [2024-10-11 16:30:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:30:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:30:54,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:01,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:31:01,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:01,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:31:01,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:01,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:31:01,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:01,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:31:01,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1851 proven. 896 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-11 16:31:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273217975] [2024-10-11 16:31:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273217975] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:31:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140868116] [2024-10-11 16:31:01,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:01,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:31:01,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:31:01,452 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:31:01,454 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 16:31:03,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:03,299 INFO L255 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-11 16:31:03,318 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:31:03,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:31:03,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:31:03,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:31:04,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:31:04,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-10-11 16:31:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1851 proven. 896 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-11 16:31:04,266 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 16:31:05,102 INFO L134 CoverageAnalysis]: Checked inductivity of 3905 backedges. 1851 proven. 896 refuted. 0 times theorem prover too weak. 1158 trivial. 0 not checked. [2024-10-11 16:31:05,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140868116] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 16:31:05,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 16:31:05,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 26 [2024-10-11 16:31:05,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215953542] [2024-10-11 16:31:05,102 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 16:31:05,104 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-11 16:31:05,104 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:05,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-11 16:31:05,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2024-10-11 16:31:05,109 INFO L87 Difference]: Start difference. First operand 3822 states and 5221 transitions. Second operand has 26 states, 26 states have (on average 76.03846153846153) internal successors, (1977), 25 states have internal predecessors, (1977), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:31:07,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:07,416 INFO L93 Difference]: Finished difference Result 6614 states and 9114 transitions. [2024-10-11 16:31:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-11 16:31:07,417 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 76.03846153846153) internal successors, (1977), 25 states have internal predecessors, (1977), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 1157 [2024-10-11 16:31:07,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:07,439 INFO L225 Difference]: With dead ends: 6614 [2024-10-11 16:31:07,439 INFO L226 Difference]: Without dead ends: 4117 [2024-10-11 16:31:07,447 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2353 GetRequests, 2307 SyntacticMatches, 7 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=375, Invalid=1265, Unknown=0, NotChecked=0, Total=1640 [2024-10-11 16:31:07,448 INFO L432 NwaCegarLoop]: 2701 mSDtfsCounter, 4870 mSDsluCounter, 30212 mSDsCounter, 0 mSdLazyCounter, 1964 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4948 SdHoareTripleChecker+Valid, 32913 SdHoareTripleChecker+Invalid, 2062 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 1964 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:07,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4948 Valid, 32913 Invalid, 2062 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [98 Valid, 1964 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-10-11 16:31:07,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2024-10-11 16:31:07,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3825. [2024-10-11 16:31:07,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3825 states, 3768 states have (on average 1.3577494692144374) internal successors, (5116), 3773 states have internal predecessors, (5116), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 16:31:07,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5219 transitions. [2024-10-11 16:31:07,571 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5219 transitions. Word has length 1157 [2024-10-11 16:31:07,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:07,572 INFO L471 AbstractCegarLoop]: Abstraction has 3825 states and 5219 transitions. [2024-10-11 16:31:07,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 76.03846153846153) internal successors, (1977), 25 states have internal predecessors, (1977), 4 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 16:31:07,573 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5219 transitions. [2024-10-11 16:31:07,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1584 [2024-10-11 16:31:07,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:07,594 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:07,629 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-11 16:31:07,795 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 16:31:07,795 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:31:07,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:07,796 INFO L85 PathProgramCache]: Analyzing trace with hash -1119255917, now seen corresponding path program 2 times [2024-10-11 16:31:07,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:07,796 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [386824706] [2024-10-11 16:31:07,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:07,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:09,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:12,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-11 16:31:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-11 16:31:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-11 16:31:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-11 16:31:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:31:13,015 INFO L134 CoverageAnalysis]: Checked inductivity of 6662 backedges. 1320 proven. 1 refuted. 0 times theorem prover too weak. 5341 trivial. 0 not checked. [2024-10-11 16:31:13,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:31:13,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [386824706] [2024-10-11 16:31:13,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [386824706] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 16:31:13,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028527806] [2024-10-11 16:31:13,016 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 16:31:13,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 16:31:13,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:31:13,018 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 16:31:13,019 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 16:31:14,610 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-11 16:31:14,610 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 16:31:14,616 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-11 16:31:14,644 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 16:31:14,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-11 16:31:15,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 16:31:15,169 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 80 treesize of output 58 [2024-10-11 16:31:15,354 INFO L134 CoverageAnalysis]: Checked inductivity of 6662 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6662 trivial. 0 not checked. [2024-10-11 16:31:15,354 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 16:31:15,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028527806] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:31:15,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-11 16:31:15,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2024-10-11 16:31:15,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793868515] [2024-10-11 16:31:15,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:31:15,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:31:15,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:31:15,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:31:15,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-11 16:31:15,358 INFO L87 Difference]: Start difference. First operand 3825 states and 5219 transitions. Second operand has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:31:16,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:31:16,485 INFO L93 Difference]: Finished difference Result 4670 states and 6474 transitions. [2024-10-11 16:31:16,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:31:16,486 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) Word has length 1583 [2024-10-11 16:31:16,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:31:16,506 INFO L225 Difference]: With dead ends: 4670 [2024-10-11 16:31:16,506 INFO L226 Difference]: Without dead ends: 3831 [2024-10-11 16:31:16,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1605 GetRequests, 1584 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-10-11 16:31:16,510 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 389 mSDsluCounter, 8718 mSDsCounter, 0 mSdLazyCounter, 949 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 9948 SdHoareTripleChecker+Invalid, 949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:31:16,510 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 9948 Invalid, 949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 949 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:31:16,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2024-10-11 16:31:16,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3828. [2024-10-11 16:31:16,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3828 states, 3771 states have (on average 1.3574648634314506) internal successors, (5119), 3776 states have internal predecessors, (5119), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (51), 48 states have call predecessors, (51), 51 states have call successors, (51) [2024-10-11 16:31:16,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5222 transitions. [2024-10-11 16:31:16,634 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5222 transitions. Word has length 1583 [2024-10-11 16:31:16,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:31:16,636 INFO L471 AbstractCegarLoop]: Abstraction has 3828 states and 5222 transitions. [2024-10-11 16:31:16,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 24.0) internal successors, (240), 10 states have internal predecessors, (240), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 1 states have call predecessors, (4), 1 states have call successors, (4) [2024-10-11 16:31:16,637 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5222 transitions. [2024-10-11 16:31:16,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1584 [2024-10-11 16:31:16,655 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:31:16,656 INFO L215 NwaCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:31:16,676 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 16:31:16,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-11 16:31:16,857 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 16:31:16,857 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:31:16,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1541782389, now seen corresponding path program 1 times [2024-10-11 16:31:16,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:31:16,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074312309] [2024-10-11 16:31:16,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:31:16,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:31:17,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat