./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_FNV_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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_FNV_test6-1.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 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 16:26:15,984 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 16:26:16,061 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 16:26:16,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 16:26:16,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 16:26:16,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 16:26:16,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 16:26:16,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 16:26:16,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 16:26:16,099 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 16:26:16,099 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 16:26:16,099 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 16:26:16,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 16:26:16,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 16:26:16,102 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 16:26:16,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 16:26:16,103 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 16:26:16,103 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 16:26:16,106 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 16:26:16,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 16:26:16,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 16:26:16,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 16:26:16,107 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 16:26:16,108 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 16:26:16,108 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 16:26:16,108 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 16:26:16,108 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 16:26:16,108 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 16:26:16,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 16:26:16,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 16:26:16,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 16:26:16,109 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 16:26:16,109 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:26:16,109 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 16:26:16,110 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 16:26:16,110 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 16:26:16,110 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 16:26:16,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 16:26:16,110 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 16:26:16,111 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 16:26:16,111 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 16:26:16,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 16:26:16,114 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 -> 8374eced2cbda6aab489eb004cb8e41f23aad88b98cd5c6913f13583171f2c3f [2024-10-14 16:26:16,395 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 16:26:16,422 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 16:26:16,425 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 16:26:16,426 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 16:26:16,428 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 16:26:16,429 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-10-14 16:26:17,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 16:26:18,236 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 16:26:18,238 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_FNV_test6-1.i [2024-10-14 16:26:18,264 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e7b1d24/7b4f185676cb42b8b0c6aa962acf786a/FLAG015e32b66 [2024-10-14 16:26:18,464 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/66e7b1d24/7b4f185676cb42b8b0c6aa962acf786a [2024-10-14 16:26:18,467 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 16:26:18,468 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 16:26:18,470 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 16:26:18,470 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 16:26:18,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 16:26:18,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:26:18" (1/1) ... [2024-10-14 16:26:18,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2872abb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:18, skipping insertion in model container [2024-10-14 16:26:18,484 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:26:18" (1/1) ... [2024-10-14 16:26:18,548 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 16:26:19,109 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_FNV_test6-1.i[44118,44131] [2024-10-14 16:26:19,123 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_FNV_test6-1.i[44660,44673] [2024-10-14 16:26:19,268 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_FNV_test6-1.i[56247,56260] [2024-10-14 16:26:19,269 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_FNV_test6-1.i[56368,56381] [2024-10-14 16:26:19,284 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:26:19,299 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 16:26:19,354 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_FNV_test6-1.i[44118,44131] [2024-10-14 16:26:19,358 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_FNV_test6-1.i[44660,44673] [2024-10-14 16:26:19,417 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_FNV_test6-1.i[56247,56260] [2024-10-14 16:26:19,418 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_FNV_test6-1.i[56368,56381] [2024-10-14 16:26:19,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:26:19,496 INFO L204 MainTranslator]: Completed translation [2024-10-14 16:26:19,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19 WrapperNode [2024-10-14 16:26:19,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 16:26:19,499 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 16:26:19,499 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 16:26:19,499 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 16:26:19,507 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,557 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,624 INFO L138 Inliner]: procedures = 282, calls = 286, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1468 [2024-10-14 16:26:19,625 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 16:26:19,626 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 16:26:19,626 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 16:26:19,626 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 16:26:19,637 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,638 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,652 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,766 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 3, 220, 34]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 2, 49, 4]. [2024-10-14 16:26:19,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,816 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,838 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 16:26:19,866 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 16:26:19,867 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 16:26:19,867 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 16:26:19,869 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (1/1) ... [2024-10-14 16:26:19,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:26:19,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:26:19,906 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-14 16:26:19,908 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-14 16:26:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 16:26:19,979 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-14 16:26:19,980 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 16:26:19,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 16:26:19,980 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 16:26:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 16:26:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 16:26:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 16:26:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 16:26:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 16:26:19,981 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-14 16:26:19,981 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-14 16:26:20,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-14 16:26:20,003 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 16:26:20,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 16:26:20,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 16:26:20,254 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 16:26:20,257 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 16:26:21,730 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-10-14 16:26:21,731 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 16:26:21,787 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 16:26:21,788 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 16:26:21,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:26:21 BoogieIcfgContainer [2024-10-14 16:26:21,788 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 16:26:21,790 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 16:26:21,791 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 16:26:21,794 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 16:26:21,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:26:18" (1/3) ... [2024-10-14 16:26:21,795 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366e2ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:26:21, skipping insertion in model container [2024-10-14 16:26:21,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:26:19" (2/3) ... [2024-10-14 16:26:21,796 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@366e2ddc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:26:21, skipping insertion in model container [2024-10-14 16:26:21,796 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:26:21" (3/3) ... [2024-10-14 16:26:21,797 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_FNV_test6-1.i [2024-10-14 16:26:21,812 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 16:26:21,812 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 16:26:21,902 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:26:21,910 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;@65854e1b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:26:21,911 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 16:26:21,917 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 16:26:21,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 16:26:21,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:21,926 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:26:21,926 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:21,931 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:21,931 INFO L85 PathProgramCache]: Analyzing trace with hash 141968546, now seen corresponding path program 1 times [2024-10-14 16:26:21,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:21,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960800254] [2024-10-14 16:26:21,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:21,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:22,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:22,146 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-14 16:26:22,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:22,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960800254] [2024-10-14 16:26:22,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960800254] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:22,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:22,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:26:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277292399] [2024-10-14 16:26:22,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:22,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 16:26:22,158 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:22,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 16:26:22,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:26:22,186 INFO L87 Difference]: Start difference. First operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:26:22,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:22,290 INFO L93 Difference]: Finished difference Result 845 states and 1360 transitions. [2024-10-14 16:26:22,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 16:26:22,293 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 16:26:22,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:22,305 INFO L225 Difference]: With dead ends: 845 [2024-10-14 16:26:22,307 INFO L226 Difference]: Without dead ends: 420 [2024-10-14 16:26:22,315 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-14 16:26:22,320 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:22,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 16:26:22,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-14 16:26:22,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-14 16:26:22,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 399 states have (on average 1.443609022556391) internal successors, (576), 404 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:22,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 601 transitions. [2024-10-14 16:26:22,428 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 601 transitions. Word has length 7 [2024-10-14 16:26:22,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:22,429 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 601 transitions. [2024-10-14 16:26:22,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:26:22,430 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 601 transitions. [2024-10-14 16:26:22,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 16:26:22,430 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:22,430 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:26:22,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 16:26:22,431 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:22,431 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:22,432 INFO L85 PathProgramCache]: Analyzing trace with hash 750725892, now seen corresponding path program 1 times [2024-10-14 16:26:22,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:22,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640555810] [2024-10-14 16:26:22,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:22,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:22,729 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:26:22,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640555810] [2024-10-14 16:26:22,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640555810] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:22,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:22,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 16:26:22,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532048643] [2024-10-14 16:26:22,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:22,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:26:22,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:22,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:26:22,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:26:22,735 INFO L87 Difference]: Start difference. First operand 420 states and 601 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:26:22,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:22,969 INFO L93 Difference]: Finished difference Result 1027 states and 1478 transitions. [2024-10-14 16:26:22,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:26:22,970 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 16:26:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:22,975 INFO L225 Difference]: With dead ends: 1027 [2024-10-14 16:26:22,975 INFO L226 Difference]: Without dead ends: 818 [2024-10-14 16:26:22,976 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-14 16:26:22,977 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 554 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:22,978 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1826 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:26:22,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-14 16:26:22,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 422. [2024-10-14 16:26:23,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4413965087281795) internal successors, (578), 406 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2024-10-14 16:26:23,004 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 9 [2024-10-14 16:26:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:23,004 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2024-10-14 16:26:23,005 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:26:23,006 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2024-10-14 16:26:23,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 16:26:23,008 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:23,009 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] [2024-10-14 16:26:23,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 16:26:23,009 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:23,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash 992376086, now seen corresponding path program 1 times [2024-10-14 16:26:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:23,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066867775] [2024-10-14 16:26:23,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:23,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:23,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:23,297 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-14 16:26:23,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:23,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066867775] [2024-10-14 16:26:23,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066867775] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:23,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:23,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:26:23,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742670436] [2024-10-14 16:26:23,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:23,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:26:23,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:23,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:26:23,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:26:23,303 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-14 16:26:23,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:23,417 INFO L93 Difference]: Finished difference Result 844 states and 1206 transitions. [2024-10-14 16:26:23,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:26:23,418 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-14 16:26:23,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:23,421 INFO L225 Difference]: With dead ends: 844 [2024-10-14 16:26:23,421 INFO L226 Difference]: Without dead ends: 425 [2024-10-14 16:26:23,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-14 16:26:23,423 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 106 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:23,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1607 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:26:23,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-14 16:26:23,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-10-14 16:26:23,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4239401496259352) internal successors, (571), 406 states have internal predecessors, (571), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:23,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 596 transitions. [2024-10-14 16:26:23,438 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 596 transitions. Word has length 64 [2024-10-14 16:26:23,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:23,438 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 596 transitions. [2024-10-14 16:26:23,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-14 16:26:23,438 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 596 transitions. [2024-10-14 16:26:23,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 16:26:23,443 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:23,443 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] [2024-10-14 16:26:23,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 16:26:23,444 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:23,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:23,461 INFO L85 PathProgramCache]: Analyzing trace with hash 696880968, now seen corresponding path program 1 times [2024-10-14 16:26:23,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:23,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826997347] [2024-10-14 16:26:23,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:23,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:23,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:23,613 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-14 16:26:23,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:23,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826997347] [2024-10-14 16:26:23,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826997347] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:23,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:23,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:26:23,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [160308855] [2024-10-14 16:26:23,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:23,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:26:23,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:23,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:26:23,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:26:23,616 INFO L87 Difference]: Start difference. First operand 422 states and 596 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-14 16:26:23,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:23,718 INFO L93 Difference]: Finished difference Result 793 states and 1114 transitions. [2024-10-14 16:26:23,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 16:26:23,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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 64 [2024-10-14 16:26:23,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:23,722 INFO L225 Difference]: With dead ends: 793 [2024-10-14 16:26:23,723 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 16:26:23,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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-14 16:26:23,726 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 9 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:23,727 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1456 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:26:23,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 16:26:23,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-10-14 16:26:23,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3909348441926346) internal successors, (491), 358 states have internal predecessors, (491), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:23,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 516 transitions. [2024-10-14 16:26:23,746 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 516 transitions. Word has length 64 [2024-10-14 16:26:23,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:23,746 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 516 transitions. [2024-10-14 16:26:23,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 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-14 16:26:23,748 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 516 transitions. [2024-10-14 16:26:23,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 16:26:23,749 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:23,749 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] [2024-10-14 16:26:23,750 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 16:26:23,750 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:23,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:23,752 INFO L85 PathProgramCache]: Analyzing trace with hash 2068688266, now seen corresponding path program 1 times [2024-10-14 16:26:23,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:23,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868050006] [2024-10-14 16:26:23,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:23,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:23,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:24,261 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-14 16:26:24,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:24,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868050006] [2024-10-14 16:26:24,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868050006] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:24,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:24,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:26:24,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710815126] [2024-10-14 16:26:24,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:24,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:26:24,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:24,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:26:24,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:26:24,266 INFO L87 Difference]: Start difference. First operand 374 states and 516 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-14 16:26:24,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:24,661 INFO L93 Difference]: Finished difference Result 750 states and 1037 transitions. [2024-10-14 16:26:24,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:26:24,662 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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 64 [2024-10-14 16:26:24,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:24,664 INFO L225 Difference]: With dead ends: 750 [2024-10-14 16:26:24,664 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 16:26:24,665 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:24,668 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 10 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:24,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2171 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:26:24,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 16:26:24,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2024-10-14 16:26:24,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.388732394366197) internal successors, (493), 360 states have internal predecessors, (493), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:24,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 518 transitions. [2024-10-14 16:26:24,684 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 518 transitions. Word has length 64 [2024-10-14 16:26:24,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:24,684 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 518 transitions. [2024-10-14 16:26:24,685 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 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-14 16:26:24,686 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 518 transitions. [2024-10-14 16:26:24,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 16:26:24,687 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:24,689 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] [2024-10-14 16:26:24,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 16:26:24,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:24,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:24,690 INFO L85 PathProgramCache]: Analyzing trace with hash -437125107, now seen corresponding path program 1 times [2024-10-14 16:26:24,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:24,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180777388] [2024-10-14 16:26:24,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:24,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:24,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:25,052 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-14 16:26:25,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:25,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180777388] [2024-10-14 16:26:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180777388] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:25,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:25,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:26:25,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [198342940] [2024-10-14 16:26:25,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:25,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:26:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:25,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:26:25,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:26:25,057 INFO L87 Difference]: Start difference. First operand 376 states and 518 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-14 16:26:25,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:25,209 INFO L93 Difference]: Finished difference Result 749 states and 1033 transitions. [2024-10-14 16:26:25,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:26:25,210 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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 65 [2024-10-14 16:26:25,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:25,212 INFO L225 Difference]: With dead ends: 749 [2024-10-14 16:26:25,213 INFO L226 Difference]: Without dead ends: 376 [2024-10-14 16:26:25,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-14 16:26:25,214 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 13 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:25,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1368 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:26:25,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-14 16:26:25,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-10-14 16:26:25,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.3859154929577464) internal successors, (492), 360 states have internal predecessors, (492), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:25,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 517 transitions. [2024-10-14 16:26:25,225 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 517 transitions. Word has length 65 [2024-10-14 16:26:25,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:25,225 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 517 transitions. [2024-10-14 16:26:25,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 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-14 16:26:25,226 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 517 transitions. [2024-10-14 16:26:25,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 16:26:25,227 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:25,227 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] [2024-10-14 16:26:25,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 16:26:25,227 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:25,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:25,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2023236473, now seen corresponding path program 1 times [2024-10-14 16:26:25,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:25,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424141840] [2024-10-14 16:26:25,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:25,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:25,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:25,481 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-14 16:26:25,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424141840] [2024-10-14 16:26:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424141840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:25,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:25,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:26:25,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821619509] [2024-10-14 16:26:25,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:25,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:26:25,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:26:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:25,483 INFO L87 Difference]: Start difference. First operand 376 states and 517 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-14 16:26:25,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:25,851 INFO L93 Difference]: Finished difference Result 754 states and 1039 transitions. [2024-10-14 16:26:25,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:26:25,852 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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 65 [2024-10-14 16:26:25,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:25,855 INFO L225 Difference]: With dead ends: 754 [2024-10-14 16:26:25,855 INFO L226 Difference]: Without dead ends: 381 [2024-10-14 16:26:25,856 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:25,857 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 10 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:25,857 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2605 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:26:25,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-14 16:26:25,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2024-10-14 16:26:25,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.384401114206128) internal successors, (497), 364 states have internal predecessors, (497), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:25,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 522 transitions. [2024-10-14 16:26:25,870 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 522 transitions. Word has length 65 [2024-10-14 16:26:25,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:25,872 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 522 transitions. [2024-10-14 16:26:25,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 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-14 16:26:25,873 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 522 transitions. [2024-10-14 16:26:25,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 16:26:25,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:25,874 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] [2024-10-14 16:26:25,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 16:26:25,875 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:25,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:25,875 INFO L85 PathProgramCache]: Analyzing trace with hash 946071343, now seen corresponding path program 1 times [2024-10-14 16:26:25,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:25,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417085566] [2024-10-14 16:26:25,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:25,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:26,129 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-14 16:26:26,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:26,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417085566] [2024-10-14 16:26:26,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417085566] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:26,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:26,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:26:26,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458808153] [2024-10-14 16:26:26,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:26,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:26:26,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:26,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:26:26,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:26:26,135 INFO L87 Difference]: Start difference. First operand 380 states and 522 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 16:26:26,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:26,385 INFO L93 Difference]: Finished difference Result 760 states and 1046 transitions. [2024-10-14 16:26:26,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:26:26,386 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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 66 [2024-10-14 16:26:26,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:26,388 INFO L225 Difference]: With dead ends: 760 [2024-10-14 16:26:26,388 INFO L226 Difference]: Without dead ends: 383 [2024-10-14 16:26:26,390 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:26:26,390 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 4 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:26,390 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1788 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 16:26:26,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-14 16:26:26,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-10-14 16:26:26,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.3812154696132597) internal successors, (500), 367 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:26,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 525 transitions. [2024-10-14 16:26:26,401 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 525 transitions. Word has length 66 [2024-10-14 16:26:26,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:26,401 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 525 transitions. [2024-10-14 16:26:26,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 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-14 16:26:26,402 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 525 transitions. [2024-10-14 16:26:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 16:26:26,402 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:26,402 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] [2024-10-14 16:26:26,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 16:26:26,403 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:26,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:26,403 INFO L85 PathProgramCache]: Analyzing trace with hash -1827898922, now seen corresponding path program 1 times [2024-10-14 16:26:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472506305] [2024-10-14 16:26:26,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:26,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:26,839 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-14 16:26:26,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:26,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472506305] [2024-10-14 16:26:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472506305] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:26,840 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:26,840 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:26:26,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611139665] [2024-10-14 16:26:26,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:26,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:26:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:26,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:26:26,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:26:26,842 INFO L87 Difference]: Start difference. First operand 383 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-14 16:26:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:27,367 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2024-10-14 16:26:27,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 16:26:27,368 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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 66 [2024-10-14 16:26:27,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:27,370 INFO L225 Difference]: With dead ends: 776 [2024-10-14 16:26:27,370 INFO L226 Difference]: Without dead ends: 396 [2024-10-14 16:26:27,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:26:27,372 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 30 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:27,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3520 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:26:27,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-14 16:26:27,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2024-10-14 16:26:27,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.381720430107527) internal successors, (514), 377 states have internal predecessors, (514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:27,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-10-14 16:26:27,385 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 66 [2024-10-14 16:26:27,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:27,386 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-10-14 16:26:27,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 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-14 16:26:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-10-14 16:26:27,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 16:26:27,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:27,388 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] [2024-10-14 16:26:27,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 16:26:27,389 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:27,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:27,389 INFO L85 PathProgramCache]: Analyzing trace with hash -215227921, now seen corresponding path program 1 times [2024-10-14 16:26:27,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:27,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079961887] [2024-10-14 16:26:27,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:27,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:27,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:27,876 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-14 16:26:27,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:27,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079961887] [2024-10-14 16:26:27,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079961887] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:27,877 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:27,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 16:26:27,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21332924] [2024-10-14 16:26:27,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:27,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 16:26:27,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:27,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 16:26:27,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 16:26:27,880 INFO L87 Difference]: Start difference. First operand 393 states and 539 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-14 16:26:28,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:28,328 INFO L93 Difference]: Finished difference Result 786 states and 1080 transitions. [2024-10-14 16:26:28,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:26:28,330 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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 66 [2024-10-14 16:26:28,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:28,332 INFO L225 Difference]: With dead ends: 786 [2024-10-14 16:26:28,332 INFO L226 Difference]: Without dead ends: 396 [2024-10-14 16:26:28,334 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:26:28,334 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 23 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:28,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3083 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:26:28,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-14 16:26:28,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-14 16:26:28,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:28,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-14 16:26:28,347 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 66 [2024-10-14 16:26:28,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:28,348 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-14 16:26:28,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 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-14 16:26:28,349 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-14 16:26:28,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 16:26:28,351 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:28,351 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-14 16:26:28,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 16:26:28,352 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:28,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:28,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1927888144, now seen corresponding path program 1 times [2024-10-14 16:26:28,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:28,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067474268] [2024-10-14 16:26:28,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:28,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:28,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:28,647 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-14 16:26:28,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:28,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067474268] [2024-10-14 16:26:28,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067474268] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:28,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:28,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:26:28,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575360128] [2024-10-14 16:26:28,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:28,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:26:28,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:28,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:26:28,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:28,649 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-14 16:26:29,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:29,048 INFO L93 Difference]: Finished difference Result 794 states and 1089 transitions. [2024-10-14 16:26:29,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:26:29,048 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-14 16:26:29,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:29,050 INFO L225 Difference]: With dead ends: 794 [2024-10-14 16:26:29,050 INFO L226 Difference]: Without dead ends: 401 [2024-10-14 16:26:29,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 16:26:29,052 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 9 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:29,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2611 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:26:29,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-14 16:26:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 396. [2024-10-14 16:26:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:29,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-14 16:26:29,064 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 67 [2024-10-14 16:26:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:29,064 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-14 16:26:29,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 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-14 16:26:29,065 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-14 16:26:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 16:26:29,065 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:29,066 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-14 16:26:29,066 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 16:26:29,066 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:29,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:29,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1191157692, now seen corresponding path program 1 times [2024-10-14 16:26:29,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:29,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711319705] [2024-10-14 16:26:29,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:29,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:29,602 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-14 16:26:29,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:29,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711319705] [2024-10-14 16:26:29,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711319705] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:29,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:29,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 16:26:29,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66832616] [2024-10-14 16:26:29,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:29,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:26:29,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:29,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:26:29,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:26:29,605 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-14 16:26:30,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:30,519 INFO L93 Difference]: Finished difference Result 1144 states and 1578 transitions. [2024-10-14 16:26:30,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:30,520 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-14 16:26:30,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:30,524 INFO L225 Difference]: With dead ends: 1144 [2024-10-14 16:26:30,524 INFO L226 Difference]: Without dead ends: 751 [2024-10-14 16:26:30,525 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-14 16:26:30,526 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 598 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:30,526 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2935 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 16:26:30,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-14 16:26:30,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 427. [2024-10-14 16:26:30,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.3497536945812807) internal successors, (548), 411 states have internal predecessors, (548), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:30,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 573 transitions. [2024-10-14 16:26:30,544 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 573 transitions. Word has length 67 [2024-10-14 16:26:30,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:30,544 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 573 transitions. [2024-10-14 16:26:30,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 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-14 16:26:30,545 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 573 transitions. [2024-10-14 16:26:30,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 16:26:30,545 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:30,546 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, 1] [2024-10-14 16:26:30,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 16:26:30,546 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:30,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:30,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1668996667, now seen corresponding path program 1 times [2024-10-14 16:26:30,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:30,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834878937] [2024-10-14 16:26:30,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:30,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:30,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:30,810 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-14 16:26:30,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:30,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834878937] [2024-10-14 16:26:30,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834878937] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:30,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:30,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:26:30,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449625076] [2024-10-14 16:26:30,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:30,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:26:30,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:30,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:26:30,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:26:30,813 INFO L87 Difference]: Start difference. First operand 427 states and 573 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-14 16:26:31,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:31,191 INFO L93 Difference]: Finished difference Result 830 states and 1126 transitions. [2024-10-14 16:26:31,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 16:26:31,192 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 68 [2024-10-14 16:26:31,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:31,195 INFO L225 Difference]: With dead ends: 830 [2024-10-14 16:26:31,195 INFO L226 Difference]: Without dead ends: 437 [2024-10-14 16:26:31,196 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:26:31,197 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 16 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:31,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3105 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:26:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-14 16:26:31,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 430. [2024-10-14 16:26:31,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:31,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-14 16:26:31,214 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-14 16:26:31,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:31,214 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-14 16:26:31,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-14 16:26:31,214 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-14 16:26:31,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 16:26:31,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:31,215 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, 1] [2024-10-14 16:26:31,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 16:26:31,216 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:31,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:31,216 INFO L85 PathProgramCache]: Analyzing trace with hash -488729825, now seen corresponding path program 1 times [2024-10-14 16:26:31,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:31,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [788781081] [2024-10-14 16:26:31,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:31,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:31,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:31,513 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-14 16:26:31,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:31,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [788781081] [2024-10-14 16:26:31,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [788781081] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:31,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:31,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:26:31,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404419898] [2024-10-14 16:26:31,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:31,515 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:26:31,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:31,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:26:31,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:26:31,516 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-14 16:26:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:32,046 INFO L93 Difference]: Finished difference Result 836 states and 1134 transitions. [2024-10-14 16:26:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:32,046 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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 68 [2024-10-14 16:26:32,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:32,048 INFO L225 Difference]: With dead ends: 836 [2024-10-14 16:26:32,049 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 16:26:32,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:26:32,050 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 26 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:32,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3456 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:26:32,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 16:26:32,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-14 16:26:32,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:32,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-14 16:26:32,066 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-14 16:26:32,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:32,066 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-14 16:26:32,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 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-14 16:26:32,067 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-14 16:26:32,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:26:32,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:32,067 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, 1, 1] [2024-10-14 16:26:32,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 16:26:32,068 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:32,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:32,068 INFO L85 PathProgramCache]: Analyzing trace with hash -29765440, now seen corresponding path program 1 times [2024-10-14 16:26:32,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:32,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116274304] [2024-10-14 16:26:32,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:32,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:32,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:32,410 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-14 16:26:32,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:32,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116274304] [2024-10-14 16:26:32,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116274304] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:32,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:32,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:26:32,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814415277] [2024-10-14 16:26:32,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:32,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:26:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:32,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:26:32,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:26:32,413 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-14 16:26:32,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:32,927 INFO L93 Difference]: Finished difference Result 842 states and 1143 transitions. [2024-10-14 16:26:32,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:32,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 69 [2024-10-14 16:26:32,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:32,930 INFO L225 Difference]: With dead ends: 842 [2024-10-14 16:26:32,930 INFO L226 Difference]: Without dead ends: 446 [2024-10-14 16:26:32,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:26:32,931 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 22 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:32,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3511 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:26:32,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-14 16:26:32,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2024-10-14 16:26:32,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 419 states have (on average 1.3460620525059666) internal successors, (564), 424 states have internal predecessors, (564), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:32,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-10-14 16:26:32,948 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 69 [2024-10-14 16:26:32,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:32,948 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-10-14 16:26:32,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-14 16:26:32,949 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-10-14 16:26:32,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:26:32,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:32,949 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, 1, 1] [2024-10-14 16:26:32,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 16:26:32,950 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:32,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:32,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1800190044, now seen corresponding path program 1 times [2024-10-14 16:26:32,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:32,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168729381] [2024-10-14 16:26:32,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:32,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:32,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:33,284 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-14 16:26:33,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:33,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168729381] [2024-10-14 16:26:33,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168729381] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:33,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:33,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:26:33,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024120963] [2024-10-14 16:26:33,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:33,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:26:33,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:33,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:26:33,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:26:33,287 INFO L87 Difference]: Start difference. First operand 440 states and 589 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-14 16:26:33,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:33,835 INFO L93 Difference]: Finished difference Result 862 states and 1167 transitions. [2024-10-14 16:26:33,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:33,836 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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 69 [2024-10-14 16:26:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:33,839 INFO L225 Difference]: With dead ends: 862 [2024-10-14 16:26:33,839 INFO L226 Difference]: Without dead ends: 456 [2024-10-14 16:26:33,840 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:26:33,840 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 13 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:33,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3919 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:26:33,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-14 16:26:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 443. [2024-10-14 16:26:33,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3459715639810426) internal successors, (568), 427 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:33,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 593 transitions. [2024-10-14 16:26:33,856 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 593 transitions. Word has length 69 [2024-10-14 16:26:33,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:33,856 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 593 transitions. [2024-10-14 16:26:33,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 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-14 16:26:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 593 transitions. [2024-10-14 16:26:33,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:26:33,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:33,858 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, 1, 1] [2024-10-14 16:26:33,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 16:26:33,859 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:33,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:33,859 INFO L85 PathProgramCache]: Analyzing trace with hash 302137308, now seen corresponding path program 1 times [2024-10-14 16:26:33,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:33,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852369259] [2024-10-14 16:26:33,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:33,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:34,223 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-14 16:26:34,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:34,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852369259] [2024-10-14 16:26:34,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852369259] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:34,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:34,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:26:34,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141882961] [2024-10-14 16:26:34,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:34,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:26:34,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:34,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:26:34,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:34,225 INFO L87 Difference]: Start difference. First operand 443 states and 593 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-14 16:26:34,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:34,572 INFO L93 Difference]: Finished difference Result 857 states and 1157 transitions. [2024-10-14 16:26:34,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:26:34,573 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 69 [2024-10-14 16:26:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:34,575 INFO L225 Difference]: With dead ends: 857 [2024-10-14 16:26:34,575 INFO L226 Difference]: Without dead ends: 448 [2024-10-14 16:26:34,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:34,577 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 7 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:34,577 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2635 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:26:34,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-14 16:26:34,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-10-14 16:26:34,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3436018957345972) internal successors, (567), 427 states have internal predecessors, (567), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:34,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 592 transitions. [2024-10-14 16:26:34,590 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 592 transitions. Word has length 69 [2024-10-14 16:26:34,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:34,591 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 592 transitions. [2024-10-14 16:26:34,591 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-14 16:26:34,591 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 592 transitions. [2024-10-14 16:26:34,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:26:34,592 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:34,592 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, 1, 1] [2024-10-14 16:26:34,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 16:26:34,592 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:34,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:34,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1914808309, now seen corresponding path program 1 times [2024-10-14 16:26:34,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:34,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407199677] [2024-10-14 16:26:34,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:34,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:34,820 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-14 16:26:34,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:34,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407199677] [2024-10-14 16:26:34,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407199677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:34,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:34,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:26:34,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451687235] [2024-10-14 16:26:34,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:34,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:26:34,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:34,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:26:34,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:34,822 INFO L87 Difference]: Start difference. First operand 443 states and 592 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-14 16:26:35,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:35,193 INFO L93 Difference]: Finished difference Result 855 states and 1155 transitions. [2024-10-14 16:26:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:26:35,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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 69 [2024-10-14 16:26:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:35,197 INFO L225 Difference]: With dead ends: 855 [2024-10-14 16:26:35,197 INFO L226 Difference]: Without dead ends: 446 [2024-10-14 16:26:35,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:26:35,198 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 4 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:35,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2594 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:26:35,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-14 16:26:35,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-10-14 16:26:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 425 states have (on average 1.3411764705882352) internal successors, (570), 430 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 595 transitions. [2024-10-14 16:26:35,214 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 595 transitions. Word has length 69 [2024-10-14 16:26:35,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:35,214 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 595 transitions. [2024-10-14 16:26:35,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 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-14 16:26:35,215 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 595 transitions. [2024-10-14 16:26:35,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:26:35,215 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:35,216 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, 1, 1, 1] [2024-10-14 16:26:35,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 16:26:35,216 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:35,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:35,216 INFO L85 PathProgramCache]: Analyzing trace with hash 48213054, now seen corresponding path program 1 times [2024-10-14 16:26:35,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:35,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [911768719] [2024-10-14 16:26:35,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:35,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:35,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:35,718 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-14 16:26:35,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:35,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [911768719] [2024-10-14 16:26:35,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [911768719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:35,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:35,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:26:35,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985109194] [2024-10-14 16:26:35,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:35,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:26:35,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:35,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:26:35,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:26:35,721 INFO L87 Difference]: Start difference. First operand 446 states and 595 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-14 16:26:36,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:36,306 INFO L93 Difference]: Finished difference Result 870 states and 1174 transitions. [2024-10-14 16:26:36,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:36,307 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 70 [2024-10-14 16:26:36,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:36,309 INFO L225 Difference]: With dead ends: 870 [2024-10-14 16:26:36,309 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 16:26:36,310 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:26:36,311 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 9 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3903 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:36,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3903 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:26:36,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 16:26:36,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2024-10-14 16:26:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.3403263403263403) internal successors, (575), 434 states have internal predecessors, (575), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 600 transitions. [2024-10-14 16:26:36,326 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 600 transitions. Word has length 70 [2024-10-14 16:26:36,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:36,326 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 600 transitions. [2024-10-14 16:26:36,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-14 16:26:36,326 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2024-10-14 16:26:36,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:26:36,327 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:36,327 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:26:36,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 16:26:36,328 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:36,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:36,328 INFO L85 PathProgramCache]: Analyzing trace with hash 1976786731, now seen corresponding path program 1 times [2024-10-14 16:26:36,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:36,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966711511] [2024-10-14 16:26:36,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:36,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:36,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:36,707 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-14 16:26:36,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:36,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966711511] [2024-10-14 16:26:36,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966711511] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:36,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:36,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 16:26:36,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021126407] [2024-10-14 16:26:36,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:36,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 16:26:36,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:36,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 16:26:36,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:26:36,709 INFO L87 Difference]: Start difference. First operand 450 states and 600 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-14 16:26:37,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:37,316 INFO L93 Difference]: Finished difference Result 879 states and 1184 transitions. [2024-10-14 16:26:37,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:37,317 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 70 [2024-10-14 16:26:37,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:37,319 INFO L225 Difference]: With dead ends: 879 [2024-10-14 16:26:37,319 INFO L226 Difference]: Without dead ends: 463 [2024-10-14 16:26:37,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:26:37,321 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 22 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:37,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4401 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 16:26:37,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-14 16:26:37,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 453. [2024-10-14 16:26:37,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.337962962962963) internal successors, (578), 437 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:37,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2024-10-14 16:26:37,340 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 70 [2024-10-14 16:26:37,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:37,340 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2024-10-14 16:26:37,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-14 16:26:37,341 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2024-10-14 16:26:37,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:26:37,341 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:37,341 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, 1, 1, 1] [2024-10-14 16:26:37,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 16:26:37,342 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:37,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:37,342 INFO L85 PathProgramCache]: Analyzing trace with hash 942258210, now seen corresponding path program 1 times [2024-10-14 16:26:37,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:37,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186902643] [2024-10-14 16:26:37,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:37,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:37,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:37,859 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-14 16:26:37,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:37,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186902643] [2024-10-14 16:26:37,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186902643] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:37,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:37,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:26:37,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [672432604] [2024-10-14 16:26:37,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:37,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:26:37,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:37,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:26:37,863 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:26:37,863 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-14 16:26:40,489 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.37s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:26:41,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:41,005 INFO L93 Difference]: Finished difference Result 878 states and 1180 transitions. [2024-10-14 16:26:41,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:41,006 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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 70 [2024-10-14 16:26:41,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:41,009 INFO L225 Difference]: With dead ends: 878 [2024-10-14 16:26:41,009 INFO L226 Difference]: Without dead ends: 459 [2024-10-14 16:26:41,010 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 16:26:41,010 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 33 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:41,011 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3426 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-10-14 16:26:41,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-14 16:26:41,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 454. [2024-10-14 16:26:41,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.3371824480369514) internal successors, (579), 438 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:41,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 604 transitions. [2024-10-14 16:26:41,030 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 604 transitions. Word has length 70 [2024-10-14 16:26:41,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:41,030 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 604 transitions. [2024-10-14 16:26:41,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 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-14 16:26:41,031 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 604 transitions. [2024-10-14 16:26:41,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:26:41,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:41,032 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, 1, 1, 1] [2024-10-14 16:26:41,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 16:26:41,032 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:41,032 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:41,032 INFO L85 PathProgramCache]: Analyzing trace with hash -894204710, now seen corresponding path program 1 times [2024-10-14 16:26:41,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:41,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580035005] [2024-10-14 16:26:41,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:41,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:41,309 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-14 16:26:41,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:26:41,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580035005] [2024-10-14 16:26:41,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580035005] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:26:41,310 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:26:41,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:26:41,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645333868] [2024-10-14 16:26:41,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:26:41,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:26:41,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:26:41,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:26:41,312 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:26:41,313 INFO L87 Difference]: Start difference. First operand 454 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-14 16:26:41,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:26:41,889 INFO L93 Difference]: Finished difference Result 883 states and 1187 transitions. [2024-10-14 16:26:41,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:26:41,889 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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 70 [2024-10-14 16:26:41,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:26:41,892 INFO L225 Difference]: With dead ends: 883 [2024-10-14 16:26:41,892 INFO L226 Difference]: Without dead ends: 463 [2024-10-14 16:26:41,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:26:41,906 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 22 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:26:41,907 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3456 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:26:41,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-14 16:26:41,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 451. [2024-10-14 16:26:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 430 states have (on average 1.3395348837209302) internal successors, (576), 435 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:26:41,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 601 transitions. [2024-10-14 16:26:41,923 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 601 transitions. Word has length 70 [2024-10-14 16:26:41,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:26:41,923 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 601 transitions. [2024-10-14 16:26:41,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 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-14 16:26:41,923 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 601 transitions. [2024-10-14 16:26:41,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:26:41,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:26:41,924 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 16:26:41,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 16:26:41,925 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:26:41,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:26:41,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1497195914, now seen corresponding path program 1 times [2024-10-14 16:26:41,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:26:41,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204175401] [2024-10-14 16:26:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:26:41,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:26:41,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:26:50,423 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (let ((.cse2 (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (or (< (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1| (* .cse2 4294967296)) (+ .cse0 |c_ULTIMATE.start_main_~_hj_i~0#1|)) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296)) (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* .cse2 2147483648))))))) is different from false [2024-10-14 16:27:01,552 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-10-14 16:27:01,652 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-14 16:27:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204175401] [2024-10-14 16:27:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204175401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 16:27:01,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406312692] [2024-10-14 16:27:01,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:01,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 16:27:01,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:01,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 16:27:01,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-10-14 16:27:01,655 INFO L87 Difference]: Start difference. First operand 451 states and 601 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-14 16:27:02,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:02,324 INFO L93 Difference]: Finished difference Result 892 states and 1205 transitions. [2024-10-14 16:27:02,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 16:27:02,327 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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 70 [2024-10-14 16:27:02,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:02,330 INFO L225 Difference]: With dead ends: 892 [2024-10-14 16:27:02,330 INFO L226 Difference]: Without dead ends: 475 [2024-10-14 16:27:02,331 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-10-14 16:27:02,332 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 41 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:02,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3469 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 315 Unchecked, 0.6s Time] [2024-10-14 16:27:02,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-14 16:27:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 457. [2024-10-14 16:27:02,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.3394495412844036) internal successors, (584), 441 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:02,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 609 transitions. [2024-10-14 16:27:02,348 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 609 transitions. Word has length 70 [2024-10-14 16:27:02,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:02,348 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 609 transitions. [2024-10-14 16:27:02,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 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-14 16:27:02,349 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 609 transitions. [2024-10-14 16:27:02,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:02,349 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:02,350 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, 1, 1, 1, 1] [2024-10-14 16:27:02,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 16:27:02,350 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:02,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:02,351 INFO L85 PathProgramCache]: Analyzing trace with hash -794892407, now seen corresponding path program 1 times [2024-10-14 16:27:02,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:02,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1109641825] [2024-10-14 16:27:02,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:02,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:02,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:02,765 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-14 16:27:02,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:02,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1109641825] [2024-10-14 16:27:02,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1109641825] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:02,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:02,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 16:27:02,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2019566812] [2024-10-14 16:27:02,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:02,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:27:02,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:02,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:27:02,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:27:02,770 INFO L87 Difference]: Start difference. First operand 457 states and 609 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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-14 16:27:03,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:03,497 INFO L93 Difference]: Finished difference Result 892 states and 1202 transitions. [2024-10-14 16:27:03,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:27:03,497 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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 71 [2024-10-14 16:27:03,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:03,502 INFO L225 Difference]: With dead ends: 892 [2024-10-14 16:27:03,503 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 16:27:03,504 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:27:03,504 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 12 mSDsluCounter, 3878 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4368 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:03,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4368 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 16:27:03,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 16:27:03,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 464. [2024-10-14 16:27:03,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 443 states have (on average 1.3386004514672687) internal successors, (593), 448 states have internal predecessors, (593), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:03,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 618 transitions. [2024-10-14 16:27:03,523 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 618 transitions. Word has length 71 [2024-10-14 16:27:03,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:03,523 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 618 transitions. [2024-10-14 16:27:03,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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-14 16:27:03,523 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 618 transitions. [2024-10-14 16:27:03,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:03,524 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:03,524 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, 1, 1, 1, 1] [2024-10-14 16:27:03,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 16:27:03,524 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:03,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:03,525 INFO L85 PathProgramCache]: Analyzing trace with hash 790204545, now seen corresponding path program 1 times [2024-10-14 16:27:03,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:03,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [190439774] [2024-10-14 16:27:03,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:03,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:03,856 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-14 16:27:03,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:03,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [190439774] [2024-10-14 16:27:03,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [190439774] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:03,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:03,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:27:03,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197863721] [2024-10-14 16:27:03,858 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:03,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:27:03,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:03,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:27:03,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:27:03,859 INFO L87 Difference]: Start difference. First operand 464 states and 618 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-14 16:27:04,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:04,386 INFO L93 Difference]: Finished difference Result 899 states and 1210 transitions. [2024-10-14 16:27:04,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:27:04,387 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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 71 [2024-10-14 16:27:04,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:04,390 INFO L225 Difference]: With dead ends: 899 [2024-10-14 16:27:04,390 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 16:27:04,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:27:04,392 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 33 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:04,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3108 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:27:04,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 16:27:04,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 461. [2024-10-14 16:27:04,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 440 states have (on average 1.3386363636363636) internal successors, (589), 445 states have internal predecessors, (589), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:04,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 614 transitions. [2024-10-14 16:27:04,407 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 614 transitions. Word has length 71 [2024-10-14 16:27:04,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:04,408 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 614 transitions. [2024-10-14 16:27:04,408 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-14 16:27:04,408 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 614 transitions. [2024-10-14 16:27:04,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:04,409 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:04,409 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, 1, 1, 1, 1] [2024-10-14 16:27:04,409 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 16:27:04,410 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:04,410 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:04,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1088293983, now seen corresponding path program 1 times [2024-10-14 16:27:04,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:04,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172820032] [2024-10-14 16:27:04,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:04,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:04,678 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-14 16:27:04,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:04,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172820032] [2024-10-14 16:27:04,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172820032] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:04,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:04,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:27:04,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794334548] [2024-10-14 16:27:04,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:04,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:27:04,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:04,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:27:04,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:27:04,681 INFO L87 Difference]: Start difference. First operand 461 states and 614 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-14 16:27:05,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:05,024 INFO L93 Difference]: Finished difference Result 889 states and 1195 transitions. [2024-10-14 16:27:05,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:27:05,025 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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 71 [2024-10-14 16:27:05,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:05,028 INFO L225 Difference]: With dead ends: 889 [2024-10-14 16:27:05,028 INFO L226 Difference]: Without dead ends: 462 [2024-10-14 16:27:05,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:27:05,030 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 45 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:05,031 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2690 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:27:05,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-14 16:27:05,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 458. [2024-10-14 16:27:05,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 437 states have (on average 1.3386727688787186) internal successors, (585), 442 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:05,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 610 transitions. [2024-10-14 16:27:05,046 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 610 transitions. Word has length 71 [2024-10-14 16:27:05,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:05,046 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 610 transitions. [2024-10-14 16:27:05,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 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-14 16:27:05,047 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 610 transitions. [2024-10-14 16:27:05,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:05,047 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:05,047 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, 1, 1, 1, 1] [2024-10-14 16:27:05,047 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 16:27:05,048 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:05,048 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:05,048 INFO L85 PathProgramCache]: Analyzing trace with hash 756361631, now seen corresponding path program 1 times [2024-10-14 16:27:05,048 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:05,048 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980794350] [2024-10-14 16:27:05,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:05,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:05,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:05,442 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-14 16:27:05,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:05,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980794350] [2024-10-14 16:27:05,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980794350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:05,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:05,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 16:27:05,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1927214763] [2024-10-14 16:27:05,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:05,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:27:05,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:05,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:27:05,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:27:05,445 INFO L87 Difference]: Start difference. First operand 458 states and 610 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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-14 16:27:07,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:07,022 INFO L93 Difference]: Finished difference Result 898 states and 1211 transitions. [2024-10-14 16:27:07,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:27:07,022 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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 71 [2024-10-14 16:27:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:07,025 INFO L225 Difference]: With dead ends: 898 [2024-10-14 16:27:07,025 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 16:27:07,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:27:07,027 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 14 mSDsluCounter, 4263 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4736 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:07,027 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4736 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-14 16:27:07,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 16:27:07,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 459. [2024-10-14 16:27:07,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3378995433789955) internal successors, (586), 443 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:07,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 611 transitions. [2024-10-14 16:27:07,047 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 611 transitions. Word has length 71 [2024-10-14 16:27:07,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:07,047 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 611 transitions. [2024-10-14 16:27:07,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 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-14 16:27:07,047 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 611 transitions. [2024-10-14 16:27:07,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:07,048 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:07,048 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, 1, 1, 1, 1] [2024-10-14 16:27:07,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 16:27:07,048 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:07,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:07,049 INFO L85 PathProgramCache]: Analyzing trace with hash 2115370497, now seen corresponding path program 1 times [2024-10-14 16:27:07,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:07,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091763979] [2024-10-14 16:27:07,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:07,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:07,345 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-14 16:27:07,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:07,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091763979] [2024-10-14 16:27:07,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091763979] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:07,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:07,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:27:07,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039970989] [2024-10-14 16:27:07,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:07,347 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:27:07,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:07,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:27:07,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:27:07,348 INFO L87 Difference]: Start difference. First operand 459 states and 611 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-14 16:27:07,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:07,927 INFO L93 Difference]: Finished difference Result 894 states and 1202 transitions. [2024-10-14 16:27:07,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:27:07,928 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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 71 [2024-10-14 16:27:07,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:07,930 INFO L225 Difference]: With dead ends: 894 [2024-10-14 16:27:07,931 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 16:27:07,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:27:07,932 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 8 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:07,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3947 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:27:07,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 16:27:07,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 459. [2024-10-14 16:27:07,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3378995433789955) internal successors, (586), 443 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:07,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 611 transitions. [2024-10-14 16:27:07,949 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 611 transitions. Word has length 71 [2024-10-14 16:27:07,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:07,949 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 611 transitions. [2024-10-14 16:27:07,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 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-14 16:27:07,949 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 611 transitions. [2024-10-14 16:27:07,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:07,950 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:07,950 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, 1, 1, 1, 1] [2024-10-14 16:27:07,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 16:27:07,950 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:07,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:07,951 INFO L85 PathProgramCache]: Analyzing trace with hash 1990201277, now seen corresponding path program 1 times [2024-10-14 16:27:07,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:07,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431100971] [2024-10-14 16:27:07,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:07,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:08,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:08,420 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-14 16:27:08,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:08,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431100971] [2024-10-14 16:27:08,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431100971] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:08,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:08,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 16:27:08,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466207396] [2024-10-14 16:27:08,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:08,422 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 16:27:08,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:08,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 16:27:08,423 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:27:08,423 INFO L87 Difference]: Start difference. First operand 459 states and 611 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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-14 16:27:09,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:09,338 INFO L93 Difference]: Finished difference Result 904 states and 1219 transitions. [2024-10-14 16:27:09,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 16:27:09,339 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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 71 [2024-10-14 16:27:09,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:09,342 INFO L225 Difference]: With dead ends: 904 [2024-10-14 16:27:09,342 INFO L226 Difference]: Without dead ends: 479 [2024-10-14 16:27:09,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-14 16:27:09,344 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 35 mSDsluCounter, 4676 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 5151 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:09,344 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 5151 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-14 16:27:09,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-14 16:27:09,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 468. [2024-10-14 16:27:09,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 447 states have (on average 1.337807606263982) internal successors, (598), 452 states have internal predecessors, (598), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:09,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 623 transitions. [2024-10-14 16:27:09,379 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 623 transitions. Word has length 71 [2024-10-14 16:27:09,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:09,380 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 623 transitions. [2024-10-14 16:27:09,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 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-14 16:27:09,380 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 623 transitions. [2024-10-14 16:27:09,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:09,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:09,382 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, 1, 1, 1, 1] [2024-10-14 16:27:09,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 16:27:09,382 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:09,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:09,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1457930159, now seen corresponding path program 1 times [2024-10-14 16:27:09,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:09,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6977458] [2024-10-14 16:27:09,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:09,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:09,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:10,692 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-14 16:27:10,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:10,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6977458] [2024-10-14 16:27:10,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [6977458] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:10,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:10,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 16:27:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697981421] [2024-10-14 16:27:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:10,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 16:27:10,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:10,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 16:27:10,693 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:27:10,693 INFO L87 Difference]: Start difference. First operand 468 states and 623 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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-14 16:27:12,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:27:14,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:27:14,628 INFO L93 Difference]: Finished difference Result 972 states and 1311 transitions. [2024-10-14 16:27:14,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 16:27:14,628 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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 71 [2024-10-14 16:27:14,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:27:14,632 INFO L225 Difference]: With dead ends: 972 [2024-10-14 16:27:14,633 INFO L226 Difference]: Without dead ends: 538 [2024-10-14 16:27:14,634 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-14 16:27:14,634 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 106 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-10-14 16:27:14,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 4592 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-10-14 16:27:14,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-14 16:27:14,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 469. [2024-10-14 16:27:14,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 448 states have (on average 1.3392857142857142) internal successors, (600), 453 states have internal predecessors, (600), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:27:14,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 625 transitions. [2024-10-14 16:27:14,655 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 625 transitions. Word has length 71 [2024-10-14 16:27:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:27:14,656 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 625 transitions. [2024-10-14 16:27:14,656 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 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-14 16:27:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 625 transitions. [2024-10-14 16:27:14,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:27:14,657 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:27:14,657 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, 1, 1, 1, 1] [2024-10-14 16:27:14,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 16:27:14,658 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:27:14,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:27:14,659 INFO L85 PathProgramCache]: Analyzing trace with hash 602512357, now seen corresponding path program 1 times [2024-10-14 16:27:14,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:27:14,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605301324] [2024-10-14 16:27:14,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:27:14,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:27:14,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:27:15,533 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-14 16:27:15,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:27:15,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605301324] [2024-10-14 16:27:15,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [605301324] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:27:15,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:27:15,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:27:15,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204102925] [2024-10-14 16:27:15,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:27:15,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:27:15,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:27:15,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:27:15,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:27:15,535 INFO L87 Difference]: Start difference. First operand 469 states and 625 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 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-14 16:27:20,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:27:24,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:27:28,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:27:32,177 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:27:33,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []