./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:41:17,118 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:41:17,194 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:41:17,198 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:41:17,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:41:17,224 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:41:17,225 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:41:17,225 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:41:17,226 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:41:17,227 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:41:17,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:41:17,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:41:17,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:41:17,229 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:41:17,229 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:41:17,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:41:17,230 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:41:17,230 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:41:17,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:41:17,231 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:41:17,231 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:41:17,234 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:41:17,235 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:41:17,235 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:41:17,235 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:41:17,235 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:41:17,235 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:41:17,236 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:41:17,236 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:41:17,236 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:41:17,236 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:41:17,237 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:41:17,237 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:41:17,237 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:41:17,238 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:41:17,239 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:41:17,239 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:41:17,239 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:41:17,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:41:17,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:41:17,240 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:41:17,240 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:41:17,240 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a71ef89e0c9f3635b059609e166e2ca02077ae52d17a785a0f63b8520dafcb51 [2024-10-11 13:41:17,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:41:17,515 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:41:17,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:41:17,535 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:41:17,535 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:41:17,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i [2024-10-11 13:41:18,929 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:41:19,146 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:41:19,153 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i [2024-10-11 13:41:19,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1fb16994e/6360882d70e443c6a6a685c1849db1e0/FLAG45361120a [2024-10-11 13:41:19,180 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1fb16994e/6360882d70e443c6a6a685c1849db1e0 [2024-10-11 13:41:19,183 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:41:19,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:41:19,187 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:41:19,188 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:41:19,192 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:41:19,193 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,194 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@666c19aa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19, skipping insertion in model container [2024-10-11 13:41:19,194 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,219 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:41:19,391 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-10-11 13:41:19,458 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:41:19,472 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:41:19,483 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/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-70.i[916,929] [2024-10-11 13:41:19,525 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:41:19,543 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:41:19,544 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19 WrapperNode [2024-10-11 13:41:19,544 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:41:19,545 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:41:19,545 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:41:19,545 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:41:19,551 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,562 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,600 INFO L138 Inliner]: procedures = 29, calls = 169, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 554 [2024-10-11 13:41:19,600 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:41:19,601 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:41:19,601 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:41:19,601 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:41:19,619 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,633 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,666 INFO L175 MemorySlicer]: Split 132 memory accesses to 15 slices as follows [2, 7, 8, 18, 3, 5, 5, 10, 8, 8, 8, 35, 6, 3, 6]. 27 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 16 writes are split as follows [0, 1, 1, 1, 1, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1]. [2024-10-11 13:41:19,669 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,669 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,685 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,694 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,697 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,706 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:41:19,707 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:41:19,707 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:41:19,708 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:41:19,708 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (1/1) ... [2024-10-11 13:41:19,714 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:41:19,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:41:19,747 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:41:19,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:41:19,799 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:41:19,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2024-10-11 13:41:19,800 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2024-10-11 13:41:19,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2024-10-11 13:41:19,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2024-10-11 13:41:19,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2024-10-11 13:41:19,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2024-10-11 13:41:19,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2024-10-11 13:41:19,801 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2024-10-11 13:41:19,802 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2024-10-11 13:41:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2024-10-11 13:41:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2024-10-11 13:41:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2024-10-11 13:41:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2024-10-11 13:41:19,803 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-10-11 13:41:19,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-10-11 13:41:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-10-11 13:41:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-10-11 13:41:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-10-11 13:41:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-10-11 13:41:19,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-10-11 13:41:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-10-11 13:41:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-10-11 13:41:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2024-10-11 13:41:19,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2024-10-11 13:41:19,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-10-11 13:41:19,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2024-10-11 13:41:19,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2024-10-11 13:41:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2024-10-11 13:41:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2024-10-11 13:41:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2024-10-11 13:41:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2024-10-11 13:41:19,810 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2024-10-11 13:41:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2024-10-11 13:41:19,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2024-10-11 13:41:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2024-10-11 13:41:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2024-10-11 13:41:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2024-10-11 13:41:19,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2024-10-11 13:41:19,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2024-10-11 13:41:19,814 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2024-10-11 13:41:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2024-10-11 13:41:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:41:19,815 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:41:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:41:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-11 13:41:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-10-11 13:41:19,815 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-10-11 13:41:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-10-11 13:41:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-10-11 13:41:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-10-11 13:41:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-10-11 13:41:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-10-11 13:41:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-10-11 13:41:19,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-10-11 13:41:19,817 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-10-11 13:41:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-10-11 13:41:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-10-11 13:41:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2024-10-11 13:41:19,818 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:41:19,818 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:41:20,027 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:41:20,029 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:41:20,677 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-10-11 13:41:20,677 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:41:20,735 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:41:20,735 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:41:20,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:41:20 BoogieIcfgContainer [2024-10-11 13:41:20,736 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:41:20,738 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:41:20,738 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:41:20,741 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:41:20,742 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:41:19" (1/3) ... [2024-10-11 13:41:20,743 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9402dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:41:20, skipping insertion in model container [2024-10-11 13:41:20,743 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:41:19" (2/3) ... [2024-10-11 13:41:20,744 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c9402dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:41:20, skipping insertion in model container [2024-10-11 13:41:20,744 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:41:20" (3/3) ... [2024-10-11 13:41:20,745 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-70.i [2024-10-11 13:41:20,761 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:41:20,761 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:41:20,827 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:41:20,835 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;@61bac3a5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:41:20,835 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:41:20,839 INFO L276 IsEmpty]: Start isEmpty. Operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:20,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 13:41:20,849 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:20,850 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:20,851 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:20,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:20,855 INFO L85 PathProgramCache]: Analyzing trace with hash 664825246, now seen corresponding path program 1 times [2024-10-11 13:41:20,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:20,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003478465] [2024-10-11 13:41:20,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:20,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:21,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:21,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:21,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:21,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:21,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,263 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:21,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:21,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003478465] [2024-10-11 13:41:21,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003478465] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:21,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:21,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:41:21,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874552526] [2024-10-11 13:41:21,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:21,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:41:21,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:21,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:41:21,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:41:21,303 INFO L87 Difference]: Start difference. First operand has 104 states, 89 states have (on average 1.4719101123595506) internal successors, (131), 90 states have internal predecessors, (131), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:21,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:21,352 INFO L93 Difference]: Finished difference Result 205 states and 320 transitions. [2024-10-11 13:41:21,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:41:21,356 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-11 13:41:21,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:21,365 INFO L225 Difference]: With dead ends: 205 [2024-10-11 13:41:21,365 INFO L226 Difference]: Without dead ends: 102 [2024-10-11 13:41:21,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:41:21,374 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:21,375 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:21,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-10-11 13:41:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2024-10-11 13:41:21,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.4318181818181819) internal successors, (126), 88 states have internal predecessors, (126), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 150 transitions. [2024-10-11 13:41:21,421 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 150 transitions. Word has length 111 [2024-10-11 13:41:21,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:21,422 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 150 transitions. [2024-10-11 13:41:21,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 27.0) internal successors, (54), 2 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:21,425 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 150 transitions. [2024-10-11 13:41:21,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 13:41:21,429 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:21,429 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:21,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:41:21,429 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:21,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:21,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1717517358, now seen corresponding path program 1 times [2024-10-11 13:41:21,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:21,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087515752] [2024-10-11 13:41:21,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:21,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:21,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:21,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:21,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:21,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:21,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:21,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:21,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:21,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:21,743 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:21,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:21,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087515752] [2024-10-11 13:41:21,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087515752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:21,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:21,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:41:21,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069533562] [2024-10-11 13:41:21,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:21,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:41:21,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:21,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:41:21,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:21,747 INFO L87 Difference]: Start difference. First operand 102 states and 150 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:21,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:21,802 INFO L93 Difference]: Finished difference Result 205 states and 302 transitions. [2024-10-11 13:41:21,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:41:21,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 111 [2024-10-11 13:41:21,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:21,804 INFO L225 Difference]: With dead ends: 205 [2024-10-11 13:41:21,804 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 13:41:21,805 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:21,806 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:21,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:21,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 13:41:21,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 13:41:21,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.4222222222222223) internal successors, (128), 90 states have internal predecessors, (128), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:21,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 152 transitions. [2024-10-11 13:41:21,823 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 152 transitions. Word has length 111 [2024-10-11 13:41:21,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:21,826 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 152 transitions. [2024-10-11 13:41:21,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-11 13:41:21,826 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 152 transitions. [2024-10-11 13:41:21,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-11 13:41:21,829 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:21,829 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:21,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:41:21,830 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:21,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:21,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1361296212, now seen corresponding path program 1 times [2024-10-11 13:41:21,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:21,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804946984] [2024-10-11 13:41:21,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:21,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:21,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:22,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:22,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:22,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:22,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:22,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:22,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:22,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:22,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:22,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:22,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:22,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804946984] [2024-10-11 13:41:22,171 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804946984] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:22,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:22,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:41:22,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014309915] [2024-10-11 13:41:22,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:22,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:41:22,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:22,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:41:22,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:22,173 INFO L87 Difference]: Start difference. First operand 104 states and 152 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:22,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:22,224 INFO L93 Difference]: Finished difference Result 209 states and 306 transitions. [2024-10-11 13:41:22,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:41:22,228 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 111 [2024-10-11 13:41:22,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:22,230 INFO L225 Difference]: With dead ends: 209 [2024-10-11 13:41:22,230 INFO L226 Difference]: Without dead ends: 106 [2024-10-11 13:41:22,231 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:22,232 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:22,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:22,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-11 13:41:22,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-10-11 13:41:22,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 92 states have internal predecessors, (130), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2024-10-11 13:41:22,250 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 111 [2024-10-11 13:41:22,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:22,250 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2024-10-11 13:41:22,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:22,250 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2024-10-11 13:41:22,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 13:41:22,252 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:22,252 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:22,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:41:22,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:22,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:22,254 INFO L85 PathProgramCache]: Analyzing trace with hash -274363887, now seen corresponding path program 1 times [2024-10-11 13:41:22,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:22,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485464345] [2024-10-11 13:41:22,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:22,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:22,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:22,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:22,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:22,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:22,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,436 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:22,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:22,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485464345] [2024-10-11 13:41:22,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1485464345] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:22,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:22,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:41:22,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076660039] [2024-10-11 13:41:22,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:22,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:41:22,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:22,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:41:22,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:22,441 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:22,480 INFO L93 Difference]: Finished difference Result 214 states and 311 transitions. [2024-10-11 13:41:22,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:41:22,481 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-11 13:41:22,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:22,483 INFO L225 Difference]: With dead ends: 214 [2024-10-11 13:41:22,485 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 13:41:22,486 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:22,486 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 1 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:22,487 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 422 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:22,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 13:41:22,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2024-10-11 13:41:22,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:22,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2024-10-11 13:41:22,498 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 113 [2024-10-11 13:41:22,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:22,499 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2024-10-11 13:41:22,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:22,500 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2024-10-11 13:41:22,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 13:41:22,501 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:22,501 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:22,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 13:41:22,502 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:22,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:22,504 INFO L85 PathProgramCache]: Analyzing trace with hash -217105585, now seen corresponding path program 1 times [2024-10-11 13:41:22,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:22,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754347323] [2024-10-11 13:41:22,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:22,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:22,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:22,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:22,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:22,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:22,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:22,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:22,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:22,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:22,708 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:22,709 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754347323] [2024-10-11 13:41:22,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754347323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:22,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:22,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:41:22,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076790789] [2024-10-11 13:41:22,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:22,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:41:22,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:22,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:41:22,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:22,712 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:22,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:22,748 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-10-11 13:41:22,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:41:22,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-11 13:41:22,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:22,750 INFO L225 Difference]: With dead ends: 218 [2024-10-11 13:41:22,750 INFO L226 Difference]: Without dead ends: 111 [2024-10-11 13:41:22,751 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:22,752 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 1 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:22,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 426 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:22,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-10-11 13:41:22,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2024-10-11 13:41:22,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.3958333333333333) internal successors, (134), 96 states have internal predecessors, (134), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2024-10-11 13:41:22,762 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 113 [2024-10-11 13:41:22,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:22,763 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2024-10-11 13:41:22,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2024-10-11 13:41:22,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-11 13:41:22,768 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:22,768 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:22,768 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 13:41:22,768 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:22,769 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:22,770 INFO L85 PathProgramCache]: Analyzing trace with hash -217046003, now seen corresponding path program 1 times [2024-10-11 13:41:22,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:22,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902720779] [2024-10-11 13:41:22,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:22,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:22,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:23,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:23,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:23,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:23,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:23,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:23,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:23,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:23,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:23,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:23,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:23,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:23,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,118 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:23,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:23,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902720779] [2024-10-11 13:41:23,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902720779] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:23,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:23,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:23,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652409641] [2024-10-11 13:41:23,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:23,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:23,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:23,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:23,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:41:23,122 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:23,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:23,201 INFO L93 Difference]: Finished difference Result 271 states and 388 transitions. [2024-10-11 13:41:23,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:41:23,201 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 113 [2024-10-11 13:41:23,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:23,203 INFO L225 Difference]: With dead ends: 271 [2024-10-11 13:41:23,203 INFO L226 Difference]: Without dead ends: 162 [2024-10-11 13:41:23,204 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:23,205 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 58 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:23,207 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 558 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:23,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-11 13:41:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 127. [2024-10-11 13:41:23,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 113 states have (on average 1.407079646017699) internal successors, (159), 113 states have internal predecessors, (159), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-11 13:41:23,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 183 transitions. [2024-10-11 13:41:23,220 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 183 transitions. Word has length 113 [2024-10-11 13:41:23,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:23,221 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 183 transitions. [2024-10-11 13:41:23,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.2) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:23,221 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 183 transitions. [2024-10-11 13:41:23,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:41:23,223 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:23,223 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:23,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 13:41:23,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:23,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:23,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1615563785, now seen corresponding path program 1 times [2024-10-11 13:41:23,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:23,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125549173] [2024-10-11 13:41:23,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:23,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:23,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:23,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,613 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:23,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:23,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:23,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:23,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:23,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:23,657 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:23,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:23,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125549173] [2024-10-11 13:41:23,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125549173] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:23,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:23,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:41:23,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187731454] [2024-10-11 13:41:23,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:23,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:41:23,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:23,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:41:23,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:23,663 INFO L87 Difference]: Start difference. First operand 127 states and 183 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:23,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:23,764 INFO L93 Difference]: Finished difference Result 384 states and 554 transitions. [2024-10-11 13:41:23,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:41:23,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-11 13:41:23,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:23,768 INFO L225 Difference]: With dead ends: 384 [2024-10-11 13:41:23,768 INFO L226 Difference]: Without dead ends: 258 [2024-10-11 13:41:23,769 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:41:23,770 INFO L432 NwaCegarLoop]: 238 mSDtfsCounter, 139 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:23,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1084 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:23,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-11 13:41:23,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 256. [2024-10-11 13:41:23,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 229 states have (on average 1.4017467248908297) internal successors, (321), 229 states have internal predecessors, (321), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:41:23,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 369 transitions. [2024-10-11 13:41:23,788 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 369 transitions. Word has length 114 [2024-10-11 13:41:23,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:23,788 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 369 transitions. [2024-10-11 13:41:23,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 6 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:23,789 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 369 transitions. [2024-10-11 13:41:23,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-11 13:41:23,790 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:23,790 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:23,790 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 13:41:23,790 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:23,791 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:23,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1756112395, now seen corresponding path program 1 times [2024-10-11 13:41:23,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:23,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526743579] [2024-10-11 13:41:23,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:23,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:23,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:24,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:24,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:24,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:24,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:24,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:24,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:24,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:24,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:24,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,164 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:24,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:24,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526743579] [2024-10-11 13:41:24,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526743579] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:24,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:24,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:24,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099862320] [2024-10-11 13:41:24,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:24,165 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:24,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:24,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:24,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:41:24,167 INFO L87 Difference]: Start difference. First operand 256 states and 369 transitions. Second operand has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:24,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:24,238 INFO L93 Difference]: Finished difference Result 581 states and 832 transitions. [2024-10-11 13:41:24,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:41:24,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 114 [2024-10-11 13:41:24,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:24,241 INFO L225 Difference]: With dead ends: 581 [2024-10-11 13:41:24,241 INFO L226 Difference]: Without dead ends: 326 [2024-10-11 13:41:24,242 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:24,243 INFO L432 NwaCegarLoop]: 155 mSDtfsCounter, 53 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:24,244 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 602 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:24,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2024-10-11 13:41:24,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 264. [2024-10-11 13:41:24,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3881856540084387) internal successors, (329), 237 states have internal predecessors, (329), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:41:24,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 377 transitions. [2024-10-11 13:41:24,262 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 377 transitions. Word has length 114 [2024-10-11 13:41:24,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:24,266 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 377 transitions. [2024-10-11 13:41:24,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.4) internal successors, (57), 5 states have internal predecessors, (57), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:24,266 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 377 transitions. [2024-10-11 13:41:24,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 13:41:24,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:24,267 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:24,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-11 13:41:24,267 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:24,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash -246760152, now seen corresponding path program 1 times [2024-10-11 13:41:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:24,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203353234] [2024-10-11 13:41:24,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:24,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:24,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:24,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:24,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:24,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:24,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:24,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:24,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:24,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,523 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:24,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:24,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203353234] [2024-10-11 13:41:24,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203353234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:24,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:24,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 13:41:24,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953509145] [2024-10-11 13:41:24,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:24,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 13:41:24,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:24,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 13:41:24,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:41:24,528 INFO L87 Difference]: Start difference. First operand 264 states and 377 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:24,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:24,580 INFO L93 Difference]: Finished difference Result 527 states and 753 transitions. [2024-10-11 13:41:24,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 13:41:24,581 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-11 13:41:24,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:24,582 INFO L225 Difference]: With dead ends: 527 [2024-10-11 13:41:24,583 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 13:41:24,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 13:41:24,584 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:24,585 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 266 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:24,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 13:41:24,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-11 13:41:24,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.371308016877637) internal successors, (325), 237 states have internal predecessors, (325), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:41:24,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 373 transitions. [2024-10-11 13:41:24,596 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 373 transitions. Word has length 115 [2024-10-11 13:41:24,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:24,596 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 373 transitions. [2024-10-11 13:41:24,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:24,597 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 373 transitions. [2024-10-11 13:41:24,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-11 13:41:24,598 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:24,598 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:24,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-11 13:41:24,598 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:24,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:24,599 INFO L85 PathProgramCache]: Analyzing trace with hash 2054062438, now seen corresponding path program 1 times [2024-10-11 13:41:24,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:24,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013374369] [2024-10-11 13:41:24,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:24,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:24,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:24,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:24,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:24,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:24,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:24,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:24,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:24,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:24,953 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:24,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:24,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013374369] [2024-10-11 13:41:24,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013374369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:24,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:24,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:41:24,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128745616] [2024-10-11 13:41:24,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:24,955 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:41:24,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:24,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:41:24,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:24,955 INFO L87 Difference]: Start difference. First operand 264 states and 373 transitions. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:25,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:25,029 INFO L93 Difference]: Finished difference Result 527 states and 745 transitions. [2024-10-11 13:41:25,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:41:25,030 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 115 [2024-10-11 13:41:25,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:25,031 INFO L225 Difference]: With dead ends: 527 [2024-10-11 13:41:25,031 INFO L226 Difference]: Without dead ends: 264 [2024-10-11 13:41:25,032 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:41:25,033 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 1 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:25,033 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 380 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:25,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2024-10-11 13:41:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2024-10-11 13:41:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 237 states have (on average 1.3544303797468353) internal successors, (321), 237 states have internal predecessors, (321), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:41:25,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 369 transitions. [2024-10-11 13:41:25,041 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 369 transitions. Word has length 115 [2024-10-11 13:41:25,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:25,041 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 369 transitions. [2024-10-11 13:41:25,042 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:25,042 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 369 transitions. [2024-10-11 13:41:25,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:41:25,043 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:25,043 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:25,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-11 13:41:25,043 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:25,044 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:25,044 INFO L85 PathProgramCache]: Analyzing trace with hash -988195763, now seen corresponding path program 1 times [2024-10-11 13:41:25,044 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:25,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260395926] [2024-10-11 13:41:25,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:25,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:25,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:26,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:26,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:26,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:26,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:26,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:26,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:26,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:26,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:26,359 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:26,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:26,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260395926] [2024-10-11 13:41:26,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260395926] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:26,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:26,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:41:26,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093522640] [2024-10-11 13:41:26,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:26,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:41:26,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:26,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:41:26,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:41:26,362 INFO L87 Difference]: Start difference. First operand 264 states and 369 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:27,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:27,159 INFO L93 Difference]: Finished difference Result 957 states and 1341 transitions. [2024-10-11 13:41:27,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:41:27,160 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 13:41:27,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:27,163 INFO L225 Difference]: With dead ends: 957 [2024-10-11 13:41:27,163 INFO L226 Difference]: Without dead ends: 694 [2024-10-11 13:41:27,164 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:41:27,165 INFO L432 NwaCegarLoop]: 234 mSDtfsCounter, 269 mSDsluCounter, 1756 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 1990 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:27,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 1990 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-11 13:41:27,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2024-10-11 13:41:27,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 302. [2024-10-11 13:41:27,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 275 states have (on average 1.3636363636363635) internal successors, (375), 275 states have internal predecessors, (375), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-10-11 13:41:27,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 423 transitions. [2024-10-11 13:41:27,189 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 423 transitions. Word has length 117 [2024-10-11 13:41:27,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:27,189 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 423 transitions. [2024-10-11 13:41:27,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:27,189 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 423 transitions. [2024-10-11 13:41:27,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:41:27,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:27,191 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:27,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 13:41:27,191 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:27,191 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:27,191 INFO L85 PathProgramCache]: Analyzing trace with hash 2026907855, now seen corresponding path program 1 times [2024-10-11 13:41:27,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:27,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1970939300] [2024-10-11 13:41:27,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:27,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:27,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:27,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:27,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:27,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:27,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:27,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:27,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:27,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:27,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:27,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:27,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:27,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:27,810 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:27,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:27,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1970939300] [2024-10-11 13:41:27,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1970939300] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:27,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:27,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-11 13:41:27,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256318172] [2024-10-11 13:41:27,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:27,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-11 13:41:27,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:27,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-11 13:41:27,812 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:41:27,813 INFO L87 Difference]: Start difference. First operand 302 states and 423 transitions. Second operand has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:28,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:28,451 INFO L93 Difference]: Finished difference Result 887 states and 1224 transitions. [2024-10-11 13:41:28,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 13:41:28,452 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 13:41:28,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:28,456 INFO L225 Difference]: With dead ends: 887 [2024-10-11 13:41:28,456 INFO L226 Difference]: Without dead ends: 736 [2024-10-11 13:41:28,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2024-10-11 13:41:28,458 INFO L432 NwaCegarLoop]: 342 mSDtfsCounter, 317 mSDsluCounter, 2115 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 2457 SdHoareTripleChecker+Invalid, 486 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:28,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 2457 Invalid, 486 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:41:28,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 736 states. [2024-10-11 13:41:28,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 736 to 722. [2024-10-11 13:41:28,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 663 states have (on average 1.3469079939668176) internal successors, (893), 665 states have internal predecessors, (893), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 50 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-11 13:41:28,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 997 transitions. [2024-10-11 13:41:28,536 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 997 transitions. Word has length 117 [2024-10-11 13:41:28,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:28,536 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 997 transitions. [2024-10-11 13:41:28,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.454545454545454) internal successors, (60), 11 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:28,537 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 997 transitions. [2024-10-11 13:41:28,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:41:28,538 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:28,539 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:28,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 13:41:28,539 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:28,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:28,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2088947469, now seen corresponding path program 1 times [2024-10-11 13:41:28,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:28,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [626109216] [2024-10-11 13:41:28,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:28,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:28,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:28,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:28,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:28,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:28,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:28,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:28,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:28,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:28,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:28,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:28,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:28,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:28,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:28,776 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:28,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:28,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [626109216] [2024-10-11 13:41:28,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [626109216] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:28,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:28,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:28,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896635101] [2024-10-11 13:41:28,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:28,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:28,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:28,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:28,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:41:28,779 INFO L87 Difference]: Start difference. First operand 722 states and 997 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:28,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:28,922 INFO L93 Difference]: Finished difference Result 1558 states and 2140 transitions. [2024-10-11 13:41:28,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:41:28,923 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 13:41:28,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:28,927 INFO L225 Difference]: With dead ends: 1558 [2024-10-11 13:41:28,927 INFO L226 Difference]: Without dead ends: 837 [2024-10-11 13:41:28,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:28,929 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 66 mSDsluCounter, 506 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 707 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:28,929 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 707 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:28,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-11 13:41:28,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 722. [2024-10-11 13:41:28,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 722 states, 660 states have (on average 1.337878787878788) internal successors, (883), 663 states have internal predecessors, (883), 54 states have call successors, (54), 7 states have call predecessors, (54), 7 states have return successors, (54), 51 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-11 13:41:28,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 991 transitions. [2024-10-11 13:41:28,976 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 991 transitions. Word has length 117 [2024-10-11 13:41:28,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:28,976 INFO L471 AbstractCegarLoop]: Abstraction has 722 states and 991 transitions. [2024-10-11 13:41:28,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:28,977 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 991 transitions. [2024-10-11 13:41:28,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:41:28,978 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:28,978 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:28,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 13:41:28,979 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:28,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:28,979 INFO L85 PathProgramCache]: Analyzing trace with hash -965563509, now seen corresponding path program 1 times [2024-10-11 13:41:28,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:28,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492947980] [2024-10-11 13:41:28,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:28,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:29,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:29,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:29,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:29,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:29,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:29,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:29,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:29,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:29,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:29,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:29,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,205 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:29,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:29,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492947980] [2024-10-11 13:41:29,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492947980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:29,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:29,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:29,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766945636] [2024-10-11 13:41:29,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:29,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:29,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:29,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:29,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:41:29,208 INFO L87 Difference]: Start difference. First operand 722 states and 991 transitions. Second operand has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:29,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:29,349 INFO L93 Difference]: Finished difference Result 1553 states and 2121 transitions. [2024-10-11 13:41:29,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:41:29,350 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 13:41:29,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:29,353 INFO L225 Difference]: With dead ends: 1553 [2024-10-11 13:41:29,353 INFO L226 Difference]: Without dead ends: 831 [2024-10-11 13:41:29,355 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:29,355 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 66 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:29,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 639 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:29,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 831 states. [2024-10-11 13:41:29,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 831 to 749. [2024-10-11 13:41:29,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 749 states, 684 states have (on average 1.3304093567251463) internal successors, (910), 688 states have internal predecessors, (910), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:41:29,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 749 states to 749 states and 1022 transitions. [2024-10-11 13:41:29,412 INFO L78 Accepts]: Start accepts. Automaton has 749 states and 1022 transitions. Word has length 117 [2024-10-11 13:41:29,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:29,413 INFO L471 AbstractCegarLoop]: Abstraction has 749 states and 1022 transitions. [2024-10-11 13:41:29,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.0) internal successors, (60), 5 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:29,413 INFO L276 IsEmpty]: Start isEmpty. Operand 749 states and 1022 transitions. [2024-10-11 13:41:29,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:41:29,414 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:29,414 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:29,415 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 13:41:29,415 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:29,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:29,415 INFO L85 PathProgramCache]: Analyzing trace with hash 2049540109, now seen corresponding path program 1 times [2024-10-11 13:41:29,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:29,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112720212] [2024-10-11 13:41:29,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:29,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:29,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:29,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:29,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:29,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:29,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:29,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:29,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:29,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:29,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:29,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:29,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:29,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:29,866 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:29,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:29,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112720212] [2024-10-11 13:41:29,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112720212] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:29,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:29,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:41:29,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455797549] [2024-10-11 13:41:29,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:29,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:41:29,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:29,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:41:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:29,868 INFO L87 Difference]: Start difference. First operand 749 states and 1022 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:30,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:30,046 INFO L93 Difference]: Finished difference Result 1132 states and 1543 transitions. [2024-10-11 13:41:30,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:41:30,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 117 [2024-10-11 13:41:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:30,050 INFO L225 Difference]: With dead ends: 1132 [2024-10-11 13:41:30,050 INFO L226 Difference]: Without dead ends: 734 [2024-10-11 13:41:30,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:41:30,052 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 76 mSDsluCounter, 630 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 815 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:30,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 815 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:41:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 734 states. [2024-10-11 13:41:30,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 734 to 720. [2024-10-11 13:41:30,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 720 states, 655 states have (on average 1.3236641221374046) internal successors, (867), 659 states have internal predecessors, (867), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:41:30,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 720 states to 720 states and 979 transitions. [2024-10-11 13:41:30,118 INFO L78 Accepts]: Start accepts. Automaton has 720 states and 979 transitions. Word has length 117 [2024-10-11 13:41:30,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:30,118 INFO L471 AbstractCegarLoop]: Abstraction has 720 states and 979 transitions. [2024-10-11 13:41:30,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 720 states and 979 transitions. [2024-10-11 13:41:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-11 13:41:30,120 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:30,120 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:30,120 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-11 13:41:30,120 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:30,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:30,121 INFO L85 PathProgramCache]: Analyzing trace with hash 2111579723, now seen corresponding path program 1 times [2024-10-11 13:41:30,121 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:30,121 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810441967] [2024-10-11 13:41:30,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:30,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:30,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:33,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:33,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:33,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:33,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,336 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:33,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:33,339 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:33,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:33,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810441967] [2024-10-11 13:41:33,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810441967] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:33,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:33,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2024-10-11 13:41:33,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634663116] [2024-10-11 13:41:33,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:33,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-11 13:41:33,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:33,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-11 13:41:33,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2024-10-11 13:41:33,343 INFO L87 Difference]: Start difference. First operand 720 states and 979 transitions. Second operand has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:48,222 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-10-11 13:41:55,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:55,314 INFO L93 Difference]: Finished difference Result 1574 states and 2128 transitions. [2024-10-11 13:41:55,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-10-11 13:41:55,315 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 117 [2024-10-11 13:41:55,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:55,319 INFO L225 Difference]: With dead ends: 1574 [2024-10-11 13:41:55,319 INFO L226 Difference]: Without dead ends: 855 [2024-10-11 13:41:55,321 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=166, Invalid=956, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 13:41:55,321 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 386 mSDsluCounter, 2233 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 2450 SdHoareTripleChecker+Invalid, 1048 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:55,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 2450 Invalid, 1048 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-10-11 13:41:55,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2024-10-11 13:41:55,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 746. [2024-10-11 13:41:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 746 states, 681 states have (on average 1.3230543318649046) internal successors, (901), 685 states have internal predecessors, (901), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:41:55,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 746 states and 1013 transitions. [2024-10-11 13:41:55,380 INFO L78 Accepts]: Start accepts. Automaton has 746 states and 1013 transitions. Word has length 117 [2024-10-11 13:41:55,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:55,380 INFO L471 AbstractCegarLoop]: Abstraction has 746 states and 1013 transitions. [2024-10-11 13:41:55,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 3.75) internal successors, (60), 17 states have internal predecessors, (60), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:55,381 INFO L276 IsEmpty]: Start isEmpty. Operand 746 states and 1013 transitions. [2024-10-11 13:41:55,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 13:41:55,382 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:55,382 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:55,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 13:41:55,383 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:55,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:55,383 INFO L85 PathProgramCache]: Analyzing trace with hash 687537525, now seen corresponding path program 1 times [2024-10-11 13:41:55,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:55,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829736858] [2024-10-11 13:41:55,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:55,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:55,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:55,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:55,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:55,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:55,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:55,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:55,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:55,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:55,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:55,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:55,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:55,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:55,746 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:55,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:55,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829736858] [2024-10-11 13:41:55,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829736858] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:55,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:55,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:41:55,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1607805505] [2024-10-11 13:41:55,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:55,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:41:55,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:55,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:41:55,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:55,748 INFO L87 Difference]: Start difference. First operand 746 states and 1013 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:56,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:56,031 INFO L93 Difference]: Finished difference Result 2053 states and 2787 transitions. [2024-10-11 13:41:56,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:41:56,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-11 13:41:56,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:56,038 INFO L225 Difference]: With dead ends: 2053 [2024-10-11 13:41:56,038 INFO L226 Difference]: Without dead ends: 1308 [2024-10-11 13:41:56,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:56,041 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 130 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:56,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 611 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:41:56,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2024-10-11 13:41:56,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 756. [2024-10-11 13:41:56,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 691 states have (on average 1.312590448625181) internal successors, (907), 695 states have internal predecessors, (907), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:41:56,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1019 transitions. [2024-10-11 13:41:56,114 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1019 transitions. Word has length 118 [2024-10-11 13:41:56,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:56,114 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1019 transitions. [2024-10-11 13:41:56,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:56,115 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1019 transitions. [2024-10-11 13:41:56,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-11 13:41:56,116 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:56,116 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:56,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-11 13:41:56,117 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:56,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:56,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1107985739, now seen corresponding path program 1 times [2024-10-11 13:41:56,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:56,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255707023] [2024-10-11 13:41:56,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:56,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:56,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,331 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:56,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:56,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:56,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:56,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:56,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:56,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,345 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:56,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:56,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:56,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:56,352 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:56,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:56,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255707023] [2024-10-11 13:41:56,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255707023] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:56,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:56,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:41:56,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728074065] [2024-10-11 13:41:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:56,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:41:56,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:56,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:41:56,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:41:56,354 INFO L87 Difference]: Start difference. First operand 756 states and 1019 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:56,448 INFO L93 Difference]: Finished difference Result 1544 states and 2079 transitions. [2024-10-11 13:41:56,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:41:56,449 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-10-11 13:41:56,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:56,452 INFO L225 Difference]: With dead ends: 1544 [2024-10-11 13:41:56,453 INFO L226 Difference]: Without dead ends: 789 [2024-10-11 13:41:56,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:41:56,455 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 59 mSDsluCounter, 485 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:56,455 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 667 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:41:56,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2024-10-11 13:41:56,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 756. [2024-10-11 13:41:56,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 756 states, 691 states have (on average 1.301013024602026) internal successors, (899), 695 states have internal predecessors, (899), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 52 states have call predecessors, (56), 56 states have call successors, (56) [2024-10-11 13:41:56,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 756 states to 756 states and 1011 transitions. [2024-10-11 13:41:56,516 INFO L78 Accepts]: Start accepts. Automaton has 756 states and 1011 transitions. Word has length 118 [2024-10-11 13:41:56,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:56,516 INFO L471 AbstractCegarLoop]: Abstraction has 756 states and 1011 transitions. [2024-10-11 13:41:56,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:41:56,517 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states and 1011 transitions. [2024-10-11 13:41:56,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:41:56,518 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:56,518 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:56,518 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 13:41:56,518 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:56,519 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:56,519 INFO L85 PathProgramCache]: Analyzing trace with hash 662726311, now seen corresponding path program 1 times [2024-10-11 13:41:56,519 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:56,519 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867269611] [2024-10-11 13:41:56,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:56,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:41:57,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:41:57,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:41:57,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:41:57,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:41:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:41:57,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:41:57,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:41:57,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:41:57,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:41:57,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:41:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:41:57,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:41:57,477 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:41:57,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:41:57,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867269611] [2024-10-11 13:41:57,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867269611] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:41:57,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:41:57,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-10-11 13:41:57,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149230173] [2024-10-11 13:41:57,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:41:57,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 13:41:57,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:41:57,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 13:41:57,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:41:57,481 INFO L87 Difference]: Start difference. First operand 756 states and 1011 transitions. Second operand has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:58,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:41:58,156 INFO L93 Difference]: Finished difference Result 1642 states and 2203 transitions. [2024-10-11 13:41:58,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:41:58,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 119 [2024-10-11 13:41:58,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:41:58,162 INFO L225 Difference]: With dead ends: 1642 [2024-10-11 13:41:58,162 INFO L226 Difference]: Without dead ends: 887 [2024-10-11 13:41:58,163 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=410, Unknown=0, NotChecked=0, Total=506 [2024-10-11 13:41:58,164 INFO L432 NwaCegarLoop]: 245 mSDtfsCounter, 335 mSDsluCounter, 1202 mSDsCounter, 0 mSdLazyCounter, 386 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 1447 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:41:58,164 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 1447 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 386 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:41:58,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2024-10-11 13:41:58,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 857. [2024-10-11 13:41:58,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 767 states have (on average 1.3063885267275097) internal successors, (1002), 772 states have internal predecessors, (1002), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:41:58,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1158 transitions. [2024-10-11 13:41:58,244 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1158 transitions. Word has length 119 [2024-10-11 13:41:58,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:41:58,244 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1158 transitions. [2024-10-11 13:41:58,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.636363636363637) internal successors, (62), 12 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:41:58,245 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1158 transitions. [2024-10-11 13:41:58,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-11 13:41:58,246 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:41:58,246 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:41:58,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-11 13:41:58,246 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:41:58,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:41:58,247 INFO L85 PathProgramCache]: Analyzing trace with hash -851850843, now seen corresponding path program 1 times [2024-10-11 13:41:58,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:41:58,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088593322] [2024-10-11 13:41:58,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:41:58,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:41:58,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:00,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:00,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:00,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:00,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:00,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:00,289 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:00,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:00,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088593322] [2024-10-11 13:42:00,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088593322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:00,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:00,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 13:42:00,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65398936] [2024-10-11 13:42:00,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:00,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 13:42:00,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:00,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 13:42:00,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=270, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:42:00,292 INFO L87 Difference]: Start difference. First operand 857 states and 1158 transitions. Second operand has 18 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:03,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:03,712 INFO L93 Difference]: Finished difference Result 1846 states and 2478 transitions. [2024-10-11 13:42:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 13:42:03,713 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 119 [2024-10-11 13:42:03,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:03,718 INFO L225 Difference]: With dead ends: 1846 [2024-10-11 13:42:03,718 INFO L226 Difference]: Without dead ends: 990 [2024-10-11 13:42:03,720 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=156, Invalid=966, Unknown=0, NotChecked=0, Total=1122 [2024-10-11 13:42:03,720 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 244 mSDsluCounter, 2187 mSDsCounter, 0 mSdLazyCounter, 1097 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 2408 SdHoareTripleChecker+Invalid, 1108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1097 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:03,720 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 2408 Invalid, 1108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1097 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-10-11 13:42:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 990 states. [2024-10-11 13:42:03,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 990 to 857. [2024-10-11 13:42:03,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 767 states have (on average 1.3063885267275097) internal successors, (1002), 772 states have internal predecessors, (1002), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:42:03,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1158 transitions. [2024-10-11 13:42:03,804 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1158 transitions. Word has length 119 [2024-10-11 13:42:03,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:03,805 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1158 transitions. [2024-10-11 13:42:03,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 18 states have internal predecessors, (62), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1158 transitions. [2024-10-11 13:42:03,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:42:03,806 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:03,807 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:03,807 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-11 13:42:03,807 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:03,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:03,807 INFO L85 PathProgramCache]: Analyzing trace with hash 206815558, now seen corresponding path program 1 times [2024-10-11 13:42:03,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:03,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319527872] [2024-10-11 13:42:03,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:03,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:03,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:04,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:04,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:04,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:04,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:04,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:04,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:04,422 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:04,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:04,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319527872] [2024-10-11 13:42:04,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319527872] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:04,423 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:04,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:42:04,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572806948] [2024-10-11 13:42:04,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:04,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:42:04,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:04,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:42:04,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:42:04,425 INFO L87 Difference]: Start difference. First operand 857 states and 1158 transitions. Second operand has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:04,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:04,825 INFO L93 Difference]: Finished difference Result 1837 states and 2471 transitions. [2024-10-11 13:42:04,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-11 13:42:04,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-10-11 13:42:04,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:04,831 INFO L225 Difference]: With dead ends: 1837 [2024-10-11 13:42:04,831 INFO L226 Difference]: Without dead ends: 981 [2024-10-11 13:42:04,833 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:42:04,833 INFO L432 NwaCegarLoop]: 226 mSDtfsCounter, 178 mSDsluCounter, 882 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:04,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1108 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 13:42:04,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 981 states. [2024-10-11 13:42:04,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 981 to 899. [2024-10-11 13:42:04,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 899 states, 809 states have (on average 1.3028430160692213) internal successors, (1054), 814 states have internal predecessors, (1054), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:42:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 899 states to 899 states and 1210 transitions. [2024-10-11 13:42:04,923 INFO L78 Accepts]: Start accepts. Automaton has 899 states and 1210 transitions. Word has length 120 [2024-10-11 13:42:04,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:04,923 INFO L471 AbstractCegarLoop]: Abstraction has 899 states and 1210 transitions. [2024-10-11 13:42:04,923 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:04,924 INFO L276 IsEmpty]: Start isEmpty. Operand 899 states and 1210 transitions. [2024-10-11 13:42:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:42:04,925 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:04,926 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:04,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-11 13:42:04,926 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:04,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:04,926 INFO L85 PathProgramCache]: Analyzing trace with hash 229447812, now seen corresponding path program 1 times [2024-10-11 13:42:04,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:04,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193792082] [2024-10-11 13:42:04,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:04,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:04,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:05,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:05,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:05,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:05,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:05,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:05,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:05,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:05,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:05,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:05,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:05,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,137 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:05,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:05,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193792082] [2024-10-11 13:42:05,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193792082] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:05,138 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:42:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549813785] [2024-10-11 13:42:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:05,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:42:05,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:05,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:42:05,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:42:05,140 INFO L87 Difference]: Start difference. First operand 899 states and 1210 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:05,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:05,280 INFO L93 Difference]: Finished difference Result 1773 states and 2387 transitions. [2024-10-11 13:42:05,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:42:05,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-10-11 13:42:05,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:05,285 INFO L225 Difference]: With dead ends: 1773 [2024-10-11 13:42:05,285 INFO L226 Difference]: Without dead ends: 875 [2024-10-11 13:42:05,287 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:42:05,288 INFO L432 NwaCegarLoop]: 181 mSDtfsCounter, 69 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 658 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:05,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 658 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:42:05,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2024-10-11 13:42:05,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 872. [2024-10-11 13:42:05,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 872 states, 782 states have (on average 1.29923273657289) internal successors, (1016), 787 states have internal predecessors, (1016), 78 states have call successors, (78), 11 states have call predecessors, (78), 11 states have return successors, (78), 73 states have call predecessors, (78), 78 states have call successors, (78) [2024-10-11 13:42:05,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 872 states to 872 states and 1172 transitions. [2024-10-11 13:42:05,364 INFO L78 Accepts]: Start accepts. Automaton has 872 states and 1172 transitions. Word has length 120 [2024-10-11 13:42:05,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:05,364 INFO L471 AbstractCegarLoop]: Abstraction has 872 states and 1172 transitions. [2024-10-11 13:42:05,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:05,365 INFO L276 IsEmpty]: Start isEmpty. Operand 872 states and 1172 transitions. [2024-10-11 13:42:05,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:42:05,366 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:05,366 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:05,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-11 13:42:05,366 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:05,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:05,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1859715706, now seen corresponding path program 1 times [2024-10-11 13:42:05,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:05,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75329809] [2024-10-11 13:42:05,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:05,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:05,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:05,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:05,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:05,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:05,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:05,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:05,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:05,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:05,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:05,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:05,994 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:05,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:05,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75329809] [2024-10-11 13:42:05,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75329809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:05,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:05,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:42:05,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707390130] [2024-10-11 13:42:05,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:05,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:42:05,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:05,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:42:05,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:42:05,997 INFO L87 Difference]: Start difference. First operand 872 states and 1172 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:42:06,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:06,360 INFO L93 Difference]: Finished difference Result 1756 states and 2356 transitions. [2024-10-11 13:42:06,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:42:06,362 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 120 [2024-10-11 13:42:06,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:06,367 INFO L225 Difference]: With dead ends: 1756 [2024-10-11 13:42:06,367 INFO L226 Difference]: Without dead ends: 885 [2024-10-11 13:42:06,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=160, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:42:06,369 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 317 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 317 SdHoareTripleChecker+Valid, 915 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:06,370 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [317 Valid, 915 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:42:06,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-10-11 13:42:06,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 475. [2024-10-11 13:42:06,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 475 states, 428 states have (on average 1.294392523364486) internal successors, (554), 431 states have internal predecessors, (554), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:42:06,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 475 states to 475 states and 634 transitions. [2024-10-11 13:42:06,438 INFO L78 Accepts]: Start accepts. Automaton has 475 states and 634 transitions. Word has length 120 [2024-10-11 13:42:06,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:06,439 INFO L471 AbstractCegarLoop]: Abstraction has 475 states and 634 transitions. [2024-10-11 13:42:06,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 8 states have internal predecessors, (63), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2024-10-11 13:42:06,440 INFO L276 IsEmpty]: Start isEmpty. Operand 475 states and 634 transitions. [2024-10-11 13:42:06,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:42:06,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:06,441 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:06,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-11 13:42:06,441 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:06,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:06,441 INFO L85 PathProgramCache]: Analyzing trace with hash 1852927264, now seen corresponding path program 1 times [2024-10-11 13:42:06,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:06,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [182639377] [2024-10-11 13:42:06,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:06,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:06,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:06,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:06,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:06,662 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:06,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:06,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [182639377] [2024-10-11 13:42:06,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [182639377] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:06,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:06,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:42:06,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733005011] [2024-10-11 13:42:06,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:06,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:42:06,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:06,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:42:06,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:42:06,665 INFO L87 Difference]: Start difference. First operand 475 states and 634 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:06,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:06,757 INFO L93 Difference]: Finished difference Result 894 states and 1194 transitions. [2024-10-11 13:42:06,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:42:06,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-10-11 13:42:06,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:06,760 INFO L225 Difference]: With dead ends: 894 [2024-10-11 13:42:06,760 INFO L226 Difference]: Without dead ends: 420 [2024-10-11 13:42:06,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:42:06,762 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 61 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:06,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 544 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:42:06,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2024-10-11 13:42:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 314. [2024-10-11 13:42:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 283 states have (on average 1.2862190812720848) internal successors, (364), 285 states have internal predecessors, (364), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:42:06,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 416 transitions. [2024-10-11 13:42:06,805 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 416 transitions. Word has length 120 [2024-10-11 13:42:06,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:06,805 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 416 transitions. [2024-10-11 13:42:06,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:06,807 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 416 transitions. [2024-10-11 13:42:06,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-10-11 13:42:06,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:06,808 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:06,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-11 13:42:06,808 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:06,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:06,809 INFO L85 PathProgramCache]: Analyzing trace with hash -1465680544, now seen corresponding path program 1 times [2024-10-11 13:42:06,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:06,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332219] [2024-10-11 13:42:06,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:06,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:07,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:07,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,314 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:07,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:07,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,320 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:07,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,326 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:07,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:07,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:07,356 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:07,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:07,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332219] [2024-10-11 13:42:07,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:07,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:07,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:42:07,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009664554] [2024-10-11 13:42:07,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:07,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:42:07,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:42:07,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:42:07,361 INFO L87 Difference]: Start difference. First operand 314 states and 416 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:07,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:07,764 INFO L93 Difference]: Finished difference Result 879 states and 1168 transitions. [2024-10-11 13:42:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:42:07,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 120 [2024-10-11 13:42:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:07,767 INFO L225 Difference]: With dead ends: 879 [2024-10-11 13:42:07,767 INFO L226 Difference]: Without dead ends: 566 [2024-10-11 13:42:07,768 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:42:07,768 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 246 mSDsluCounter, 878 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 1090 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:07,768 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 1090 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:42:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2024-10-11 13:42:07,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 385. [2024-10-11 13:42:07,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 354 states have (on average 1.265536723163842) internal successors, (448), 356 states have internal predecessors, (448), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:42:07,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 500 transitions. [2024-10-11 13:42:07,817 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 500 transitions. Word has length 120 [2024-10-11 13:42:07,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:07,817 INFO L471 AbstractCegarLoop]: Abstraction has 385 states and 500 transitions. [2024-10-11 13:42:07,817 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:07,818 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 500 transitions. [2024-10-11 13:42:07,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-11 13:42:07,818 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:07,819 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:07,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-11 13:42:07,819 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:07,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:07,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1406273578, now seen corresponding path program 1 times [2024-10-11 13:42:07,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:07,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682271056] [2024-10-11 13:42:07,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:07,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:10,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:10,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,569 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:10,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:10,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:10,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,576 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:10,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:10,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:10,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:10,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:10,588 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:10,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:10,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682271056] [2024-10-11 13:42:10,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682271056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:10,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:10,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2024-10-11 13:42:10,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341244388] [2024-10-11 13:42:10,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:10,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 13:42:10,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:10,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 13:42:10,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2024-10-11 13:42:10,591 INFO L87 Difference]: Start difference. First operand 385 states and 500 transitions. Second operand has 19 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 13:42:20,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:20,647 INFO L93 Difference]: Finished difference Result 778 states and 1007 transitions. [2024-10-11 13:42:20,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 13:42:20,648 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) Word has length 121 [2024-10-11 13:42:20,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:20,651 INFO L225 Difference]: With dead ends: 778 [2024-10-11 13:42:20,651 INFO L226 Difference]: Without dead ends: 394 [2024-10-11 13:42:20,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=163, Invalid=829, Unknown=0, NotChecked=0, Total=992 [2024-10-11 13:42:20,654 INFO L432 NwaCegarLoop]: 161 mSDtfsCounter, 428 mSDsluCounter, 1490 mSDsCounter, 0 mSdLazyCounter, 958 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 428 SdHoareTripleChecker+Valid, 1651 SdHoareTripleChecker+Invalid, 1005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 958 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:20,654 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [428 Valid, 1651 Invalid, 1005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 958 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2024-10-11 13:42:20,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2024-10-11 13:42:20,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 375. [2024-10-11 13:42:20,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 344 states have (on average 1.2674418604651163) internal successors, (436), 346 states have internal predecessors, (436), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:42:20,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 488 transitions. [2024-10-11 13:42:20,713 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 488 transitions. Word has length 121 [2024-10-11 13:42:20,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:20,714 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 488 transitions. [2024-10-11 13:42:20,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 4.0) internal successors, (64), 18 states have internal predecessors, (64), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 13:42:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 488 transitions. [2024-10-11 13:42:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 13:42:20,717 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:20,717 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:20,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-11 13:42:20,717 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:20,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:20,718 INFO L85 PathProgramCache]: Analyzing trace with hash 618614918, now seen corresponding path program 1 times [2024-10-11 13:42:20,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:20,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685491686] [2024-10-11 13:42:20,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:20,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:20,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:21,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:21,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:21,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:21,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:21,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:21,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:21,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685491686] [2024-10-11 13:42:21,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685491686] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:21,225 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:21,225 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-11 13:42:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254314241] [2024-10-11 13:42:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:21,226 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 13:42:21,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:21,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 13:42:21,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-10-11 13:42:21,227 INFO L87 Difference]: Start difference. First operand 375 states and 488 transitions. Second operand has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:21,577 INFO L93 Difference]: Finished difference Result 930 states and 1225 transitions. [2024-10-11 13:42:21,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-11 13:42:21,578 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 122 [2024-10-11 13:42:21,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:21,582 INFO L225 Difference]: With dead ends: 930 [2024-10-11 13:42:21,582 INFO L226 Difference]: Without dead ends: 556 [2024-10-11 13:42:21,583 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:42:21,583 INFO L432 NwaCegarLoop]: 173 mSDtfsCounter, 233 mSDsluCounter, 691 mSDsCounter, 0 mSdLazyCounter, 282 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:21,583 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 864 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 282 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:42:21,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2024-10-11 13:42:21,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 375. [2024-10-11 13:42:21,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 344 states have (on average 1.2587209302325582) internal successors, (433), 346 states have internal predecessors, (433), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-10-11 13:42:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 485 transitions. [2024-10-11 13:42:21,632 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 485 transitions. Word has length 122 [2024-10-11 13:42:21,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:21,633 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 485 transitions. [2024-10-11 13:42:21,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 8.125) internal successors, (65), 9 states have internal predecessors, (65), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:21,633 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 485 transitions. [2024-10-11 13:42:21,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-10-11 13:42:21,634 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:21,634 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:21,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-11 13:42:21,634 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:21,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:21,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1658829177, now seen corresponding path program 1 times [2024-10-11 13:42:21,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:21,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187119670] [2024-10-11 13:42:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:21,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:21,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:23,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:23,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:23,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:23,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:23,462 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:23,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:23,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187119670] [2024-10-11 13:42:23,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187119670] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:23,462 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:23,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2024-10-11 13:42:23,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522151003] [2024-10-11 13:42:23,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:23,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 13:42:23,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:23,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 13:42:23,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=315, Unknown=0, NotChecked=0, Total=380 [2024-10-11 13:42:23,464 INFO L87 Difference]: Start difference. First operand 375 states and 485 transitions. Second operand has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 13:42:24,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:24,550 INFO L93 Difference]: Finished difference Result 982 states and 1262 transitions. [2024-10-11 13:42:24,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 13:42:24,550 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) Word has length 122 [2024-10-11 13:42:24,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:24,553 INFO L225 Difference]: With dead ends: 982 [2024-10-11 13:42:24,553 INFO L226 Difference]: Without dead ends: 608 [2024-10-11 13:42:24,554 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=249, Invalid=1011, Unknown=0, NotChecked=0, Total=1260 [2024-10-11 13:42:24,555 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 629 mSDsluCounter, 1306 mSDsCounter, 0 mSdLazyCounter, 719 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:24,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1436 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 719 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:42:24,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2024-10-11 13:42:24,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 563. [2024-10-11 13:42:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 563 states, 516 states have (on average 1.251937984496124) internal successors, (646), 519 states have internal predecessors, (646), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:42:24,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 726 transitions. [2024-10-11 13:42:24,631 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 726 transitions. Word has length 122 [2024-10-11 13:42:24,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:24,631 INFO L471 AbstractCegarLoop]: Abstraction has 563 states and 726 transitions. [2024-10-11 13:42:24,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.611111111111111) internal successors, (65), 19 states have internal predecessors, (65), 6 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 6 states have call successors, (12) [2024-10-11 13:42:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 726 transitions. [2024-10-11 13:42:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 13:42:24,633 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:24,633 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:24,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-11 13:42:24,633 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:24,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:24,634 INFO L85 PathProgramCache]: Analyzing trace with hash 93950153, now seen corresponding path program 1 times [2024-10-11 13:42:24,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:24,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860868622] [2024-10-11 13:42:24,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:24,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:24,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:24,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:24,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:24,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:24,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:24,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:24,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:24,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:24,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:24,988 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:24,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:24,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860868622] [2024-10-11 13:42:24,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860868622] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:24,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:24,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 13:42:24,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1902781887] [2024-10-11 13:42:24,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:24,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 13:42:24,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:24,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 13:42:24,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:42:24,990 INFO L87 Difference]: Start difference. First operand 563 states and 726 transitions. Second operand has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:25,163 INFO L93 Difference]: Finished difference Result 1129 states and 1455 transitions. [2024-10-11 13:42:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 13:42:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 123 [2024-10-11 13:42:25,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:25,166 INFO L225 Difference]: With dead ends: 1129 [2024-10-11 13:42:25,166 INFO L226 Difference]: Without dead ends: 567 [2024-10-11 13:42:25,167 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-11 13:42:25,168 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 115 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:25,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 506 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:42:25,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2024-10-11 13:42:25,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 553. [2024-10-11 13:42:25,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 506 states have (on average 1.2470355731225296) internal successors, (631), 509 states have internal predecessors, (631), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:42:25,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 711 transitions. [2024-10-11 13:42:25,244 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 711 transitions. Word has length 123 [2024-10-11 13:42:25,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:25,244 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 711 transitions. [2024-10-11 13:42:25,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.0) internal successors, (66), 7 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:25,245 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 711 transitions. [2024-10-11 13:42:25,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-10-11 13:42:25,245 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:25,246 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:25,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-11 13:42:25,246 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:25,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash 616432520, now seen corresponding path program 1 times [2024-10-11 13:42:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:25,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906308901] [2024-10-11 13:42:25,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:25,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:25,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:25,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:25,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:25,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:25,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:25,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:25,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:25,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:25,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,595 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:25,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:25,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:25,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:25,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:25,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906308901] [2024-10-11 13:42:25,600 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906308901] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:25,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:25,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:42:25,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528890792] [2024-10-11 13:42:25,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:25,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:42:25,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:25,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:42:25,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:42:25,601 INFO L87 Difference]: Start difference. First operand 553 states and 711 transitions. Second operand has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:25,924 INFO L93 Difference]: Finished difference Result 1389 states and 1812 transitions. [2024-10-11 13:42:25,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:42:25,924 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 123 [2024-10-11 13:42:25,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:25,928 INFO L225 Difference]: With dead ends: 1389 [2024-10-11 13:42:25,928 INFO L226 Difference]: Without dead ends: 837 [2024-10-11 13:42:25,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-10-11 13:42:25,930 INFO L432 NwaCegarLoop]: 187 mSDtfsCounter, 411 mSDsluCounter, 597 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:25,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 784 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:42:25,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2024-10-11 13:42:26,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 553. [2024-10-11 13:42:26,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 506 states have (on average 1.2371541501976284) internal successors, (626), 509 states have internal predecessors, (626), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:42:26,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 706 transitions. [2024-10-11 13:42:26,013 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 706 transitions. Word has length 123 [2024-10-11 13:42:26,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:26,013 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 706 transitions. [2024-10-11 13:42:26,014 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.428571428571429) internal successors, (66), 8 states have internal predecessors, (66), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:26,014 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 706 transitions. [2024-10-11 13:42:26,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:42:26,015 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:26,015 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:26,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-11 13:42:26,015 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:26,016 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:26,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1352280852, now seen corresponding path program 1 times [2024-10-11 13:42:26,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:26,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058068158] [2024-10-11 13:42:26,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:26,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:26,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:26,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:26,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:26,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:26,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:26,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:26,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:26,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:26,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:26,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:26,387 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:26,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:26,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058068158] [2024-10-11 13:42:26,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058068158] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:26,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:26,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:42:26,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553012334] [2024-10-11 13:42:26,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:26,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:42:26,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:26,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:42:26,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:42:26,391 INFO L87 Difference]: Start difference. First operand 553 states and 706 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:26,618 INFO L93 Difference]: Finished difference Result 1100 states and 1406 transitions. [2024-10-11 13:42:26,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 13:42:26,618 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-10-11 13:42:26,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:26,621 INFO L225 Difference]: With dead ends: 1100 [2024-10-11 13:42:26,621 INFO L226 Difference]: Without dead ends: 548 [2024-10-11 13:42:26,622 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-10-11 13:42:26,623 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 3 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:26,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 839 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:42:26,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2024-10-11 13:42:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 548. [2024-10-11 13:42:26,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 501 states have (on average 1.219560878243513) internal successors, (611), 504 states have internal predecessors, (611), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:42:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 691 transitions. [2024-10-11 13:42:26,703 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 691 transitions. Word has length 124 [2024-10-11 13:42:26,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:26,703 INFO L471 AbstractCegarLoop]: Abstraction has 548 states and 691 transitions. [2024-10-11 13:42:26,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 8 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:26,703 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 691 transitions. [2024-10-11 13:42:26,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:42:26,704 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:26,704 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:26,705 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-11 13:42:26,705 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:26,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:26,705 INFO L85 PathProgramCache]: Analyzing trace with hash 842807762, now seen corresponding path program 1 times [2024-10-11 13:42:26,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:26,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568809865] [2024-10-11 13:42:26,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:26,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:26,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:27,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:27,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:27,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:27,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:27,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:27,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:27,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:27,374 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:27,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:27,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568809865] [2024-10-11 13:42:27,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568809865] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:27,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:27,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-11 13:42:27,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162435010] [2024-10-11 13:42:27,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:27,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-11 13:42:27,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:27,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-11 13:42:27,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2024-10-11 13:42:27,375 INFO L87 Difference]: Start difference. First operand 548 states and 691 transitions. Second operand has 15 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:28,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:28,048 INFO L93 Difference]: Finished difference Result 1274 states and 1599 transitions. [2024-10-11 13:42:28,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 13:42:28,049 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-10-11 13:42:28,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:28,052 INFO L225 Difference]: With dead ends: 1274 [2024-10-11 13:42:28,052 INFO L226 Difference]: Without dead ends: 727 [2024-10-11 13:42:28,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=108, Invalid=542, Unknown=0, NotChecked=0, Total=650 [2024-10-11 13:42:28,054 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 366 mSDsluCounter, 1404 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1561 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:28,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1561 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 13:42:28,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 727 states. [2024-10-11 13:42:28,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 727 to 608. [2024-10-11 13:42:28,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 561 states have (on average 1.2085561497326203) internal successors, (678), 564 states have internal predecessors, (678), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:42:28,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 758 transitions. [2024-10-11 13:42:28,119 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 758 transitions. Word has length 124 [2024-10-11 13:42:28,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:28,119 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 758 transitions. [2024-10-11 13:42:28,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 5.153846153846154) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:28,120 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 758 transitions. [2024-10-11 13:42:28,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:42:28,121 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:28,121 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:28,121 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-11 13:42:28,121 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:28,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:28,122 INFO L85 PathProgramCache]: Analyzing trace with hash 703535796, now seen corresponding path program 1 times [2024-10-11 13:42:28,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:28,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326346838] [2024-10-11 13:42:28,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:28,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:28,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:29,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:29,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:29,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:29,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:29,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:29,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:29,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:29,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:29,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,044 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:29,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:29,046 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:29,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:29,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326346838] [2024-10-11 13:42:29,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326346838] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:29,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:29,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2024-10-11 13:42:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741977164] [2024-10-11 13:42:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:29,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-10-11 13:42:29,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:29,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-10-11 13:42:29,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=260, Unknown=0, NotChecked=0, Total=306 [2024-10-11 13:42:29,048 INFO L87 Difference]: Start difference. First operand 608 states and 758 transitions. Second operand has 18 states, 15 states have (on average 4.466666666666667) internal successors, (67), 17 states have internal predecessors, (67), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 13:42:29,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:29,869 INFO L93 Difference]: Finished difference Result 1322 states and 1650 transitions. [2024-10-11 13:42:29,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 13:42:29,869 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.466666666666667) internal successors, (67), 17 states have internal predecessors, (67), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) Word has length 124 [2024-10-11 13:42:29,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:29,872 INFO L225 Difference]: With dead ends: 1322 [2024-10-11 13:42:29,872 INFO L226 Difference]: Without dead ends: 715 [2024-10-11 13:42:29,873 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=148, Invalid=722, Unknown=0, NotChecked=0, Total=870 [2024-10-11 13:42:29,875 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 361 mSDsluCounter, 1177 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:29,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 1295 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 712 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 13:42:29,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2024-10-11 13:42:29,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 610. [2024-10-11 13:42:29,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 563 states have (on average 1.2042628774422734) internal successors, (678), 566 states have internal predecessors, (678), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 37 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-11 13:42:29,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 758 transitions. [2024-10-11 13:42:29,963 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 758 transitions. Word has length 124 [2024-10-11 13:42:29,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:29,966 INFO L471 AbstractCegarLoop]: Abstraction has 610 states and 758 transitions. [2024-10-11 13:42:29,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.466666666666667) internal successors, (67), 17 states have internal predecessors, (67), 7 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2024-10-11 13:42:29,966 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 758 transitions. [2024-10-11 13:42:29,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:42:29,967 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:29,967 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:29,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-11 13:42:29,968 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:29,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:29,968 INFO L85 PathProgramCache]: Analyzing trace with hash -978529182, now seen corresponding path program 1 times [2024-10-11 13:42:29,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:29,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662839401] [2024-10-11 13:42:29,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:29,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:30,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:30,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:30,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:30,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:30,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:30,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:30,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:30,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:30,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:30,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:30,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,153 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:30,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:30,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662839401] [2024-10-11 13:42:30,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662839401] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:30,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:30,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:42:30,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743488490] [2024-10-11 13:42:30,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:30,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:42:30,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:30,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:42:30,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:42:30,155 INFO L87 Difference]: Start difference. First operand 610 states and 758 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:30,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:30,272 INFO L93 Difference]: Finished difference Result 681 states and 851 transitions. [2024-10-11 13:42:30,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:42:30,273 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 124 [2024-10-11 13:42:30,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:30,275 INFO L225 Difference]: With dead ends: 681 [2024-10-11 13:42:30,275 INFO L226 Difference]: Without dead ends: 679 [2024-10-11 13:42:30,275 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-11 13:42:30,276 INFO L432 NwaCegarLoop]: 203 mSDtfsCounter, 105 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 672 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:30,276 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 672 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:42:30,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 679 states. [2024-10-11 13:42:30,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 679 to 670. [2024-10-11 13:42:30,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 612 states have (on average 1.207516339869281) internal successors, (739), 616 states have internal predecessors, (739), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:42:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 835 transitions. [2024-10-11 13:42:30,359 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 835 transitions. Word has length 124 [2024-10-11 13:42:30,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:30,360 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 835 transitions. [2024-10-11 13:42:30,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-11 13:42:30,360 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 835 transitions. [2024-10-11 13:42:30,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:42:30,361 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:30,361 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:30,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-11 13:42:30,362 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:30,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:30,362 INFO L85 PathProgramCache]: Analyzing trace with hash -978469600, now seen corresponding path program 1 times [2024-10-11 13:42:30,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40761219] [2024-10-11 13:42:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:30,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:30,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:30,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:30,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:30,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:30,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:30,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:30,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:30,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:30,639 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:30,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:30,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40761219] [2024-10-11 13:42:30,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40761219] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:30,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:30,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 13:42:30,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900639402] [2024-10-11 13:42:30,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:30,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 13:42:30,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:30,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 13:42:30,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-11 13:42:30,641 INFO L87 Difference]: Start difference. First operand 670 states and 835 transitions. Second operand has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:30,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:30,803 INFO L93 Difference]: Finished difference Result 1293 states and 1602 transitions. [2024-10-11 13:42:30,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:42:30,804 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-10-11 13:42:30,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:30,807 INFO L225 Difference]: With dead ends: 1293 [2024-10-11 13:42:30,807 INFO L226 Difference]: Without dead ends: 670 [2024-10-11 13:42:30,808 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:42:30,808 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 212 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:30,809 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 379 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:42:30,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2024-10-11 13:42:30,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 670. [2024-10-11 13:42:30,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 612 states have (on average 1.1993464052287581) internal successors, (734), 616 states have internal predecessors, (734), 48 states have call successors, (48), 9 states have call predecessors, (48), 9 states have return successors, (48), 44 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-11 13:42:30,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 830 transitions. [2024-10-11 13:42:30,897 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 830 transitions. Word has length 124 [2024-10-11 13:42:30,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:30,897 INFO L471 AbstractCegarLoop]: Abstraction has 670 states and 830 transitions. [2024-10-11 13:42:30,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.4) internal successors, (67), 6 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:30,897 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 830 transitions. [2024-10-11 13:42:30,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:42:30,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:30,898 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:30,899 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-11 13:42:30,899 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:30,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:30,899 INFO L85 PathProgramCache]: Analyzing trace with hash -298411230, now seen corresponding path program 1 times [2024-10-11 13:42:30,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:30,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049985975] [2024-10-11 13:42:30,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:30,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:42:31,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-11 13:42:31,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-11 13:42:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-11 13:42:31,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:42:31,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-11 13:42:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-11 13:42:31,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-11 13:42:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-11 13:42:31,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-11 13:42:31,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-11 13:42:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-11 13:42:31,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:42:31,287 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-11 13:42:31,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:42:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049985975] [2024-10-11 13:42:31,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049985975] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:42:31,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:42:31,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 13:42:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389608930] [2024-10-11 13:42:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:42:31,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 13:42:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:42:31,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 13:42:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 13:42:31,289 INFO L87 Difference]: Start difference. First operand 670 states and 830 transitions. Second operand has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:31,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:42:31,619 INFO L93 Difference]: Finished difference Result 1305 states and 1601 transitions. [2024-10-11 13:42:31,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 13:42:31,619 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-10-11 13:42:31,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:42:31,622 INFO L225 Difference]: With dead ends: 1305 [2024-10-11 13:42:31,622 INFO L226 Difference]: Without dead ends: 682 [2024-10-11 13:42:31,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-10-11 13:42:31,623 INFO L432 NwaCegarLoop]: 174 mSDtfsCounter, 198 mSDsluCounter, 521 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 13:42:31,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 695 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 13:42:31,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 682 states. [2024-10-11 13:42:31,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 682 to 674. [2024-10-11 13:42:31,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 674 states, 616 states have (on average 1.1899350649350648) internal successors, (733), 620 states have internal predecessors, (733), 46 states have call successors, (46), 11 states have call predecessors, (46), 11 states have return successors, (46), 42 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-11 13:42:31,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 825 transitions. [2024-10-11 13:42:31,712 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 825 transitions. Word has length 124 [2024-10-11 13:42:31,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:42:31,713 INFO L471 AbstractCegarLoop]: Abstraction has 674 states and 825 transitions. [2024-10-11 13:42:31,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.571428571428571) internal successors, (67), 8 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2024-10-11 13:42:31,713 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 825 transitions. [2024-10-11 13:42:31,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-10-11 13:42:31,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:42:31,714 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 13:42:31,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-11 13:42:31,715 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:42:31,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:42:31,715 INFO L85 PathProgramCache]: Analyzing trace with hash -241152928, now seen corresponding path program 1 times [2024-10-11 13:42:31,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:42:31,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197472530] [2024-10-11 13:42:31,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:42:31,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:42:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:42:31,767 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:42:31,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:42:31,892 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:42:31,893 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:42:31,894 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:42:31,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-11 13:42:31,898 INFO L407 BasicCegarLoop]: Path program 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]