./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_BER_test6-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 16:22:38,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 16:22:38,950 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 16:22:38,955 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 16:22:38,957 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 16:22:38,990 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 16:22:38,990 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 16:22:38,990 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 16:22:38,991 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 16:22:38,991 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 16:22:38,991 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 16:22:38,992 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 16:22:38,992 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 16:22:38,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 16:22:38,993 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 16:22:38,993 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 16:22:38,993 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 16:22:38,994 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 16:22:38,994 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 16:22:38,994 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 16:22:38,994 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 16:22:38,999 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 16:22:38,999 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 16:22:38,999 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 16:22:38,999 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 16:22:39,000 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 16:22:39,000 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 16:22:39,000 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 16:22:39,000 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 16:22:39,000 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 16:22:39,000 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 16:22:39,001 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 16:22:39,001 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:22:39,001 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 16:22:39,001 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 16:22:39,001 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 16:22:39,001 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 16:22:39,002 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 16:22:39,002 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 16:22:39,002 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 16:22:39,004 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 16:22:39,007 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 16:22:39,007 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 05edfd344a133924af20e7887ded3d695179bf474d7b39ea2b7287f4a108ff8d [2024-10-14 16:22:39,203 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 16:22:39,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 16:22:39,229 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 16:22:39,230 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 16:22:39,230 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 16:22:39,231 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-14 16:22:40,580 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 16:22:40,816 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 16:22:40,816 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/uthash-2.0.2/uthash_BER_test6-1.i [2024-10-14 16:22:40,839 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d20e2bdf7/dc83bda89d6e413dae9e602acd4a99b7/FLAG4cd3f5988 [2024-10-14 16:22:40,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d20e2bdf7/dc83bda89d6e413dae9e602acd4a99b7 [2024-10-14 16:22:40,853 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 16:22:40,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 16:22:40,860 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 16:22:40,860 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 16:22:40,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 16:22:40,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:22:40" (1/1) ... [2024-10-14 16:22:40,867 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b642ded and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:40, skipping insertion in model container [2024-10-14 16:22:40,867 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 04:22:40" (1/1) ... [2024-10-14 16:22:40,916 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 16:22:41,314 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_BER_test6-1.i[44118,44131] [2024-10-14 16:22:41,328 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_BER_test6-1.i[44660,44673] [2024-10-14 16:22:41,396 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_BER_test6-1.i[56247,56260] [2024-10-14 16:22:41,397 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_BER_test6-1.i[56368,56381] [2024-10-14 16:22:41,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:22:41,411 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 16:22:41,442 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_BER_test6-1.i[44118,44131] [2024-10-14 16:22:41,444 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_BER_test6-1.i[44660,44673] [2024-10-14 16:22:41,505 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_BER_test6-1.i[56247,56260] [2024-10-14 16:22:41,506 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_BER_test6-1.i[56368,56381] [2024-10-14 16:22:41,509 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 16:22:41,561 INFO L204 MainTranslator]: Completed translation [2024-10-14 16:22:41,561 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41 WrapperNode [2024-10-14 16:22:41,562 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 16:22:41,562 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 16:22:41,562 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 16:22:41,562 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 16:22:41,572 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,615 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,685 INFO L138 Inliner]: procedures = 282, calls = 286, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 1468 [2024-10-14 16:22:41,685 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 16:22:41,686 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 16:22:41,686 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 16:22:41,686 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 16:22:41,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,699 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,760 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-14 16:22:41,760 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,761 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,798 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,814 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,822 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,833 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,848 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 16:22:41,848 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 16:22:41,849 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 16:22:41,849 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 16:22:41,849 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (1/1) ... [2024-10-14 16:22:41,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 16:22:41,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 16:22:41,883 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 16:22:41,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 16:22:41,925 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-10-14 16:22:41,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-14 16:22:41,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-10-14 16:22:41,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-10-14 16:22:41,925 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-10-14 16:22:41,926 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-14 16:22:41,926 INFO L130 BoogieDeclarations]: Found specification of procedure alt_bzero [2024-10-14 16:22:41,926 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_bzero [2024-10-14 16:22:41,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-14 16:22:41,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-14 16:22:41,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-14 16:22:41,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-14 16:22:41,926 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-10-14 16:22:41,926 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure alt_malloc [2024-10-14 16:22:41,927 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_malloc [2024-10-14 16:22:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure alt_free [2024-10-14 16:22:41,928 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_free [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-14 16:22:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 16:22:41,929 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 16:22:42,092 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 16:22:42,094 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 16:22:43,120 INFO L? ?]: Removed 333 outVars from TransFormulas that were not future-live. [2024-10-14 16:22:43,120 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 16:22:43,206 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 16:22:43,209 INFO L314 CfgBuilder]: Removed 63 assume(true) statements. [2024-10-14 16:22:43,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:22:43 BoogieIcfgContainer [2024-10-14 16:22:43,210 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 16:22:43,212 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 16:22:43,212 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 16:22:43,214 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 16:22:43,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 04:22:40" (1/3) ... [2024-10-14 16:22:43,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c64684b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:22:43, skipping insertion in model container [2024-10-14 16:22:43,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 04:22:41" (2/3) ... [2024-10-14 16:22:43,215 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5c64684b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:22:43, skipping insertion in model container [2024-10-14 16:22:43,215 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:22:43" (3/3) ... [2024-10-14 16:22:43,216 INFO L112 eAbstractionObserver]: Analyzing ICFG uthash_BER_test6-1.i [2024-10-14 16:22:43,229 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 16:22:43,229 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 4 error locations. [2024-10-14 16:22:43,293 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 16:22:43,299 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;@2363804b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 16:22:43,301 INFO L334 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2024-10-14 16:22:43,306 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-14 16:22:43,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-14 16:22:43,312 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:43,312 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:43,313 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:43,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:43,317 INFO L85 PathProgramCache]: Analyzing trace with hash 141968546, now seen corresponding path program 1 times [2024-10-14 16:22:43,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:43,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227618893] [2024-10-14 16:22:43,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:43,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:43,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:43,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:43,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:43,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227618893] [2024-10-14 16:22:43,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227618893] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:43,550 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:43,550 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 16:22:43,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042733092] [2024-10-14 16:22:43,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:43,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 16:22:43,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:43,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 16:22:43,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:22:43,596 INFO L87 Difference]: Start difference. First operand has 424 states, 402 states have (on average 1.6144278606965174) internal successors, (649), 406 states have internal predecessors, (649), 14 states have call successors, (14), 4 states have call predecessors, (14), 4 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:43,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:43,680 INFO L93 Difference]: Finished difference Result 845 states and 1360 transitions. [2024-10-14 16:22:43,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 16:22:43,683 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-10-14 16:22:43,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:43,694 INFO L225 Difference]: With dead ends: 845 [2024-10-14 16:22:43,695 INFO L226 Difference]: Without dead ends: 420 [2024-10-14 16:22:43,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 16:22:43,704 INFO L432 NwaCegarLoop]: 595 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:43,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 595 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 16:22:43,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-14 16:22:43,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2024-10-14 16:22:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 399 states have (on average 1.443609022556391) internal successors, (576), 404 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:43,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 601 transitions. [2024-10-14 16:22:43,763 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 601 transitions. Word has length 7 [2024-10-14 16:22:43,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:43,763 INFO L471 AbstractCegarLoop]: Abstraction has 420 states and 601 transitions. [2024-10-14 16:22:43,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:43,764 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 601 transitions. [2024-10-14 16:22:43,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-10-14 16:22:43,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:43,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:43,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 16:22:43,765 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:43,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:43,766 INFO L85 PathProgramCache]: Analyzing trace with hash 750725892, now seen corresponding path program 1 times [2024-10-14 16:22:43,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:43,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951145588] [2024-10-14 16:22:43,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:43,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:43,914 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:43,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:43,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951145588] [2024-10-14 16:22:43,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951145588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:43,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:43,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 16:22:43,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515095477] [2024-10-14 16:22:43,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:43,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:22:43,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:43,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:22:43,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:22:43,917 INFO L87 Difference]: Start difference. First operand 420 states and 601 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:44,090 INFO L93 Difference]: Finished difference Result 1027 states and 1478 transitions. [2024-10-14 16:22:44,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:22:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-10-14 16:22:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:44,094 INFO L225 Difference]: With dead ends: 1027 [2024-10-14 16:22:44,094 INFO L226 Difference]: Without dead ends: 818 [2024-10-14 16:22:44,095 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:22:44,096 INFO L432 NwaCegarLoop]: 630 mSDtfsCounter, 554 mSDsluCounter, 1196 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1826 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:44,097 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [565 Valid, 1826 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:22:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 818 states. [2024-10-14 16:22:44,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 818 to 422. [2024-10-14 16:22:44,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4413965087281795) internal successors, (578), 406 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:44,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 603 transitions. [2024-10-14 16:22:44,117 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 603 transitions. Word has length 9 [2024-10-14 16:22:44,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:44,117 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 603 transitions. [2024-10-14 16:22:44,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:44,118 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 603 transitions. [2024-10-14 16:22:44,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 16:22:44,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:44,120 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:44,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 16:22:44,120 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:44,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:44,121 INFO L85 PathProgramCache]: Analyzing trace with hash 992376086, now seen corresponding path program 1 times [2024-10-14 16:22:44,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:44,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767371985] [2024-10-14 16:22:44,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:44,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:44,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:44,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:44,347 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:44,347 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767371985] [2024-10-14 16:22:44,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767371985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:44,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:44,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:22:44,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971179010] [2024-10-14 16:22:44,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:44,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:22:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:44,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:22:44,349 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:22:44,350 INFO L87 Difference]: Start difference. First operand 422 states and 603 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:44,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:44,430 INFO L93 Difference]: Finished difference Result 844 states and 1206 transitions. [2024-10-14 16:22:44,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:22:44,431 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-14 16:22:44,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:44,433 INFO L225 Difference]: With dead ends: 844 [2024-10-14 16:22:44,433 INFO L226 Difference]: Without dead ends: 425 [2024-10-14 16:22:44,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:22:44,435 INFO L432 NwaCegarLoop]: 566 mSDtfsCounter, 106 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1607 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:44,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1607 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:22:44,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2024-10-14 16:22:44,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2024-10-14 16:22:44,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 401 states have (on average 1.4239401496259352) internal successors, (571), 406 states have internal predecessors, (571), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:44,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 596 transitions. [2024-10-14 16:22:44,450 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 596 transitions. Word has length 64 [2024-10-14 16:22:44,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:44,451 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 596 transitions. [2024-10-14 16:22:44,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 596 transitions. [2024-10-14 16:22:44,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 16:22:44,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:44,453 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:44,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 16:22:44,454 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:44,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:44,454 INFO L85 PathProgramCache]: Analyzing trace with hash 696880968, now seen corresponding path program 1 times [2024-10-14 16:22:44,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:44,455 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407178882] [2024-10-14 16:22:44,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:44,455 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:44,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:44,557 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:44,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:44,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407178882] [2024-10-14 16:22:44,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407178882] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:44,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:44,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:22:44,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598260110] [2024-10-14 16:22:44,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:44,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:22:44,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:44,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:22:44,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:22:44,559 INFO L87 Difference]: Start difference. First operand 422 states and 596 transitions. Second operand has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:44,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:44,645 INFO L93 Difference]: Finished difference Result 793 states and 1114 transitions. [2024-10-14 16:22:44,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 16:22:44,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-14 16:22:44,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:44,647 INFO L225 Difference]: With dead ends: 793 [2024-10-14 16:22:44,648 INFO L226 Difference]: Without dead ends: 374 [2024-10-14 16:22:44,649 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 16:22:44,650 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 9 mSDsluCounter, 965 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:44,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1456 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:22:44,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2024-10-14 16:22:44,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 374. [2024-10-14 16:22:44,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 374 states, 353 states have (on average 1.3909348441926346) internal successors, (491), 358 states have internal predecessors, (491), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:44,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 516 transitions. [2024-10-14 16:22:44,664 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 516 transitions. Word has length 64 [2024-10-14 16:22:44,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:44,665 INFO L471 AbstractCegarLoop]: Abstraction has 374 states and 516 transitions. [2024-10-14 16:22:44,665 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.5) internal successors, (62), 4 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:44,665 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 516 transitions. [2024-10-14 16:22:44,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2024-10-14 16:22:44,666 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:44,666 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:44,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 16:22:44,668 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:44,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash 2068688266, now seen corresponding path program 1 times [2024-10-14 16:22:44,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:44,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108111652] [2024-10-14 16:22:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:44,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:45,019 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:45,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:45,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108111652] [2024-10-14 16:22:45,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108111652] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:45,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:45,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:22:45,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640408113] [2024-10-14 16:22:45,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:45,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:22:45,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:45,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:22:45,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:22:45,022 INFO L87 Difference]: Start difference. First operand 374 states and 516 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:45,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:45,308 INFO L93 Difference]: Finished difference Result 750 states and 1037 transitions. [2024-10-14 16:22:45,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:22:45,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 64 [2024-10-14 16:22:45,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:45,310 INFO L225 Difference]: With dead ends: 750 [2024-10-14 16:22:45,311 INFO L226 Difference]: Without dead ends: 379 [2024-10-14 16:22:45,311 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-14 16:22:45,312 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 10 mSDsluCounter, 1679 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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-14 16:22:45,312 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-14 16:22:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-10-14 16:22:45,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 376. [2024-10-14 16:22:45,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.388732394366197) internal successors, (493), 360 states have internal predecessors, (493), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:45,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 518 transitions. [2024-10-14 16:22:45,320 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 518 transitions. Word has length 64 [2024-10-14 16:22:45,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:45,320 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 518 transitions. [2024-10-14 16:22:45,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:45,321 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 518 transitions. [2024-10-14 16:22:45,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 16:22:45,322 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:45,322 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:45,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 16:22:45,322 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:45,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:45,323 INFO L85 PathProgramCache]: Analyzing trace with hash -437125107, now seen corresponding path program 1 times [2024-10-14 16:22:45,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:45,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696579554] [2024-10-14 16:22:45,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:45,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:45,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:45,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:45,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:45,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696579554] [2024-10-14 16:22:45,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696579554] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:45,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:45,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 16:22:45,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [359805626] [2024-10-14 16:22:45,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:45,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 16:22:45,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:45,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 16:22:45,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:22:45,574 INFO L87 Difference]: Start difference. First operand 376 states and 518 transitions. Second operand has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:45,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:45,697 INFO L93 Difference]: Finished difference Result 749 states and 1033 transitions. [2024-10-14 16:22:45,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 16:22:45,697 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 16:22:45,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:45,699 INFO L225 Difference]: With dead ends: 749 [2024-10-14 16:22:45,699 INFO L226 Difference]: Without dead ends: 376 [2024-10-14 16:22:45,700 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 16:22:45,701 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 13 mSDsluCounter, 871 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 1368 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:45,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 1368 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 16:22:45,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2024-10-14 16:22:45,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 376. [2024-10-14 16:22:45,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 376 states, 355 states have (on average 1.3859154929577464) internal successors, (492), 360 states have internal predecessors, (492), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 517 transitions. [2024-10-14 16:22:45,711 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 517 transitions. Word has length 65 [2024-10-14 16:22:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:45,712 INFO L471 AbstractCegarLoop]: Abstraction has 376 states and 517 transitions. [2024-10-14 16:22:45,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.75) internal successors, (63), 4 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 517 transitions. [2024-10-14 16:22:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2024-10-14 16:22:45,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:45,714 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:45,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 16:22:45,714 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash 2023236473, now seen corresponding path program 1 times [2024-10-14 16:22:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181707616] [2024-10-14 16:22:45,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:45,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:45,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:45,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:45,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:45,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181707616] [2024-10-14 16:22:45,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181707616] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:45,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:45,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:22:45,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682190637] [2024-10-14 16:22:45,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:45,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:22:45,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:45,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:22:45,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:22:45,933 INFO L87 Difference]: Start difference. First operand 376 states and 517 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:46,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:46,195 INFO L93 Difference]: Finished difference Result 754 states and 1039 transitions. [2024-10-14 16:22:46,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:22:46,195 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 65 [2024-10-14 16:22:46,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:46,198 INFO L225 Difference]: With dead ends: 754 [2024-10-14 16:22:46,198 INFO L226 Difference]: Without dead ends: 381 [2024-10-14 16:22:46,199 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:22:46,200 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 10 mSDsluCounter, 2119 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:46,200 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.2s Time] [2024-10-14 16:22:46,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 381 states. [2024-10-14 16:22:46,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 381 to 380. [2024-10-14 16:22:46,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 359 states have (on average 1.384401114206128) internal successors, (497), 364 states have internal predecessors, (497), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:46,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 522 transitions. [2024-10-14 16:22:46,209 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 522 transitions. Word has length 65 [2024-10-14 16:22:46,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:46,210 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 522 transitions. [2024-10-14 16:22:46,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:46,210 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 522 transitions. [2024-10-14 16:22:46,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 16:22:46,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:46,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:46,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 16:22:46,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:46,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:46,212 INFO L85 PathProgramCache]: Analyzing trace with hash 946071343, now seen corresponding path program 1 times [2024-10-14 16:22:46,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:46,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045009075] [2024-10-14 16:22:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:46,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:46,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:46,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045009075] [2024-10-14 16:22:46,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045009075] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:46,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:46,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 16:22:46,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [416572218] [2024-10-14 16:22:46,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:46,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 16:22:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:46,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 16:22:46,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:22:46,491 INFO L87 Difference]: Start difference. First operand 380 states and 522 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:46,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:46,710 INFO L93 Difference]: Finished difference Result 760 states and 1046 transitions. [2024-10-14 16:22:46,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 16:22:46,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 16:22:46,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:46,713 INFO L225 Difference]: With dead ends: 760 [2024-10-14 16:22:46,714 INFO L226 Difference]: Without dead ends: 383 [2024-10-14 16:22:46,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-14 16:22:46,715 INFO L432 NwaCegarLoop]: 498 mSDtfsCounter, 4 mSDsluCounter, 1290 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:46,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 1788 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 16:22:46,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2024-10-14 16:22:46,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2024-10-14 16:22:46,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 362 states have (on average 1.3812154696132597) internal successors, (500), 367 states have internal predecessors, (500), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:46,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 525 transitions. [2024-10-14 16:22:46,723 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 525 transitions. Word has length 66 [2024-10-14 16:22:46,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:46,723 INFO L471 AbstractCegarLoop]: Abstraction has 383 states and 525 transitions. [2024-10-14 16:22:46,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:46,724 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 525 transitions. [2024-10-14 16:22:46,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 16:22:46,724 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:46,724 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:46,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-14 16:22:46,725 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:46,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:46,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1827898922, now seen corresponding path program 1 times [2024-10-14 16:22:46,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:46,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896221883] [2024-10-14 16:22:46,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:46,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:46,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:47,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:47,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:47,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896221883] [2024-10-14 16:22:47,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896221883] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:47,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:47,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:22:47,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474564733] [2024-10-14 16:22:47,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:47,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:22:47,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:47,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:22:47,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:22:47,008 INFO L87 Difference]: Start difference. First operand 383 states and 525 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:47,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:47,525 INFO L93 Difference]: Finished difference Result 776 states and 1068 transitions. [2024-10-14 16:22:47,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 16:22:47,526 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 16:22:47,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:47,527 INFO L225 Difference]: With dead ends: 776 [2024-10-14 16:22:47,527 INFO L226 Difference]: Without dead ends: 396 [2024-10-14 16:22:47,528 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:22:47,529 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:47,529 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.5s Time] [2024-10-14 16:22:47,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-14 16:22:47,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 393. [2024-10-14 16:22:47,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 372 states have (on average 1.381720430107527) internal successors, (514), 377 states have internal predecessors, (514), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:47,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 539 transitions. [2024-10-14 16:22:47,539 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 539 transitions. Word has length 66 [2024-10-14 16:22:47,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:47,539 INFO L471 AbstractCegarLoop]: Abstraction has 393 states and 539 transitions. [2024-10-14 16:22:47,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 9 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:47,539 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 539 transitions. [2024-10-14 16:22:47,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-10-14 16:22:47,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:47,540 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:47,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 16:22:47,540 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:47,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:47,541 INFO L85 PathProgramCache]: Analyzing trace with hash -215227921, now seen corresponding path program 1 times [2024-10-14 16:22:47,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:47,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572194638] [2024-10-14 16:22:47,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:47,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:47,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:47,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:47,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:47,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572194638] [2024-10-14 16:22:47,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [572194638] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:47,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:47,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 16:22:47,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142923022] [2024-10-14 16:22:47,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:47,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 16:22:47,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:47,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 16:22:47,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-14 16:22:47,893 INFO L87 Difference]: Start difference. First operand 393 states and 539 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:48,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:48,248 INFO L93 Difference]: Finished difference Result 786 states and 1080 transitions. [2024-10-14 16:22:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:22:48,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 66 [2024-10-14 16:22:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:48,253 INFO L225 Difference]: With dead ends: 786 [2024-10-14 16:22:48,253 INFO L226 Difference]: Without dead ends: 396 [2024-10-14 16:22:48,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:22:48,254 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.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:48,255 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.3s Time] [2024-10-14 16:22:48,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2024-10-14 16:22:48,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 396. [2024-10-14 16:22:48,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:48,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-14 16:22:48,264 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 66 [2024-10-14 16:22:48,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:48,265 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-14 16:22:48,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:48,265 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-14 16:22:48,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 16:22:48,266 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:48,266 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:48,266 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-14 16:22:48,267 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:48,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:48,267 INFO L85 PathProgramCache]: Analyzing trace with hash 1927888144, now seen corresponding path program 1 times [2024-10-14 16:22:48,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:48,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825353395] [2024-10-14 16:22:48,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:48,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:48,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:48,545 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:48,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:48,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825353395] [2024-10-14 16:22:48,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825353395] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:48,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:48,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:22:48,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929574652] [2024-10-14 16:22:48,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:48,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:22:48,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:48,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:22:48,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:22:48,547 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:48,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:48,877 INFO L93 Difference]: Finished difference Result 794 states and 1089 transitions. [2024-10-14 16:22:48,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:22:48,877 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-14 16:22:48,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:48,879 INFO L225 Difference]: With dead ends: 794 [2024-10-14 16:22:48,879 INFO L226 Difference]: Without dead ends: 401 [2024-10-14 16:22:48,879 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-14 16:22:48,880 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-14 16:22:48,880 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-14 16:22:48,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2024-10-14 16:22:48,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 396. [2024-10-14 16:22:48,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 396 states, 375 states have (on average 1.3786666666666667) internal successors, (517), 380 states have internal predecessors, (517), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:48,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 542 transitions. [2024-10-14 16:22:48,889 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 542 transitions. Word has length 67 [2024-10-14 16:22:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:48,889 INFO L471 AbstractCegarLoop]: Abstraction has 396 states and 542 transitions. [2024-10-14 16:22:48,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:48,890 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 542 transitions. [2024-10-14 16:22:48,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2024-10-14 16:22:48,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:48,890 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:48,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-14 16:22:48,891 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:48,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:48,891 INFO L85 PathProgramCache]: Analyzing trace with hash 1191157692, now seen corresponding path program 1 times [2024-10-14 16:22:48,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:48,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311691017] [2024-10-14 16:22:48,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:48,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:48,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:49,323 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:49,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:49,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311691017] [2024-10-14 16:22:49,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311691017] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:49,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:49,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 16:22:49,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230902228] [2024-10-14 16:22:49,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:49,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:22:49,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:49,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:22:49,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:22:49,326 INFO L87 Difference]: Start difference. First operand 396 states and 542 transitions. Second operand has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:50,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:50,071 INFO L93 Difference]: Finished difference Result 1144 states and 1578 transitions. [2024-10-14 16:22:50,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:22:50,071 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2024-10-14 16:22:50,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:50,075 INFO L225 Difference]: With dead ends: 1144 [2024-10-14 16:22:50,075 INFO L226 Difference]: Without dead ends: 751 [2024-10-14 16:22:50,076 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2024-10-14 16:22:50,077 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 598 mSDsluCounter, 2456 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:50,077 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.6s Time] [2024-10-14 16:22:50,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2024-10-14 16:22:50,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 427. [2024-10-14 16:22:50,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 427 states, 406 states have (on average 1.3497536945812807) internal successors, (548), 411 states have internal predecessors, (548), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:50,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 573 transitions. [2024-10-14 16:22:50,087 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 573 transitions. Word has length 67 [2024-10-14 16:22:50,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:50,088 INFO L471 AbstractCegarLoop]: Abstraction has 427 states and 573 transitions. [2024-10-14 16:22:50,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.222222222222222) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 573 transitions. [2024-10-14 16:22:50,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 16:22:50,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:50,088 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:50,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-14 16:22:50,089 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:50,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:50,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1668996667, now seen corresponding path program 1 times [2024-10-14 16:22:50,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:50,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377027721] [2024-10-14 16:22:50,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:50,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:50,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:50,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:50,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377027721] [2024-10-14 16:22:50,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377027721] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:50,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:50,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:22:50,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965405375] [2024-10-14 16:22:50,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:50,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:22:50,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:50,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:22:50,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:22:50,293 INFO L87 Difference]: Start difference. First operand 427 states and 573 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:50,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:50,567 INFO L93 Difference]: Finished difference Result 830 states and 1126 transitions. [2024-10-14 16:22:50,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 16:22:50,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-14 16:22:50,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:50,569 INFO L225 Difference]: With dead ends: 830 [2024-10-14 16:22:50,569 INFO L226 Difference]: Without dead ends: 437 [2024-10-14 16:22:50,570 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:22:50,570 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 16 mSDsluCounter, 2619 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 3105 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:50,570 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 3105 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:22:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2024-10-14 16:22:50,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 430. [2024-10-14 16:22:50,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:50,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-14 16:22:50,579 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-14 16:22:50,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:50,580 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-14 16:22:50,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:50,580 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-14 16:22:50,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2024-10-14 16:22:50,580 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:50,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:50,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-14 16:22:50,581 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:50,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:50,581 INFO L85 PathProgramCache]: Analyzing trace with hash -488729825, now seen corresponding path program 1 times [2024-10-14 16:22:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006297178] [2024-10-14 16:22:50,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:50,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:50,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:50,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:50,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006297178] [2024-10-14 16:22:50,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006297178] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:50,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:50,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:22:50,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498478242] [2024-10-14 16:22:50,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:50,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:22:50,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:50,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:22:50,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:22:50,760 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:51,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:51,170 INFO L93 Difference]: Finished difference Result 836 states and 1134 transitions. [2024-10-14 16:22:51,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:22:51,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 68 [2024-10-14 16:22:51,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:51,173 INFO L225 Difference]: With dead ends: 836 [2024-10-14 16:22:51,173 INFO L226 Difference]: Without dead ends: 440 [2024-10-14 16:22:51,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:22:51,174 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 26 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:51,177 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.4s Time] [2024-10-14 16:22:51,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2024-10-14 16:22:51,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 430. [2024-10-14 16:22:51,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 409 states have (on average 1.3496332518337408) internal successors, (552), 414 states have internal predecessors, (552), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:51,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 577 transitions. [2024-10-14 16:22:51,186 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 577 transitions. Word has length 68 [2024-10-14 16:22:51,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:51,187 INFO L471 AbstractCegarLoop]: Abstraction has 430 states and 577 transitions. [2024-10-14 16:22:51,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:51,187 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 577 transitions. [2024-10-14 16:22:51,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:22:51,187 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:51,188 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:51,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-14 16:22:51,188 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:51,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:51,188 INFO L85 PathProgramCache]: Analyzing trace with hash -29765440, now seen corresponding path program 1 times [2024-10-14 16:22:51,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:51,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880488819] [2024-10-14 16:22:51,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:51,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:51,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:51,474 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:51,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:51,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880488819] [2024-10-14 16:22:51,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880488819] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:51,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:51,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:22:51,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [700329559] [2024-10-14 16:22:51,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:51,475 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:22:51,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:51,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:22:51,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:22:51,476 INFO L87 Difference]: Start difference. First operand 430 states and 577 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:51,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:51,872 INFO L93 Difference]: Finished difference Result 842 states and 1143 transitions. [2024-10-14 16:22:51,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:22:51,872 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-14 16:22:51,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:51,874 INFO L225 Difference]: With dead ends: 842 [2024-10-14 16:22:51,874 INFO L226 Difference]: Without dead ends: 446 [2024-10-14 16:22:51,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:22:51,875 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 22 mSDsluCounter, 3018 mSDsCounter, 0 mSdLazyCounter, 683 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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-14 16:22:51,875 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-14 16:22:51,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-14 16:22:51,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 440. [2024-10-14 16:22:51,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 419 states have (on average 1.3460620525059666) internal successors, (564), 424 states have internal predecessors, (564), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:51,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 589 transitions. [2024-10-14 16:22:51,885 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 589 transitions. Word has length 69 [2024-10-14 16:22:51,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:51,885 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 589 transitions. [2024-10-14 16:22:51,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:51,885 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 589 transitions. [2024-10-14 16:22:51,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:22:51,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:51,886 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:51,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-14 16:22:51,886 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:51,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:51,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1800190044, now seen corresponding path program 1 times [2024-10-14 16:22:51,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:51,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542696737] [2024-10-14 16:22:51,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:51,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:51,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:52,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:52,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:52,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542696737] [2024-10-14 16:22:52,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542696737] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:52,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:52,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:22:52,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452535960] [2024-10-14 16:22:52,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:52,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:22:52,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:52,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:22:52,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:22:52,090 INFO L87 Difference]: Start difference. First operand 440 states and 589 transitions. Second operand has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:52,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:52,511 INFO L93 Difference]: Finished difference Result 862 states and 1167 transitions. [2024-10-14 16:22:52,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:22:52,512 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-14 16:22:52,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:52,514 INFO L225 Difference]: With dead ends: 862 [2024-10-14 16:22:52,514 INFO L226 Difference]: Without dead ends: 456 [2024-10-14 16:22:52,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:22:52,515 INFO L432 NwaCegarLoop]: 479 mSDtfsCounter, 13 mSDsluCounter, 3440 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:52,515 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.4s Time] [2024-10-14 16:22:52,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-10-14 16:22:52,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 443. [2024-10-14 16:22:52,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3459715639810426) internal successors, (568), 427 states have internal predecessors, (568), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:52,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 593 transitions. [2024-10-14 16:22:52,525 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 593 transitions. Word has length 69 [2024-10-14 16:22:52,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:52,526 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 593 transitions. [2024-10-14 16:22:52,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.7) internal successors, (67), 10 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:52,526 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 593 transitions. [2024-10-14 16:22:52,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:22:52,526 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:52,526 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:52,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-14 16:22:52,527 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:52,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:52,527 INFO L85 PathProgramCache]: Analyzing trace with hash 302137308, now seen corresponding path program 1 times [2024-10-14 16:22:52,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:52,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759617580] [2024-10-14 16:22:52,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:52,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:52,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:52,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:52,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:52,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759617580] [2024-10-14 16:22:52,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759617580] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:52,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:52,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:22:52,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1222984378] [2024-10-14 16:22:52,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:52,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:22:52,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:22:52,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:22:52,794 INFO L87 Difference]: Start difference. First operand 443 states and 593 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:53,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:53,103 INFO L93 Difference]: Finished difference Result 857 states and 1157 transitions. [2024-10-14 16:22:53,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:22:53,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-14 16:22:53,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:53,105 INFO L225 Difference]: With dead ends: 857 [2024-10-14 16:22:53,105 INFO L226 Difference]: Without dead ends: 448 [2024-10-14 16:22:53,106 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:22:53,106 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 7 mSDsluCounter, 2148 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 2635 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:53,107 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 2635 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:22:53,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2024-10-14 16:22:53,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 443. [2024-10-14 16:22:53,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 422 states have (on average 1.3436018957345972) internal successors, (567), 427 states have internal predecessors, (567), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:53,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 592 transitions. [2024-10-14 16:22:53,116 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 592 transitions. Word has length 69 [2024-10-14 16:22:53,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:53,116 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 592 transitions. [2024-10-14 16:22:53,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:53,116 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 592 transitions. [2024-10-14 16:22:53,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2024-10-14 16:22:53,117 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:53,117 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:53,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-14 16:22:53,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:53,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:53,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1914808309, now seen corresponding path program 1 times [2024-10-14 16:22:53,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:53,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477530540] [2024-10-14 16:22:53,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:53,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:53,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:53,284 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:53,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:53,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477530540] [2024-10-14 16:22:53,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477530540] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:53,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:53,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:22:53,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503002858] [2024-10-14 16:22:53,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:53,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:22:53,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:53,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:22:53,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:22:53,286 INFO L87 Difference]: Start difference. First operand 443 states and 592 transitions. Second operand has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:53,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:53,791 INFO L93 Difference]: Finished difference Result 855 states and 1155 transitions. [2024-10-14 16:22:53,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:22:53,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 69 [2024-10-14 16:22:53,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:53,793 INFO L225 Difference]: With dead ends: 855 [2024-10-14 16:22:53,793 INFO L226 Difference]: Without dead ends: 446 [2024-10-14 16:22:53,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:22:53,795 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 4 mSDsluCounter, 2103 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:53,795 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.5s Time] [2024-10-14 16:22:53,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2024-10-14 16:22:53,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2024-10-14 16:22:53,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 425 states have (on average 1.3411764705882352) internal successors, (570), 430 states have internal predecessors, (570), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:53,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 595 transitions. [2024-10-14 16:22:53,805 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 595 transitions. Word has length 69 [2024-10-14 16:22:53,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:53,805 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 595 transitions. [2024-10-14 16:22:53,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.571428571428571) internal successors, (67), 7 states have internal predecessors, (67), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:53,805 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 595 transitions. [2024-10-14 16:22:53,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:22:53,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:53,806 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:53,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-14 16:22:53,806 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:53,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:53,807 INFO L85 PathProgramCache]: Analyzing trace with hash 48213054, now seen corresponding path program 1 times [2024-10-14 16:22:53,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:53,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003558116] [2024-10-14 16:22:53,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:53,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:53,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:54,107 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:54,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:54,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003558116] [2024-10-14 16:22:54,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003558116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:54,108 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:54,108 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:22:54,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559792182] [2024-10-14 16:22:54,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:54,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:22:54,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:54,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:22:54,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:22:54,109 INFO L87 Difference]: Start difference. First operand 446 states and 595 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:54,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:54,579 INFO L93 Difference]: Finished difference Result 870 states and 1174 transitions. [2024-10-14 16:22:54,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:22:54,579 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-14 16:22:54,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:54,581 INFO L225 Difference]: With dead ends: 870 [2024-10-14 16:22:54,581 INFO L226 Difference]: Without dead ends: 458 [2024-10-14 16:22:54,582 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:22:54,582 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 9 mSDsluCounter, 3413 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:54,583 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.4s Time] [2024-10-14 16:22:54,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2024-10-14 16:22:54,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 450. [2024-10-14 16:22:54,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 429 states have (on average 1.3403263403263403) internal successors, (575), 434 states have internal predecessors, (575), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:54,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 600 transitions. [2024-10-14 16:22:54,592 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 600 transitions. Word has length 70 [2024-10-14 16:22:54,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:54,592 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 600 transitions. [2024-10-14 16:22:54,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:54,593 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 600 transitions. [2024-10-14 16:22:54,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:22:54,593 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:54,593 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:54,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-14 16:22:54,594 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:54,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:54,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1976786731, now seen corresponding path program 1 times [2024-10-14 16:22:54,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341670281] [2024-10-14 16:22:54,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:54,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:54,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:54,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:54,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341670281] [2024-10-14 16:22:54,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341670281] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:54,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:54,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 16:22:54,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176628541] [2024-10-14 16:22:54,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:54,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 16:22:54,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:54,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 16:22:54,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:22:54,804 INFO L87 Difference]: Start difference. First operand 450 states and 600 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:55,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:22:55,260 INFO L93 Difference]: Finished difference Result 879 states and 1184 transitions. [2024-10-14 16:22:55,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:22:55,261 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-14 16:22:55,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:22:55,263 INFO L225 Difference]: With dead ends: 879 [2024-10-14 16:22:55,263 INFO L226 Difference]: Without dead ends: 463 [2024-10-14 16:22:55,263 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:22:55,264 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.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:22:55,264 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.4s Time] [2024-10-14 16:22:55,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-14 16:22:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 453. [2024-10-14 16:22:55,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 432 states have (on average 1.337962962962963) internal successors, (578), 437 states have internal predecessors, (578), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:22:55,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 603 transitions. [2024-10-14 16:22:55,275 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 603 transitions. Word has length 70 [2024-10-14 16:22:55,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:22:55,276 INFO L471 AbstractCegarLoop]: Abstraction has 453 states and 603 transitions. [2024-10-14 16:22:55,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:55,276 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 603 transitions. [2024-10-14 16:22:55,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:22:55,276 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:22:55,277 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:22:55,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-14 16:22:55,277 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:22:55,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:22:55,277 INFO L85 PathProgramCache]: Analyzing trace with hash 942258210, now seen corresponding path program 1 times [2024-10-14 16:22:55,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:22:55,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279153361] [2024-10-14 16:22:55,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:22:55,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:22:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:22:55,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:22:55,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:22:55,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279153361] [2024-10-14 16:22:55,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [279153361] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:22:55,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:22:55,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:22:55,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288389439] [2024-10-14 16:22:55,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:22:55,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:22:55,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:22:55,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:22:55,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:22:55,613 INFO L87 Difference]: Start difference. First operand 453 states and 603 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:22:59,620 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.81s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:23:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:00,037 INFO L93 Difference]: Finished difference Result 878 states and 1180 transitions. [2024-10-14 16:23:00,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:23:00,038 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-14 16:23:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:00,040 INFO L225 Difference]: With dead ends: 878 [2024-10-14 16:23:00,040 INFO L226 Difference]: Without dead ends: 459 [2024-10-14 16:23:00,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-14 16:23:00,041 INFO L432 NwaCegarLoop]: 484 mSDtfsCounter, 33 mSDsluCounter, 2942 mSDsCounter, 0 mSdLazyCounter, 655 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s 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-14 16:23:00,041 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-14 16:23:00,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-10-14 16:23:00,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 454. [2024-10-14 16:23:00,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 454 states, 433 states have (on average 1.3371824480369514) internal successors, (579), 438 states have internal predecessors, (579), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 454 states to 454 states and 604 transitions. [2024-10-14 16:23:00,052 INFO L78 Accepts]: Start accepts. Automaton has 454 states and 604 transitions. Word has length 70 [2024-10-14 16:23:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:00,052 INFO L471 AbstractCegarLoop]: Abstraction has 454 states and 604 transitions. [2024-10-14 16:23:00,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 10 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:00,052 INFO L276 IsEmpty]: Start isEmpty. Operand 454 states and 604 transitions. [2024-10-14 16:23:00,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:23:00,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:00,053 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:00,053 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-14 16:23:00,053 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:00,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:00,053 INFO L85 PathProgramCache]: Analyzing trace with hash -894204710, now seen corresponding path program 1 times [2024-10-14 16:23:00,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:00,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50961327] [2024-10-14 16:23:00,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:00,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:00,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:00,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:00,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:00,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50961327] [2024-10-14 16:23:00,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50961327] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:00,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:00,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:23:00,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940099460] [2024-10-14 16:23:00,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:00,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:23:00,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:00,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:23:00,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:23:00,239 INFO L87 Difference]: Start difference. First operand 454 states and 604 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:00,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:00,737 INFO L93 Difference]: Finished difference Result 883 states and 1187 transitions. [2024-10-14 16:23:00,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:23:00,737 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-14 16:23:00,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:00,739 INFO L225 Difference]: With dead ends: 883 [2024-10-14 16:23:00,739 INFO L226 Difference]: Without dead ends: 463 [2024-10-14 16:23:00,740 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:23:00,741 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 22 mSDsluCounter, 2965 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 3456 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:00,741 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 3456 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 659 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:23:00,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2024-10-14 16:23:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 451. [2024-10-14 16:23:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 430 states have (on average 1.3395348837209302) internal successors, (576), 435 states have internal predecessors, (576), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:00,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 601 transitions. [2024-10-14 16:23:00,754 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 601 transitions. Word has length 70 [2024-10-14 16:23:00,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:00,754 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 601 transitions. [2024-10-14 16:23:00,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 9 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:00,755 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 601 transitions. [2024-10-14 16:23:00,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2024-10-14 16:23:00,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:00,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:00,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-14 16:23:00,756 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:00,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:00,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1497195914, now seen corresponding path program 1 times [2024-10-14 16:23:00,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:00,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113414066] [2024-10-14 16:23:00,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:00,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:00,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:10,153 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (let ((.cse2 (div |c_ULTIMATE.start_main_~_hj_i~0#1| 4294967296))) (or (< (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1| (* .cse2 4294967296)) (+ .cse0 |c_ULTIMATE.start_main_~_hj_i~0#1|)) (< 4408680405129836980 (+ (* 1030789529 |c_ULTIMATE.start_main_~_hj_i~0#1|) (* 2147483648 (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 (* (- 2061579059) |c_ULTIMATE.start_main_~_hj_i~0#1|) .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296)) (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* .cse2 2147483648))))))) is different from false [2024-10-14 16:23:22,402 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (* (div |c_ULTIMATE.start_main_~_hj_j~0#1| 4294967296) 524288)) (.cse0 (div |c_ULTIMATE.start_main_~_hj_j~0#1| 8192))) (and (= .cse0 (+ .cse1 |c_ULTIMATE.start_main_~_ha_hashv~0#1|)) (<= 4408680405129836981 (+ (* 1030789530 |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* |c_ULTIMATE.start_main_~_hj_j~0#1| 2061579059) (* (div (+ (* (- 4123158118) |c_ULTIMATE.start_main_~_hj_j~0#1|) 8817360810260198248 .cse1 (* (- 2061579059) |c_ULTIMATE.start_main_~_ha_hashv~0#1|) (* (- 1) .cse0)) 4294967296) 2147483648))))) is different from false [2024-10-14 16:23:22,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:22,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:22,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113414066] [2024-10-14 16:23:22,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113414066] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:22,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:22,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 16:23:22,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733923100] [2024-10-14 16:23:22,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:22,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 16:23:22,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:22,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 16:23:22,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-10-14 16:23:22,455 INFO L87 Difference]: Start difference. First operand 451 states and 601 transitions. Second operand has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:23,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:23,804 INFO L93 Difference]: Finished difference Result 892 states and 1205 transitions. [2024-10-14 16:23:23,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 16:23:23,804 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 70 [2024-10-14 16:23:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:23,806 INFO L225 Difference]: With dead ends: 892 [2024-10-14 16:23:23,806 INFO L226 Difference]: Without dead ends: 475 [2024-10-14 16:23:23,807 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=21, Invalid=57, Unknown=2, NotChecked=30, Total=110 [2024-10-14 16:23:23,807 INFO L432 NwaCegarLoop]: 491 mSDtfsCounter, 41 mSDsluCounter, 2978 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 3469 SdHoareTripleChecker+Invalid, 903 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 315 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:23,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 3469 Invalid, 903 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 586 Invalid, 0 Unknown, 315 Unchecked, 1.3s Time] [2024-10-14 16:23:23,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 475 states. [2024-10-14 16:23:23,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 475 to 457. [2024-10-14 16:23:23,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.3394495412844036) internal successors, (584), 441 states have internal predecessors, (584), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:23,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 609 transitions. [2024-10-14 16:23:23,830 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 609 transitions. Word has length 70 [2024-10-14 16:23:23,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:23,830 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 609 transitions. [2024-10-14 16:23:23,830 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.181818181818182) internal successors, (68), 11 states have internal predecessors, (68), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:23,831 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 609 transitions. [2024-10-14 16:23:23,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:23,832 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:23,832 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:23,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-14 16:23:23,832 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:23,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:23,832 INFO L85 PathProgramCache]: Analyzing trace with hash -794892407, now seen corresponding path program 1 times [2024-10-14 16:23:23,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:23,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445873562] [2024-10-14 16:23:23,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:23,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:23,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:24,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:24,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445873562] [2024-10-14 16:23:24,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445873562] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:24,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:24,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 16:23:24,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442066249] [2024-10-14 16:23:24,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:24,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:23:24,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:24,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:23:24,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:23:24,152 INFO L87 Difference]: Start difference. First operand 457 states and 609 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:24,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:24,671 INFO L93 Difference]: Finished difference Result 892 states and 1202 transitions. [2024-10-14 16:23:24,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:23:24,675 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:23:24,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:24,677 INFO L225 Difference]: With dead ends: 892 [2024-10-14 16:23:24,677 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 16:23:24,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=130, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:23:24,678 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 12 mSDsluCounter, 3878 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 4368 SdHoareTripleChecker+Invalid, 927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:24,678 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 4368 Invalid, 927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 925 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:23:24,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 16:23:24,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 464. [2024-10-14 16:23:24,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 443 states have (on average 1.3386004514672687) internal successors, (593), 448 states have internal predecessors, (593), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:24,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 618 transitions. [2024-10-14 16:23:24,694 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 618 transitions. Word has length 71 [2024-10-14 16:23:24,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:24,694 INFO L471 AbstractCegarLoop]: Abstraction has 464 states and 618 transitions. [2024-10-14 16:23:24,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 618 transitions. [2024-10-14 16:23:24,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:24,695 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:24,695 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:24,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-14 16:23:24,695 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:24,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:24,696 INFO L85 PathProgramCache]: Analyzing trace with hash 790204545, now seen corresponding path program 1 times [2024-10-14 16:23:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:24,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503270153] [2024-10-14 16:23:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:24,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:24,966 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:24,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:24,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503270153] [2024-10-14 16:23:24,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503270153] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:24,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:24,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:23:24,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1964920873] [2024-10-14 16:23:24,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:24,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:23:24,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:23:24,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:23:24,968 INFO L87 Difference]: Start difference. First operand 464 states and 618 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:25,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:25,336 INFO L93 Difference]: Finished difference Result 899 states and 1210 transitions. [2024-10-14 16:23:25,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 16:23:25,336 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:23:25,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:25,338 INFO L225 Difference]: With dead ends: 899 [2024-10-14 16:23:25,338 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 16:23:25,339 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:23:25,339 INFO L432 NwaCegarLoop]: 494 mSDtfsCounter, 33 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 3108 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:25,340 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 3108 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:23:25,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 16:23:25,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 461. [2024-10-14 16:23:25,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 461 states, 440 states have (on average 1.3386363636363636) internal successors, (589), 445 states have internal predecessors, (589), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:25,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 614 transitions. [2024-10-14 16:23:25,349 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 614 transitions. Word has length 71 [2024-10-14 16:23:25,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:25,349 INFO L471 AbstractCegarLoop]: Abstraction has 461 states and 614 transitions. [2024-10-14 16:23:25,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:25,349 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 614 transitions. [2024-10-14 16:23:25,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:25,350 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:25,350 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:25,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-14 16:23:25,350 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:25,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:25,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1088293983, now seen corresponding path program 1 times [2024-10-14 16:23:25,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:25,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560997477] [2024-10-14 16:23:25,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:25,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:25,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:25,498 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:25,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:25,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560997477] [2024-10-14 16:23:25,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560997477] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:25,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:25,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:23:25,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304537688] [2024-10-14 16:23:25,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:25,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:23:25,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:25,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:23:25,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:23:25,500 INFO L87 Difference]: Start difference. First operand 461 states and 614 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:25,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:25,871 INFO L93 Difference]: Finished difference Result 889 states and 1195 transitions. [2024-10-14 16:23:25,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 16:23:25,874 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:23:25,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:25,876 INFO L225 Difference]: With dead ends: 889 [2024-10-14 16:23:25,876 INFO L226 Difference]: Without dead ends: 462 [2024-10-14 16:23:25,877 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:23:25,877 INFO L432 NwaCegarLoop]: 497 mSDtfsCounter, 45 mSDsluCounter, 2193 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:25,877 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 2690 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 16:23:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 462 states. [2024-10-14 16:23:25,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 462 to 458. [2024-10-14 16:23:25,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 458 states, 437 states have (on average 1.3386727688787186) internal successors, (585), 442 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:25,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 610 transitions. [2024-10-14 16:23:25,901 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 610 transitions. Word has length 71 [2024-10-14 16:23:25,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:25,901 INFO L471 AbstractCegarLoop]: Abstraction has 458 states and 610 transitions. [2024-10-14 16:23:25,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:25,901 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 610 transitions. [2024-10-14 16:23:25,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:25,902 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:25,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, 1, 1] [2024-10-14 16:23:25,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-14 16:23:25,903 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:25,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:25,903 INFO L85 PathProgramCache]: Analyzing trace with hash 756361631, now seen corresponding path program 1 times [2024-10-14 16:23:25,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:25,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740138918] [2024-10-14 16:23:25,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:25,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:26,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:26,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740138918] [2024-10-14 16:23:26,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740138918] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:26,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:26,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 16:23:26,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1101632419] [2024-10-14 16:23:26,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:26,198 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:23:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:26,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:23:26,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:23:26,199 INFO L87 Difference]: Start difference. First operand 458 states and 610 transitions. Second operand has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:26,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:26,746 INFO L93 Difference]: Finished difference Result 898 states and 1211 transitions. [2024-10-14 16:23:26,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:23:26,747 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:23:26,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:26,748 INFO L225 Difference]: With dead ends: 898 [2024-10-14 16:23:26,749 INFO L226 Difference]: Without dead ends: 474 [2024-10-14 16:23:26,749 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:23:26,750 INFO L432 NwaCegarLoop]: 473 mSDtfsCounter, 14 mSDsluCounter, 4263 mSDsCounter, 0 mSdLazyCounter, 951 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 4736 SdHoareTripleChecker+Invalid, 952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:26,750 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 4736 Invalid, 952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 951 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:23:26,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2024-10-14 16:23:26,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 459. [2024-10-14 16:23:26,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3378995433789955) internal successors, (586), 443 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:26,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 611 transitions. [2024-10-14 16:23:26,759 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 611 transitions. Word has length 71 [2024-10-14 16:23:26,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:26,759 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 611 transitions. [2024-10-14 16:23:26,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.75) internal successors, (69), 12 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 611 transitions. [2024-10-14 16:23:26,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:26,760 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:26,760 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:26,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-14 16:23:26,760 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:26,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:26,761 INFO L85 PathProgramCache]: Analyzing trace with hash 2115370497, now seen corresponding path program 1 times [2024-10-14 16:23:26,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:26,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334256543] [2024-10-14 16:23:26,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:26,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:26,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:26,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:26,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334256543] [2024-10-14 16:23:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1334256543] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:26,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:23:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298402348] [2024-10-14 16:23:26,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:26,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:23:26,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:26,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:23:26,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:23:26,957 INFO L87 Difference]: Start difference. First operand 459 states and 611 transitions. Second operand has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:27,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:27,465 INFO L93 Difference]: Finished difference Result 894 states and 1202 transitions. [2024-10-14 16:23:27,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:23:27,469 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:23:27,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:27,471 INFO L225 Difference]: With dead ends: 894 [2024-10-14 16:23:27,471 INFO L226 Difference]: Without dead ends: 469 [2024-10-14 16:23:27,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:23:27,472 INFO L432 NwaCegarLoop]: 492 mSDtfsCounter, 8 mSDsluCounter, 3455 mSDsCounter, 0 mSdLazyCounter, 757 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3947 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 757 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:27,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3947 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 757 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:23:27,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 469 states. [2024-10-14 16:23:27,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 469 to 459. [2024-10-14 16:23:27,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 438 states have (on average 1.3378995433789955) internal successors, (586), 443 states have internal predecessors, (586), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:27,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 611 transitions. [2024-10-14 16:23:27,496 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 611 transitions. Word has length 71 [2024-10-14 16:23:27,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:27,496 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 611 transitions. [2024-10-14 16:23:27,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.9) internal successors, (69), 10 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:27,497 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 611 transitions. [2024-10-14 16:23:27,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:27,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:27,501 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:27,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-14 16:23:27,501 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:27,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:27,502 INFO L85 PathProgramCache]: Analyzing trace with hash 1990201277, now seen corresponding path program 1 times [2024-10-14 16:23:27,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:27,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357017577] [2024-10-14 16:23:27,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:27,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:27,844 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:27,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:27,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357017577] [2024-10-14 16:23:27,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357017577] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:27,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:27,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-14 16:23:27,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316162210] [2024-10-14 16:23:27,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:27,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-14 16:23:27,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:27,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-14 16:23:27,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:23:27,847 INFO L87 Difference]: Start difference. First operand 459 states and 611 transitions. Second operand has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:28,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:28,565 INFO L93 Difference]: Finished difference Result 904 states and 1219 transitions. [2024-10-14 16:23:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-14 16:23:28,565 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:23:28,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:28,567 INFO L225 Difference]: With dead ends: 904 [2024-10-14 16:23:28,567 INFO L226 Difference]: Without dead ends: 479 [2024-10-14 16:23:28,568 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2024-10-14 16:23:28,568 INFO L432 NwaCegarLoop]: 475 mSDtfsCounter, 35 mSDsluCounter, 4676 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 5151 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:28,568 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 5151 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 16:23:28,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 479 states. [2024-10-14 16:23:28,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 479 to 468. [2024-10-14 16:23:28,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 447 states have (on average 1.337807606263982) internal successors, (598), 452 states have internal predecessors, (598), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:28,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 623 transitions. [2024-10-14 16:23:28,579 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 623 transitions. Word has length 71 [2024-10-14 16:23:28,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:28,580 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 623 transitions. [2024-10-14 16:23:28,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.3076923076923075) internal successors, (69), 13 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:28,580 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 623 transitions. [2024-10-14 16:23:28,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:28,581 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:28,581 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:28,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-14 16:23:28,581 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:28,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:28,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1457930159, now seen corresponding path program 1 times [2024-10-14 16:23:28,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:28,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616469410] [2024-10-14 16:23:28,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:28,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:28,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:29,418 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:29,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:29,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616469410] [2024-10-14 16:23:29,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616469410] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:29,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:29,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 16:23:29,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862450101] [2024-10-14 16:23:29,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:29,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 16:23:29,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:29,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 16:23:29,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:23:29,419 INFO L87 Difference]: Start difference. First operand 468 states and 623 transitions. Second operand has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:23:31,677 INFO L93 Difference]: Finished difference Result 972 states and 1311 transitions. [2024-10-14 16:23:31,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-14 16:23:31,678 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:23:31,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:23:31,680 INFO L225 Difference]: With dead ends: 972 [2024-10-14 16:23:31,680 INFO L226 Difference]: Without dead ends: 538 [2024-10-14 16:23:31,681 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2024-10-14 16:23:31,681 INFO L432 NwaCegarLoop]: 517 mSDtfsCounter, 106 mSDsluCounter, 4075 mSDsCounter, 0 mSdLazyCounter, 1030 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 4592 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1030 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-10-14 16:23:31,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 4592 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1030 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-10-14 16:23:31,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2024-10-14 16:23:31,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 469. [2024-10-14 16:23:31,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 448 states have (on average 1.3392857142857142) internal successors, (600), 453 states have internal predecessors, (600), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:23:31,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 625 transitions. [2024-10-14 16:23:31,695 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 625 transitions. Word has length 71 [2024-10-14 16:23:31,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:23:31,695 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 625 transitions. [2024-10-14 16:23:31,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.2727272727272725) internal successors, (69), 11 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:31,695 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 625 transitions. [2024-10-14 16:23:31,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:23:31,696 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:23:31,696 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:23:31,696 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-14 16:23:31,696 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:23:31,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:23:31,697 INFO L85 PathProgramCache]: Analyzing trace with hash 602512357, now seen corresponding path program 1 times [2024-10-14 16:23:31,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:23:31,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003490924] [2024-10-14 16:23:31,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:23:31,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:23:31,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:23:32,270 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:23:32,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:23:32,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003490924] [2024-10-14 16:23:32,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003490924] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:23:32,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:23:32,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-14 16:23:32,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646289861] [2024-10-14 16:23:32,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:23:32,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-14 16:23:32,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:23:32,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-14 16:23:32,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-14 16:23:32,274 INFO L87 Difference]: Start difference. First operand 469 states and 625 transitions. Second operand has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:23:36,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:23:40,594 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:23:44,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:23:48,602 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:23:52,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:23:56,618 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:24:00,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:24:05,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:24:07,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 16:24:08,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:24:08,291 INFO L93 Difference]: Finished difference Result 929 states and 1251 transitions. [2024-10-14 16:24:08,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:24:08,291 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:24:08,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:24:08,294 INFO L225 Difference]: With dead ends: 929 [2024-10-14 16:24:08,294 INFO L226 Difference]: Without dead ends: 494 [2024-10-14 16:24:08,295 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:24:08,295 INFO L432 NwaCegarLoop]: 480 mSDtfsCounter, 74 mSDsluCounter, 2986 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 9 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 35.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 3466 SdHoareTripleChecker+Invalid, 703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.9s IncrementalHoareTripleChecker+Time [2024-10-14 16:24:08,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 3466 Invalid, 703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 686 Invalid, 8 Unknown, 0 Unchecked, 35.9s Time] [2024-10-14 16:24:08,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 494 states. [2024-10-14 16:24:08,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 494 to 469. [2024-10-14 16:24:08,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 448 states have (on average 1.3392857142857142) internal successors, (600), 453 states have internal predecessors, (600), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:24:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 625 transitions. [2024-10-14 16:24:08,306 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 625 transitions. Word has length 71 [2024-10-14 16:24:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:24:08,306 INFO L471 AbstractCegarLoop]: Abstraction has 469 states and 625 transitions. [2024-10-14 16:24:08,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.666666666666667) internal successors, (69), 9 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:08,306 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 625 transitions. [2024-10-14 16:24:08,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-10-14 16:24:08,307 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:24:08,307 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:24:08,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-14 16:24:08,308 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:24:08,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:24:08,308 INFO L85 PathProgramCache]: Analyzing trace with hash 707846777, now seen corresponding path program 1 times [2024-10-14 16:24:08,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:24:08,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726637588] [2024-10-14 16:24:08,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:24:08,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:24:08,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24: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-14 16:24:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:24:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726637588] [2024-10-14 16:24:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726637588] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:24:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:24:08,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-14 16:24:08,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225089106] [2024-10-14 16:24:08,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:24:08,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 16:24:08,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:24:08,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 16:24:08,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-14 16:24:08,500 INFO L87 Difference]: Start difference. First operand 469 states and 625 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:09,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:24:09,107 INFO L93 Difference]: Finished difference Result 922 states and 1241 transitions. [2024-10-14 16:24:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-14 16:24:09,108 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 71 [2024-10-14 16:24:09,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:24:09,110 INFO L225 Difference]: With dead ends: 922 [2024-10-14 16:24:09,112 INFO L226 Difference]: Without dead ends: 487 [2024-10-14 16:24:09,112 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:24:09,113 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 82 mSDsluCounter, 1708 mSDsCounter, 0 mSdLazyCounter, 404 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2193 SdHoareTripleChecker+Invalid, 416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 404 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:24:09,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2193 Invalid, 416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 404 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:24:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2024-10-14 16:24:09,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 471. [2024-10-14 16:24:09,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 450 states have (on average 1.3377777777777777) internal successors, (602), 455 states have internal predecessors, (602), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:24:09,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 627 transitions. [2024-10-14 16:24:09,128 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 627 transitions. Word has length 71 [2024-10-14 16:24:09,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:24:09,129 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 627 transitions. [2024-10-14 16:24:09,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:09,129 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 627 transitions. [2024-10-14 16:24:09,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 16:24:09,130 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:24:09,130 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:24:09,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-14 16:24:09,130 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:24:09,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:24:09,130 INFO L85 PathProgramCache]: Analyzing trace with hash -2008193782, now seen corresponding path program 1 times [2024-10-14 16:24:09,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:24:09,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721328663] [2024-10-14 16:24:09,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:24:09,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:24:09,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24:09,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:24:09,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:24:09,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721328663] [2024-10-14 16:24:09,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721328663] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:24:09,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:24:09,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 16:24:09,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046905910] [2024-10-14 16:24:09,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:24:09,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:24:09,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:24:09,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:24:09,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:24:09,582 INFO L87 Difference]: Start difference. First operand 471 states and 627 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:24:10,373 INFO L93 Difference]: Finished difference Result 922 states and 1240 transitions. [2024-10-14 16:24:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:24:10,373 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 72 [2024-10-14 16:24:10,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:24:10,375 INFO L225 Difference]: With dead ends: 922 [2024-10-14 16:24:10,375 INFO L226 Difference]: Without dead ends: 485 [2024-10-14 16:24:10,376 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=226, Unknown=0, NotChecked=0, Total=272 [2024-10-14 16:24:10,376 INFO L432 NwaCegarLoop]: 485 mSDtfsCounter, 58 mSDsluCounter, 3443 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 3928 SdHoareTripleChecker+Invalid, 827 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:24:10,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 3928 Invalid, 827 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 16:24:10,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2024-10-14 16:24:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 471. [2024-10-14 16:24:10,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 450 states have (on average 1.3355555555555556) internal successors, (601), 455 states have internal predecessors, (601), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:24:10,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 626 transitions. [2024-10-14 16:24:10,386 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 626 transitions. Word has length 72 [2024-10-14 16:24:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:24:10,387 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 626 transitions. [2024-10-14 16:24:10,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:10,387 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 626 transitions. [2024-10-14 16:24:10,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 16:24:10,388 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:24:10,388 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:24:10,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-14 16:24:10,388 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:24:10,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:24:10,388 INFO L85 PathProgramCache]: Analyzing trace with hash 767497187, now seen corresponding path program 1 times [2024-10-14 16:24:10,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:24:10,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065939194] [2024-10-14 16:24:10,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:24:10,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:24:10,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24:10,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:24:10,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:24:10,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065939194] [2024-10-14 16:24:10,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065939194] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:24:10,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:24:10,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-14 16:24:10,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180717112] [2024-10-14 16:24:10,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:24:10,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-14 16:24:10,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:24:10,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-14 16:24:10,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:24:10,770 INFO L87 Difference]: Start difference. First operand 471 states and 626 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:11,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:24:11,314 INFO L93 Difference]: Finished difference Result 904 states and 1215 transitions. [2024-10-14 16:24:11,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:24:11,314 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 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 72 [2024-10-14 16:24:11,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:24:11,316 INFO L225 Difference]: With dead ends: 904 [2024-10-14 16:24:11,320 INFO L226 Difference]: Without dead ends: 467 [2024-10-14 16:24:11,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-10-14 16:24:11,321 INFO L432 NwaCegarLoop]: 486 mSDtfsCounter, 8 mSDsluCounter, 3804 mSDsCounter, 0 mSdLazyCounter, 807 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 4290 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 16:24:11,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 4290 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 807 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 16:24:11,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2024-10-14 16:24:11,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 457. [2024-10-14 16:24:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 457 states, 436 states have (on average 1.341743119266055) internal successors, (585), 441 states have internal predecessors, (585), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:24:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 457 states to 457 states and 610 transitions. [2024-10-14 16:24:11,348 INFO L78 Accepts]: Start accepts. Automaton has 457 states and 610 transitions. Word has length 72 [2024-10-14 16:24:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:24:11,348 INFO L471 AbstractCegarLoop]: Abstraction has 457 states and 610 transitions. [2024-10-14 16:24:11,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 610 transitions. [2024-10-14 16:24:11,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 16:24:11,353 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:24:11,353 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:24:11,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-14 16:24:11,353 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:24:11,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:24:11,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1712149366, now seen corresponding path program 1 times [2024-10-14 16:24:11,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:24:11,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100485653] [2024-10-14 16:24:11,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:24:11,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:24:11,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:24:11,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:24:11,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100485653] [2024-10-14 16:24:11,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100485653] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:24:11,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:24:11,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-14 16:24:11,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85482566] [2024-10-14 16:24:11,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:24:11,715 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 16:24:11,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:24:11,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 16:24:11,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:24:11,716 INFO L87 Difference]: Start difference. First operand 457 states and 610 transitions. Second operand has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:12,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:24:12,144 INFO L93 Difference]: Finished difference Result 896 states and 1205 transitions. [2024-10-14 16:24:12,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-14 16:24:12,145 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 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 72 [2024-10-14 16:24:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:24:12,147 INFO L225 Difference]: With dead ends: 896 [2024-10-14 16:24:12,147 INFO L226 Difference]: Without dead ends: 473 [2024-10-14 16:24:12,148 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-10-14 16:24:12,148 INFO L432 NwaCegarLoop]: 487 mSDtfsCounter, 9 mSDsluCounter, 3437 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 3924 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 16:24:12,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 3924 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 16:24:12,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2024-10-14 16:24:12,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 468. [2024-10-14 16:24:12,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 447 states have (on average 1.3355704697986577) internal successors, (597), 452 states have internal predecessors, (597), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:24:12,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 622 transitions. [2024-10-14 16:24:12,159 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 622 transitions. Word has length 72 [2024-10-14 16:24:12,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:24:12,159 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 622 transitions. [2024-10-14 16:24:12,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.0) internal successors, (70), 10 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:12,160 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 622 transitions. [2024-10-14 16:24:12,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 16:24:12,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:24:12,160 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:24:12,160 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-14 16:24:12,160 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:24:12,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:24:12,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1528213650, now seen corresponding path program 1 times [2024-10-14 16:24:12,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:24:12,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [128869452] [2024-10-14 16:24:12,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:24:12,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:24:12,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 16:24:12,417 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-14 16:24:12,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 16:24:12,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [128869452] [2024-10-14 16:24:12,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [128869452] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 16:24:12,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 16:24:12,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-14 16:24:12,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564781303] [2024-10-14 16:24:12,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 16:24:12,418 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-14 16:24:12,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 16:24:12,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-14 16:24:12,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2024-10-14 16:24:12,419 INFO L87 Difference]: Start difference. First operand 468 states and 622 transitions. Second operand has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:13,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 16:24:13,050 INFO L93 Difference]: Finished difference Result 917 states and 1231 transitions. [2024-10-14 16:24:13,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-14 16:24:13,051 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 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 72 [2024-10-14 16:24:13,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 16:24:13,053 INFO L225 Difference]: With dead ends: 917 [2024-10-14 16:24:13,053 INFO L226 Difference]: Without dead ends: 483 [2024-10-14 16:24:13,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-10-14 16:24:13,054 INFO L432 NwaCegarLoop]: 493 mSDtfsCounter, 13 mSDsluCounter, 4288 mSDsCounter, 0 mSdLazyCounter, 1079 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 4781 SdHoareTripleChecker+Invalid, 1080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-14 16:24:13,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 4781 Invalid, 1080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1079 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-14 16:24:13,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2024-10-14 16:24:13,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 473. [2024-10-14 16:24:13,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 473 states, 452 states have (on average 1.334070796460177) internal successors, (603), 457 states have internal predecessors, (603), 13 states have call successors, (13), 4 states have call predecessors, (13), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-14 16:24:13,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 628 transitions. [2024-10-14 16:24:13,082 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 628 transitions. Word has length 72 [2024-10-14 16:24:13,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 16:24:13,082 INFO L471 AbstractCegarLoop]: Abstraction has 473 states and 628 transitions. [2024-10-14 16:24:13,082 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.833333333333333) internal successors, (70), 12 states have internal predecessors, (70), 1 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-14 16:24:13,082 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 628 transitions. [2024-10-14 16:24:13,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2024-10-14 16:24:13,082 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 16:24:13,083 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 16:24:13,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-14 16:24:13,083 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [alt_freeErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 1 more)] === [2024-10-14 16:24:13,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 16:24:13,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1163958860, now seen corresponding path program 1 times [2024-10-14 16:24:13,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 16:24:13,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798261700] [2024-10-14 16:24:13,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 16:24:13,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 16:24:13,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat