./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_OAT_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 16:34:58,461 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 16:34:58,513 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 16:34:58,518 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 16:34:58,518 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 16:34:58,550 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 16:34:58,551 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 16:34:58,551 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 16:34:58,552 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 16:34:58,552 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 16:34:58,552 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 16:34:58,553 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 16:34:58,554 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 16:34:58,555 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 16:34:58,557 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 16:34:58,557 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 16:34:58,557 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 16:34:58,558 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 16:34:58,558 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 16:34:58,558 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 16:34:58,558 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 16:34:58,559 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 16:34:58,559 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 16:34:58,560 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 16:34:58,560 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 16:34:58,560 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 16:34:58,560 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 16:34:58,560 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 16:34:58,561 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 16:34:58,561 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 16:34:58,561 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 16:34:58,561 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 16:34:58,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:34:58,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 16:34:58,563 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 16:34:58,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 16:34:58,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 16:34:58,564 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 16:34:58,564 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 16:34:58,564 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 16:34:58,564 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 16:34:58,565 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 16:34:58,565 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ac848265e1daab3ca0f2905a3d0d6fdafaee38399ca7123ad8517babc999ef80 [2024-10-11 16:34:58,881 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 16:34:58,908 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 16:34:58,911 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 16:34:58,912 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 16:34:58,912 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 16:34:58,914 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2024-10-11 16:35:00,331 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 16:35:00,652 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 16:35:00,652 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_OAT_test6-1.i [2024-10-11 16:35:00,676 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/319cade41/09bb89b0802c494ba093bdd4d4042b70/FLAG55f3f45bf [2024-10-11 16:35:00,690 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/319cade41/09bb89b0802c494ba093bdd4d4042b70 [2024-10-11 16:35:00,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 16:35:00,694 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 16:35:00,695 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 16:35:00,695 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 16:35:00,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 16:35:00,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:35:00" (1/1) ... [2024-10-11 16:35:00,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b1e514b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:00, skipping insertion in model container [2024-10-11 16:35:00,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 04:35:00" (1/1) ... [2024-10-11 16:35:00,772 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 16:35:01,281 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_OAT_test6-1.i[44118,44131] [2024-10-11 16:35:01,293 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_OAT_test6-1.i[44660,44673] [2024-10-11 16:35:01,421 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_OAT_test6-1.i[56247,56260] [2024-10-11 16:35:01,423 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_OAT_test6-1.i[56368,56381] [2024-10-11 16:35:01,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:35:01,454 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 16:35:01,512 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_OAT_test6-1.i[44118,44131] [2024-10-11 16:35:01,514 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_OAT_test6-1.i[44660,44673] [2024-10-11 16:35:01,568 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_OAT_test6-1.i[56247,56260] [2024-10-11 16:35:01,569 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_OAT_test6-1.i[56368,56381] [2024-10-11 16:35:01,572 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 16:35:01,632 INFO L204 MainTranslator]: Completed translation [2024-10-11 16:35:01,633 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01 WrapperNode [2024-10-11 16:35:01,633 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 16:35:01,634 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 16:35:01,634 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 16:35:01,634 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 16:35:01,639 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,669 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,742 INFO L138 Inliner]: procedures = 282, calls = 286, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1468 [2024-10-11 16:35:01,743 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 16:35:01,744 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 16:35:01,744 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 16:35:01,744 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 16:35:01,758 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,878 INFO L175 MemorySlicer]: Split 259 memory accesses to 4 slices as follows [2, 3, 34, 220]. 85 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 55 writes are split as follows [0, 2, 4, 49]. [2024-10-11 16:35:01,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,883 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,939 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,959 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,972 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,986 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:01,997 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 16:35:01,998 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 16:35:01,999 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 16:35:01,999 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 16:35:02,000 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (1/1) ... [2024-10-11 16:35:02,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 16:35:02,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 16:35:02,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 16:35:02,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 16:35:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-11 16:35:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 16:35:02,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-11 16:35:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-11 16:35:02,109 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-11 16:35:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 16:35:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-11 16:35:02,110 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-11 16:35:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 16:35:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 16:35:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 16:35:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 16:35:02,110 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-11 16:35:02,111 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-11 16:35:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 16:35:02,111 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-11 16:35:02,113 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-11 16:35:02,113 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-11 16:35:02,114 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-11 16:35:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 16:35:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 16:35:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 16:35:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 16:35:02,114 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 16:35:02,114 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 16:35:02,369 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 16:35:02,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 16:35:03,797 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-10-11 16:35:03,797 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 16:35:03,861 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 16:35:03,861 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-11 16:35:03,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:35:03 BoogieIcfgContainer [2024-10-11 16:35:03,862 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 16:35:03,864 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 16:35:03,865 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 16:35:03,869 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 16:35:03,869 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 04:35:00" (1/3) ... [2024-10-11 16:35:03,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f160cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:35:03, skipping insertion in model container [2024-10-11 16:35:03,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 04:35:01" (2/3) ... [2024-10-11 16:35:03,870 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f160cc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 04:35:03, skipping insertion in model container [2024-10-11 16:35:03,870 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 04:35:03" (3/3) ... [2024-10-11 16:35:03,872 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_OAT_test6-1.i [2024-10-11 16:35:03,889 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 16:35:03,890 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-11 16:35:03,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 16:35:03,983 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;@cf091b8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 16:35:03,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-11 16:35:03,990 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 16:35:03,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 16:35:03,995 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:03,996 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:35:03,997 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-11 16:35:04,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:04,002 INFO L85 PathProgramCache]: Analyzing trace with hash 141968546, now seen corresponding path program 1 times [2024-10-11 16:35:04,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:04,009 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030591101] [2024-10-11 16:35:04,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:04,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:04,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:04,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:04,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:04,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030591101] [2024-10-11 16:35:04,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030591101] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:04,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:04,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 16:35:04,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131538024] [2024-10-11 16:35:04,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:04,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 16:35:04,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:04,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 16:35:04,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:35:04,255 INFO L87 Difference]: Start difference. First operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:04,356 INFO L93 Difference]: Finished difference Result 845 states and 1360 transitions. [2024-10-11 16:35:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 16:35:04,360 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-11 16:35:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:04,375 INFO L225 Difference]: With dead ends: 845 [2024-10-11 16:35:04,376 INFO L226 Difference]: Without dead ends: 420 [2024-10-11 16:35:04,381 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 16:35:04,387 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:04,388 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 16:35:04,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-11 16:35:04,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-11 16:35:04,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 399 states have (on average 1.443609022556391) internal successors, (576), 404 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:04,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 601 transitions. [2024-10-11 16:35:04,465 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 601 transitions. Word has length 7 [2024-10-11 16:35:04,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:04,466 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 601 transitions. [2024-10-11 16:35:04,466 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-11 16:35:04,466 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 601 transitions. [2024-10-11 16:35:04,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-11 16:35:04,467 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:04,467 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:35:04,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 16:35:04,468 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-11 16:35:04,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:04,469 INFO L85 PathProgramCache]: Analyzing trace with hash 750725892, now seen corresponding path program 1 times [2024-10-11 16:35:04,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:04,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641018225] [2024-10-11 16:35:04,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:04,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:04,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:04,708 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:04,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:04,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641018225] [2024-10-11 16:35:04,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641018225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:04,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:04,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 16:35:04,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683605089] [2024-10-11 16:35:04,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:04,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:35:04,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:04,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:35:04,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:35:04,713 INFO L87 Difference]: Start difference. First operand 420 states and 601 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:04,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:04,913 INFO L93 Difference]: Finished difference Result 1027 states and 1478 transitions. [2024-10-11 16:35:04,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:35:04,914 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-11 16:35:04,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:04,919 INFO L225 Difference]: With dead ends: 1027 [2024-10-11 16:35:04,920 INFO L226 Difference]: Without dead ends: 818 [2024-10-11 16:35:04,923 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-11 16:35:04,925 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 554 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:04,925 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1826 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:35:04,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-11 16:35:04,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 422. [2024-10-11 16:35:04,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4413965087281795) internal successors, (578), 406 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:04,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2024-10-11 16:35:04,976 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 9 [2024-10-11 16:35:04,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:04,976 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2024-10-11 16:35:04,976 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-11 16:35:04,977 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2024-10-11 16:35:04,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:35:04,981 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:04,981 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-11 16:35:04,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 16:35:04,982 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-11 16:35:04,982 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:04,982 INFO L85 PathProgramCache]: Analyzing trace with hash 992376086, now seen corresponding path program 1 times [2024-10-11 16:35:04,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:04,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [545598148] [2024-10-11 16:35:04,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:04,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:05,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:05,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:05,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:05,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [545598148] [2024-10-11 16:35:05,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [545598148] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:05,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:05,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:35:05,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690854025] [2024-10-11 16:35:05,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:05,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:35:05,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:05,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:35:05,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:35:05,307 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:05,412 INFO L93 Difference]: Finished difference Result 844 states and 1206 transitions. [2024-10-11 16:35:05,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:35:05,414 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-11 16:35:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:05,418 INFO L225 Difference]: With dead ends: 844 [2024-10-11 16:35:05,419 INFO L226 Difference]: Without dead ends: 425 [2024-10-11 16:35:05,420 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-11 16:35:05,421 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 106 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:05,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1607 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:35:05,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-11 16:35:05,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-10-11 16:35:05,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4239401496259352) internal successors, (571), 406 states have internal predecessors, (571), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:05,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 596 transitions. [2024-10-11 16:35:05,446 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 596 transitions. Word has length 64 [2024-10-11 16:35:05,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:05,447 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 596 transitions. [2024-10-11 16:35:05,447 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-11 16:35:05,448 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 596 transitions. [2024-10-11 16:35:05,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:35:05,450 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:05,450 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-11 16:35:05,450 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 16:35:05,451 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-11 16:35:05,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:05,454 INFO L85 PathProgramCache]: Analyzing trace with hash 696880968, now seen corresponding path program 1 times [2024-10-11 16:35:05,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:05,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983407580] [2024-10-11 16:35:05,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:05,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:05,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:05,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:05,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983407580] [2024-10-11 16:35:05,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983407580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:05,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:05,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:35:05,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1673710189] [2024-10-11 16:35:05,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:05,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:35:05,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:05,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:35:05,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:35:05,651 INFO L87 Difference]: Start difference. First operand 422 states and 596 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:05,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:05,741 INFO L93 Difference]: Finished difference Result 793 states and 1114 transitions. [2024-10-11 16:35:05,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 16:35:05,742 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-11 16:35:05,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:05,746 INFO L225 Difference]: With dead ends: 793 [2024-10-11 16:35:05,746 INFO L226 Difference]: Without dead ends: 374 [2024-10-11 16:35:05,748 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-11 16:35:05,749 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 9 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:05,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1456 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:35:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-11 16:35:05,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-10-11 16:35:05,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3909348441926346) internal successors, (491), 358 states have internal predecessors, (491), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:05,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 516 transitions. [2024-10-11 16:35:05,767 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 516 transitions. Word has length 64 [2024-10-11 16:35:05,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:05,769 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 516 transitions. [2024-10-11 16:35:05,769 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-11 16:35:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 516 transitions. [2024-10-11 16:35:05,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-11 16:35:05,773 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:05,773 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-11 16:35:05,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 16:35:05,773 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-11 16:35:05,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:05,774 INFO L85 PathProgramCache]: Analyzing trace with hash 2068688266, now seen corresponding path program 1 times [2024-10-11 16:35:05,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:05,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [221149240] [2024-10-11 16:35:05,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:05,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:05,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:06,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:06,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:06,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [221149240] [2024-10-11 16:35:06,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [221149240] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:06,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:06,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:35:06,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136438504] [2024-10-11 16:35:06,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:06,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:35:06,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:06,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:35:06,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:35:06,164 INFO L87 Difference]: Start difference. First operand 374 states and 516 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:06,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:06,520 INFO L93 Difference]: Finished difference Result 750 states and 1037 transitions. [2024-10-11 16:35:06,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:35:06,520 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-11 16:35:06,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:06,522 INFO L225 Difference]: With dead ends: 750 [2024-10-11 16:35:06,523 INFO L226 Difference]: Without dead ends: 379 [2024-10-11 16:35:06,523 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:35:06,524 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 10 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2171 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:06,524 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2171 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:35:06,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-11 16:35:06,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2024-10-11 16:35:06,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.388732394366197) internal successors, (493), 360 states have internal predecessors, (493), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:06,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 518 transitions. [2024-10-11 16:35:06,535 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 518 transitions. Word has length 64 [2024-10-11 16:35:06,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:06,535 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 518 transitions. [2024-10-11 16:35:06,536 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-11 16:35:06,536 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 518 transitions. [2024-10-11 16:35:06,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:35:06,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:06,537 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-11 16:35:06,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 16:35:06,538 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-11 16:35:06,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:06,538 INFO L85 PathProgramCache]: Analyzing trace with hash -437125107, now seen corresponding path program 1 times [2024-10-11 16:35:06,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:06,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [498651707] [2024-10-11 16:35:06,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:06,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:06,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:06,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:06,806 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [498651707] [2024-10-11 16:35:06,806 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [498651707] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:06,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:06,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 16:35:06,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277142610] [2024-10-11 16:35:06,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:06,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 16:35:06,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:06,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 16:35:06,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 16:35:06,808 INFO L87 Difference]: Start difference. First operand 376 states and 518 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:06,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:06,942 INFO L93 Difference]: Finished difference Result 749 states and 1033 transitions. [2024-10-11 16:35:06,943 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 16:35:06,943 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-11 16:35:06,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:06,945 INFO L225 Difference]: With dead ends: 749 [2024-10-11 16:35:06,946 INFO L226 Difference]: Without dead ends: 376 [2024-10-11 16:35:06,946 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-11 16:35:06,947 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 13 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:06,949 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1368 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 16:35:06,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-11 16:35:06,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-10-11 16:35:06,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.3859154929577464) internal successors, (492), 360 states have internal predecessors, (492), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:06,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 517 transitions. [2024-10-11 16:35:06,962 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 517 transitions. Word has length 65 [2024-10-11 16:35:06,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:06,963 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 517 transitions. [2024-10-11 16:35:06,963 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-11 16:35:06,963 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 517 transitions. [2024-10-11 16:35:06,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-11 16:35:06,964 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:06,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] [2024-10-11 16:35:06,964 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 16:35:06,965 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-11 16:35:06,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:06,965 INFO L85 PathProgramCache]: Analyzing trace with hash 2023236473, now seen corresponding path program 1 times [2024-10-11 16:35:06,965 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:06,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071692404] [2024-10-11 16:35:06,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:06,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:07,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:07,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:07,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071692404] [2024-10-11 16:35:07,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071692404] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:07,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:07,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:35:07,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299044255] [2024-10-11 16:35:07,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:07,248 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:35:07,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:07,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:35:07,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:35:07,249 INFO L87 Difference]: Start difference. First operand 376 states and 517 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:07,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:07,586 INFO L93 Difference]: Finished difference Result 754 states and 1039 transitions. [2024-10-11 16:35:07,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:35:07,587 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-11 16:35:07,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:07,589 INFO L225 Difference]: With dead ends: 754 [2024-10-11 16:35:07,589 INFO L226 Difference]: Without dead ends: 381 [2024-10-11 16:35:07,590 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-11 16:35:07,591 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 10 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 2605 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:07,591 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 2605 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:35:07,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-11 16:35:07,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2024-10-11 16:35:07,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.384401114206128) internal successors, (497), 364 states have internal predecessors, (497), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:07,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 522 transitions. [2024-10-11 16:35:07,602 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 522 transitions. Word has length 65 [2024-10-11 16:35:07,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:07,602 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 522 transitions. [2024-10-11 16:35:07,603 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-11 16:35:07,603 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 522 transitions. [2024-10-11 16:35:07,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:35:07,604 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:07,604 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-11 16:35:07,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 16:35:07,604 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-11 16:35:07,605 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:07,605 INFO L85 PathProgramCache]: Analyzing trace with hash 946071343, now seen corresponding path program 1 times [2024-10-11 16:35:07,605 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:07,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266615669] [2024-10-11 16:35:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:07,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:07,823 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:07,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:07,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266615669] [2024-10-11 16:35:07,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266615669] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:07,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:07,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 16:35:07,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590782064] [2024-10-11 16:35:07,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:07,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 16:35:07,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:07,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 16:35:07,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 16:35:07,828 INFO L87 Difference]: Start difference. First operand 380 states and 522 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:08,058 INFO L93 Difference]: Finished difference Result 760 states and 1046 transitions. [2024-10-11 16:35:08,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 16:35:08,059 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-11 16:35:08,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:08,061 INFO L225 Difference]: With dead ends: 760 [2024-10-11 16:35:08,061 INFO L226 Difference]: Without dead ends: 383 [2024-10-11 16:35:08,062 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-11 16:35:08,063 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 4 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:08,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1788 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 16:35:08,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-11 16:35:08,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-10-11 16:35:08,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.3812154696132597) internal successors, (500), 367 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:08,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 525 transitions. [2024-10-11 16:35:08,077 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 525 transitions. Word has length 66 [2024-10-11 16:35:08,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:08,079 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 525 transitions. [2024-10-11 16:35:08,079 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-11 16:35:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 525 transitions. [2024-10-11 16:35:08,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:35:08,080 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:08,080 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-11 16:35:08,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 16:35:08,080 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-11 16:35:08,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:08,081 INFO L85 PathProgramCache]: Analyzing trace with hash -1827898922, now seen corresponding path program 1 times [2024-10-11 16:35:08,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869344816] [2024-10-11 16:35:08,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:08,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:08,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:08,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869344816] [2024-10-11 16:35:08,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869344816] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:35:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057193096] [2024-10-11 16:35:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:35:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:08,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:35:08,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:35:08,500 INFO L87 Difference]: Start difference. First operand 383 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:09,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:09,009 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2024-10-11 16:35:09,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 16:35:09,011 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-11 16:35:09,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:09,014 INFO L225 Difference]: With dead ends: 776 [2024-10-11 16:35:09,014 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 16:35:09,015 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-11 16:35:09,016 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 30 mSDsluCounter, 3033 mSDsCounter, 0 mSdLazyCounter, 585 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 3520 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 585 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:09,017 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 3520 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 585 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:35:09,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 16:35:09,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2024-10-11 16:35:09,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.381720430107527) internal successors, (514), 377 states have internal predecessors, (514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:09,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-10-11 16:35:09,028 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 66 [2024-10-11 16:35:09,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:09,029 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-10-11 16:35:09,029 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-11 16:35:09,029 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-10-11 16:35:09,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-11 16:35:09,031 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:09,031 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-11 16:35:09,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 16:35:09,032 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-11 16:35:09,035 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:09,036 INFO L85 PathProgramCache]: Analyzing trace with hash -215227921, now seen corresponding path program 1 times [2024-10-11 16:35:09,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:09,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703808539] [2024-10-11 16:35:09,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:09,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:09,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:09,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-11 16:35:09,486 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:09,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703808539] [2024-10-11 16:35:09,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703808539] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:09,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:09,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:35:09,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662204948] [2024-10-11 16:35:09,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:09,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 16:35:09,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:09,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 16:35:09,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:35:09,488 INFO L87 Difference]: Start difference. First operand 393 states and 539 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:09,915 INFO L93 Difference]: Finished difference Result 786 states and 1080 transitions. [2024-10-11 16:35:09,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 16:35:09,916 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-11 16:35:09,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:09,918 INFO L225 Difference]: With dead ends: 786 [2024-10-11 16:35:09,918 INFO L226 Difference]: Without dead ends: 396 [2024-10-11 16:35:09,921 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-11 16:35:09,922 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 23 mSDsluCounter, 2592 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3083 SdHoareTripleChecker+Invalid, 469 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:09,923 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3083 Invalid, 469 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:35:09,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-11 16:35:09,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-11 16:35:09,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:09,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-11 16:35:09,936 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 66 [2024-10-11 16:35:09,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:09,936 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-11 16:35:09,936 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-11 16:35:09,937 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-11 16:35:09,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:35:09,937 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:09,937 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:35:09,938 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 16:35:09,938 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-11 16:35:09,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:09,938 INFO L85 PathProgramCache]: Analyzing trace with hash 1927888144, now seen corresponding path program 1 times [2024-10-11 16:35:09,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:09,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239552738] [2024-10-11 16:35:09,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:09,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:09,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:10,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:10,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:10,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239552738] [2024-10-11 16:35:10,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239552738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:10,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:10,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:35:10,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951506743] [2024-10-11 16:35:10,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:10,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:35:10,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:10,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:35:10,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:35:10,199 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:10,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:10,552 INFO L93 Difference]: Finished difference Result 794 states and 1089 transitions. [2024-10-11 16:35:10,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:35:10,552 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-11 16:35:10,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:10,554 INFO L225 Difference]: With dead ends: 794 [2024-10-11 16:35:10,555 INFO L226 Difference]: Without dead ends: 401 [2024-10-11 16:35:10,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-11 16:35:10,556 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 9 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 2611 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:10,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 2611 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:35:10,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-11 16:35:10,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 396. [2024-10-11 16:35:10,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:10,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-11 16:35:10,567 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 67 [2024-10-11 16:35:10,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:10,568 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-11 16:35:10,568 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-11 16:35:10,568 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-11 16:35:10,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-11 16:35:10,569 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:10,569 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:35:10,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 16:35:10,569 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-11 16:35:10,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1191157692, now seen corresponding path program 1 times [2024-10-11 16:35:10,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:10,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189851770] [2024-10-11 16:35:10,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:10,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:10,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:11,155 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:11,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:11,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189851770] [2024-10-11 16:35:11,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189851770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:11,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:11,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 16:35:11,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928415057] [2024-10-11 16:35:11,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:11,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:35:11,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:11,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:35:11,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:35:11,158 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:12,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:12,044 INFO L93 Difference]: Finished difference Result 1144 states and 1578 transitions. [2024-10-11 16:35:12,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:12,045 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-11 16:35:12,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:12,048 INFO L225 Difference]: With dead ends: 1144 [2024-10-11 16:35:12,048 INFO L226 Difference]: Without dead ends: 751 [2024-10-11 16:35:12,049 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-11 16:35:12,050 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 598 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 2935 SdHoareTripleChecker+Invalid, 704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:12,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 2935 Invalid, 704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 16:35:12,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-11 16:35:12,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 427. [2024-10-11 16:35:12,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.3497536945812807) internal successors, (548), 411 states have internal predecessors, (548), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:12,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 573 transitions. [2024-10-11 16:35:12,066 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 573 transitions. Word has length 67 [2024-10-11 16:35:12,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:12,066 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 573 transitions. [2024-10-11 16:35:12,066 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-11 16:35:12,067 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 573 transitions. [2024-10-11 16:35:12,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 16:35:12,067 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:12,067 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 16:35:12,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 16:35:12,068 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-11 16:35:12,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:12,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1668996667, now seen corresponding path program 1 times [2024-10-11 16:35:12,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:12,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693621753] [2024-10-11 16:35:12,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:12,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:12,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:12,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:12,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:12,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693621753] [2024-10-11 16:35:12,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693621753] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:12,365 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:12,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:35:12,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464741589] [2024-10-11 16:35:12,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:12,366 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:35:12,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:12,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:35:12,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:35:12,367 INFO L87 Difference]: Start difference. First operand 427 states and 573 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:12,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:12,699 INFO L93 Difference]: Finished difference Result 830 states and 1126 transitions. [2024-10-11 16:35:12,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 16:35:12,700 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-11 16:35:12,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:12,702 INFO L225 Difference]: With dead ends: 830 [2024-10-11 16:35:12,702 INFO L226 Difference]: Without dead ends: 437 [2024-10-11 16:35:12,703 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-11 16:35:12,704 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 16 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:12,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3105 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:35:12,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-11 16:35:12,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 430. [2024-10-11 16:35:12,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:12,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-11 16:35:12,717 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-11 16:35:12,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:12,717 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-11 16:35:12,718 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-11 16:35:12,718 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-11 16:35:12,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-11 16:35:12,718 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:12,718 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-11 16:35:12,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 16:35:12,719 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-11 16:35:12,719 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:12,719 INFO L85 PathProgramCache]: Analyzing trace with hash -488729825, now seen corresponding path program 1 times [2024-10-11 16:35:12,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:12,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718719119] [2024-10-11 16:35:12,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:12,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:12,967 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:12,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:12,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718719119] [2024-10-11 16:35:12,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718719119] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:12,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:12,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:35:12,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [985095326] [2024-10-11 16:35:12,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:12,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:35:12,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:12,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:35:12,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:35:12,969 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:13,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:13,514 INFO L93 Difference]: Finished difference Result 836 states and 1134 transitions. [2024-10-11 16:35:13,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:13,515 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-11 16:35:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:13,517 INFO L225 Difference]: With dead ends: 836 [2024-10-11 16:35:13,517 INFO L226 Difference]: Without dead ends: 440 [2024-10-11 16:35:13,518 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-11 16:35:13,518 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 26 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 683 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:13,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 3456 Invalid, 683 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 681 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:35:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-11 16:35:13,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-11 16:35:13,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:13,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-11 16:35:13,531 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-11 16:35:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:13,532 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-11 16:35:13,532 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-11 16:35:13,532 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-11 16:35:13,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:35:13,533 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:13,533 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-11 16:35:13,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 16:35:13,533 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-11 16:35:13,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:13,534 INFO L85 PathProgramCache]: Analyzing trace with hash -29765440, now seen corresponding path program 1 times [2024-10-11 16:35:13,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:13,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399699472] [2024-10-11 16:35:13,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:13,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:13,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:13,820 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:13,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:13,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399699472] [2024-10-11 16:35:13,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399699472] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:13,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:13,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:35:13,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079208646] [2024-10-11 16:35:13,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:13,821 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:35:13,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:13,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:35:13,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:35:13,822 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:14,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:14,305 INFO L93 Difference]: Finished difference Result 842 states and 1143 transitions. [2024-10-11 16:35:14,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:14,305 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-11 16:35:14,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:14,308 INFO L225 Difference]: With dead ends: 842 [2024-10-11 16:35:14,308 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 16:35:14,311 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-11 16:35:14,312 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 22 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3511 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:14,312 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3511 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 683 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:35:14,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 16:35:14,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2024-10-11 16:35:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 419 states have (on average 1.3460620525059666) internal successors, (564), 424 states have internal predecessors, (564), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:14,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-10-11 16:35:14,328 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 69 [2024-10-11 16:35:14,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:14,328 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-10-11 16:35:14,328 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-11 16:35:14,329 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-10-11 16:35:14,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:35:14,329 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:14,329 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-11 16:35:14,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 16:35:14,330 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-11 16:35:14,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:14,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1800190044, now seen corresponding path program 1 times [2024-10-11 16:35:14,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:14,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815058260] [2024-10-11 16:35:14,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:14,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:14,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:14,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:14,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:14,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815058260] [2024-10-11 16:35:14,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815058260] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:14,668 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:14,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:35:14,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719342471] [2024-10-11 16:35:14,669 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:14,669 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:35:14,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:14,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:35:14,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:35:14,670 INFO L87 Difference]: Start difference. First operand 440 states and 589 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:15,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:15,172 INFO L93 Difference]: Finished difference Result 862 states and 1167 transitions. [2024-10-11 16:35:15,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:15,172 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-11 16:35:15,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:15,175 INFO L225 Difference]: With dead ends: 862 [2024-10-11 16:35:15,175 INFO L226 Difference]: Without dead ends: 456 [2024-10-11 16:35:15,176 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-11 16:35:15,177 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 13 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 3919 SdHoareTripleChecker+Invalid, 719 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:15,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 3919 Invalid, 719 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:35:15,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-11 16:35:15,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 443. [2024-10-11 16:35:15,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3459715639810426) internal successors, (568), 427 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:15,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 593 transitions. [2024-10-11 16:35:15,190 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 593 transitions. Word has length 69 [2024-10-11 16:35:15,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:15,191 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 593 transitions. [2024-10-11 16:35:15,191 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-11 16:35:15,191 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 593 transitions. [2024-10-11 16:35:15,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:35:15,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:15,192 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-11 16:35:15,192 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 16:35:15,192 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-11 16:35:15,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:15,193 INFO L85 PathProgramCache]: Analyzing trace with hash 302137308, now seen corresponding path program 1 times [2024-10-11 16:35:15,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:15,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1202335409] [2024-10-11 16:35:15,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:15,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:15,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:15,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:15,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:15,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1202335409] [2024-10-11 16:35:15,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1202335409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:15,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:15,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:35:15,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554939109] [2024-10-11 16:35:15,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:15,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:35:15,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:35:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:35:15,513 INFO L87 Difference]: Start difference. First operand 443 states and 593 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:15,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:15,881 INFO L93 Difference]: Finished difference Result 857 states and 1157 transitions. [2024-10-11 16:35:15,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:35:15,882 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-11 16:35:15,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:15,884 INFO L225 Difference]: With dead ends: 857 [2024-10-11 16:35:15,885 INFO L226 Difference]: Without dead ends: 448 [2024-10-11 16:35:15,886 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-11 16:35:15,887 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 7 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:15,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2635 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 16:35:15,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-11 16:35:15,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-10-11 16:35:15,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3436018957345972) internal successors, (567), 427 states have internal predecessors, (567), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:15,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 592 transitions. [2024-10-11 16:35:15,899 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 592 transitions. Word has length 69 [2024-10-11 16:35:15,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:15,899 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 592 transitions. [2024-10-11 16:35:15,900 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-11 16:35:15,900 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 592 transitions. [2024-10-11 16:35:15,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-11 16:35:15,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:15,902 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-11 16:35:15,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 16:35:15,902 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-11 16:35:15,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:15,903 INFO L85 PathProgramCache]: Analyzing trace with hash 1914808309, now seen corresponding path program 1 times [2024-10-11 16:35:15,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:15,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974487343] [2024-10-11 16:35:15,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:15,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:15,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:16,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:16,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974487343] [2024-10-11 16:35:16,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974487343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:16,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:16,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 16:35:16,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090720248] [2024-10-11 16:35:16,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:16,206 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 16:35:16,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:16,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 16:35:16,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 16:35:16,207 INFO L87 Difference]: Start difference. First operand 443 states and 592 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:16,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:16,843 INFO L93 Difference]: Finished difference Result 855 states and 1155 transitions. [2024-10-11 16:35:16,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 16:35:16,843 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-11 16:35:16,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:16,846 INFO L225 Difference]: With dead ends: 855 [2024-10-11 16:35:16,846 INFO L226 Difference]: Without dead ends: 446 [2024-10-11 16:35:16,847 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-11 16:35:16,847 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 4 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2594 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:16,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2594 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 16:35:16,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-11 16:35:16,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-10-11 16:35:16,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 425 states have (on average 1.3411764705882352) internal successors, (570), 430 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:16,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 595 transitions. [2024-10-11 16:35:16,862 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 595 transitions. Word has length 69 [2024-10-11 16:35:16,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:16,862 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 595 transitions. [2024-10-11 16:35:16,862 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-11 16:35:16,862 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 595 transitions. [2024-10-11 16:35:16,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:35:16,863 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:16,863 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-11 16:35:16,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 16:35:16,864 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-11 16:35:16,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:16,864 INFO L85 PathProgramCache]: Analyzing trace with hash 48213054, now seen corresponding path program 1 times [2024-10-11 16:35:16,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:16,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010858285] [2024-10-11 16:35:16,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:16,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:16,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:17,331 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:17,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:17,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010858285] [2024-10-11 16:35:17,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010858285] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:17,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:17,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:35:17,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30242084] [2024-10-11 16:35:17,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:17,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:35:17,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:35:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:35:17,333 INFO L87 Difference]: Start difference. First operand 446 states and 595 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:17,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:17,904 INFO L93 Difference]: Finished difference Result 870 states and 1174 transitions. [2024-10-11 16:35:17,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:17,905 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-11 16:35:17,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:17,907 INFO L225 Difference]: With dead ends: 870 [2024-10-11 16:35:17,908 INFO L226 Difference]: Without dead ends: 458 [2024-10-11 16:35:17,908 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-11 16:35:17,909 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 9 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3903 SdHoareTripleChecker+Invalid, 790 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:17,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3903 Invalid, 790 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:35:17,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-11 16:35:17,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2024-10-11 16:35:17,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.3403263403263403) internal successors, (575), 434 states have internal predecessors, (575), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:17,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 600 transitions. [2024-10-11 16:35:17,924 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 600 transitions. Word has length 70 [2024-10-11 16:35:17,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:17,925 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 600 transitions. [2024-10-11 16:35:17,925 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-11 16:35:17,925 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2024-10-11 16:35:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:35:17,926 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:17,926 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-11 16:35:17,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 16:35:17,927 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-11 16:35:17,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:17,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1976786731, now seen corresponding path program 1 times [2024-10-11 16:35:17,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:17,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798302836] [2024-10-11 16:35:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:17,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:17,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:18,257 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:18,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:18,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798302836] [2024-10-11 16:35:18,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798302836] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:18,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:18,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 16:35:18,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771839470] [2024-10-11 16:35:18,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:18,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 16:35:18,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:18,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 16:35:18,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-11 16:35:18,259 INFO L87 Difference]: Start difference. First operand 450 states and 600 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:18,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:18,778 INFO L93 Difference]: Finished difference Result 879 states and 1184 transitions. [2024-10-11 16:35:18,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:18,778 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-11 16:35:18,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:18,781 INFO L225 Difference]: With dead ends: 879 [2024-10-11 16:35:18,781 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 16:35:18,782 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-11 16:35:18,782 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 22 mSDsluCounter, 3914 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 4401 SdHoareTripleChecker+Invalid, 813 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:18,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 4401 Invalid, 813 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 16:35:18,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 16:35:18,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 453. [2024-10-11 16:35:18,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.337962962962963) internal successors, (578), 437 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:18,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2024-10-11 16:35:18,798 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 70 [2024-10-11 16:35:18,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:18,798 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2024-10-11 16:35:18,798 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-11 16:35:18,799 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2024-10-11 16:35:18,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:35:18,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:18,799 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-11 16:35:18,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 16:35:18,800 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-11 16:35:18,800 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash 942258210, now seen corresponding path program 1 times [2024-10-11 16:35:18,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:18,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104960543] [2024-10-11 16:35:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:18,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:19,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:19,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:19,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104960543] [2024-10-11 16:35:19,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104960543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:19,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:19,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-11 16:35:19,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741602247] [2024-10-11 16:35:19,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:19,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-11 16:35:19,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:19,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-11 16:35:19,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-11 16:35:19,311 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:23,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.83s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 16:35:23,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:23,776 INFO L93 Difference]: Finished difference Result 878 states and 1180 transitions. [2024-10-11 16:35:23,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:23,777 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-11 16:35:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:23,779 INFO L225 Difference]: With dead ends: 878 [2024-10-11 16:35:23,780 INFO L226 Difference]: Without dead ends: 459 [2024-10-11 16:35:23,780 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-11 16:35:23,781 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 33 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3426 SdHoareTripleChecker+Invalid, 662 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:23,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3426 Invalid, 662 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 655 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 16:35:23,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-11 16:35:23,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 454. [2024-10-11 16:35:23,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.3371824480369514) internal successors, (579), 438 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:23,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 604 transitions. [2024-10-11 16:35:23,795 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 604 transitions. Word has length 70 [2024-10-11 16:35:23,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:23,795 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 604 transitions. [2024-10-11 16:35:23,796 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-11 16:35:23,796 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 604 transitions. [2024-10-11 16:35:23,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:35:23,796 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:23,796 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-11 16:35:23,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 16:35:23,797 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-11 16:35:23,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:23,797 INFO L85 PathProgramCache]: Analyzing trace with hash -894204710, now seen corresponding path program 1 times [2024-10-11 16:35:23,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:23,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404264040] [2024-10-11 16:35:23,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:23,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:35:24,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 16:35:24,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 16:35:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404264040] [2024-10-11 16:35:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404264040] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 16:35:24,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 16:35:24,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 16:35:24,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121557241] [2024-10-11 16:35:24,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 16:35:24,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 16:35:24,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 16:35:24,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 16:35:24,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-11 16:35:24,038 INFO L87 Difference]: Start difference. First operand 454 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-11 16:35:24,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 16:35:24,500 INFO L93 Difference]: Finished difference Result 883 states and 1187 transitions. [2024-10-11 16:35:24,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 16:35:24,501 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-11 16:35:24,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 16:35:24,503 INFO L225 Difference]: With dead ends: 883 [2024-10-11 16:35:24,503 INFO L226 Difference]: Without dead ends: 463 [2024-10-11 16:35:24,507 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-11 16:35:24,508 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 22 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 16:35:24,508 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3456 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 16:35:24,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-11 16:35:24,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 451. [2024-10-11 16:35:24,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 430 states have (on average 1.3395348837209302) internal successors, (576), 435 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 16:35:24,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 601 transitions. [2024-10-11 16:35:24,525 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 601 transitions. Word has length 70 [2024-10-11 16:35:24,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 16:35:24,526 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 601 transitions. [2024-10-11 16:35:24,526 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-11 16:35:24,526 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 601 transitions. [2024-10-11 16:35:24,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-11 16:35:24,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 16:35:24,527 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-11 16:35:24,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 16:35:24,527 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-11 16:35:24,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 16:35:24,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1497195914, now seen corresponding path program 1 times [2024-10-11 16:35:24,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 16:35:24,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529886046] [2024-10-11 16:35:24,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 16:35:24,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 16:35:24,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 16:36:26,510 WARN L286 SmtUtils]: Spent 6.32s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)