./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_SAX_test6-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 09:21:01,135 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 09:21:01,211 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 09:21:01,215 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 09:21:01,216 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 09:21:01,245 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 09:21:01,247 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 09:21:01,247 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 09:21:01,248 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 09:21:01,249 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 09:21:01,250 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 09:21:01,251 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 09:21:01,251 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 09:21:01,252 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 09:21:01,254 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 09:21:01,254 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 09:21:01,254 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 09:21:01,255 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 09:21:01,255 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 09:21:01,255 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 09:21:01,255 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 09:21:01,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 09:21:01,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 09:21:01,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 09:21:01,260 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 09:21:01,260 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 09:21:01,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 09:21:01,261 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 09:21:01,261 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 09:21:01,262 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 09:21:01,262 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 09:21:01,262 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 09:21:01,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:21:01,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 09:21:01,263 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 09:21:01,263 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 09:21:01,264 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 09:21:01,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 09:21:01,264 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 09:21:01,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 09:21:01,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 09:21:01,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 09:21:01,265 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 -> bb48026e7f870ff561a4cdd394c24cb5edb1d0f2fc8e8ef2bffe0b7b8438fda4 [2024-10-13 09:21:01,519 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 09:21:01,544 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 09:21:01,546 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 09:21:01,548 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 09:21:01,548 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 09:21:01,549 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-10-13 09:21:02,978 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 09:21:03,307 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 09:21:03,308 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_SAX_test6-2.i [2024-10-13 09:21:03,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41a079b7c/690bf2d98c5243be90637d71fb6344eb/FLAG938394651 [2024-10-13 09:21:03,555 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/41a079b7c/690bf2d98c5243be90637d71fb6344eb [2024-10-13 09:21:03,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 09:21:03,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 09:21:03,563 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 09:21:03,563 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 09:21:03,568 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 09:21:03,569 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:21:03" (1/1) ... [2024-10-13 09:21:03,570 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24c33ada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:03, skipping insertion in model container [2024-10-13 09:21:03,570 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:21:03" (1/1) ... [2024-10-13 09:21:03,642 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 09:21:04,182 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_SAX_test6-2.i[44118,44131] [2024-10-13 09:21:04,198 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_SAX_test6-2.i[44660,44673] [2024-10-13 09:21:04,318 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_SAX_test6-2.i[56247,56260] [2024-10-13 09:21:04,319 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_SAX_test6-2.i[56368,56381] [2024-10-13 09:21:04,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:21:04,368 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 09:21:04,415 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_SAX_test6-2.i[44118,44131] [2024-10-13 09:21:04,420 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_SAX_test6-2.i[44660,44673] [2024-10-13 09:21:04,550 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_SAX_test6-2.i[56247,56260] [2024-10-13 09:21:04,555 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_SAX_test6-2.i[56368,56381] [2024-10-13 09:21:04,569 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 09:21:04,626 INFO L204 MainTranslator]: Completed translation [2024-10-13 09:21:04,626 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04 WrapperNode [2024-10-13 09:21:04,626 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 09:21:04,627 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 09:21:04,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 09:21:04,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 09:21:04,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,672 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,746 INFO L138 Inliner]: procedures = 282, calls = 339, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1638 [2024-10-13 09:21:04,746 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 09:21:04,747 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 09:21:04,747 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 09:21:04,747 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 09:21:04,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,759 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,780 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,875 INFO L175 MemorySlicer]: Split 309 memory accesses to 4 slices as follows [2, 3, 270, 34]. 87 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 63 writes are split as follows [0, 2, 57, 4]. [2024-10-13 09:21:04,875 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,876 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,929 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,949 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,958 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,985 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 09:21:04,986 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 09:21:04,986 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 09:21:04,986 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 09:21:04,987 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (1/1) ... [2024-10-13 09:21:04,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 09:21:05,004 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 09:21:05,025 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 09:21:05,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 09:21:05,079 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-13 09:21:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 09:21:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-13 09:21:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-13 09:21:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-13 09:21:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 09:21:05,080 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-13 09:21:05,081 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-13 09:21:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 09:21:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 09:21:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-13 09:21:05,081 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-13 09:21:05,082 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-13 09:21:05,082 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-13 09:21:05,082 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 09:21:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 09:21:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-13 09:21:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-13 09:21:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 09:21:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 09:21:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-13 09:21:05,083 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-13 09:21:05,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-13 09:21:05,084 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-13 09:21:05,084 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 09:21:05,084 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 09:21:05,366 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 09:21:05,368 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 09:21:06,967 INFO L? ?]: Removed 364 outVars from TransFormulas that were not future-live. [2024-10-13 09:21:06,967 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 09:21:07,041 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 09:21:07,041 INFO L314 CfgBuilder]: Removed 72 assume(true) statements. [2024-10-13 09:21:07,042 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:21:07 BoogieIcfgContainer [2024-10-13 09:21:07,042 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 09:21:07,044 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 09:21:07,045 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 09:21:07,049 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 09:21:07,049 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:21:03" (1/3) ... [2024-10-13 09:21:07,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e732880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:21:07, skipping insertion in model container [2024-10-13 09:21:07,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:21:04" (2/3) ... [2024-10-13 09:21:07,050 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e732880 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:21:07, skipping insertion in model container [2024-10-13 09:21:07,050 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:21:07" (3/3) ... [2024-10-13 09:21:07,051 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_SAX_test6-2.i [2024-10-13 09:21:07,070 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 09:21:07,071 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-13 09:21:07,148 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 09:21:07,154 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;@6659f882, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 09:21:07,154 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-13 09:21:07,160 INFO L276 IsEmpty]: Start isEmpty. Operand has 462 states, 438 states have (on average 1.6141552511415524) internal successors, (707), 442 states have internal predecessors, (707), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-10-13 09:21:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 09:21:07,166 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:07,167 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:07,167 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-13 09:21:07,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:07,173 INFO L85 PathProgramCache]: Analyzing trace with hash 123534520, now seen corresponding path program 1 times [2024-10-13 09:21:07,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:07,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657164621] [2024-10-13 09:21:07,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:07,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:07,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:07,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:07,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657164621] [2024-10-13 09:21:07,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657164621] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:07,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:07,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 09:21:07,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390818324] [2024-10-13 09:21:07,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:07,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 09:21:07,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:07,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 09:21:07,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:21:07,436 INFO L87 Difference]: Start difference. First operand has 462 states, 438 states have (on average 1.6141552511415524) internal successors, (707), 442 states have internal predecessors, (707), 16 states have call successors, (16), 4 states have call predecessors, (16), 4 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) 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-13 09:21:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:07,532 INFO L93 Difference]: Finished difference Result 921 states and 1486 transitions. [2024-10-13 09:21:07,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 09:21:07,535 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-13 09:21:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:07,557 INFO L225 Difference]: With dead ends: 921 [2024-10-13 09:21:07,558 INFO L226 Difference]: Without dead ends: 458 [2024-10-13 09:21:07,566 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 09:21:07,572 INFO L432 NwaCegarLoop]: 647 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:07,573 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 647 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 09:21:07,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-13 09:21:07,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 458. [2024-10-13 09:21:07,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 435 states have (on average 1.4344827586206896) internal successors, (624), 439 states have internal predecessors, (624), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:07,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 654 transitions. [2024-10-13 09:21:07,662 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 654 transitions. Word has length 7 [2024-10-13 09:21:07,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:07,663 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 654 transitions. [2024-10-13 09:21:07,664 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-13 09:21:07,664 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 654 transitions. [2024-10-13 09:21:07,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-13 09:21:07,665 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:07,665 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:07,665 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 09:21:07,667 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-13 09:21:07,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:07,668 INFO L85 PathProgramCache]: Analyzing trace with hash 215496090, now seen corresponding path program 1 times [2024-10-13 09:21:07,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:07,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644398694] [2024-10-13 09:21:07,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:07,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:07,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:07,899 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:07,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:07,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644398694] [2024-10-13 09:21:07,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644398694] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:07,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:07,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 09:21:07,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96712393] [2024-10-13 09:21:07,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:07,902 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:21:07,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:07,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:21:07,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:21:07,903 INFO L87 Difference]: Start difference. First operand 458 states and 654 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-13 09:21:08,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:08,174 INFO L93 Difference]: Finished difference Result 1141 states and 1637 transitions. [2024-10-13 09:21:08,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:21:08,174 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-13 09:21:08,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:08,181 INFO L225 Difference]: With dead ends: 1141 [2024-10-13 09:21:08,182 INFO L226 Difference]: Without dead ends: 894 [2024-10-13 09:21:08,183 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:21:08,185 INFO L432 NwaCegarLoop]: 721 mSDtfsCounter, 602 mSDsluCounter, 1338 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 616 SdHoareTripleChecker+Valid, 2059 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:08,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [616 Valid, 2059 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 09:21:08,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2024-10-13 09:21:08,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 460. [2024-10-13 09:21:08,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 460 states, 437 states have (on average 1.4324942791762014) internal successors, (626), 441 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:08,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 656 transitions. [2024-10-13 09:21:08,238 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 656 transitions. Word has length 9 [2024-10-13 09:21:08,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:08,241 INFO L471 AbstractCegarLoop]: Abstraction has 460 states and 656 transitions. [2024-10-13 09:21:08,241 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-13 09:21:08,241 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 656 transitions. [2024-10-13 09:21:08,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 09:21:08,243 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:08,243 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-13 09:21:08,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 09:21:08,243 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-13 09:21:08,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:08,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1344700540, now seen corresponding path program 1 times [2024-10-13 09:21:08,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:08,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346863495] [2024-10-13 09:21:08,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:08,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:08,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:08,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:08,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:08,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346863495] [2024-10-13 09:21:08,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346863495] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:08,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:08,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:21:08,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528946147] [2024-10-13 09:21:08,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:08,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:21:08,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:08,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:21:08,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:21:08,579 INFO L87 Difference]: Start difference. First operand 460 states and 656 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-13 09:21:08,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:08,700 INFO L93 Difference]: Finished difference Result 875 states and 1243 transitions. [2024-10-13 09:21:08,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:21:08,701 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-13 09:21:08,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:08,704 INFO L225 Difference]: With dead ends: 875 [2024-10-13 09:21:08,704 INFO L226 Difference]: Without dead ends: 418 [2024-10-13 09:21:08,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 09:21:08,706 INFO L432 NwaCegarLoop]: 541 mSDtfsCounter, 36 mSDsluCounter, 1070 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 1611 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:08,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 1611 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:21:08,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2024-10-13 09:21:08,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2024-10-13 09:21:08,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 395 states have (on average 1.389873417721519) internal successors, (549), 399 states have internal predecessors, (549), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 579 transitions. [2024-10-13 09:21:08,719 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 579 transitions. Word has length 64 [2024-10-13 09:21:08,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:08,719 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 579 transitions. [2024-10-13 09:21:08,720 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-13 09:21:08,720 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 579 transitions. [2024-10-13 09:21:08,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 09:21:08,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:08,722 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-13 09:21:08,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 09:21:08,722 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-13 09:21:08,723 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:08,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1676463336, now seen corresponding path program 1 times [2024-10-13 09:21:08,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:08,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621120520] [2024-10-13 09:21:08,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:08,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:08,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:08,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:08,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:08,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621120520] [2024-10-13 09:21:08,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621120520] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:08,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:08,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:21:08,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271221482] [2024-10-13 09:21:08,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:08,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:21:08,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:08,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:21:08,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:21:08,853 INFO L87 Difference]: Start difference. First operand 418 states and 579 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-13 09:21:08,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:08,947 INFO L93 Difference]: Finished difference Result 827 states and 1149 transitions. [2024-10-13 09:21:08,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 09:21:08,949 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-13 09:21:08,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:08,975 INFO L225 Difference]: With dead ends: 827 [2024-10-13 09:21:08,977 INFO L226 Difference]: Without dead ends: 412 [2024-10-13 09:21:08,978 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-13 09:21:08,979 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 9 mSDsluCounter, 1069 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:08,979 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1612 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:21:08,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-10-13 09:21:08,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2024-10-13 09:21:08,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 389 states have (on average 1.3856041131105399) internal successors, (539), 393 states have internal predecessors, (539), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 569 transitions. [2024-10-13 09:21:08,993 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 569 transitions. Word has length 64 [2024-10-13 09:21:08,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:08,995 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 569 transitions. [2024-10-13 09:21:08,995 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-13 09:21:08,995 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 569 transitions. [2024-10-13 09:21:08,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-13 09:21:08,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:09,000 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-13 09:21:09,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 09:21:09,000 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-13 09:21:09,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:09,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1873954576, now seen corresponding path program 1 times [2024-10-13 09:21:09,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:09,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650418028] [2024-10-13 09:21:09,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:09,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:09,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:09,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:09,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650418028] [2024-10-13 09:21:09,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650418028] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:09,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:09,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:21:09,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942184521] [2024-10-13 09:21:09,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:09,447 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:21:09,447 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:09,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:21:09,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:21:09,449 INFO L87 Difference]: Start difference. First operand 412 states and 569 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-13 09:21:09,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:09,866 INFO L93 Difference]: Finished difference Result 826 states and 1143 transitions. [2024-10-13 09:21:09,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:21:09,868 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-13 09:21:09,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:09,871 INFO L225 Difference]: With dead ends: 826 [2024-10-13 09:21:09,871 INFO L226 Difference]: Without dead ends: 417 [2024-10-13 09:21:09,872 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-13 09:21:09,876 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 10 mSDsluCounter, 1887 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2431 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:09,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2431 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:21:09,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-13 09:21:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 414. [2024-10-13 09:21:09,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 391 states have (on average 1.3836317135549872) internal successors, (541), 395 states have internal predecessors, (541), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:09,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 571 transitions. [2024-10-13 09:21:09,894 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 571 transitions. Word has length 64 [2024-10-13 09:21:09,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:09,894 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 571 transitions. [2024-10-13 09:21:09,895 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-13 09:21:09,895 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 571 transitions. [2024-10-13 09:21:09,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 09:21:09,896 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:09,896 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-13 09:21:09,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 09:21:09,897 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-13 09:21:09,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:09,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1439444555, now seen corresponding path program 1 times [2024-10-13 09:21:09,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:09,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689024894] [2024-10-13 09:21:09,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:09,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:09,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:10,289 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:10,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:10,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689024894] [2024-10-13 09:21:10,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689024894] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:10,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:10,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 09:21:10,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46211458] [2024-10-13 09:21:10,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:10,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 09:21:10,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:10,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 09:21:10,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 09:21:10,293 INFO L87 Difference]: Start difference. First operand 414 states and 571 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-13 09:21:10,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:10,440 INFO L93 Difference]: Finished difference Result 825 states and 1139 transitions. [2024-10-13 09:21:10,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 09:21:10,440 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-13 09:21:10,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:10,443 INFO L225 Difference]: With dead ends: 825 [2024-10-13 09:21:10,443 INFO L226 Difference]: Without dead ends: 414 [2024-10-13 09:21:10,444 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-13 09:21:10,446 INFO L432 NwaCegarLoop]: 549 mSDtfsCounter, 13 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1524 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:10,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1524 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 09:21:10,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2024-10-13 09:21:10,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2024-10-13 09:21:10,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 391 states have (on average 1.381074168797954) internal successors, (540), 395 states have internal predecessors, (540), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:10,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 570 transitions. [2024-10-13 09:21:10,462 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 570 transitions. Word has length 65 [2024-10-13 09:21:10,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:10,464 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 570 transitions. [2024-10-13 09:21:10,464 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-13 09:21:10,464 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 570 transitions. [2024-10-13 09:21:10,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-13 09:21:10,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:10,467 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-13 09:21:10,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 09:21:10,468 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-13 09:21:10,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:10,468 INFO L85 PathProgramCache]: Analyzing trace with hash -395161161, now seen corresponding path program 1 times [2024-10-13 09:21:10,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:10,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510226386] [2024-10-13 09:21:10,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:10,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:10,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:10,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:10,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:10,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510226386] [2024-10-13 09:21:10,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510226386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:10,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:10,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:21:10,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504242139] [2024-10-13 09:21:10,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:10,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:21:10,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:10,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:21:10,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:21:10,788 INFO L87 Difference]: Start difference. First operand 414 states and 570 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-13 09:21:11,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:11,175 INFO L93 Difference]: Finished difference Result 830 states and 1145 transitions. [2024-10-13 09:21:11,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:21:11,177 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-13 09:21:11,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:11,180 INFO L225 Difference]: With dead ends: 830 [2024-10-13 09:21:11,181 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 09:21:11,183 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-13 09:21:11,184 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 10 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 442 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:11,185 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2917 Invalid, 443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 442 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:21:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 09:21:11,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 418. [2024-10-13 09:21:11,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 395 states have (on average 1.379746835443038) internal successors, (545), 399 states have internal predecessors, (545), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:11,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 575 transitions. [2024-10-13 09:21:11,200 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 575 transitions. Word has length 65 [2024-10-13 09:21:11,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:11,201 INFO L471 AbstractCegarLoop]: Abstraction has 418 states and 575 transitions. [2024-10-13 09:21:11,202 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-13 09:21:11,202 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 575 transitions. [2024-10-13 09:21:11,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 09:21:11,203 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:11,203 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-13 09:21:11,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 09:21:11,204 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-13 09:21:11,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:11,204 INFO L85 PathProgramCache]: Analyzing trace with hash -1465365099, now seen corresponding path program 1 times [2024-10-13 09:21:11,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:11,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182505543] [2024-10-13 09:21:11,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:11,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:11,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:11,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:11,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182505543] [2024-10-13 09:21:11,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182505543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:11,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:11,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 09:21:11,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263850471] [2024-10-13 09:21:11,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:11,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 09:21:11,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:11,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 09:21:11,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 09:21:11,489 INFO L87 Difference]: Start difference. First operand 418 states and 575 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-13 09:21:11,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:11,731 INFO L93 Difference]: Finished difference Result 836 states and 1152 transitions. [2024-10-13 09:21:11,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 09:21:11,733 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-13 09:21:11,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:11,735 INFO L225 Difference]: With dead ends: 836 [2024-10-13 09:21:11,736 INFO L226 Difference]: Without dead ends: 421 [2024-10-13 09:21:11,737 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-13 09:21:11,739 INFO L432 NwaCegarLoop]: 550 mSDtfsCounter, 4 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1996 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:11,739 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1996 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 09:21:11,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 421 states. [2024-10-13 09:21:11,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 421 to 421. [2024-10-13 09:21:11,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 421 states, 398 states have (on average 1.3768844221105527) internal successors, (548), 402 states have internal predecessors, (548), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:11,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 578 transitions. [2024-10-13 09:21:11,755 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 578 transitions. Word has length 66 [2024-10-13 09:21:11,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:11,756 INFO L471 AbstractCegarLoop]: Abstraction has 421 states and 578 transitions. [2024-10-13 09:21:11,756 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-13 09:21:11,759 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 578 transitions. [2024-10-13 09:21:11,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 09:21:11,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:11,760 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-13 09:21:11,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 09:21:11,761 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-13 09:21:11,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:11,761 INFO L85 PathProgramCache]: Analyzing trace with hash 55631932, now seen corresponding path program 1 times [2024-10-13 09:21:11,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:11,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090500360] [2024-10-13 09:21:11,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:11,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:12,185 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:12,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:12,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090500360] [2024-10-13 09:21:12,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090500360] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:12,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:12,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:21:12,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496736252] [2024-10-13 09:21:12,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:12,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:21:12,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:12,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:21:12,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:21:12,189 INFO L87 Difference]: Start difference. First operand 421 states and 578 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-13 09:21:12,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:12,726 INFO L93 Difference]: Finished difference Result 852 states and 1174 transitions. [2024-10-13 09:21:12,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 09:21:12,727 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-13 09:21:12,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:12,730 INFO L225 Difference]: With dead ends: 852 [2024-10-13 09:21:12,730 INFO L226 Difference]: Without dead ends: 434 [2024-10-13 09:21:12,731 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-13 09:21:12,732 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 30 mSDsluCounter, 3397 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3936 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:12,732 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3936 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 593 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:21:12,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-13 09:21:12,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 431. [2024-10-13 09:21:12,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 431 states, 408 states have (on average 1.3774509803921569) internal successors, (562), 412 states have internal predecessors, (562), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 592 transitions. [2024-10-13 09:21:12,743 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 592 transitions. Word has length 66 [2024-10-13 09:21:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:12,743 INFO L471 AbstractCegarLoop]: Abstraction has 431 states and 592 transitions. [2024-10-13 09:21:12,744 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-13 09:21:12,744 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 592 transitions. [2024-10-13 09:21:12,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-13 09:21:12,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:12,745 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-13 09:21:12,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 09:21:12,746 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-13 09:21:12,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1668302933, now seen corresponding path program 1 times [2024-10-13 09:21:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:12,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218937829] [2024-10-13 09:21:12,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:12,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:13,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:13,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:13,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218937829] [2024-10-13 09:21:13,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218937829] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:13,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:13,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:21:13,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248307406] [2024-10-13 09:21:13,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:13,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 09:21:13,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:13,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 09:21:13,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:21:13,263 INFO L87 Difference]: Start difference. First operand 431 states and 592 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-13 09:21:13,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:13,638 INFO L93 Difference]: Finished difference Result 862 states and 1186 transitions. [2024-10-13 09:21:13,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 09:21:13,639 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-13 09:21:13,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:13,641 INFO L225 Difference]: With dead ends: 862 [2024-10-13 09:21:13,641 INFO L226 Difference]: Without dead ends: 434 [2024-10-13 09:21:13,642 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-13 09:21:13,643 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 23 mSDsluCounter, 2428 mSDsCounter, 0 mSdLazyCounter, 390 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 2971 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 390 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:13,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 2971 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 390 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:21:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-10-13 09:21:13,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2024-10-13 09:21:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 411 states have (on average 1.3746958637469586) internal successors, (565), 415 states have internal predecessors, (565), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 595 transitions. [2024-10-13 09:21:13,655 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 595 transitions. Word has length 66 [2024-10-13 09:21:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:13,655 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 595 transitions. [2024-10-13 09:21:13,655 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-13 09:21:13,656 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 595 transitions. [2024-10-13 09:21:13,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 09:21:13,656 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:13,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] [2024-10-13 09:21:13,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 09:21:13,657 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-13 09:21:13,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:13,658 INFO L85 PathProgramCache]: Analyzing trace with hash -267751346, now seen corresponding path program 1 times [2024-10-13 09:21:13,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:13,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [839547838] [2024-10-13 09:21:13,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:13,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:13,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:13,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:13,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [839547838] [2024-10-13 09:21:13,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [839547838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:13,914 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:13,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:21:13,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417148735] [2024-10-13 09:21:13,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:13,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:21:13,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:13,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:21:13,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:21:13,915 INFO L87 Difference]: Start difference. First operand 434 states and 595 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-13 09:21:14,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:14,277 INFO L93 Difference]: Finished difference Result 870 states and 1195 transitions. [2024-10-13 09:21:14,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:21:14,278 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-13 09:21:14,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:14,280 INFO L225 Difference]: With dead ends: 870 [2024-10-13 09:21:14,280 INFO L226 Difference]: Without dead ends: 439 [2024-10-13 09:21:14,281 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 09:21:14,282 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 9 mSDsluCounter, 2379 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2923 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:14,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2923 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:21:14,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2024-10-13 09:21:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 434. [2024-10-13 09:21:14,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 411 states have (on average 1.3746958637469586) internal successors, (565), 415 states have internal predecessors, (565), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 595 transitions. [2024-10-13 09:21:14,294 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 595 transitions. Word has length 67 [2024-10-13 09:21:14,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:14,294 INFO L471 AbstractCegarLoop]: Abstraction has 434 states and 595 transitions. [2024-10-13 09:21:14,295 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-13 09:21:14,295 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 595 transitions. [2024-10-13 09:21:14,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-13 09:21:14,296 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:14,296 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 09:21:14,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 09:21:14,296 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-13 09:21:14,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:14,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1004481798, now seen corresponding path program 1 times [2024-10-13 09:21:14,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:14,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983556524] [2024-10-13 09:21:14,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:14,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:14,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:14,858 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:14,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:14,859 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983556524] [2024-10-13 09:21:14,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983556524] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:14,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:14,859 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 09:21:14,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953324735] [2024-10-13 09:21:14,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:14,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:21:14,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:14,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:21:14,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:21:14,861 INFO L87 Difference]: Start difference. First operand 434 states and 595 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-13 09:21:15,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:15,714 INFO L93 Difference]: Finished difference Result 1258 states and 1737 transitions. [2024-10-13 09:21:15,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:15,715 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-13 09:21:15,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:15,719 INFO L225 Difference]: With dead ends: 1258 [2024-10-13 09:21:15,719 INFO L226 Difference]: Without dead ends: 827 [2024-10-13 09:21:15,722 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-13 09:21:15,722 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 646 mSDsluCounter, 2472 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 658 SdHoareTripleChecker+Valid, 3045 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:15,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [658 Valid, 3045 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 09:21:15,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2024-10-13 09:21:15,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 465. [2024-10-13 09:21:15,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 465 states, 442 states have (on average 1.3484162895927603) internal successors, (596), 446 states have internal predecessors, (596), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:15,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 465 states to 465 states and 626 transitions. [2024-10-13 09:21:15,740 INFO L78 Accepts]: Start accepts. Automaton has 465 states and 626 transitions. Word has length 67 [2024-10-13 09:21:15,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:15,740 INFO L471 AbstractCegarLoop]: Abstraction has 465 states and 626 transitions. [2024-10-13 09:21:15,741 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-13 09:21:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 465 states and 626 transitions. [2024-10-13 09:21:15,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 09:21:15,741 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:15,741 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-13 09:21:15,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 09:21:15,742 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-13 09:21:15,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:15,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1868095393, now seen corresponding path program 1 times [2024-10-13 09:21:15,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:15,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [495735300] [2024-10-13 09:21:15,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:15,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:16,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:16,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:16,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [495735300] [2024-10-13 09:21:16,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [495735300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:16,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:16,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:21:16,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908413166] [2024-10-13 09:21:16,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:16,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:21:16,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:16,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:21:16,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:21:16,095 INFO L87 Difference]: Start difference. First operand 465 states and 626 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-13 09:21:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:16,414 INFO L93 Difference]: Finished difference Result 906 states and 1232 transitions. [2024-10-13 09:21:16,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 09:21:16,415 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-13 09:21:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:16,417 INFO L225 Difference]: With dead ends: 906 [2024-10-13 09:21:16,418 INFO L226 Difference]: Without dead ends: 475 [2024-10-13 09:21:16,419 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-13 09:21:16,419 INFO L432 NwaCegarLoop]: 538 mSDtfsCounter, 16 mSDsluCounter, 2474 mSDsCounter, 0 mSdLazyCounter, 419 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3012 SdHoareTripleChecker+Invalid, 420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 419 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:16,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3012 Invalid, 420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 419 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:21:16,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-13 09:21:16,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 468. [2024-10-13 09:21:16,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.348314606741573) internal successors, (600), 449 states have internal predecessors, (600), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:16,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 630 transitions. [2024-10-13 09:21:16,433 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 630 transitions. Word has length 68 [2024-10-13 09:21:16,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:16,434 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 630 transitions. [2024-10-13 09:21:16,434 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-13 09:21:16,434 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 630 transitions. [2024-10-13 09:21:16,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-13 09:21:16,435 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:16,435 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-13 09:21:16,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 09:21:16,435 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-13 09:21:16,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:16,436 INFO L85 PathProgramCache]: Analyzing trace with hash -289631099, now seen corresponding path program 1 times [2024-10-13 09:21:16,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:16,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757493386] [2024-10-13 09:21:16,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:16,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:16,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:16,704 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:16,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:16,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757493386] [2024-10-13 09:21:16,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757493386] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:16,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:16,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:21:16,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162134323] [2024-10-13 09:21:16,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:16,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:21:16,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:16,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:21:16,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:21:16,707 INFO L87 Difference]: Start difference. First operand 468 states and 630 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-13 09:21:17,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:17,238 INFO L93 Difference]: Finished difference Result 912 states and 1240 transitions. [2024-10-13 09:21:17,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:17,239 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-13 09:21:17,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:17,242 INFO L225 Difference]: With dead ends: 912 [2024-10-13 09:21:17,242 INFO L226 Difference]: Without dead ends: 478 [2024-10-13 09:21:17,244 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-13 09:21:17,244 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 26 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 689 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 691 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:17,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3872 Invalid, 691 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 689 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:21:17,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2024-10-13 09:21:17,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 468. [2024-10-13 09:21:17,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 445 states have (on average 1.348314606741573) internal successors, (600), 449 states have internal predecessors, (600), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 630 transitions. [2024-10-13 09:21:17,262 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 630 transitions. Word has length 68 [2024-10-13 09:21:17,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:17,263 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 630 transitions. [2024-10-13 09:21:17,263 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-13 09:21:17,263 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 630 transitions. [2024-10-13 09:21:17,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:21:17,264 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:17,264 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-13 09:21:17,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 09:21:17,265 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-13 09:21:17,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:17,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1391773950, now seen corresponding path program 1 times [2024-10-13 09:21:17,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:17,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425183607] [2024-10-13 09:21:17,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:17,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:17,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:17,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-13 09:21:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425183607] [2024-10-13 09:21:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425183607] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:21:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578032430] [2024-10-13 09:21:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:17,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:21:17,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:17,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:21:17,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:21:17,605 INFO L87 Difference]: Start difference. First operand 468 states and 630 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-13 09:21:18,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:18,075 INFO L93 Difference]: Finished difference Result 918 states and 1249 transitions. [2024-10-13 09:21:18,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:18,076 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-13 09:21:18,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:18,078 INFO L225 Difference]: With dead ends: 918 [2024-10-13 09:21:18,079 INFO L226 Difference]: Without dead ends: 484 [2024-10-13 09:21:18,081 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-13 09:21:18,081 INFO L432 NwaCegarLoop]: 545 mSDtfsCounter, 22 mSDsluCounter, 2923 mSDsCounter, 0 mSdLazyCounter, 598 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3468 SdHoareTripleChecker+Invalid, 599 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 598 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:18,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3468 Invalid, 599 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 598 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:21:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-13 09:21:18,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 478. [2024-10-13 09:21:18,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 455 states have (on average 1.3450549450549452) internal successors, (612), 459 states have internal predecessors, (612), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:18,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 642 transitions. [2024-10-13 09:21:18,096 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 642 transitions. Word has length 69 [2024-10-13 09:21:18,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:18,097 INFO L471 AbstractCegarLoop]: Abstraction has 478 states and 642 transitions. [2024-10-13 09:21:18,097 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-13 09:21:18,097 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 642 transitions. [2024-10-13 09:21:18,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:21:18,097 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:18,097 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-13 09:21:18,098 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 09:21:18,098 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-13 09:21:18,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:18,099 INFO L85 PathProgramCache]: Analyzing trace with hash -1073237862, now seen corresponding path program 1 times [2024-10-13 09:21:18,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:18,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604306131] [2024-10-13 09:21:18,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:18,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:18,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:18,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:18,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:18,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604306131] [2024-10-13 09:21:18,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604306131] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:18,414 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:18,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:21:18,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85703191] [2024-10-13 09:21:18,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:18,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:21:18,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:18,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:21:18,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:21:18,415 INFO L87 Difference]: Start difference. First operand 478 states and 642 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-13 09:21:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:18,932 INFO L93 Difference]: Finished difference Result 938 states and 1273 transitions. [2024-10-13 09:21:18,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:18,933 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-13 09:21:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:18,937 INFO L225 Difference]: With dead ends: 938 [2024-10-13 09:21:18,937 INFO L226 Difference]: Without dead ends: 494 [2024-10-13 09:21:18,938 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-13 09:21:18,939 INFO L432 NwaCegarLoop]: 531 mSDtfsCounter, 13 mSDsluCounter, 3856 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4387 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:18,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4387 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 728 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:21:18,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-13 09:21:18,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 481. [2024-10-13 09:21:18,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 458 states have (on average 1.3449781659388647) internal successors, (616), 462 states have internal predecessors, (616), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:18,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 646 transitions. [2024-10-13 09:21:18,961 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 646 transitions. Word has length 69 [2024-10-13 09:21:18,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:18,962 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 646 transitions. [2024-10-13 09:21:18,962 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-13 09:21:18,962 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 646 transitions. [2024-10-13 09:21:18,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:21:18,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:18,964 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-13 09:21:18,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 09:21:18,964 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-13 09:21:18,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:18,965 INFO L85 PathProgramCache]: Analyzing trace with hash 1723676698, now seen corresponding path program 1 times [2024-10-13 09:21:18,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:18,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649969220] [2024-10-13 09:21:18,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:18,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:19,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:19,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:19,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:19,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649969220] [2024-10-13 09:21:19,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649969220] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:19,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:19,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:21:19,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440798807] [2024-10-13 09:21:19,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:19,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:21:19,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:19,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:21:19,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:21:19,342 INFO L87 Difference]: Start difference. First operand 481 states and 646 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-13 09:21:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:19,662 INFO L93 Difference]: Finished difference Result 933 states and 1263 transitions. [2024-10-13 09:21:19,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:21:19,662 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-13 09:21:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:19,665 INFO L225 Difference]: With dead ends: 933 [2024-10-13 09:21:19,665 INFO L226 Difference]: Without dead ends: 486 [2024-10-13 09:21:19,666 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-13 09:21:19,667 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 7 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2947 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:19,667 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2947 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:21:19,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2024-10-13 09:21:19,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 481. [2024-10-13 09:21:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 458 states have (on average 1.3427947598253276) internal successors, (615), 462 states have internal predecessors, (615), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 645 transitions. [2024-10-13 09:21:19,686 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 645 transitions. Word has length 69 [2024-10-13 09:21:19,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:19,687 INFO L471 AbstractCegarLoop]: Abstraction has 481 states and 645 transitions. [2024-10-13 09:21:19,687 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-13 09:21:19,687 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 645 transitions. [2024-10-13 09:21:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-13 09:21:19,688 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:19,688 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-13 09:21:19,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 09:21:19,688 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-13 09:21:19,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:19,689 INFO L85 PathProgramCache]: Analyzing trace with hash -958619597, now seen corresponding path program 1 times [2024-10-13 09:21:19,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:19,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766504612] [2024-10-13 09:21:19,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:19,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:19,949 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:19,949 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:19,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766504612] [2024-10-13 09:21:19,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766504612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:19,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:19,950 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 09:21:19,950 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310840212] [2024-10-13 09:21:19,950 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:19,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 09:21:19,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:19,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 09:21:19,951 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 09:21:19,952 INFO L87 Difference]: Start difference. First operand 481 states and 645 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-13 09:21:20,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:20,305 INFO L93 Difference]: Finished difference Result 931 states and 1261 transitions. [2024-10-13 09:21:20,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 09:21:20,306 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-13 09:21:20,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:20,309 INFO L225 Difference]: With dead ends: 931 [2024-10-13 09:21:20,309 INFO L226 Difference]: Without dead ends: 484 [2024-10-13 09:21:20,310 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-13 09:21:20,311 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 4 mSDsluCounter, 2363 mSDsCounter, 0 mSdLazyCounter, 469 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2906 SdHoareTripleChecker+Invalid, 470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:20,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2906 Invalid, 470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 469 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 09:21:20,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 484 states. [2024-10-13 09:21:20,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 484 to 484. [2024-10-13 09:21:20,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 461 states have (on average 1.3405639913232104) internal successors, (618), 465 states have internal predecessors, (618), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:20,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 648 transitions. [2024-10-13 09:21:20,325 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 648 transitions. Word has length 69 [2024-10-13 09:21:20,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:20,325 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 648 transitions. [2024-10-13 09:21:20,325 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-13 09:21:20,326 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 648 transitions. [2024-10-13 09:21:20,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:21:20,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:20,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-13 09:21:20,327 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 09:21:20,327 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-13 09:21:20,327 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 710707364, now seen corresponding path program 1 times [2024-10-13 09:21:20,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:20,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246381711] [2024-10-13 09:21:20,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:20,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:20,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:20,759 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:20,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:20,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246381711] [2024-10-13 09:21:20,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246381711] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:20,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:20,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:21:20,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402901879] [2024-10-13 09:21:20,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:20,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:21:20,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:20,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:21:20,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:21:20,761 INFO L87 Difference]: Start difference. First operand 484 states and 648 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-13 09:21:21,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:21,320 INFO L93 Difference]: Finished difference Result 946 states and 1280 transitions. [2024-10-13 09:21:21,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:21,320 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-13 09:21:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:21,323 INFO L225 Difference]: With dead ends: 946 [2024-10-13 09:21:21,323 INFO L226 Difference]: Without dead ends: 496 [2024-10-13 09:21:21,325 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-13 09:21:21,325 INFO L432 NwaCegarLoop]: 542 mSDtfsCounter, 9 mSDsluCounter, 3371 mSDsCounter, 0 mSdLazyCounter, 708 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3913 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:21,325 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3913 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 708 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:21:21,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-13 09:21:21,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 488. [2024-10-13 09:21:21,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 465 states have (on average 1.3397849462365592) internal successors, (623), 469 states have internal predecessors, (623), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:21,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 653 transitions. [2024-10-13 09:21:21,343 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 653 transitions. Word has length 70 [2024-10-13 09:21:21,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:21,343 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 653 transitions. [2024-10-13 09:21:21,344 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-13 09:21:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 653 transitions. [2024-10-13 09:21:21,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:21:21,344 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:21,345 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-13 09:21:21,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 09:21:21,346 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-13 09:21:21,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:21,347 INFO L85 PathProgramCache]: Analyzing trace with hash -1655686255, now seen corresponding path program 1 times [2024-10-13 09:21:21,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:21,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143207750] [2024-10-13 09:21:21,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:21,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:21,730 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:21,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:21,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143207750] [2024-10-13 09:21:21,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143207750] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:21,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:21,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 09:21:21,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502788067] [2024-10-13 09:21:21,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:21,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 09:21:21,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:21,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 09:21:21,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-13 09:21:21,732 INFO L87 Difference]: Start difference. First operand 488 states and 653 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-13 09:21:22,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:22,284 INFO L93 Difference]: Finished difference Result 955 states and 1290 transitions. [2024-10-13 09:21:22,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:22,285 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-13 09:21:22,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:22,289 INFO L225 Difference]: With dead ends: 955 [2024-10-13 09:21:22,289 INFO L226 Difference]: Without dead ends: 501 [2024-10-13 09:21:22,290 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-13 09:21:22,291 INFO L432 NwaCegarLoop]: 539 mSDtfsCounter, 22 mSDsluCounter, 4382 mSDsCounter, 0 mSdLazyCounter, 822 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4921 SdHoareTripleChecker+Invalid, 823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 822 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:22,291 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4921 Invalid, 823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 822 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 09:21:22,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-13 09:21:22,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 491. [2024-10-13 09:21:22,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 468 states have (on average 1.3376068376068375) internal successors, (626), 472 states have internal predecessors, (626), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:22,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 656 transitions. [2024-10-13 09:21:22,308 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 656 transitions. Word has length 70 [2024-10-13 09:21:22,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:22,308 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 656 transitions. [2024-10-13 09:21:22,308 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-13 09:21:22,308 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 656 transitions. [2024-10-13 09:21:22,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:21:22,309 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:22,309 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-13 09:21:22,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 09:21:22,310 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-13 09:21:22,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:22,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1604752520, now seen corresponding path program 1 times [2024-10-13 09:21:22,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:22,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832438649] [2024-10-13 09:21:22,310 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:22,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:22,853 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:22,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:22,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832438649] [2024-10-13 09:21:22,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832438649] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:22,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:22,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 09:21:22,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916145887] [2024-10-13 09:21:22,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:22,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 09:21:22,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:22,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 09:21:22,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-13 09:21:22,857 INFO L87 Difference]: Start difference. First operand 491 states and 656 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-13 09:21:23,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:23,714 INFO L93 Difference]: Finished difference Result 954 states and 1286 transitions. [2024-10-13 09:21:23,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:23,715 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-13 09:21:23,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:23,719 INFO L225 Difference]: With dead ends: 954 [2024-10-13 09:21:23,719 INFO L226 Difference]: Without dead ends: 497 [2024-10-13 09:21:23,720 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-13 09:21:23,721 INFO L432 NwaCegarLoop]: 536 mSDtfsCounter, 33 mSDsluCounter, 3777 mSDsCounter, 0 mSdLazyCounter, 761 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 4313 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:23,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 4313 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 761 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 09:21:23,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-10-13 09:21:23,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 492. [2024-10-13 09:21:23,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 492 states, 469 states have (on average 1.3368869936034116) internal successors, (627), 473 states have internal predecessors, (627), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:23,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 492 states to 492 states and 657 transitions. [2024-10-13 09:21:23,743 INFO L78 Accepts]: Start accepts. Automaton has 492 states and 657 transitions. Word has length 70 [2024-10-13 09:21:23,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:23,744 INFO L471 AbstractCegarLoop]: Abstraction has 492 states and 657 transitions. [2024-10-13 09:21:23,744 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-13 09:21:23,744 INFO L276 IsEmpty]: Start isEmpty. Operand 492 states and 657 transitions. [2024-10-13 09:21:23,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:21:23,744 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:23,745 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-13 09:21:23,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 09:21:23,745 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-13 09:21:23,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:23,745 INFO L85 PathProgramCache]: Analyzing trace with hash -231710400, now seen corresponding path program 1 times [2024-10-13 09:21:23,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:23,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018137273] [2024-10-13 09:21:23,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:23,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:23,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:23,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:23,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018137273] [2024-10-13 09:21:23,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018137273] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:23,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:23,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 09:21:23,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961809951] [2024-10-13 09:21:23,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:23,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 09:21:23,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:23,988 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 09:21:23,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-13 09:21:23,988 INFO L87 Difference]: Start difference. First operand 492 states and 657 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-13 09:21:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 09:21:24,474 INFO L93 Difference]: Finished difference Result 959 states and 1293 transitions. [2024-10-13 09:21:24,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 09:21:24,476 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-13 09:21:24,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 09:21:24,479 INFO L225 Difference]: With dead ends: 959 [2024-10-13 09:21:24,479 INFO L226 Difference]: Without dead ends: 501 [2024-10-13 09:21:24,480 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-13 09:21:24,480 INFO L432 NwaCegarLoop]: 543 mSDtfsCounter, 22 mSDsluCounter, 3329 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3872 SdHoareTripleChecker+Invalid, 669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 09:21:24,481 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3872 Invalid, 669 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 09:21:24,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 501 states. [2024-10-13 09:21:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 501 to 489. [2024-10-13 09:21:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 466 states have (on average 1.3390557939914163) internal successors, (624), 470 states have internal predecessors, (624), 15 states have call successors, (15), 4 states have call predecessors, (15), 4 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-13 09:21:24,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 654 transitions. [2024-10-13 09:21:24,496 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 654 transitions. Word has length 70 [2024-10-13 09:21:24,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 09:21:24,497 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 654 transitions. [2024-10-13 09:21:24,497 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-13 09:21:24,497 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 654 transitions. [2024-10-13 09:21:24,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-13 09:21:24,497 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 09:21:24,498 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-13 09:21:24,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 09:21:24,498 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-13 09:21:24,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 09:21:24,499 INFO L85 PathProgramCache]: Analyzing trace with hash -834701604, now seen corresponding path program 1 times [2024-10-13 09:21:24,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 09:21:24,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486129982] [2024-10-13 09:21:24,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 09:21:24,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 09:21:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 09:21:50,127 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-13 09:21:50,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 09:21:50,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 09:21:50,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486129982] [2024-10-13 09:21:50,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486129982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 09:21:50,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 09:21:50,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 09:21:50,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108228825] [2024-10-13 09:21:50,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 09:21:50,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 09:21:50,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 09:21:50,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 09:21:50,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=72, Unknown=1, NotChecked=16, Total=110 [2024-10-13 09:21:50,191 INFO L87 Difference]: Start difference. First operand 489 states and 654 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-13 09:21:51,646 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 [] [2024-10-13 09:21:55,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers []