./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-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:12:45,947 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:12:46,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:12:46,032 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:12:46,032 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:12:46,064 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:12:46,065 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:12:46,065 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:12:46,066 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:12:46,066 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:12:46,067 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:12:46,067 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:12:46,068 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:12:46,068 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:12:46,068 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:12:46,069 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:12:46,069 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:12:46,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:12:46,070 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:12:46,070 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:12:46,070 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:12:46,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:12:46,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:12:46,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:12:46,073 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:12:46,074 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:12:46,074 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:12:46,074 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:12:46,074 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:12:46,075 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:12:46,075 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:12:46,076 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:12:46,076 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:12:46,076 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:12:46,077 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:12:46,077 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:12:46,077 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:12:46,077 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:12:46,077 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:12:46,078 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:12:46,078 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:12:46,078 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:12:46,078 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 3db5e6ee1090a5741e563a010c3676d5357df7fec89fabe5a888b2d307357a0e [2024-10-13 09:12:46,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:12:46,350 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:12:46,357 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:12:46,359 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:12:46,359 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:12:46,361 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2024-10-13 09:12:47,796 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:12:48,121 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:12:48,121 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_JEN_test10-2.i [2024-10-13 09:12:48,154 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9c55919/2de85be3281540a88624b633aafd2cbf/FLAG25852fc94 [2024-10-13 09:12:48,173 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8d9c55919/2de85be3281540a88624b633aafd2cbf [2024-10-13 09:12:48,176 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:12:48,178 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:12:48,181 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:12:48,181 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:12:48,187 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:12:48,188 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:48" (1/1) ... [2024-10-13 09:12:48,188 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@536b8e60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:48, skipping insertion in model container [2024-10-13 09:12:48,189 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:48" (1/1) ... [2024-10-13 09:12:48,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:12:48,700 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-2.i[33022,33035] [2024-10-13 09:12:48,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:12:48,953 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:12:48,994 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-2.i[33022,33035] [2024-10-13 09:12:49,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:12:49,156 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:12:49,157 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49 WrapperNode [2024-10-13 09:12:49,157 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:12:49,158 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:12:49,158 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:12:49,159 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:12:49,166 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,239 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,387 INFO L138 Inliner]: procedures = 177, calls = 557, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 3576 [2024-10-13 09:12:49,388 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:12:49,389 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:12:49,389 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:12:49,389 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:12:49,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,427 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,615 INFO L175 MemorySlicer]: Split 528 memory accesses to 3 slices as follows [2, 420, 106]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 94 writes are split as follows [0, 90, 4]. [2024-10-13 09:12:49,616 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,616 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,675 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,709 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,718 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,734 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,755 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:12:49,757 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:12:49,757 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:12:49,758 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:12:49,758 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (1/1) ... [2024-10-13 09:12:49,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:12:49,775 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:12:49,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:12:49,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:12:49,833 INFO L130 BoogieDeclarations]: Found specification of procedure test_int_int [2024-10-13 09:12:49,834 INFO L138 BoogieDeclarations]: Found implementation of procedure test_int_int [2024-10-13 09:12:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:12:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:12:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:12:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 09:12:49,834 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 09:12:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:12:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:12:49,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:12:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#0 [2024-10-13 09:12:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#1 [2024-10-13 09:12:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset#2 [2024-10-13 09:12:49,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#0 [2024-10-13 09:12:49,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#1 [2024-10-13 09:12:49,835 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset#2 [2024-10-13 09:12:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:12:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:12:49,835 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:12:49,836 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:12:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:12:49,837 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:12:49,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:12:50,105 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:12:50,111 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:12:53,024 INFO L? ?]: Removed 807 outVars from TransFormulas that were not future-live. [2024-10-13 09:12:53,024 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:12:53,096 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:12:53,096 INFO L314 CfgBuilder]: Removed 160 assume(true) statements. [2024-10-13 09:12:53,097 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:53 BoogieIcfgContainer [2024-10-13 09:12:53,097 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:12:53,099 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:12:53,099 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:12:53,105 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:12:53,105 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:12:48" (1/3) ... [2024-10-13 09:12:53,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b09767d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:53, skipping insertion in model container [2024-10-13 09:12:53,106 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:49" (2/3) ... [2024-10-13 09:12:53,106 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b09767d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:53, skipping insertion in model container [2024-10-13 09:12:53,107 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:53" (3/3) ... [2024-10-13 09:12:53,109 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_JEN_test10-2.i [2024-10-13 09:12:53,125 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:12:53,125 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 09:12:53,232 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:12:53,239 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;@5299828d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:12:53,240 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 09:12:53,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 1059 states, 1040 states have (on average 1.6317307692307692) internal successors, (1697), 1045 states have internal predecessors, (1697), 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-13 09:12:53,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 09:12:53,254 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:53,255 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:12:53,255 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:53,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:53,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1592715190, now seen corresponding path program 1 times [2024-10-13 09:12:53,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:53,267 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954959864] [2024-10-13 09:12:53,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:53,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:53,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:53,443 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-13 09:12:53,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:53,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954959864] [2024-10-13 09:12:53,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954959864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:53,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:53,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:12:53,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800884816] [2024-10-13 09:12:53,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:53,452 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:12:53,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:53,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:12:53,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:12:53,498 INFO L87 Difference]: Start difference. First operand has 1059 states, 1040 states have (on average 1.6317307692307692) internal successors, (1697), 1045 states have internal predecessors, (1697), 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-13 09:12:53,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:53,625 INFO L93 Difference]: Finished difference Result 2117 states and 3457 transitions. [2024-10-13 09:12:53,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:12:53,627 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-13 09:12:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:53,645 INFO L225 Difference]: With dead ends: 2117 [2024-10-13 09:12:53,645 INFO L226 Difference]: Without dead ends: 1023 [2024-10-13 09:12:53,651 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-13 09:12:53,654 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:53,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1552 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:12:53,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2024-10-13 09:12:53,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 1023. [2024-10-13 09:12:53,737 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-13 09:12:53,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1023 states to 1023 states and 1508 transitions. [2024-10-13 09:12:53,744 INFO L78 Accepts]: Start accepts. Automaton has 1023 states and 1508 transitions. Word has length 12 [2024-10-13 09:12:53,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:53,745 INFO L471 AbstractCegarLoop]: Abstraction has 1023 states and 1508 transitions. [2024-10-13 09:12:53,745 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-13 09:12:53,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1023 states and 1508 transitions. [2024-10-13 09:12:53,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 09:12:53,751 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:53,751 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-13 09:12:53,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:12:53,752 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:53,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:53,753 INFO L85 PathProgramCache]: Analyzing trace with hash -323389402, now seen corresponding path program 1 times [2024-10-13 09:12:53,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:53,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169777478] [2024-10-13 09:12:53,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:53,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:53,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:54,243 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-13 09:12:54,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:54,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169777478] [2024-10-13 09:12:54,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169777478] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:54,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:54,244 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:12:54,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130468582] [2024-10-13 09:12:54,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:54,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:12:54,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:54,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:12:54,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:12:54,251 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-13 09:12:54,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:54,527 INFO L93 Difference]: Finished difference Result 2042 states and 3012 transitions. [2024-10-13 09:12:54,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:12:54,528 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-13 09:12:54,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:54,536 INFO L225 Difference]: With dead ends: 2042 [2024-10-13 09:12:54,537 INFO L226 Difference]: Without dead ends: 1409 [2024-10-13 09:12:54,539 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-13 09:12:54,541 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.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:54,542 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.2s Time] [2024-10-13 09:12:54,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-13 09:12:54,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1025. [2024-10-13 09:12:54,578 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-13 09:12:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1025 states to 1025 states and 1510 transitions. [2024-10-13 09:12:54,583 INFO L78 Accepts]: Start accepts. Automaton has 1025 states and 1510 transitions. Word has length 67 [2024-10-13 09:12:54,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:54,583 INFO L471 AbstractCegarLoop]: Abstraction has 1025 states and 1510 transitions. [2024-10-13 09:12:54,584 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-13 09:12:54,584 INFO L276 IsEmpty]: Start isEmpty. Operand 1025 states and 1510 transitions. [2024-10-13 09:12:54,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-13 09:12:54,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:54,593 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-13 09:12:54,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:12:54,593 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:54,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash -251082163, now seen corresponding path program 1 times [2024-10-13 09:12:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:54,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151547534] [2024-10-13 09:12:54,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:54,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:54,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:55,158 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-13 09:12:55,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:55,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151547534] [2024-10-13 09:12:55,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151547534] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:55,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:55,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:12:55,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590448202] [2024-10-13 09:12:55,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:55,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:12:55,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:55,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:12:55,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:12:55,164 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-13 09:12:55,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:55,378 INFO L93 Difference]: Finished difference Result 2431 states and 3576 transitions. [2024-10-13 09:12:55,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:12:55,379 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-13 09:12:55,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:55,386 INFO L225 Difference]: With dead ends: 2431 [2024-10-13 09:12:55,386 INFO L226 Difference]: Without dead ends: 1409 [2024-10-13 09:12:55,388 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-13 09:12:55,389 INFO L432 NwaCegarLoop]: 1552 mSDtfsCounter, 544 mSDsluCounter, 2990 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 550 SdHoareTripleChecker+Valid, 4542 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-13 09:12:55,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [550 Valid, 4542 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:12:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1409 states. [2024-10-13 09:12:55,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1409 to 1028. [2024-10-13 09:12:55,418 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-13 09:12:55,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1028 states to 1028 states and 1513 transitions. [2024-10-13 09:12:55,424 INFO L78 Accepts]: Start accepts. Automaton has 1028 states and 1513 transitions. Word has length 144 [2024-10-13 09:12:55,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:55,425 INFO L471 AbstractCegarLoop]: Abstraction has 1028 states and 1513 transitions. [2024-10-13 09:12:55,425 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-13 09:12:55,425 INFO L276 IsEmpty]: Start isEmpty. Operand 1028 states and 1513 transitions. [2024-10-13 09:12:55,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-13 09:12:55,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:55,430 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-13 09:12:55,430 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:12:55,430 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:55,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:55,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1877923075, now seen corresponding path program 1 times [2024-10-13 09:12:55,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:55,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9425319] [2024-10-13 09:12:55,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:55,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:55,853 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-13 09:12:55,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:55,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9425319] [2024-10-13 09:12:55,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9425319] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:55,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:55,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:12:55,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399911588] [2024-10-13 09:12:55,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:55,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:12:55,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:55,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:12:55,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:12:55,861 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-13 09:12:55,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:55,991 INFO L93 Difference]: Finished difference Result 2008 states and 2954 transitions. [2024-10-13 09:12:55,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:12:55,992 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-13 09:12:55,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:55,996 INFO L225 Difference]: With dead ends: 2008 [2024-10-13 09:12:55,997 INFO L226 Difference]: Without dead ends: 986 [2024-10-13 09:12:55,999 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-13 09:12:56,001 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-13 09:12:56,002 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-13 09:12:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 986 states. [2024-10-13 09:12:56,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 986 to 986. [2024-10-13 09:12:56,022 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-13 09:12:56,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 986 states to 986 states and 1436 transitions. [2024-10-13 09:12:56,029 INFO L78 Accepts]: Start accepts. Automaton has 986 states and 1436 transitions. Word has length 215 [2024-10-13 09:12:56,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:56,029 INFO L471 AbstractCegarLoop]: Abstraction has 986 states and 1436 transitions. [2024-10-13 09:12:56,030 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-13 09:12:56,030 INFO L276 IsEmpty]: Start isEmpty. Operand 986 states and 1436 transitions. [2024-10-13 09:12:56,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2024-10-13 09:12:56,035 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:56,035 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-13 09:12:56,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:12:56,036 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:56,036 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:56,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1165810441, now seen corresponding path program 1 times [2024-10-13 09:12:56,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:56,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581618252] [2024-10-13 09:12:56,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:56,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:56,280 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-13 09:12:56,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:56,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [581618252] [2024-10-13 09:12:56,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [581618252] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:56,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:56,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:12:56,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620900890] [2024-10-13 09:12:56,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:56,284 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 09:12:56,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:56,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 09:12:56,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 09:12:56,287 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-13 09:12:56,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:56,385 INFO L93 Difference]: Finished difference Result 2497 states and 3649 transitions. [2024-10-13 09:12:56,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 09:12:56,386 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-13 09:12:56,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:56,392 INFO L225 Difference]: With dead ends: 2497 [2024-10-13 09:12:56,393 INFO L226 Difference]: Without dead ends: 1517 [2024-10-13 09:12:56,395 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-13 09:12:56,396 INFO L432 NwaCegarLoop]: 1420 mSDtfsCounter, 716 mSDsluCounter, 1403 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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-13 09:12:56,397 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-13 09:12:56,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1517 states. [2024-10-13 09:12:56,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1517 to 1358. [2024-10-13 09:12:56,434 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-13 09:12:56,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1358 states to 1358 states and 1982 transitions. [2024-10-13 09:12:56,440 INFO L78 Accepts]: Start accepts. Automaton has 1358 states and 1982 transitions. Word has length 215 [2024-10-13 09:12:56,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:56,441 INFO L471 AbstractCegarLoop]: Abstraction has 1358 states and 1982 transitions. [2024-10-13 09:12:56,441 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-13 09:12:56,441 INFO L276 IsEmpty]: Start isEmpty. Operand 1358 states and 1982 transitions. [2024-10-13 09:12:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 09:12:56,445 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:56,445 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-13 09:12:56,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:12:56,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:56,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:56,446 INFO L85 PathProgramCache]: Analyzing trace with hash 472858846, now seen corresponding path program 1 times [2024-10-13 09:12:56,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:56,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657789294] [2024-10-13 09:12:56,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:56,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:12:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:12:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:56,934 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-13 09:12:56,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:56,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657789294] [2024-10-13 09:12:56,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657789294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:56,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:56,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:12:56,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953186109] [2024-10-13 09:12:56,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:56,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:12:56,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:56,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:12:56,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:12:56,938 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-13 09:12:57,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:57,437 INFO L93 Difference]: Finished difference Result 2585 states and 3784 transitions. [2024-10-13 09:12:57,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:12:57,438 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-13 09:12:57,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:57,445 INFO L225 Difference]: With dead ends: 2585 [2024-10-13 09:12:57,446 INFO L226 Difference]: Without dead ends: 1318 [2024-10-13 09:12:57,449 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-13 09:12:57,451 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-13 09:12:57,451 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-13 09:12:57,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-13 09:12:57,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-13 09:12:57,489 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-13 09:12:57,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1905 transitions. [2024-10-13 09:12:57,496 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1905 transitions. Word has length 228 [2024-10-13 09:12:57,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:57,498 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1905 transitions. [2024-10-13 09:12:57,498 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-13 09:12:57,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1905 transitions. [2024-10-13 09:12:57,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 09:12:57,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:57,501 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-13 09:12:57,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:12:57,502 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:57,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:57,502 INFO L85 PathProgramCache]: Analyzing trace with hash 97051882, now seen corresponding path program 1 times [2024-10-13 09:12:57,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:57,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390993599] [2024-10-13 09:12:57,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:57,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:12:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:57,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:12:57,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:57,890 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-13 09:12:57,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:57,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390993599] [2024-10-13 09:12:57,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390993599] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:57,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:57,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:12:57,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979307047] [2024-10-13 09:12:57,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:57,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:12:57,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:57,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:12:57,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:12:57,894 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-13 09:12:58,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:58,462 INFO L93 Difference]: Finished difference Result 2543 states and 3696 transitions. [2024-10-13 09:12:58,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:12:58,463 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-13 09:12:58,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:58,469 INFO L225 Difference]: With dead ends: 2543 [2024-10-13 09:12:58,470 INFO L226 Difference]: Without dead ends: 1318 [2024-10-13 09:12:58,472 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-13 09:12:58,473 INFO L432 NwaCegarLoop]: 1310 mSDtfsCounter, 22 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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-13 09:12:58,473 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-13 09:12:58,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2024-10-13 09:12:58,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1316. [2024-10-13 09:12:58,499 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-13 09:12:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1902 transitions. [2024-10-13 09:12:58,505 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1902 transitions. Word has length 228 [2024-10-13 09:12:58,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:58,505 INFO L471 AbstractCegarLoop]: Abstraction has 1316 states and 1902 transitions. [2024-10-13 09:12:58,506 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-13 09:12:58,506 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1902 transitions. [2024-10-13 09:12:58,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2024-10-13 09:12:58,509 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:58,509 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-13 09:12:58,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:12:58,509 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:58,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:58,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1630093080, now seen corresponding path program 1 times [2024-10-13 09:12:58,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:58,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876041486] [2024-10-13 09:12:58,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:58,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:58,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:58,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:12:58,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:58,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:12:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:58,848 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-13 09:12:58,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:58,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876041486] [2024-10-13 09:12:58,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876041486] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:58,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:58,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:12:58,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92649430] [2024-10-13 09:12:58,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:58,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:12:58,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:58,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:12:58,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:12:58,852 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-13 09:12:59,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:12:59,304 INFO L93 Difference]: Finished difference Result 3114 states and 4524 transitions. [2024-10-13 09:12:59,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:12:59,305 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-13 09:12:59,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:12:59,314 INFO L225 Difference]: With dead ends: 3114 [2024-10-13 09:12:59,315 INFO L226 Difference]: Without dead ends: 1889 [2024-10-13 09:12:59,317 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-13 09:12:59,318 INFO L432 NwaCegarLoop]: 1314 mSDtfsCounter, 618 mSDsluCounter, 2482 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 626 SdHoareTripleChecker+Valid, 3796 SdHoareTripleChecker+Invalid, 210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:12:59,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [626 Valid, 3796 Invalid, 210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:12:59,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1889 states. [2024-10-13 09:12:59,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1889 to 1882. [2024-10-13 09:12:59,363 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-13 09:12:59,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1882 states to 1882 states and 2726 transitions. [2024-10-13 09:12:59,371 INFO L78 Accepts]: Start accepts. Automaton has 1882 states and 2726 transitions. Word has length 228 [2024-10-13 09:12:59,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:12:59,372 INFO L471 AbstractCegarLoop]: Abstraction has 1882 states and 2726 transitions. [2024-10-13 09:12:59,372 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-13 09:12:59,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1882 states and 2726 transitions. [2024-10-13 09:12:59,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2024-10-13 09:12:59,375 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:12:59,376 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-13 09:12:59,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:12:59,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:12:59,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:12:59,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2141622998, now seen corresponding path program 1 times [2024-10-13 09:12:59,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:12:59,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424899384] [2024-10-13 09:12:59,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:12:59,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:12:59,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:59,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:12:59,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:59,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:12:59,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:59,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:12:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:59,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:12:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:12:59,834 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-13 09:12:59,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:12:59,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424899384] [2024-10-13 09:12:59,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424899384] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:12:59,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:12:59,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:12:59,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177748144] [2024-10-13 09:12:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:12:59,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:12:59,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:12:59,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:12:59,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:12:59,838 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-13 09:13:00,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:00,886 INFO L93 Difference]: Finished difference Result 4067 states and 5941 transitions. [2024-10-13 09:13:00,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:13:00,887 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-13 09:13:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:00,899 INFO L225 Difference]: With dead ends: 4067 [2024-10-13 09:13:00,899 INFO L226 Difference]: Without dead ends: 2422 [2024-10-13 09:13:00,904 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-13 09:13:00,904 INFO L432 NwaCegarLoop]: 1354 mSDtfsCounter, 3558 mSDsluCounter, 2766 mSDsCounter, 0 mSdLazyCounter, 405 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3569 SdHoareTripleChecker+Valid, 4120 SdHoareTripleChecker+Invalid, 444 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 405 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:00,905 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3569 Valid, 4120 Invalid, 444 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 405 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-13 09:13:00,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2422 states. [2024-10-13 09:13:00,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2422 to 1453. [2024-10-13 09:13:00,962 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-13 09:13:00,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1453 states to 1453 states and 2081 transitions. [2024-10-13 09:13:00,967 INFO L78 Accepts]: Start accepts. Automaton has 1453 states and 2081 transitions. Word has length 241 [2024-10-13 09:13:00,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:00,968 INFO L471 AbstractCegarLoop]: Abstraction has 1453 states and 2081 transitions. [2024-10-13 09:13:00,969 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-13 09:13:00,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1453 states and 2081 transitions. [2024-10-13 09:13:00,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-13 09:13:00,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:00,973 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-13 09:13:00,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:13:00,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:00,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash -379152962, now seen corresponding path program 1 times [2024-10-13 09:13:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:00,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371882576] [2024-10-13 09:13:00,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:00,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:01,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:01,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:01,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:01,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:01,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:01,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:01,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:01,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:01,474 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-13 09:13:01,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:01,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371882576] [2024-10-13 09:13:01,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371882576] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:13:01,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:13:01,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:13:01,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270768637] [2024-10-13 09:13:01,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:13:01,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:13:01,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:01,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:13:01,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:13:01,477 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-13 09:13:01,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:01,993 INFO L93 Difference]: Finished difference Result 2329 states and 3389 transitions. [2024-10-13 09:13:01,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:13:01,994 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-13 09:13:01,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:02,003 INFO L225 Difference]: With dead ends: 2329 [2024-10-13 09:13:02,003 INFO L226 Difference]: Without dead ends: 1413 [2024-10-13 09:13:02,005 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-13 09:13:02,006 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.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:02,006 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.5s Time] [2024-10-13 09:13:02,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-13 09:13:02,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1411. [2024-10-13 09:13:02,047 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-13 09:13:02,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2004 transitions. [2024-10-13 09:13:02,051 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2004 transitions. Word has length 251 [2024-10-13 09:13:02,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:02,052 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2004 transitions. [2024-10-13 09:13:02,052 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-13 09:13:02,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2004 transitions. [2024-10-13 09:13:02,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-13 09:13:02,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:02,056 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-13 09:13:02,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:13:02,056 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:02,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:02,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1157485456, now seen corresponding path program 1 times [2024-10-13 09:13:02,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:02,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588825866] [2024-10-13 09:13:02,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:02,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:02,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:02,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:02,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:02,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:02,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:02,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:02,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:02,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:02,425 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-13 09:13:02,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:02,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588825866] [2024-10-13 09:13:02,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588825866] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:13:02,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:13:02,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:13:02,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278398597] [2024-10-13 09:13:02,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:13:02,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:13:02,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:02,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:13:02,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:13:02,429 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-13 09:13:02,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:02,884 INFO L93 Difference]: Finished difference Result 2262 states and 3272 transitions. [2024-10-13 09:13:02,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:13:02,884 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-13 09:13:02,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:02,891 INFO L225 Difference]: With dead ends: 2262 [2024-10-13 09:13:02,891 INFO L226 Difference]: Without dead ends: 1413 [2024-10-13 09:13:02,893 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-13 09:13:02,894 INFO L432 NwaCegarLoop]: 1225 mSDtfsCounter, 22 mSDsluCounter, 2299 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:02,895 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.4s Time] [2024-10-13 09:13:02,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1413 states. [2024-10-13 09:13:02,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1413 to 1411. [2024-10-13 09:13:02,939 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-13 09:13:02,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1411 states to 1411 states and 2001 transitions. [2024-10-13 09:13:02,944 INFO L78 Accepts]: Start accepts. Automaton has 1411 states and 2001 transitions. Word has length 251 [2024-10-13 09:13:02,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:02,945 INFO L471 AbstractCegarLoop]: Abstraction has 1411 states and 2001 transitions. [2024-10-13 09:13:02,945 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-13 09:13:02,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1411 states and 2001 transitions. [2024-10-13 09:13:02,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2024-10-13 09:13:02,948 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:02,948 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-13 09:13:02,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:13:02,949 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:02,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:02,949 INFO L85 PathProgramCache]: Analyzing trace with hash 1679400052, now seen corresponding path program 1 times [2024-10-13 09:13:02,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:02,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698153800] [2024-10-13 09:13:02,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:02,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:03,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:04,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:04,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:04,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:04,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:04,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:04,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:04,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:04,042 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-13 09:13:04,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698153800] [2024-10-13 09:13:04,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698153800] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:13:04,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039563345] [2024-10-13 09:13:04,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:04,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:13:04,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:13:04,045 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:13:04,047 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-13 09:13:04,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:04,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 09:13:04,748 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:13:04,781 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-13 09:13:05,186 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-13 09:13:05,206 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-13 09:13:05,206 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:13:05,521 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-13 09:13:05,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039563345] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:13:05,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:13:05,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5, 5] total 13 [2024-10-13 09:13:05,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481573753] [2024-10-13 09:13:05,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:13:05,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 09:13:05,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:05,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 09:13:05,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-13 09:13:05,525 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-13 09:13:06,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:06,745 INFO L93 Difference]: Finished difference Result 3237 states and 4580 transitions. [2024-10-13 09:13:06,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 09:13:06,746 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-13 09:13:06,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:06,755 INFO L225 Difference]: With dead ends: 3237 [2024-10-13 09:13:06,755 INFO L226 Difference]: Without dead ends: 2359 [2024-10-13 09:13:06,758 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-13 09:13:06,758 INFO L432 NwaCegarLoop]: 1544 mSDtfsCounter, 3077 mSDsluCounter, 9093 mSDsCounter, 0 mSdLazyCounter, 872 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3108 SdHoareTripleChecker+Valid, 10637 SdHoareTripleChecker+Invalid, 916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:06,758 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3108 Valid, 10637 Invalid, 916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 872 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 09:13:06,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-10-13 09:13:06,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2064. [2024-10-13 09:13:06,818 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-13 09:13:06,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2872 transitions. [2024-10-13 09:13:06,824 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2872 transitions. Word has length 251 [2024-10-13 09:13:06,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:06,824 INFO L471 AbstractCegarLoop]: Abstraction has 2064 states and 2872 transitions. [2024-10-13 09:13:06,825 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-13 09:13:06,825 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2872 transitions. [2024-10-13 09:13:06,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2024-10-13 09:13:06,833 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:06,834 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-13 09:13:06,856 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 09:13:07,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-10-13 09:13:07,040 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:07,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:07,041 INFO L85 PathProgramCache]: Analyzing trace with hash 672060733, now seen corresponding path program 1 times [2024-10-13 09:13:07,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:07,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947813030] [2024-10-13 09:13:07,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:07,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:07,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:09,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:09,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:09,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:09,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:09,308 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-13 09:13:09,308 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:09,308 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947813030] [2024-10-13 09:13:09,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [947813030] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:13:09,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [728949193] [2024-10-13 09:13:09,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:09,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:13:09,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:13:09,311 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:13:09,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-13 09:13:10,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:10,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 2403 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 09:13:10,346 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:13:10,355 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-13 09:13:10,694 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-13 09:13:10,723 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-13 09:13:10,723 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:13:11,019 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-13 09:13:11,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [728949193] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:13:11,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:13:11,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 14 [2024-10-13 09:13:11,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602356825] [2024-10-13 09:13:11,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:13:11,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 09:13:11,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:11,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 09:13:11,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-10-13 09:13:11,024 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-13 09:13:12,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:12,420 INFO L93 Difference]: Finished difference Result 3977 states and 5565 transitions. [2024-10-13 09:13:12,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 09:13:12,421 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-13 09:13:12,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:12,431 INFO L225 Difference]: With dead ends: 3977 [2024-10-13 09:13:12,432 INFO L226 Difference]: Without dead ends: 2359 [2024-10-13 09:13:12,435 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-13 09:13:12,436 INFO L432 NwaCegarLoop]: 1570 mSDtfsCounter, 1578 mSDsluCounter, 11515 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1608 SdHoareTripleChecker+Valid, 13085 SdHoareTripleChecker+Invalid, 989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:12,436 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1608 Valid, 13085 Invalid, 989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-10-13 09:13:12,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2359 states. [2024-10-13 09:13:12,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2359 to 2067. [2024-10-13 09:13:12,503 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-13 09:13:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2067 states to 2067 states and 2873 transitions. [2024-10-13 09:13:12,512 INFO L78 Accepts]: Start accepts. Automaton has 2067 states and 2873 transitions. Word has length 482 [2024-10-13 09:13:12,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:12,513 INFO L471 AbstractCegarLoop]: Abstraction has 2067 states and 2873 transitions. [2024-10-13 09:13:12,515 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-13 09:13:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 2067 states and 2873 transitions. [2024-10-13 09:13:12,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2024-10-13 09:13:12,536 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:12,536 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-13 09:13:12,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 09:13:12,740 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2024-10-13 09:13:12,741 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:12,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:12,742 INFO L85 PathProgramCache]: Analyzing trace with hash -1995144891, now seen corresponding path program 1 times [2024-10-13 09:13:12,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:12,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [54650862] [2024-10-13 09:13:12,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:12,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:13,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:18,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:18,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:18,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:18,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:18,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:18,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:18,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:18,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:18,410 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-13 09:13:18,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:18,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [54650862] [2024-10-13 09:13:18,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [54650862] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:13:18,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [792954761] [2024-10-13 09:13:18,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:18,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:13:18,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:13:18,413 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:13:18,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-13 09:13:19,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:19,703 INFO L255 TraceCheckSpWp]: Trace formula consists of 3384 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 09:13:19,717 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:13:19,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 09:13:20,021 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-13 09:13:20,217 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-13 09:13:20,405 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-13 09:13:20,591 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-13 09:13:20,613 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-13 09:13:20,614 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:13:21,391 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-13 09:13:21,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [792954761] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:13:21,392 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:13:21,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 8, 8] total 25 [2024-10-13 09:13:21,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179005687] [2024-10-13 09:13:21,392 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:13:21,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-13 09:13:21,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:21,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-13 09:13:21,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=416, Unknown=0, NotChecked=0, Total=600 [2024-10-13 09:13:21,399 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-13 09:13:23,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:23,445 INFO L93 Difference]: Finished difference Result 4995 states and 6956 transitions. [2024-10-13 09:13:23,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 09:13:23,446 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-13 09:13:23,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:23,470 INFO L225 Difference]: With dead ends: 4995 [2024-10-13 09:13:23,471 INFO L226 Difference]: Without dead ends: 4117 [2024-10-13 09:13:23,475 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-13 09:13:23,476 INFO L432 NwaCegarLoop]: 2678 mSDtfsCounter, 7317 mSDsluCounter, 22928 mSDsCounter, 0 mSdLazyCounter, 1386 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7396 SdHoareTripleChecker+Valid, 25606 SdHoareTripleChecker+Invalid, 1493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:23,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7396 Valid, 25606 Invalid, 1493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1386 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-10-13 09:13:23,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2024-10-13 09:13:23,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3822. [2024-10-13 09:13:23,575 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-13 09:13:23,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3822 states to 3822 states and 5221 transitions. [2024-10-13 09:13:23,586 INFO L78 Accepts]: Start accepts. Automaton has 3822 states and 5221 transitions. Word has length 695 [2024-10-13 09:13:23,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:23,587 INFO L471 AbstractCegarLoop]: Abstraction has 3822 states and 5221 transitions. [2024-10-13 09:13:23,588 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-13 09:13:23,588 INFO L276 IsEmpty]: Start isEmpty. Operand 3822 states and 5221 transitions. [2024-10-13 09:13:23,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1158 [2024-10-13 09:13:23,602 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:23,602 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-13 09:13:23,630 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-10-13 09:13:23,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:13:23,803 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:23,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:23,804 INFO L85 PathProgramCache]: Analyzing trace with hash 548831077, now seen corresponding path program 1 times [2024-10-13 09:13:23,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:23,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336810027] [2024-10-13 09:13:23,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:23,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:31,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:31,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:31,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:31,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:31,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:31,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:31,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:31,223 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-13 09:13:31,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:31,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336810027] [2024-10-13 09:13:31,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336810027] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:13:31,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [724364020] [2024-10-13 09:13:31,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:31,224 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:13:31,224 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:13:31,226 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:13:31,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 09:13:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:33,018 INFO L255 TraceCheckSpWp]: Trace formula consists of 5664 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-10-13 09:13:33,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:13:33,042 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-13 09:13:33,316 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-13 09:13:33,501 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-13 09:13:33,707 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-13 09:13:33,900 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-13 09:13:33,928 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-13 09:13:33,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 09:13:34,686 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-13 09:13:34,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [724364020] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 09:13:34,686 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 09:13:34,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 8, 8] total 26 [2024-10-13 09:13:34,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818543062] [2024-10-13 09:13:34,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 09:13:34,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-13 09:13:34,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:34,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-13 09:13:34,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=462, Unknown=0, NotChecked=0, Total=650 [2024-10-13 09:13:34,692 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-13 09:13:36,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:36,659 INFO L93 Difference]: Finished difference Result 6614 states and 9114 transitions. [2024-10-13 09:13:36,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2024-10-13 09:13:36,661 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-13 09:13:36,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:36,686 INFO L225 Difference]: With dead ends: 6614 [2024-10-13 09:13:36,687 INFO L226 Difference]: Without dead ends: 4117 [2024-10-13 09:13:36,694 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-13 09:13:36,695 INFO L432 NwaCegarLoop]: 2701 mSDtfsCounter, 5883 mSDsluCounter, 20369 mSDsCounter, 0 mSdLazyCounter, 1230 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5961 SdHoareTripleChecker+Valid, 23070 SdHoareTripleChecker+Invalid, 1327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 1230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:36,695 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5961 Valid, 23070 Invalid, 1327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 1230 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-13 09:13:36,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4117 states. [2024-10-13 09:13:36,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4117 to 3825. [2024-10-13 09:13:36,803 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-13 09:13:36,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3825 states to 3825 states and 5219 transitions. [2024-10-13 09:13:36,813 INFO L78 Accepts]: Start accepts. Automaton has 3825 states and 5219 transitions. Word has length 1157 [2024-10-13 09:13:36,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:36,815 INFO L471 AbstractCegarLoop]: Abstraction has 3825 states and 5219 transitions. [2024-10-13 09:13:36,816 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-13 09:13:36,816 INFO L276 IsEmpty]: Start isEmpty. Operand 3825 states and 5219 transitions. [2024-10-13 09:13:36,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1584 [2024-10-13 09:13:36,835 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:36,836 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-13 09:13:36,870 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-13 09:13:37,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 09:13:37,037 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:37,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:37,038 INFO L85 PathProgramCache]: Analyzing trace with hash -100264857, now seen corresponding path program 2 times [2024-10-13 09:13:37,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:37,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559490046] [2024-10-13 09:13:37,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:37,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:38,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:41,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:41,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:41,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:41,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:41,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:41,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:41,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:41,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:41,958 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-13 09:13:41,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559490046] [2024-10-13 09:13:41,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559490046] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 09:13:41,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799632683] [2024-10-13 09:13:41,959 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-13 09:13:41,959 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 09:13:41,960 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:13:41,961 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 09:13:41,963 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 09:13:43,379 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-10-13 09:13:43,380 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-13 09:13:43,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-13 09:13:43,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 09:13:43,453 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-13 09:13:43,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 09:13:43,815 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-13 09:13:44,038 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-13 09:13:44,039 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 09:13:44,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799632683] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:13:44,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-13 09:13:44,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [8] total 16 [2024-10-13 09:13:44,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379514196] [2024-10-13 09:13:44,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:13:44,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:13:44,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:44,043 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:13:44,043 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2024-10-13 09:13:44,043 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-13 09:13:44,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:44,945 INFO L93 Difference]: Finished difference Result 4670 states and 6474 transitions. [2024-10-13 09:13:44,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:13:44,945 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-13 09:13:44,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:44,955 INFO L225 Difference]: With dead ends: 4670 [2024-10-13 09:13:44,956 INFO L226 Difference]: Without dead ends: 3831 [2024-10-13 09:13:44,958 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1605 GetRequests, 1584 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2024-10-13 09:13:44,959 INFO L432 NwaCegarLoop]: 1230 mSDtfsCounter, 389 mSDsluCounter, 7622 mSDsCounter, 0 mSdLazyCounter, 810 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 8852 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 810 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:44,959 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 8852 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 810 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 09:13:44,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3831 states. [2024-10-13 09:13:45,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3831 to 3828. [2024-10-13 09:13:45,049 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-13 09:13:45,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3828 states to 3828 states and 5222 transitions. [2024-10-13 09:13:45,057 INFO L78 Accepts]: Start accepts. Automaton has 3828 states and 5222 transitions. Word has length 1583 [2024-10-13 09:13:45,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:45,060 INFO L471 AbstractCegarLoop]: Abstraction has 3828 states and 5222 transitions. [2024-10-13 09:13:45,060 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-13 09:13:45,060 INFO L276 IsEmpty]: Start isEmpty. Operand 3828 states and 5222 transitions. [2024-10-13 09:13:45,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1584 [2024-10-13 09:13:45,081 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:45,081 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-13 09:13:45,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-13 09:13:45,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-10-13 09:13:45,283 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:45,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:45,284 INFO L85 PathProgramCache]: Analyzing trace with hash -522791329, now seen corresponding path program 1 times [2024-10-13 09:13:45,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:45,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721048492] [2024-10-13 09:13:45,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:45,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:46,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-13 09:13:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-10-13 09:13:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-10-13 09:13:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:47,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-10-13 09:13:47,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:13:47,838 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-13 09:13:47,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:13:47,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721048492] [2024-10-13 09:13:47,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721048492] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:13:47,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:13:47,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 09:13:47,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158514040] [2024-10-13 09:13:47,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:13:47,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 09:13:47,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:13:47,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 09:13:47,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:13:47,841 INFO L87 Difference]: Start difference. First operand 3828 states and 5222 transitions. Second operand has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 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-13 09:13:48,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:13:48,232 INFO L93 Difference]: Finished difference Result 4674 states and 6519 transitions. [2024-10-13 09:13:48,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:13:48,232 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 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-13 09:13:48,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:13:48,243 INFO L225 Difference]: With dead ends: 4674 [2024-10-13 09:13:48,243 INFO L226 Difference]: Without dead ends: 3823 [2024-10-13 09:13:48,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 9 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-13 09:13:48,247 INFO L432 NwaCegarLoop]: 1210 mSDtfsCounter, 30 mSDsluCounter, 3480 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 4690 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:13:48,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 4690 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:13:48,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3823 states. [2024-10-13 09:13:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3823 to 3819. [2024-10-13 09:13:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3819 states, 3762 states have (on average 1.3577884104199893) internal successors, (5108), 3767 states have internal predecessors, (5108), 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-13 09:13:48,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3819 states to 3819 states and 5211 transitions. [2024-10-13 09:13:48,398 INFO L78 Accepts]: Start accepts. Automaton has 3819 states and 5211 transitions. Word has length 1583 [2024-10-13 09:13:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:13:48,400 INFO L471 AbstractCegarLoop]: Abstraction has 3819 states and 5211 transitions. [2024-10-13 09:13:48,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 48.0) internal successors, (240), 4 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-13 09:13:48,400 INFO L276 IsEmpty]: Start isEmpty. Operand 3819 states and 5211 transitions. [2024-10-13 09:13:48,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1585 [2024-10-13 09:13:48,419 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:13:48,420 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, 1] [2024-10-13 09:13:48,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:13:48,421 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 09:13:48,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:13:48,421 INFO L85 PathProgramCache]: Analyzing trace with hash -420022655, now seen corresponding path program 1 times [2024-10-13 09:13:48,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:13:48,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548274580] [2024-10-13 09:13:48,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:13:48,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:13:49,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat