./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:05:40,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:05:40,418 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-04 01:05:40,423 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:05:40,425 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:05:40,444 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:05:40,445 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:05:40,445 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:05:40,445 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:05:40,445 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:05:40,445 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:05:40,445 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:05:40,446 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:05:40,446 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:05:40,446 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:05:40,446 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:05:40,447 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:05:40,447 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 [2025-03-04 01:05:40,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:05:40,675 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:05:40,677 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:05:40,677 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:05:40,678 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:05:40,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2025-03-04 01:05:41,795 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05b94f1f/afa15ecf8d7f4a95b6b8828675a1750e/FLAGd36750117 [2025-03-04 01:05:42,051 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:05:42,053 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2025-03-04 01:05:42,061 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05b94f1f/afa15ecf8d7f4a95b6b8828675a1750e/FLAGd36750117 [2025-03-04 01:05:42,075 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f05b94f1f/afa15ecf8d7f4a95b6b8828675a1750e [2025-03-04 01:05:42,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:05:42,079 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:05:42,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:05:42,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:05:42,084 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:05:42,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@736f61e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42, skipping insertion in model container [2025-03-04 01:05:42,086 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,109 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:05:42,207 WARN L250 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-a_file-4.i[915,928] [2025-03-04 01:05:42,261 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:05:42,275 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:05:42,283 WARN L250 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-a_file-4.i[915,928] [2025-03-04 01:05:42,326 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:05:42,341 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:05:42,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42 WrapperNode [2025-03-04 01:05:42,342 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:05:42,343 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:05:42,343 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:05:42,343 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:05:42,348 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,362 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,394 INFO L138 Inliner]: procedures = 29, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 493 [2025-03-04 01:05:42,395 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:05:42,395 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:05:42,395 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:05:42,395 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:05:42,401 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,401 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,409 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,428 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 38, 11, 55, 12, 12]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 4, 1, 4, 2, 2]. The 15 writes are split as follows [0, 4, 1, 5, 3, 2]. [2025-03-04 01:05:42,428 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,428 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,453 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,459 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,460 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,461 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,464 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:05:42,465 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:05:42,465 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:05:42,465 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:05:42,466 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (1/1) ... [2025-03-04 01:05:42,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:05:42,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:05:42,492 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:05:42,495 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:05:42,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 01:05:42,514 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-03-04 01:05:42,515 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-03-04 01:05:42,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-03-04 01:05:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:05:42,517 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:05:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 01:05:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 01:05:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 01:05:42,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 01:05:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 01:05:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 01:05:42,518 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:05:42,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:05:42,641 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:05:42,643 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:05:43,021 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite102#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite119#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite137#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-04 01:05:43,055 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-03-04 01:05:43,055 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:05:43,067 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:05:43,069 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:05:43,069 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:43 BoogieIcfgContainer [2025-03-04 01:05:43,069 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:05:43,071 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:05:43,071 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:05:43,075 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:05:43,075 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:05:42" (1/3) ... [2025-03-04 01:05:43,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60900a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:05:43, skipping insertion in model container [2025-03-04 01:05:43,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:05:42" (2/3) ... [2025-03-04 01:05:43,076 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60900a97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:05:43, skipping insertion in model container [2025-03-04 01:05:43,076 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:43" (3/3) ... [2025-03-04 01:05:43,077 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-4.i [2025-03-04 01:05:43,088 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:05:43,089 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-4.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:05:43,131 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:05:43,140 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;@2b78b932, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:05:43,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:05:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:05:43,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:05:43,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:43,156 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:43,156 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:43,160 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:43,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1626083602, now seen corresponding path program 1 times [2025-03-04 01:05:43,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:43,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648646364] [2025-03-04 01:05:43,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:43,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:43,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:05:43,290 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:05:43,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:43,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:43,428 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:05:43,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:43,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648646364] [2025-03-04 01:05:43,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648646364] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:43,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89094684] [2025-03-04 01:05:43,430 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:43,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:05:43,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:05:43,434 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:05:43,435 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 01:05:43,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:05:43,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:05:43,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:43,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:43,627 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:05:43,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:43,644 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2025-03-04 01:05:43,644 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:43,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89094684] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:43,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:05:43,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-04 01:05:43,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578070830] [2025-03-04 01:05:43,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:43,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:05:43,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:43,668 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:05:43,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:05:43,670 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:43,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:43,688 INFO L93 Difference]: Finished difference Result 212 states and 328 transitions. [2025-03-04 01:05:43,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:05:43,689 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-04 01:05:43,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:43,693 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:05:43,693 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:05:43,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:05:43,697 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:43,697 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:05:43,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 01:05:43,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:05:43,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-03-04 01:05:43,723 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2025-03-04 01:05:43,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:43,723 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-03-04 01:05:43,723 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:43,723 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-03-04 01:05:43,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:05:43,725 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:43,725 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:43,732 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 01:05:43,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-04 01:05:43,926 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:43,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:43,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1662114311, now seen corresponding path program 1 times [2025-03-04 01:05:43,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:43,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [447556244] [2025-03-04 01:05:43,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:43,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:43,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:05:43,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:05:43,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:43,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:44,252 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:44,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:44,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [447556244] [2025-03-04 01:05:44,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [447556244] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:44,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:44,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 01:05:44,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256921885] [2025-03-04 01:05:44,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:44,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:05:44,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:44,255 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:05:44,255 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:05:44,255 INFO L87 Difference]: Start difference. First operand 106 states and 154 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:44,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:44,289 INFO L93 Difference]: Finished difference Result 212 states and 309 transitions. [2025-03-04 01:05:44,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:05:44,289 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:05:44,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:44,291 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:05:44,291 INFO L226 Difference]: Without dead ends: 109 [2025-03-04 01:05:44,291 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 01:05:44,292 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:44,292 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 444 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:44,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-03-04 01:05:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2025-03-04 01:05:44,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 91 states have (on average 1.3846153846153846) internal successors, (126), 91 states have internal predecessors, (126), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:05:44,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 156 transitions. [2025-03-04 01:05:44,305 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 156 transitions. Word has length 130 [2025-03-04 01:05:44,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:44,306 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 156 transitions. [2025-03-04 01:05:44,306 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:44,306 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 156 transitions. [2025-03-04 01:05:44,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:05:44,307 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:44,307 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:44,307 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 01:05:44,307 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:44,308 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:44,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1661190790, now seen corresponding path program 1 times [2025-03-04 01:05:44,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:44,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137435275] [2025-03-04 01:05:44,308 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:44,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:44,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:05:44,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:05:44,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:44,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:45,053 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:45,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:45,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137435275] [2025-03-04 01:05:45,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137435275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:45,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:45,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:05:45,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517840198] [2025-03-04 01:05:45,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:45,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:05:45,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:45,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:05:45,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:45,057 INFO L87 Difference]: Start difference. First operand 108 states and 156 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:45,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:45,375 INFO L93 Difference]: Finished difference Result 283 states and 412 transitions. [2025-03-04 01:05:45,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:05:45,376 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:05:45,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:45,377 INFO L225 Difference]: With dead ends: 283 [2025-03-04 01:05:45,378 INFO L226 Difference]: Without dead ends: 178 [2025-03-04 01:05:45,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:45,381 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 143 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 868 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:45,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 868 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:05:45,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2025-03-04 01:05:45,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 110. [2025-03-04 01:05:45,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:05:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-03-04 01:05:45,395 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2025-03-04 01:05:45,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:45,396 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-03-04 01:05:45,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 6 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:45,396 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-03-04 01:05:45,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:05:45,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:45,398 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:45,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-04 01:05:45,398 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:45,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:45,398 INFO L85 PathProgramCache]: Analyzing trace with hash 836825147, now seen corresponding path program 1 times [2025-03-04 01:05:45,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:45,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934744006] [2025-03-04 01:05:45,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:45,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:45,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:05:45,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:05:45,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:45,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:45,589 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:05:45,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:45,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934744006] [2025-03-04 01:05:45,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934744006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:45,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1954076927] [2025-03-04 01:05:45,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:05:45,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:05:45,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:05:45,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 01:05:45,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:05:45,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:05:45,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:45,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:45,803 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 01:05:45,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:45,844 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:45,844 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:45,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1954076927] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:45,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:05:45,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2025-03-04 01:05:45,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648812115] [2025-03-04 01:05:45,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:45,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 01:05:45,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:45,846 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 01:05:45,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:45,846 INFO L87 Difference]: Start difference. First operand 110 states and 158 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:45,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:45,869 INFO L93 Difference]: Finished difference Result 219 states and 316 transitions. [2025-03-04 01:05:45,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 01:05:45,870 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:05:45,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:45,871 INFO L225 Difference]: With dead ends: 219 [2025-03-04 01:05:45,873 INFO L226 Difference]: Without dead ends: 112 [2025-03-04 01:05:45,873 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 131 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:45,874 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:45,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 446 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:45,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2025-03-04 01:05:45,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2025-03-04 01:05:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 95 states have (on average 1.368421052631579) internal successors, (130), 95 states have internal predecessors, (130), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:05:45,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 160 transitions. [2025-03-04 01:05:45,880 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 160 transitions. Word has length 130 [2025-03-04 01:05:45,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:45,880 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 160 transitions. [2025-03-04 01:05:45,880 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 160 transitions. [2025-03-04 01:05:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-04 01:05:45,882 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:45,882 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:45,889 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 01:05:46,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 01:05:46,086 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:46,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:46,087 INFO L85 PathProgramCache]: Analyzing trace with hash 170229525, now seen corresponding path program 1 times [2025-03-04 01:05:46,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942686] [2025-03-04 01:05:46,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:46,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:46,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:05:46,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:05:46,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:46,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:46,263 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 27 proven. 15 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2025-03-04 01:05:46,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942686] [2025-03-04 01:05:46,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942686] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 01:05:46,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362540416] [2025-03-04 01:05:46,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:46,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:05:46,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:05:46,265 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:05:46,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 01:05:46,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-04 01:05:46,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-04 01:05:46,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:46,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:46,433 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:05:46,436 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:05:46,464 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:46,466 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:05:46,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1362540416] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:46,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 01:05:46,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2025-03-04 01:05:46,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683890982] [2025-03-04 01:05:46,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:46,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:05:46,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:46,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:05:46,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:05:46,468 INFO L87 Difference]: Start difference. First operand 112 states and 160 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:46,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:46,495 INFO L93 Difference]: Finished difference Result 224 states and 321 transitions. [2025-03-04 01:05:46,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:05:46,496 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 132 [2025-03-04 01:05:46,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:46,497 INFO L225 Difference]: With dead ends: 224 [2025-03-04 01:05:46,498 INFO L226 Difference]: Without dead ends: 115 [2025-03-04 01:05:46,498 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:05:46,499 INFO L435 NwaCegarLoop]: 151 mSDtfsCounter, 0 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:46,499 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 590 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:05:46,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-03-04 01:05:46,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 113. [2025-03-04 01:05:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 96 states have internal predecessors, (131), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:05:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2025-03-04 01:05:46,509 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 132 [2025-03-04 01:05:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:46,510 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2025-03-04 01:05:46,510 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, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2025-03-04 01:05:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:46,511 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:46,512 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:46,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-04 01:05:46,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:05:46,712 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:46,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -2012546601, now seen corresponding path program 1 times [2025-03-04 01:05:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466836275] [2025-03-04 01:05:46,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:46,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:46,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:46,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:46,780 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:46,780 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:47,489 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:47,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:47,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466836275] [2025-03-04 01:05:47,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [466836275] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:47,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:47,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:05:47,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879230955] [2025-03-04 01:05:47,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:47,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:05:47,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:47,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:05:47,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:47,491 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:48,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:48,060 INFO L93 Difference]: Finished difference Result 383 states and 549 transitions. [2025-03-04 01:05:48,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:05:48,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:05:48,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:48,063 INFO L225 Difference]: With dead ends: 383 [2025-03-04 01:05:48,063 INFO L226 Difference]: Without dead ends: 273 [2025-03-04 01:05:48,064 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:05:48,064 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 236 mSDsluCounter, 713 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:48,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 897 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:05:48,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2025-03-04 01:05:48,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 207. [2025-03-04 01:05:48,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 178 states have (on average 1.3707865168539326) internal successors, (244), 179 states have internal predecessors, (244), 26 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 25 states have call predecessors, (26), 26 states have call successors, (26) [2025-03-04 01:05:48,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 296 transitions. [2025-03-04 01:05:48,087 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 296 transitions. Word has length 134 [2025-03-04 01:05:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:48,087 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 296 transitions. [2025-03-04 01:05:48,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 8.857142857142858) internal successors, (62), 8 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 296 transitions. [2025-03-04 01:05:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:48,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:48,088 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:48,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-04 01:05:48,089 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:48,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:48,089 INFO L85 PathProgramCache]: Analyzing trace with hash -504994792, now seen corresponding path program 1 times [2025-03-04 01:05:48,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:48,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033206462] [2025-03-04 01:05:48,089 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:48,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:48,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:48,187 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:48,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:48,188 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:48,966 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:48,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:48,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033206462] [2025-03-04 01:05:48,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033206462] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:48,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:48,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-04 01:05:48,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419966461] [2025-03-04 01:05:48,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:48,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 01:05:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:48,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 01:05:48,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:48,968 INFO L87 Difference]: Start difference. First operand 207 states and 296 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:49,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:49,287 INFO L93 Difference]: Finished difference Result 543 states and 774 transitions. [2025-03-04 01:05:49,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 01:05:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-04 01:05:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:49,296 INFO L225 Difference]: With dead ends: 543 [2025-03-04 01:05:49,296 INFO L226 Difference]: Without dead ends: 339 [2025-03-04 01:05:49,296 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:05:49,298 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 237 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:49,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 437 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:05:49,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2025-03-04 01:05:49,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 335. [2025-03-04 01:05:49,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 292 states have (on average 1.36986301369863) internal successors, (400), 295 states have internal predecessors, (400), 38 states have call successors, (38), 4 states have call predecessors, (38), 4 states have return successors, (38), 35 states have call predecessors, (38), 38 states have call successors, (38) [2025-03-04 01:05:49,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 476 transitions. [2025-03-04 01:05:49,326 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 476 transitions. Word has length 134 [2025-03-04 01:05:49,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:49,327 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 476 transitions. [2025-03-04 01:05:49,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 6 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:49,327 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 476 transitions. [2025-03-04 01:05:49,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:49,328 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:49,328 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:49,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-04 01:05:49,328 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:49,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:49,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1495502122, now seen corresponding path program 1 times [2025-03-04 01:05:49,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:49,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032326016] [2025-03-04 01:05:49,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:49,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:49,352 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:49,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:49,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:49,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:50,263 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:50,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:50,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032326016] [2025-03-04 01:05:50,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032326016] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:50,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:50,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-03-04 01:05:50,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764856435] [2025-03-04 01:05:50,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:50,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-04 01:05:50,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:50,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-04 01:05:50,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:05:50,265 INFO L87 Difference]: Start difference. First operand 335 states and 476 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:50,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:50,707 INFO L93 Difference]: Finished difference Result 729 states and 1030 transitions. [2025-03-04 01:05:50,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-04 01:05:50,708 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:05:50,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:50,710 INFO L225 Difference]: With dead ends: 729 [2025-03-04 01:05:50,711 INFO L226 Difference]: Without dead ends: 397 [2025-03-04 01:05:50,712 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2025-03-04 01:05:50,713 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 117 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 466 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:50,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1067 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 466 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:05:50,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2025-03-04 01:05:50,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 394. [2025-03-04 01:05:50,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 394 states, 339 states have (on average 1.3539823008849559) internal successors, (459), 343 states have internal predecessors, (459), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:50,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 394 states and 553 transitions. [2025-03-04 01:05:50,747 INFO L78 Accepts]: Start accepts. Automaton has 394 states and 553 transitions. Word has length 134 [2025-03-04 01:05:50,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:50,747 INFO L471 AbstractCegarLoop]: Abstraction has 394 states and 553 transitions. [2025-03-04 01:05:50,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 11 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:50,748 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 553 transitions. [2025-03-04 01:05:50,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:50,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:50,749 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:50,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 01:05:50,750 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:50,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:50,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1002513815, now seen corresponding path program 1 times [2025-03-04 01:05:50,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:50,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2045802349] [2025-03-04 01:05:50,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:50,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:50,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:50,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:50,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:50,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:51,412 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:51,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:51,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2045802349] [2025-03-04 01:05:51,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2045802349] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:51,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:51,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:05:51,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152441273] [2025-03-04 01:05:51,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:51,414 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:05:51,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:51,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:05:51,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:51,415 INFO L87 Difference]: Start difference. First operand 394 states and 553 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:51,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:51,722 INFO L93 Difference]: Finished difference Result 738 states and 1036 transitions. [2025-03-04 01:05:51,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:05:51,723 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2025-03-04 01:05:51,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:51,725 INFO L225 Difference]: With dead ends: 738 [2025-03-04 01:05:51,725 INFO L226 Difference]: Without dead ends: 394 [2025-03-04 01:05:51,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:51,726 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 110 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:51,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 920 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:05:51,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2025-03-04 01:05:51,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2025-03-04 01:05:51,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 392 states, 337 states have (on average 1.3501483679525224) internal successors, (455), 341 states have internal predecessors, (455), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:51,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 549 transitions. [2025-03-04 01:05:51,767 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 549 transitions. Word has length 134 [2025-03-04 01:05:51,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:51,768 INFO L471 AbstractCegarLoop]: Abstraction has 392 states and 549 transitions. [2025-03-04 01:05:51,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:51,768 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 549 transitions. [2025-03-04 01:05:51,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:51,769 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:51,770 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:51,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-04 01:05:51,770 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:51,770 INFO L85 PathProgramCache]: Analyzing trace with hash -363096110, now seen corresponding path program 1 times [2025-03-04 01:05:51,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:51,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500156776] [2025-03-04 01:05:51,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:51,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:51,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:51,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:51,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:51,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:52,229 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:52,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:52,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500156776] [2025-03-04 01:05:52,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500156776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:52,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:52,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:05:52,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260660642] [2025-03-04 01:05:52,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:52,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:05:52,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:52,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:05:52,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:05:52,231 INFO L87 Difference]: Start difference. First operand 392 states and 549 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:52,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:52,426 INFO L93 Difference]: Finished difference Result 797 states and 1115 transitions. [2025-03-04 01:05:52,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:05:52,430 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-04 01:05:52,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:52,432 INFO L225 Difference]: With dead ends: 797 [2025-03-04 01:05:52,432 INFO L226 Difference]: Without dead ends: 455 [2025-03-04 01:05:52,433 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:52,434 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 49 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:52,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 563 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:05:52,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2025-03-04 01:05:52,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 415. [2025-03-04 01:05:52,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 360 states have (on average 1.3444444444444446) internal successors, (484), 364 states have internal predecessors, (484), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 578 transitions. [2025-03-04 01:05:52,460 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 578 transitions. Word has length 134 [2025-03-04 01:05:52,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:52,465 INFO L471 AbstractCegarLoop]: Abstraction has 415 states and 578 transitions. [2025-03-04 01:05:52,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:52,465 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 578 transitions. [2025-03-04 01:05:52,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:52,468 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:52,469 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:52,469 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 01:05:52,469 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:52,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:52,469 INFO L85 PathProgramCache]: Analyzing trace with hash 722255831, now seen corresponding path program 1 times [2025-03-04 01:05:52,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:52,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1737779291] [2025-03-04 01:05:52,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:52,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:52,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:52,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:52,509 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:52,509 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:53,026 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:53,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:53,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1737779291] [2025-03-04 01:05:53,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1737779291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:53,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:53,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:05:53,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861437281] [2025-03-04 01:05:53,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:53,027 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:05:53,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:53,027 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:05:53,027 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:53,028 INFO L87 Difference]: Start difference. First operand 415 states and 578 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:53,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:53,323 INFO L93 Difference]: Finished difference Result 899 states and 1256 transitions. [2025-03-04 01:05:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:05:53,323 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2025-03-04 01:05:53,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:53,327 INFO L225 Difference]: With dead ends: 899 [2025-03-04 01:05:53,328 INFO L226 Difference]: Without dead ends: 534 [2025-03-04 01:05:53,329 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:53,329 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 109 mSDsluCounter, 637 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 811 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:53,330 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 811 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:05:53,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 534 states. [2025-03-04 01:05:53,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 534 to 531. [2025-03-04 01:05:53,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 531 states, 459 states have (on average 1.3485838779956427) internal successors, (619), 465 states have internal predecessors, (619), 62 states have call successors, (62), 9 states have call predecessors, (62), 9 states have return successors, (62), 56 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:05:53,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 531 states to 531 states and 743 transitions. [2025-03-04 01:05:53,373 INFO L78 Accepts]: Start accepts. Automaton has 531 states and 743 transitions. Word has length 134 [2025-03-04 01:05:53,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:53,375 INFO L471 AbstractCegarLoop]: Abstraction has 531 states and 743 transitions. [2025-03-04 01:05:53,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:53,375 INFO L276 IsEmpty]: Start isEmpty. Operand 531 states and 743 transitions. [2025-03-04 01:05:53,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:53,377 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:53,377 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:53,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 01:05:53,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:53,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:53,378 INFO L85 PathProgramCache]: Analyzing trace with hash -1074695528, now seen corresponding path program 1 times [2025-03-04 01:05:53,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:53,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020311040] [2025-03-04 01:05:53,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:53,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:53,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:53,424 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:53,424 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:53,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:54,008 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:54,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:54,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020311040] [2025-03-04 01:05:54,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020311040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:54,009 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:54,009 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:05:54,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20265725] [2025-03-04 01:05:54,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:54,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:05:54,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:54,010 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:05:54,010 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:05:54,010 INFO L87 Difference]: Start difference. First operand 531 states and 743 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:54,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:54,531 INFO L93 Difference]: Finished difference Result 1023 states and 1429 transitions. [2025-03-04 01:05:54,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:05:54,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:05:54,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:54,535 INFO L225 Difference]: With dead ends: 1023 [2025-03-04 01:05:54,535 INFO L226 Difference]: Without dead ends: 542 [2025-03-04 01:05:54,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:05:54,537 INFO L435 NwaCegarLoop]: 250 mSDtfsCounter, 114 mSDsluCounter, 1628 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 1878 SdHoareTripleChecker+Invalid, 496 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:54,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 1878 Invalid, 496 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:05:54,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-03-04 01:05:54,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 417. [2025-03-04 01:05:54,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 362 states have (on average 1.3425414364640884) internal successors, (486), 366 states have internal predecessors, (486), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:54,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 580 transitions. [2025-03-04 01:05:54,564 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 580 transitions. Word has length 134 [2025-03-04 01:05:54,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:54,564 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 580 transitions. [2025-03-04 01:05:54,565 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:54,565 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 580 transitions. [2025-03-04 01:05:54,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:54,565 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:54,566 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:54,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 01:05:54,566 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:54,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:54,566 INFO L85 PathProgramCache]: Analyzing trace with hash -1358352686, now seen corresponding path program 1 times [2025-03-04 01:05:54,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:54,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107901329] [2025-03-04 01:05:54,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:54,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:54,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:54,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:54,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:54,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:54,979 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:54,979 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:54,979 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107901329] [2025-03-04 01:05:54,979 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107901329] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:54,979 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:54,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:05:54,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [366968389] [2025-03-04 01:05:54,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:54,980 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:05:54,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:54,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:05:54,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:05:54,982 INFO L87 Difference]: Start difference. First operand 417 states and 580 transitions. Second operand has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:55,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:55,658 INFO L93 Difference]: Finished difference Result 782 states and 1086 transitions. [2025-03-04 01:05:55,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:05:55,659 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 134 [2025-03-04 01:05:55,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:55,661 INFO L225 Difference]: With dead ends: 782 [2025-03-04 01:05:55,661 INFO L226 Difference]: Without dead ends: 415 [2025-03-04 01:05:55,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:05:55,662 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 47 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 686 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.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:55,662 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 686 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:05:55,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2025-03-04 01:05:55,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 413. [2025-03-04 01:05:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 358 states have (on average 1.335195530726257) internal successors, (478), 362 states have internal predecessors, (478), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:55,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 572 transitions. [2025-03-04 01:05:55,686 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 572 transitions. Word has length 134 [2025-03-04 01:05:55,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:55,687 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 572 transitions. [2025-03-04 01:05:55,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.4) internal successors, (62), 5 states have internal predecessors, (62), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:05:55,687 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 572 transitions. [2025-03-04 01:05:55,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:55,688 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:55,688 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:55,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 01:05:55,688 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:55,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:55,688 INFO L85 PathProgramCache]: Analyzing trace with hash -225946674, now seen corresponding path program 1 times [2025-03-04 01:05:55,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:55,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [189527381] [2025-03-04 01:05:55,688 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:55,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:55,705 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:55,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:55,740 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:55,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:56,148 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:56,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:56,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [189527381] [2025-03-04 01:05:56,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [189527381] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:56,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:56,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:05:56,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134024764] [2025-03-04 01:05:56,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:56,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:05:56,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:56,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:05:56,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:05:56,150 INFO L87 Difference]: Start difference. First operand 413 states and 572 transitions. Second operand has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:56,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:56,531 INFO L93 Difference]: Finished difference Result 941 states and 1305 transitions. [2025-03-04 01:05:56,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:05:56,531 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 134 [2025-03-04 01:05:56,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:56,534 INFO L225 Difference]: With dead ends: 941 [2025-03-04 01:05:56,534 INFO L226 Difference]: Without dead ends: 578 [2025-03-04 01:05:56,536 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:05:56,537 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 117 mSDsluCounter, 1567 mSDsCounter, 0 mSdLazyCounter, 483 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1805 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 483 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:56,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1805 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 483 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:05:56,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states. [2025-03-04 01:05:56,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 575. [2025-03-04 01:05:56,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 501 states have (on average 1.3373253493013972) internal successors, (670), 507 states have internal predecessors, (670), 64 states have call successors, (64), 9 states have call predecessors, (64), 9 states have return successors, (64), 58 states have call predecessors, (64), 64 states have call successors, (64) [2025-03-04 01:05:56,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 798 transitions. [2025-03-04 01:05:56,571 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 798 transitions. Word has length 134 [2025-03-04 01:05:56,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:56,571 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 798 transitions. [2025-03-04 01:05:56,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.888888888888889) internal successors, (62), 10 states have internal predecessors, (62), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:05:56,572 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 798 transitions. [2025-03-04 01:05:56,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:56,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:56,573 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:56,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 01:05:56,573 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:56,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:56,573 INFO L85 PathProgramCache]: Analyzing trace with hash -2022898033, now seen corresponding path program 1 times [2025-03-04 01:05:56,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:56,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062831361] [2025-03-04 01:05:56,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:56,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:56,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:56,623 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:56,623 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:56,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:57,030 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:57,031 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:57,031 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062831361] [2025-03-04 01:05:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062831361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:05:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719684205] [2025-03-04 01:05:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:57,031 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:05:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:57,032 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:05:57,032 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:57,033 INFO L87 Difference]: Start difference. First operand 575 states and 798 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:57,337 INFO L93 Difference]: Finished difference Result 1098 states and 1522 transitions. [2025-03-04 01:05:57,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:05:57,339 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2025-03-04 01:05:57,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:57,342 INFO L225 Difference]: With dead ends: 1098 [2025-03-04 01:05:57,342 INFO L226 Difference]: Without dead ends: 573 [2025-03-04 01:05:57,344 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:57,344 INFO L435 NwaCegarLoop]: 245 mSDtfsCounter, 107 mSDsluCounter, 917 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:57,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 1162 Invalid, 337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:05:57,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 573 states. [2025-03-04 01:05:57,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 573 to 451. [2025-03-04 01:05:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 396 states have (on average 1.3308080808080809) internal successors, (527), 400 states have internal predecessors, (527), 47 states have call successors, (47), 7 states have call predecessors, (47), 7 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 621 transitions. [2025-03-04 01:05:57,376 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 621 transitions. Word has length 134 [2025-03-04 01:05:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 621 transitions. [2025-03-04 01:05:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 621 transitions. [2025-03-04 01:05:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:57,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:57,378 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:57,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 01:05:57,379 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:57,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1991811279, now seen corresponding path program 1 times [2025-03-04 01:05:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:57,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923389369] [2025-03-04 01:05:57,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:57,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:57,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:57,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:57,418 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:57,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:57,843 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:57,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:57,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923389369] [2025-03-04 01:05:57,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923389369] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:57,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:57,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:05:57,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724263502] [2025-03-04 01:05:57,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:57,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:05:57,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:57,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:05:57,846 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:57,846 INFO L87 Difference]: Start difference. First operand 451 states and 621 transitions. Second operand has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:58,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:58,142 INFO L93 Difference]: Finished difference Result 858 states and 1177 transitions. [2025-03-04 01:05:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:05:58,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2025-03-04 01:05:58,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:58,144 INFO L225 Difference]: With dead ends: 858 [2025-03-04 01:05:58,145 INFO L226 Difference]: Without dead ends: 457 [2025-03-04 01:05:58,145 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:05:58,146 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 109 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:58,146 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 813 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:05:58,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-04 01:05:58,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2025-03-04 01:05:58,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 399 states have (on average 1.3233082706766917) internal successors, (528), 403 states have internal predecessors, (528), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:58,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 622 transitions. [2025-03-04 01:05:58,171 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 622 transitions. Word has length 134 [2025-03-04 01:05:58,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:58,172 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 622 transitions. [2025-03-04 01:05:58,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 12.4) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:58,172 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 622 transitions. [2025-03-04 01:05:58,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-04 01:05:58,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:58,173 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:58,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-04 01:05:58,174 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:58,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:58,174 INFO L85 PathProgramCache]: Analyzing trace with hash 194859920, now seen corresponding path program 1 times [2025-03-04 01:05:58,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:58,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37403718] [2025-03-04 01:05:58,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:58,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:58,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-04 01:05:58,212 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-04 01:05:58,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:58,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:58,941 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:58,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:58,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37403718] [2025-03-04 01:05:58,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37403718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:58,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:58,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-04 01:05:58,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [954995491] [2025-03-04 01:05:58,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:58,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 01:05:58,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:58,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 01:05:58,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:05:58,943 INFO L87 Difference]: Start difference. First operand 455 states and 622 transitions. Second operand has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:59,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:05:59,449 INFO L93 Difference]: Finished difference Result 862 states and 1177 transitions. [2025-03-04 01:05:59,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:05:59,449 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 134 [2025-03-04 01:05:59,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:05:59,452 INFO L225 Difference]: With dead ends: 862 [2025-03-04 01:05:59,452 INFO L226 Difference]: Without dead ends: 457 [2025-03-04 01:05:59,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2025-03-04 01:05:59,454 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 111 mSDsluCounter, 1402 mSDsCounter, 0 mSdLazyCounter, 648 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 1582 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:05:59,454 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 1582 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 648 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:05:59,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2025-03-04 01:05:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 455. [2025-03-04 01:05:59,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 455 states, 399 states have (on average 1.3208020050125313) internal successors, (527), 403 states have internal predecessors, (527), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:05:59,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 621 transitions. [2025-03-04 01:05:59,479 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 621 transitions. Word has length 134 [2025-03-04 01:05:59,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:05:59,479 INFO L471 AbstractCegarLoop]: Abstraction has 455 states and 621 transitions. [2025-03-04 01:05:59,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.2) internal successors, (62), 12 states have internal predecessors, (62), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:05:59,479 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 621 transitions. [2025-03-04 01:05:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-04 01:05:59,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:05:59,481 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:05:59,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-04 01:05:59,481 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:05:59,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:05:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash 119561964, now seen corresponding path program 1 times [2025-03-04 01:05:59,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:05:59,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030236246] [2025-03-04 01:05:59,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:05:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:05:59,497 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-04 01:05:59,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-04 01:05:59,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:05:59,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:05:59,858 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:05:59,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:05:59,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030236246] [2025-03-04 01:05:59,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030236246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:05:59,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:05:59,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:05:59,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1054070950] [2025-03-04 01:05:59,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:05:59,859 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:05:59,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:05:59,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:05:59,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:05:59,860 INFO L87 Difference]: Start difference. First operand 455 states and 621 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:00,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:00,183 INFO L93 Difference]: Finished difference Result 1009 states and 1373 transitions. [2025-03-04 01:06:00,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:06:00,184 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 135 [2025-03-04 01:06:00,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:00,188 INFO L225 Difference]: With dead ends: 1009 [2025-03-04 01:06:00,189 INFO L226 Difference]: Without dead ends: 604 [2025-03-04 01:06:00,190 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:06:00,190 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 217 mSDsluCounter, 645 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:00,190 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 871 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:06:00,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2025-03-04 01:06:00,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 471. [2025-03-04 01:06:00,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 471 states, 415 states have (on average 1.3180722891566266) internal successors, (547), 419 states have internal predecessors, (547), 47 states have call successors, (47), 8 states have call predecessors, (47), 8 states have return successors, (47), 43 states have call predecessors, (47), 47 states have call successors, (47) [2025-03-04 01:06:00,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 641 transitions. [2025-03-04 01:06:00,218 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 641 transitions. Word has length 135 [2025-03-04 01:06:00,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:00,219 INFO L471 AbstractCegarLoop]: Abstraction has 471 states and 641 transitions. [2025-03-04 01:06:00,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:00,219 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 641 transitions. [2025-03-04 01:06:00,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:00,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:00,220 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:00,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-04 01:06:00,221 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:00,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:00,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1105141930, now seen corresponding path program 1 times [2025-03-04 01:06:00,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:00,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703997774] [2025-03-04 01:06:00,221 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:00,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:00,236 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:00,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:00,250 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:00,250 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:00,553 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:00,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:00,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703997774] [2025-03-04 01:06:00,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703997774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:00,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:00,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:06:00,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364083945] [2025-03-04 01:06:00,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:00,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:06:00,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:00,554 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:06:00,554 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:06:00,554 INFO L87 Difference]: Start difference. First operand 471 states and 641 transitions. Second operand has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:01,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:01,027 INFO L93 Difference]: Finished difference Result 1142 states and 1552 transitions. [2025-03-04 01:06:01,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:06:01,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-04 01:06:01,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:01,030 INFO L225 Difference]: With dead ends: 1142 [2025-03-04 01:06:01,031 INFO L226 Difference]: Without dead ends: 720 [2025-03-04 01:06:01,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:06:01,032 INFO L435 NwaCegarLoop]: 225 mSDtfsCounter, 255 mSDsluCounter, 948 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1173 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:01,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1173 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 498 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:06:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2025-03-04 01:06:01,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 560. [2025-03-04 01:06:01,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 560 states, 486 states have (on average 1.308641975308642) internal successors, (636), 491 states have internal predecessors, (636), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:06:01,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 760 transitions. [2025-03-04 01:06:01,071 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 760 transitions. Word has length 137 [2025-03-04 01:06:01,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:01,072 INFO L471 AbstractCegarLoop]: Abstraction has 560 states and 760 transitions. [2025-03-04 01:06:01,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.125) internal successors, (65), 8 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:01,072 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 760 transitions. [2025-03-04 01:06:01,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:01,073 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:01,073 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:01,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 01:06:01,074 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:01,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash 696317705, now seen corresponding path program 1 times [2025-03-04 01:06:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64952326] [2025-03-04 01:06:01,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:01,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:01,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:01,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:01,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:01,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:01,464 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:01,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:01,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64952326] [2025-03-04 01:06:01,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64952326] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:01,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:01,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:06:01,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031264642] [2025-03-04 01:06:01,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:01,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:06:01,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:01,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:06:01,467 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:06:01,467 INFO L87 Difference]: Start difference. First operand 560 states and 760 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:02,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:02,023 INFO L93 Difference]: Finished difference Result 1318 states and 1788 transitions. [2025-03-04 01:06:02,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:06:02,024 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-04 01:06:02,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:02,027 INFO L225 Difference]: With dead ends: 1318 [2025-03-04 01:06:02,028 INFO L226 Difference]: Without dead ends: 808 [2025-03-04 01:06:02,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:06:02,031 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 143 mSDsluCounter, 1647 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1899 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:02,031 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1899 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:06:02,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 808 states. [2025-03-04 01:06:02,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 808 to 573. [2025-03-04 01:06:02,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 573 states, 499 states have (on average 1.314629258517034) internal successors, (656), 504 states have internal predecessors, (656), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:06:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 780 transitions. [2025-03-04 01:06:02,076 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 780 transitions. Word has length 137 [2025-03-04 01:06:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:02,076 INFO L471 AbstractCegarLoop]: Abstraction has 573 states and 780 transitions. [2025-03-04 01:06:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:02,077 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 780 transitions. [2025-03-04 01:06:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:02,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:02,078 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:02,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-04 01:06:02,078 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:02,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1631395435, now seen corresponding path program 1 times [2025-03-04 01:06:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694559131] [2025-03-04 01:06:02,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:02,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:02,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:02,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:02,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:02,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:02,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:02,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694559131] [2025-03-04 01:06:02,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694559131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:02,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:02,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:06:02,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274899472] [2025-03-04 01:06:02,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:02,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:06:02,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:02,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:06:02,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:06:02,598 INFO L87 Difference]: Start difference. First operand 573 states and 780 transitions. Second operand has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:02,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:02,998 INFO L93 Difference]: Finished difference Result 714 states and 971 transitions. [2025-03-04 01:06:02,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:06:02,999 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-04 01:06:02,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:03,002 INFO L225 Difference]: With dead ends: 714 [2025-03-04 01:06:03,002 INFO L226 Difference]: Without dead ends: 712 [2025-03-04 01:06:03,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:06:03,003 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 199 mSDsluCounter, 1093 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 1285 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:03,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 1285 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:06:03,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-04 01:06:03,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 604. [2025-03-04 01:06:03,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 604 states, 530 states have (on average 1.3113207547169812) internal successors, (695), 535 states have internal predecessors, (695), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:06:03,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 819 transitions. [2025-03-04 01:06:03,071 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 819 transitions. Word has length 137 [2025-03-04 01:06:03,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:03,071 INFO L471 AbstractCegarLoop]: Abstraction has 604 states and 819 transitions. [2025-03-04 01:06:03,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.222222222222222) internal successors, (65), 10 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:03,071 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 819 transitions. [2025-03-04 01:06:03,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:03,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:03,073 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:03,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-04 01:06:03,073 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:03,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:03,073 INFO L85 PathProgramCache]: Analyzing trace with hash -1630471914, now seen corresponding path program 1 times [2025-03-04 01:06:03,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:03,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645562868] [2025-03-04 01:06:03,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:03,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:03,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:03,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:03,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:03,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:03,786 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:03,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:03,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645562868] [2025-03-04 01:06:03,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645562868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:03,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:03,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 01:06:03,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787409175] [2025-03-04 01:06:03,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:03,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 01:06:03,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:03,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 01:06:03,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-03-04 01:06:03,788 INFO L87 Difference]: Start difference. First operand 604 states and 819 transitions. Second operand has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:06:04,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:04,119 INFO L93 Difference]: Finished difference Result 1663 states and 2252 transitions. [2025-03-04 01:06:04,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:06:04,120 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2025-03-04 01:06:04,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:04,124 INFO L225 Difference]: With dead ends: 1663 [2025-03-04 01:06:04,124 INFO L226 Difference]: Without dead ends: 1109 [2025-03-04 01:06:04,125 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=104, Unknown=0, NotChecked=0, Total=132 [2025-03-04 01:06:04,127 INFO L435 NwaCegarLoop]: 193 mSDtfsCounter, 103 mSDsluCounter, 1065 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:04,127 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1258 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:06:04,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1109 states. [2025-03-04 01:06:04,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1109 to 833. [2025-03-04 01:06:04,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 833 states, 759 states have (on average 1.295125164690382) internal successors, (983), 764 states have internal predecessors, (983), 62 states have call successors, (62), 11 states have call predecessors, (62), 11 states have return successors, (62), 57 states have call predecessors, (62), 62 states have call successors, (62) [2025-03-04 01:06:04,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 833 states to 833 states and 1107 transitions. [2025-03-04 01:06:04,190 INFO L78 Accepts]: Start accepts. Automaton has 833 states and 1107 transitions. Word has length 137 [2025-03-04 01:06:04,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:04,190 INFO L471 AbstractCegarLoop]: Abstraction has 833 states and 1107 transitions. [2025-03-04 01:06:04,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 9.285714285714286) internal successors, (65), 9 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:06:04,191 INFO L276 IsEmpty]: Start isEmpty. Operand 833 states and 1107 transitions. [2025-03-04 01:06:04,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:04,193 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:04,193 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:04,193 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-04 01:06:04,193 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:04,194 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:04,194 INFO L85 PathProgramCache]: Analyzing trace with hash -657146424, now seen corresponding path program 1 times [2025-03-04 01:06:04,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:04,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734954771] [2025-03-04 01:06:04,194 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:04,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:04,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:04,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:04,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:04,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:04,544 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:04,544 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734954771] [2025-03-04 01:06:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734954771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:04,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:06:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54319507] [2025-03-04 01:06:04,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:04,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:06:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:04,546 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:06:04,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:06:04,546 INFO L87 Difference]: Start difference. First operand 833 states and 1107 transitions. Second operand has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:05,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:05,046 INFO L93 Difference]: Finished difference Result 1776 states and 2359 transitions. [2025-03-04 01:06:05,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 01:06:05,047 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-04 01:06:05,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:05,050 INFO L225 Difference]: With dead ends: 1776 [2025-03-04 01:06:05,050 INFO L226 Difference]: Without dead ends: 993 [2025-03-04 01:06:05,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:06:05,052 INFO L435 NwaCegarLoop]: 234 mSDtfsCounter, 228 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:05,052 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 909 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:06:05,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2025-03-04 01:06:05,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 906. [2025-03-04 01:06:05,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 906 states, 825 states have (on average 1.2945454545454544) internal successors, (1068), 831 states have internal predecessors, (1068), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:06:05,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 906 states to 906 states and 1204 transitions. [2025-03-04 01:06:05,106 INFO L78 Accepts]: Start accepts. Automaton has 906 states and 1204 transitions. Word has length 137 [2025-03-04 01:06:05,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:05,106 INFO L471 AbstractCegarLoop]: Abstraction has 906 states and 1204 transitions. [2025-03-04 01:06:05,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 10.833333333333334) internal successors, (65), 7 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:05,107 INFO L276 IsEmpty]: Start isEmpty. Operand 906 states and 1204 transitions. [2025-03-04 01:06:05,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:05,109 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:05,109 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:05,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-04 01:06:05,109 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:05,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:05,110 INFO L85 PathProgramCache]: Analyzing trace with hash -1065970649, now seen corresponding path program 1 times [2025-03-04 01:06:05,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:05,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464561400] [2025-03-04 01:06:05,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:05,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:05,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:05,135 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:05,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:05,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:05,449 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:05,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:05,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464561400] [2025-03-04 01:06:05,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464561400] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:05,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:05,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:06:05,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832906344] [2025-03-04 01:06:05,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:05,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:06:05,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:05,451 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:06:05,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:06:05,451 INFO L87 Difference]: Start difference. First operand 906 states and 1204 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:05,942 INFO L93 Difference]: Finished difference Result 1971 states and 2620 transitions. [2025-03-04 01:06:05,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:06:05,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-04 01:06:05,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:05,947 INFO L225 Difference]: With dead ends: 1971 [2025-03-04 01:06:05,947 INFO L226 Difference]: Without dead ends: 1115 [2025-03-04 01:06:05,949 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:06:05,949 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 312 mSDsluCounter, 694 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 841 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:05,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 841 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:06:05,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1115 states. [2025-03-04 01:06:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1115 to 855. [2025-03-04 01:06:06,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 774 states have (on average 1.297157622739018) internal successors, (1004), 780 states have internal predecessors, (1004), 68 states have call successors, (68), 12 states have call predecessors, (68), 12 states have return successors, (68), 62 states have call predecessors, (68), 68 states have call successors, (68) [2025-03-04 01:06:06,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1140 transitions. [2025-03-04 01:06:06,026 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1140 transitions. Word has length 137 [2025-03-04 01:06:06,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:06,026 INFO L471 AbstractCegarLoop]: Abstraction has 855 states and 1140 transitions. [2025-03-04 01:06:06,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:06,027 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1140 transitions. [2025-03-04 01:06:06,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:06,028 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:06,028 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:06,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-04 01:06:06,028 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:06,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:06,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1903276691, now seen corresponding path program 1 times [2025-03-04 01:06:06,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:06,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665481197] [2025-03-04 01:06:06,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:06,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:06,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:06,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:06,077 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:06,077 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:06,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:06,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665481197] [2025-03-04 01:06:06,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665481197] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:06,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:06,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-03-04 01:06:06,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410578014] [2025-03-04 01:06:06,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:06,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-04 01:06:06,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:06,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-04 01:06:06,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2025-03-04 01:06:06,939 INFO L87 Difference]: Start difference. First operand 855 states and 1140 transitions. Second operand has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:06:07,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:07,634 INFO L93 Difference]: Finished difference Result 946 states and 1257 transitions. [2025-03-04 01:06:07,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-04 01:06:07,634 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) Word has length 137 [2025-03-04 01:06:07,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:07,638 INFO L225 Difference]: With dead ends: 946 [2025-03-04 01:06:07,638 INFO L226 Difference]: Without dead ends: 944 [2025-03-04 01:06:07,639 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=96, Invalid=554, Unknown=0, NotChecked=0, Total=650 [2025-03-04 01:06:07,639 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 344 mSDsluCounter, 1419 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 1599 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:07,639 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [345 Valid, 1599 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:06:07,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2025-03-04 01:06:07,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 556. [2025-03-04 01:06:07,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 556 states, 519 states have (on average 1.28131021194605) internal successors, (665), 521 states have internal predecessors, (665), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:06:07,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 725 transitions. [2025-03-04 01:06:07,684 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 725 transitions. Word has length 137 [2025-03-04 01:06:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:07,684 INFO L471 AbstractCegarLoop]: Abstraction has 556 states and 725 transitions. [2025-03-04 01:06:07,684 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 5.909090909090909) internal successors, (65), 13 states have internal predecessors, (65), 3 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-04 01:06:07,684 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 725 transitions. [2025-03-04 01:06:07,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:07,685 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:07,686 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:07,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-03-04 01:06:07,686 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:07,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash 902539501, now seen corresponding path program 1 times [2025-03-04 01:06:07,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:07,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383869933] [2025-03-04 01:06:07,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:07,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:07,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:07,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:07,719 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:07,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:08,126 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:08,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:08,126 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383869933] [2025-03-04 01:06:08,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383869933] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:08,126 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:08,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 01:06:08,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911233293] [2025-03-04 01:06:08,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:08,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 01:06:08,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:08,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 01:06:08,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:06:08,127 INFO L87 Difference]: Start difference. First operand 556 states and 725 transitions. Second operand has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:08,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:08,731 INFO L93 Difference]: Finished difference Result 1326 states and 1737 transitions. [2025-03-04 01:06:08,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-04 01:06:08,732 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 137 [2025-03-04 01:06:08,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:08,734 INFO L225 Difference]: With dead ends: 1326 [2025-03-04 01:06:08,735 INFO L226 Difference]: Without dead ends: 773 [2025-03-04 01:06:08,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2025-03-04 01:06:08,737 INFO L435 NwaCegarLoop]: 221 mSDtfsCounter, 305 mSDsluCounter, 838 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:08,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1059 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-04 01:06:08,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-03-04 01:06:08,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 546. [2025-03-04 01:06:08,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 546 states, 509 states have (on average 1.2711198428290766) internal successors, (647), 511 states have internal predecessors, (647), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:06:08,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 707 transitions. [2025-03-04 01:06:08,775 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 707 transitions. Word has length 137 [2025-03-04 01:06:08,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:08,776 INFO L471 AbstractCegarLoop]: Abstraction has 546 states and 707 transitions. [2025-03-04 01:06:08,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.285714285714286) internal successors, (65), 8 states have internal predecessors, (65), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:08,777 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 707 transitions. [2025-03-04 01:06:08,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:08,778 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:08,778 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:08,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-03-04 01:06:08,779 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:08,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:08,780 INFO L85 PathProgramCache]: Analyzing trace with hash 493715276, now seen corresponding path program 1 times [2025-03-04 01:06:08,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:08,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803885898] [2025-03-04 01:06:08,780 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:08,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:08,796 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:08,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:08,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:08,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:08,922 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:08,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:08,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803885898] [2025-03-04 01:06:08,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803885898] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:08,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:08,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:06:08,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827730358] [2025-03-04 01:06:08,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:08,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:06:08,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:08,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:06:08,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:06:08,924 INFO L87 Difference]: Start difference. First operand 546 states and 707 transitions. Second operand has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:09,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:09,181 INFO L93 Difference]: Finished difference Result 1255 states and 1625 transitions. [2025-03-04 01:06:09,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:06:09,181 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-04 01:06:09,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:09,184 INFO L225 Difference]: With dead ends: 1255 [2025-03-04 01:06:09,184 INFO L226 Difference]: Without dead ends: 712 [2025-03-04 01:06:09,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-04 01:06:09,185 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 127 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 542 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:09,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 542 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:06:09,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2025-03-04 01:06:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 534. [2025-03-04 01:06:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 497 states have (on average 1.261569416498994) internal successors, (627), 499 states have internal predecessors, (627), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:06:09,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 687 transitions. [2025-03-04 01:06:09,222 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 687 transitions. Word has length 137 [2025-03-04 01:06:09,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:09,222 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 687 transitions. [2025-03-04 01:06:09,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.0) internal successors, (65), 5 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:09,223 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 687 transitions. [2025-03-04 01:06:09,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:09,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:09,224 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:09,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-03-04 01:06:09,224 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 647802956, now seen corresponding path program 1 times [2025-03-04 01:06:09,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:09,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1734211194] [2025-03-04 01:06:09,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:09,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:09,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:09,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:09,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:09,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:09,584 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:09,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1734211194] [2025-03-04 01:06:09,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1734211194] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:09,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:09,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-03-04 01:06:09,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338887034] [2025-03-04 01:06:09,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:09,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-03-04 01:06:09,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:09,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-03-04 01:06:09,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-03-04 01:06:09,587 INFO L87 Difference]: Start difference. First operand 534 states and 687 transitions. Second operand has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:10,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:10,148 INFO L93 Difference]: Finished difference Result 1228 states and 1569 transitions. [2025-03-04 01:06:10,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-04 01:06:10,148 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-04 01:06:10,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:10,151 INFO L225 Difference]: With dead ends: 1228 [2025-03-04 01:06:10,151 INFO L226 Difference]: Without dead ends: 697 [2025-03-04 01:06:10,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-03-04 01:06:10,152 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 133 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1820 SdHoareTripleChecker+Invalid, 566 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:10,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1820 Invalid, 566 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 01:06:10,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2025-03-04 01:06:10,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 534. [2025-03-04 01:06:10,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 497 states have (on average 1.261569416498994) internal successors, (627), 499 states have internal predecessors, (627), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:06:10,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 687 transitions. [2025-03-04 01:06:10,203 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 687 transitions. Word has length 137 [2025-03-04 01:06:10,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:10,204 INFO L471 AbstractCegarLoop]: Abstraction has 534 states and 687 transitions. [2025-03-04 01:06:10,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.5) internal successors, (65), 10 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:10,204 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 687 transitions. [2025-03-04 01:06:10,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-04 01:06:10,205 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:10,205 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:10,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-03-04 01:06:10,205 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:10,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:10,206 INFO L85 PathProgramCache]: Analyzing trace with hash -2139612531, now seen corresponding path program 1 times [2025-03-04 01:06:10,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:10,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197066247] [2025-03-04 01:06:10,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:10,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:10,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-04 01:06:10,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-04 01:06:10,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:10,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:10,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:10,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [197066247] [2025-03-04 01:06:10,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [197066247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:10,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:10,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:06:10,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504913022] [2025-03-04 01:06:10,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:10,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:06:10,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:10,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:06:10,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:06:10,558 INFO L87 Difference]: Start difference. First operand 534 states and 687 transitions. Second operand has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:10,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:10,992 INFO L93 Difference]: Finished difference Result 1372 states and 1781 transitions. [2025-03-04 01:06:10,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-04 01:06:10,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 137 [2025-03-04 01:06:10,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:10,996 INFO L225 Difference]: With dead ends: 1372 [2025-03-04 01:06:10,996 INFO L226 Difference]: Without dead ends: 841 [2025-03-04 01:06:10,997 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-03-04 01:06:10,998 INFO L435 NwaCegarLoop]: 270 mSDtfsCounter, 226 mSDsluCounter, 902 mSDsCounter, 0 mSdLazyCounter, 410 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 447 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 410 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:10,998 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1172 Invalid, 447 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 410 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 01:06:10,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 841 states. [2025-03-04 01:06:11,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 841 to 516. [2025-03-04 01:06:11,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 479 states have (on average 1.254697286012526) internal successors, (601), 481 states have internal predecessors, (601), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:06:11,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 661 transitions. [2025-03-04 01:06:11,040 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 661 transitions. Word has length 137 [2025-03-04 01:06:11,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:11,040 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 661 transitions. [2025-03-04 01:06:11,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.285714285714286) internal successors, (65), 7 states have internal predecessors, (65), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:11,040 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 661 transitions. [2025-03-04 01:06:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:06:11,041 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:11,041 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:11,041 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-03-04 01:06:11,042 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1800184744, now seen corresponding path program 1 times [2025-03-04 01:06:11,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:11,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849577598] [2025-03-04 01:06:11,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:11,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:06:11,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:06:11,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:11,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:11,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 01:06:11,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849577598] [2025-03-04 01:06:11,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849577598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:11,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:11,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-04 01:06:11,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977332350] [2025-03-04 01:06:11,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:11,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 01:06:11,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 01:06:11,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 01:06:11,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-04 01:06:11,579 INFO L87 Difference]: Start difference. First operand 516 states and 661 transitions. Second operand has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:11,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:11,842 INFO L93 Difference]: Finished difference Result 1102 states and 1418 transitions. [2025-03-04 01:06:11,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 01:06:11,843 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 139 [2025-03-04 01:06:11,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:11,846 INFO L225 Difference]: With dead ends: 1102 [2025-03-04 01:06:11,846 INFO L226 Difference]: Without dead ends: 589 [2025-03-04 01:06:11,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-04 01:06:11,847 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 112 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:11,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 638 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 01:06:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2025-03-04 01:06:11,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 516. [2025-03-04 01:06:11,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 516 states, 479 states have (on average 1.2526096033402923) internal successors, (600), 481 states have internal predecessors, (600), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2025-03-04 01:06:11,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 660 transitions. [2025-03-04 01:06:11,891 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 660 transitions. Word has length 139 [2025-03-04 01:06:11,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:11,891 INFO L471 AbstractCegarLoop]: Abstraction has 516 states and 660 transitions. [2025-03-04 01:06:11,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 11.166666666666666) internal successors, (67), 7 states have internal predecessors, (67), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:11,891 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 660 transitions. [2025-03-04 01:06:11,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-04 01:06:11,892 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:11,892 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:11,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-03-04 01:06:11,892 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:11,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:11,893 INFO L85 PathProgramCache]: Analyzing trace with hash 417573209, now seen corresponding path program 1 times [2025-03-04 01:06:11,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 01:06:11,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552652942] [2025-03-04 01:06:11,893 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:11,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 01:06:11,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:06:11,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:06:11,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:11,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-04 01:06:11,965 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1573634789] [2025-03-04 01:06:11,965 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:11,965 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:06:11,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:06:11,967 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 01:06:11,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 01:06:12,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:06:12,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:06:12,441 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:12,441 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:06:12,441 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 01:06:12,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-04 01:06:12,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-04 01:06:12,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:12,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 01:06:12,680 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 01:06:12,680 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 01:06:12,681 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-04 01:06:12,693 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-04 01:06:12,883 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 01:06:12,885 INFO L422 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] [2025-03-04 01:06:12,959 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 01:06:12,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 01:06:12 BoogieIcfgContainer [2025-03-04 01:06:12,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 01:06:12,964 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 01:06:12,964 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 01:06:12,964 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 01:06:12,966 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:05:43" (3/4) ... [2025-03-04 01:06:12,967 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-03-04 01:06:12,968 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 01:06:12,968 INFO L158 Benchmark]: Toolchain (without parser) took 30889.37ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 112.3MB in the beginning and 57.1MB in the end (delta: 55.2MB). Peak memory consumption was 78.4MB. Max. memory is 16.1GB. [2025-03-04 01:06:12,969 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:06:12,969 INFO L158 Benchmark]: CACSL2BoogieTranslator took 262.61ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 01:06:12,970 INFO L158 Benchmark]: Boogie Procedure Inliner took 51.57ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:06:12,970 INFO L158 Benchmark]: Boogie Preprocessor took 69.49ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 86.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 01:06:12,970 INFO L158 Benchmark]: IcfgBuilder took 604.32ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 51.0MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-03-04 01:06:12,970 INFO L158 Benchmark]: TraceAbstraction took 29892.31ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 50.6MB in the beginning and 57.2MB in the end (delta: -6.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. [2025-03-04 01:06:12,970 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 167.8MB. Free memory was 57.2MB in the beginning and 57.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 01:06:12,972 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 262.61ms. Allocated memory is still 142.6MB. Free memory was 112.3MB in the beginning and 96.2MB in the end (delta: 16.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 51.57ms. Allocated memory is still 142.6MB. Free memory was 96.2MB in the beginning and 91.3MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 69.49ms. Allocated memory is still 142.6MB. Free memory was 91.3MB in the beginning and 86.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 604.32ms. Allocated memory is still 142.6MB. Free memory was 86.4MB in the beginning and 51.0MB in the end (delta: 35.3MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 29892.31ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 50.6MB in the beginning and 57.2MB in the end (delta: -6.6MB). Peak memory consumption was 19.7MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 167.8MB. Free memory was 57.2MB in the beginning and 57.1MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 68, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 48, overapproximation of someBinaryFLOATComparisonOperation at line 70, overapproximation of someBinaryFLOATComparisonOperation at line 67, overapproximation of someBinaryFLOATComparisonOperation at line 65, overapproximation of someBinaryFLOATComparisonOperation at line 73, overapproximation of someBinaryFLOATComparisonOperation at line 93, overapproximation of someBinaryFLOATComparisonOperation at line 72, overapproximation of someBinaryFLOATComparisonOperation at line 67. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L22-L24] float float_Array_0[2][2] = { {99.6, 127.5}, {256.5, 16.5} }; [L25-L27] signed short int signed_short_int_Array_0[1] = { -25 }; [L25-L27] signed short int signed_short_int_Array_0[1] = { -25 }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L28-L30] unsigned char unsigned_char_Array_0[2][2] = { {4, 8}, {4, 0} }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L31-L33] unsigned long int unsigned_long_int_Array_0[2] = { 10, 4288034294 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L34-L36] unsigned short int unsigned_short_int_Array_0[2] = { 4, 5 }; [L37] unsigned char last_1_unsigned_char_Array_0_1__1_ = 0; [L38] unsigned long int last_1_unsigned_long_int_Array_0_0_ = 10; VAL [float_Array_0={4:0}, isInitial=0, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L97] isInitial = 1 [L98] FCALL initially() [L99] COND TRUE 1 [L100] CALL updateLastVariables() [L89] EXPR unsigned_char_Array_0[1][1] [L89] last_1_unsigned_char_Array_0_1__1_ = unsigned_char_Array_0[1][1] [L90] EXPR unsigned_long_int_Array_0[0] [L90] last_1_unsigned_long_int_Array_0_0_ = unsigned_long_int_Array_0[0] [L100] RET updateLastVariables() [L101] CALL updateVariables() [L64] float_Array_0[0][0] = __VERIFIER_nondet_float() [L65] EXPR float_Array_0[0][0] [L65] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F [L65] EXPR float_Array_0[0][0] [L65] EXPR float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] EXPR (float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] CALL assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L65] RET assume_abort_if_not((float_Array_0[0][0] >= -922337.2036854776000e+13F && float_Array_0[0][0] <= -1.0e-20F) || (float_Array_0[0][0] <= 9223372.036854776000e+12F && float_Array_0[0][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L66] float_Array_0[1][0] = __VERIFIER_nondet_float() [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F [L67] EXPR float_Array_0[1][0] [L67] EXPR float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] EXPR (float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] CALL assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L67] RET assume_abort_if_not((float_Array_0[1][0] >= -922337.2036854776000e+13F && float_Array_0[1][0] <= -1.0e-20F) || (float_Array_0[1][0] <= 9223372.036854776000e+12F && float_Array_0[1][0] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] CALL assume_abort_if_not(float_Array_0[1][0] != 0.0F) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L68] RET assume_abort_if_not(float_Array_0[1][0] != 0.0F) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L69] float_Array_0[0][1] = __VERIFIER_nondet_float() [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F [L70] EXPR float_Array_0[0][1] [L70] EXPR float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] EXPR (float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] CALL assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L70] RET assume_abort_if_not((float_Array_0[0][1] >= -922337.2036854776000e+13F && float_Array_0[0][1] <= -1.0e-20F) || (float_Array_0[0][1] <= 9223372.036854776000e+12F && float_Array_0[0][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L71] float_Array_0[1][1] = __VERIFIER_nondet_float() [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F [L72] EXPR float_Array_0[1][1] [L72] EXPR float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] EXPR (float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F ) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] CALL assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L72] RET assume_abort_if_not((float_Array_0[1][1] >= -922337.2036854776000e+13F && float_Array_0[1][1] <= -1.0e-20F) || (float_Array_0[1][1] <= 9223372.036854776000e+12F && float_Array_0[1][1] >= 1.0e-20F )) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] EXPR float_Array_0[1][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] CALL assume_abort_if_not(float_Array_0[1][1] != 0.0F) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L73] RET assume_abort_if_not(float_Array_0[1][1] != 0.0F) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L74] signed_short_int_Array_0[0] = __VERIFIER_nondet_short() [L75] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] CALL assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L75] RET assume_abort_if_not(signed_short_int_Array_0[0] >= -32768) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] CALL assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L76] RET assume_abort_if_not(signed_short_int_Array_0[0] <= 32767) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] CALL assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L77] RET assume_abort_if_not(signed_short_int_Array_0[0] != 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L78] unsigned_char_Array_0[1][0] = __VERIFIER_nondet_uchar() [L79] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L79] RET assume_abort_if_not(unsigned_char_Array_0[1][0] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] EXPR unsigned_char_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] CALL assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L80] RET assume_abort_if_not(unsigned_char_Array_0[1][0] <= 254) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L81] unsigned_char_Array_0[0][1] = __VERIFIER_nondet_uchar() [L82] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L82] RET assume_abort_if_not(unsigned_char_Array_0[0][1] >= 0) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] CALL assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L83] RET assume_abort_if_not(unsigned_char_Array_0[0][1] <= 254) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L84] unsigned_long_int_Array_0[1] = __VERIFIER_nondet_ulong() [L85] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L85] RET assume_abort_if_not(unsigned_long_int_Array_0[1] >= 2147483647) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] EXPR unsigned_long_int_Array_0[1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] CALL assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L86] RET assume_abort_if_not(unsigned_long_int_Array_0[1] <= 4294967294) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L101] RET updateVariables() [L102] CALL step() [L42] EXPR signed_short_int_Array_0[0] [L42] unsigned long int stepLocal_2 = last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]; [L43] COND TRUE stepLocal_2 != (last_1_unsigned_char_Array_0_1__1_ - 64) [L44] EXPR unsigned_char_Array_0[1][0] [L44] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) [L44] EXPR unsigned_char_Array_0[1][0] [L44] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L44] unsigned_char_Array_0[0][0] = ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))) [L48] EXPR float_Array_0[0][0] [L48] EXPR float_Array_0[0][1] [L48] EXPR float_Array_0[1][1] [L48] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) [L48] EXPR float_Array_0[1][1] [L48] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L48] COND TRUE (- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0])))) [L49] EXPR unsigned_char_Array_0[1][0] [L49] EXPR unsigned_char_Array_0[0][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0]) [L49] EXPR unsigned_char_Array_0[0][0] [L49] EXPR ((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L49] unsigned_long_int_Array_0[0] = (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))) [L53] EXPR unsigned_char_Array_0[0][1] [L53] unsigned_char_Array_0[1][1] = unsigned_char_Array_0[0][1] [L54] EXPR unsigned_char_Array_0[1][1] [L54] unsigned_short_int_Array_0[0] = unsigned_char_Array_0[1][1] [L55] EXPR signed_short_int_Array_0[0] [L55] signed long int stepLocal_1 = - signed_short_int_Array_0[0]; [L56] EXPR unsigned_short_int_Array_0[0] [L56] EXPR signed_short_int_Array_0[0] [L56] signed long int stepLocal_0 = unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]; [L57] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L57] COND FALSE !(stepLocal_0 >= unsigned_short_int_Array_0[0]) [L102] RET step() [L103] CALL, EXPR property() [L93] EXPR unsigned_short_int_Array_0[0] [L93] EXPR signed_short_int_Array_0[0] [L93] EXPR unsigned_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1 [L93] EXPR ((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1 VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1])) [L93] EXPR unsigned_short_int_Array_0[0] [L93] EXPR unsigned_char_Array_0[1][1] [L93] EXPR (((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))))) [L93] EXPR signed_short_int_Array_0[0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))) [L93] EXPR unsigned_char_Array_0[0][0] [L93] EXPR unsigned_char_Array_0[1][0] [L93] EXPR unsigned_char_Array_0[0][1] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) [L93] EXPR unsigned_char_Array_0[1][0] [L93] EXPR ((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0])))))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0])))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0])))) [L93] EXPR float_Array_0[0][0] [L93] EXPR float_Array_0[0][1] [L93] EXPR float_Array_0[1][1] [L93] EXPR float_Array_0[1][0] VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) [L93] EXPR float_Array_0[1][1] [L93] EXPR ((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))) [L93] EXPR unsigned_long_int_Array_0[0] [L93] EXPR unsigned_long_int_Array_0[1] [L93] EXPR unsigned_char_Array_0[1][0] [L93] EXPR ((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR (((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0])))) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))))) && (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93] EXPR ((((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))))) && (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][1])) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L93-L94] return ((((((unsigned_short_int_Array_0[0] / signed_short_int_Array_0[0]) >= unsigned_short_int_Array_0[0]) ? (((- signed_short_int_Array_0[0]) > unsigned_short_int_Array_0[0]) ? (unsigned_short_int_Array_0[1] == ((unsigned short int) ((((unsigned_char_Array_0[0][0]) < (unsigned_char_Array_0[1][1])) ? (unsigned_char_Array_0[0][0]) : (unsigned_char_Array_0[1][1]))))) : 1) : 1) && (unsigned_short_int_Array_0[0] == ((unsigned short int) unsigned_char_Array_0[1][1]))) && (((last_1_unsigned_long_int_Array_0_0_ / signed_short_int_Array_0[0]) != (last_1_unsigned_char_Array_0_1__1_ - 64)) ? (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[1][0]) > (unsigned_char_Array_0[0][1])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][1]))))) : (unsigned_char_Array_0[0][0] == ((unsigned char) ((((unsigned_char_Array_0[0][1]) < (unsigned_char_Array_0[1][0])) ? (unsigned_char_Array_0[0][1]) : (unsigned_char_Array_0[1][0]))))))) && (((- (float_Array_0[0][0] / 0.6f)) > ((float_Array_0[0][1] + 3.25f) / ((((float_Array_0[1][1]) < (float_Array_0[1][0])) ? (float_Array_0[1][1]) : (float_Array_0[1][0]))))) ? (unsigned_long_int_Array_0[0] == ((unsigned long int) (500u + ((((unsigned_char_Array_0[1][0]) < (unsigned_char_Array_0[0][0])) ? (unsigned_char_Array_0[1][0]) : (unsigned_char_Array_0[0][0])))))) : (unsigned_long_int_Array_0[0] == ((unsigned long int) (unsigned_long_int_Array_0[1] - unsigned_char_Array_0[1][0]))))) && (unsigned_char_Array_0[1][1] == ((unsigned char) unsigned_char_Array_0[0][1])) ; [L103] RET, EXPR property() [L103] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] [L19] reach_error() VAL [float_Array_0={4:0}, isInitial=1, last_1_unsigned_char_Array_0_1__1_=0, last_1_unsigned_long_int_Array_0_0_=10, signed_short_int_Array_0={5:0}, unsigned_char_Array_0={6:0}, unsigned_long_int_Array_0={7:0}, unsigned_short_int_Array_0={8:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 109 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 29.8s, OverallIterations: 31, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 11.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4333 SdHoareTripleChecker+Valid, 8.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4311 mSDsluCounter, 30189 SdHoareTripleChecker+Invalid, 6.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 24456 mSDsCounter, 292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10252 IncrementalHoareTripleChecker+Invalid, 10544 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 292 mSolverCounterUnsat, 5733 mSDtfsCounter, 10252 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 813 GetRequests, 549 SyntacticMatches, 0 SemanticMatches, 264 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 229 ImplicationChecksByTransitivity, 2.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=906occurred in iteration=23, InterpolantAutomatonStates: 259, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 30 MinimizatonAttempts, 3058 StatesRemovedByMinimization, 28 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 13.3s InterpolantComputationTime, 4711 NumberOfCodeBlocks, 4711 NumberOfCodeBlocksAsserted, 35 NumberOfCheckSat, 4400 ConstructedInterpolants, 0 QuantifiedInterpolants, 14589 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1358 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 33 InterpolantComputations, 30 PerfectInterpolantSequences, 13802/13860 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-03-04 01:06:13,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 01:06:14,866 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 01:06:14,954 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-03-04 01:06:14,959 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 01:06:14,960 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 01:06:14,984 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 01:06:14,985 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 01:06:14,985 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 01:06:14,985 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 01:06:14,986 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 01:06:14,986 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 01:06:14,986 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 01:06:14,986 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 01:06:14,986 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 01:06:14,987 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 01:06:14,987 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 01:06:14,987 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 01:06:14,987 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 01:06:14,987 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 01:06:14,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 01:06:14,988 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 01:06:14,989 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 01:06:14,989 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 01:06:14,989 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 01:06:14,989 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 01:06:14,989 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:06:14,989 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 01:06:14,989 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 01:06:14,990 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f0c11a71501857fba3402e4bb377289983d3b24a383b44d5d668b185a2e73be4 [2025-03-04 01:06:15,279 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 01:06:15,288 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 01:06:15,290 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 01:06:15,291 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 01:06:15,291 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 01:06:15,293 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2025-03-04 01:06:16,465 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7f504c2/49f641c48abe4d0d836acb375c7dee58/FLAGed720086b [2025-03-04 01:06:16,672 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 01:06:16,673 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-a_file-4.i [2025-03-04 01:06:16,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7f504c2/49f641c48abe4d0d836acb375c7dee58/FLAGed720086b [2025-03-04 01:06:17,034 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8f7f504c2/49f641c48abe4d0d836acb375c7dee58 [2025-03-04 01:06:17,036 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 01:06:17,037 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 01:06:17,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 01:06:17,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 01:06:17,041 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 01:06:17,041 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,042 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@50847923 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17, skipping insertion in model container [2025-03-04 01:06:17,042 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 01:06:17,157 WARN L250 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-a_file-4.i[915,928] [2025-03-04 01:06:17,234 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:06:17,252 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 01:06:17,261 WARN L250 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-a_file-4.i[915,928] [2025-03-04 01:06:17,298 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 01:06:17,314 INFO L204 MainTranslator]: Completed translation [2025-03-04 01:06:17,315 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17 WrapperNode [2025-03-04 01:06:17,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 01:06:17,316 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 01:06:17,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 01:06:17,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 01:06:17,320 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,333 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,366 INFO L138 Inliner]: procedures = 36, calls = 161, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 492 [2025-03-04 01:06:17,366 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 01:06:17,367 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 01:06:17,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 01:06:17,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 01:06:17,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,387 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,406 INFO L175 MemorySlicer]: Split 130 memory accesses to 6 slices as follows [2, 38, 11, 55, 12, 12]. 42 percent of accesses are in the largest equivalence class. The 15 initializations are split as follows [2, 4, 1, 4, 2, 2]. The 15 writes are split as follows [0, 4, 1, 5, 3, 2]. [2025-03-04 01:06:17,406 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,406 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,430 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,432 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,436 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,441 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,445 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 01:06:17,446 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 01:06:17,446 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 01:06:17,446 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 01:06:17,448 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (1/1) ... [2025-03-04 01:06:17,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 01:06:17,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 01:06:17,475 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 01:06:17,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#0 [2025-03-04 01:06:17,499 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#1 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#2 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#3 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#4 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE2#5 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-03-04 01:06:17,500 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-03-04 01:06:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-03-04 01:06:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2025-03-04 01:06:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2025-03-04 01:06:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2025-03-04 01:06:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#3 [2025-03-04 01:06:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#4 [2025-03-04 01:06:17,501 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#5 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#2 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#3 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#4 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#5 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2025-03-04 01:06:17,502 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#4 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#5 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#2 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#3 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#4 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#5 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#2 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#3 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#4 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#5 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#0 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#1 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#2 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#3 [2025-03-04 01:06:17,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#4 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE4#5 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-04 01:06:17,505 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 01:06:17,505 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#2 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#3 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#4 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#5 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2025-03-04 01:06:17,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#5 [2025-03-04 01:06:17,651 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 01:06:17,653 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 01:06:33,533 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L93: havoc property_#t~mem90#1;havoc property_#t~mem91#1;havoc property_#t~mem92#1;havoc property_#t~ite102#1;havoc property_#t~mem93#1;havoc property_#t~mem94#1;havoc property_#t~ite101#1;havoc property_#t~mem100#1;havoc property_#t~mem95#1;havoc property_#t~mem96#1;havoc property_#t~ite99#1;havoc property_#t~mem97#1;havoc property_#t~mem98#1;havoc property_#t~mem104#1;havoc property_#t~mem103#1;havoc property_#t~short105#1;havoc property_#t~mem106#1;havoc property_#t~ite119#1;havoc property_#t~mem112#1;havoc property_#t~mem107#1;havoc property_#t~mem108#1;havoc property_#t~ite111#1;havoc property_#t~mem109#1;havoc property_#t~mem110#1;havoc property_#t~mem118#1;havoc property_#t~mem113#1;havoc property_#t~mem114#1;havoc property_#t~ite117#1;havoc property_#t~mem115#1;havoc property_#t~mem116#1;havoc property_#t~short120#1;havoc property_#t~mem121#1;havoc property_#t~mem122#1;havoc property_#t~mem123#1;havoc property_#t~mem124#1;havoc property_#t~ite127#1;havoc property_#t~mem125#1;havoc property_#t~mem126#1;havoc property_#t~ite137#1;havoc property_#t~mem133#1;havoc property_#t~mem128#1;havoc property_#t~mem129#1;havoc property_#t~ite132#1;havoc property_#t~mem130#1;havoc property_#t~mem131#1;havoc property_#t~mem136#1;havoc property_#t~mem134#1;havoc property_#t~mem135#1;havoc property_#t~short138#1;havoc property_#t~mem140#1;havoc property_#t~mem139#1;havoc property_#t~short141#1; [2025-03-04 01:06:33,565 INFO L? ?]: Removed 144 outVars from TransFormulas that were not future-live. [2025-03-04 01:06:33,567 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 01:06:33,578 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 01:06:33,578 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 01:06:33,579 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:06:33 BoogieIcfgContainer [2025-03-04 01:06:33,579 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 01:06:33,581 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 01:06:33,581 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 01:06:33,584 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 01:06:33,585 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 01:06:17" (1/3) ... [2025-03-04 01:06:33,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426addcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:06:33, skipping insertion in model container [2025-03-04 01:06:33,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 01:06:17" (2/3) ... [2025-03-04 01:06:33,586 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@426addcf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 01:06:33, skipping insertion in model container [2025-03-04 01:06:33,586 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 01:06:33" (3/3) ... [2025-03-04 01:06:33,587 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-a_file-4.i [2025-03-04 01:06:33,597 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 01:06:33,598 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-a_file-4.i that has 2 procedures, 109 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-04 01:06:33,639 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 01:06:33,647 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;@889d8f8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 01:06:33,647 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-04 01:06:33,650 INFO L276 IsEmpty]: Start isEmpty. Operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:06:33,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:06:33,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:33,657 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:33,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:33,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1626083602, now seen corresponding path program 1 times [2025-03-04 01:06:33,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:33,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1757306698] [2025-03-04 01:06:33,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:33,669 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:33,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:33,671 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:33,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2025-03-04 01:06:33,813 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:06:34,224 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:06:34,224 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:34,224 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:34,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-04 01:06:34,255 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:34,283 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2025-03-04 01:06:34,284 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:06:34,284 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:06:34,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1757306698] [2025-03-04 01:06:34,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1757306698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:34,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:34,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 01:06:34,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738084597] [2025-03-04 01:06:34,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 01:06:34,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:06:34,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 01:06:34,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:06:34,306 INFO L87 Difference]: Start difference. First operand has 109 states, 91 states have (on average 1.4175824175824177) internal successors, (129), 92 states have internal predecessors, (129), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:34,325 INFO L93 Difference]: Finished difference Result 212 states and 328 transitions. [2025-03-04 01:06:34,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 01:06:34,326 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 130 [2025-03-04 01:06:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:34,331 INFO L225 Difference]: With dead ends: 212 [2025-03-04 01:06:34,331 INFO L226 Difference]: Without dead ends: 106 [2025-03-04 01:06:34,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 01:06:34,336 INFO L435 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:34,337 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 01:06:34,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-03-04 01:06:34,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-03-04 01:06:34,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 89 states have internal predecessors, (124), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:06:34,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 154 transitions. [2025-03-04 01:06:34,369 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 154 transitions. Word has length 130 [2025-03-04 01:06:34,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:34,370 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 154 transitions. [2025-03-04 01:06:34,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.0) internal successors, (62), 2 states have internal predecessors, (62), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-03-04 01:06:34,371 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 154 transitions. [2025-03-04 01:06:34,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:06:34,373 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:34,373 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:34,390 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2025-03-04 01:06:34,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:34,574 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:34,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:34,575 INFO L85 PathProgramCache]: Analyzing trace with hash -1662114311, now seen corresponding path program 1 times [2025-03-04 01:06:34,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:34,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1452127518] [2025-03-04 01:06:34,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:34,576 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:34,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:34,578 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:34,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2025-03-04 01:06:34,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:06:35,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:06:35,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:35,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:35,173 INFO L256 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 01:06:35,176 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:35,328 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:35,328 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:06:35,328 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:06:35,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1452127518] [2025-03-04 01:06:35,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1452127518] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:35,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:35,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:06:35,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561375245] [2025-03-04 01:06:35,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:35,331 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:06:35,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:06:35,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:06:35,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:06:35,332 INFO L87 Difference]: Start difference. First operand 106 states and 154 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 01:06:35,483 INFO L93 Difference]: Finished difference Result 214 states and 312 transitions. [2025-03-04 01:06:35,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 01:06:35,484 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 130 [2025-03-04 01:06:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 01:06:35,487 INFO L225 Difference]: With dead ends: 214 [2025-03-04 01:06:35,487 INFO L226 Difference]: Without dead ends: 111 [2025-03-04 01:06:35,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:06:35,488 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 1 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 01:06:35,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 583 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 01:06:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-03-04 01:06:35,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2025-03-04 01:06:35,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 93 states have (on average 1.3763440860215055) internal successors, (128), 93 states have internal predecessors, (128), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2025-03-04 01:06:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 158 transitions. [2025-03-04 01:06:35,498 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 158 transitions. Word has length 130 [2025-03-04 01:06:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 01:06:35,499 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 158 transitions. [2025-03-04 01:06:35,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:35,500 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 158 transitions. [2025-03-04 01:06:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-04 01:06:35,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 01:06:35,501 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 01:06:35,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2025-03-04 01:06:35,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:35,703 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-04 01:06:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 01:06:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1661190790, now seen corresponding path program 1 times [2025-03-04 01:06:35,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-03-04 01:06:35,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [914248882] [2025-03-04 01:06:35,706 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 01:06:35,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-03-04 01:06:35,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2025-03-04 01:06:35,709 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2025-03-04 01:06:35,709 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2025-03-04 01:06:35,824 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-04 01:06:36,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-04 01:06:36,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 01:06:36,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 01:06:36,466 INFO L256 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-04 01:06:36,472 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 01:06:36,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2025-03-04 01:06:36,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 48 [2025-03-04 01:06:36,697 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2025-03-04 01:06:36,698 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 01:06:36,698 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-03-04 01:06:36,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [914248882] [2025-03-04 01:06:36,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [914248882] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 01:06:36,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 01:06:36,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 01:06:36,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1245246420] [2025-03-04 01:06:36,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 01:06:36,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 01:06:36,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-03-04 01:06:36,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 01:06:36,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 01:06:36,699 INFO L87 Difference]: Start difference. First operand 110 states and 158 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2025-03-04 01:06:40,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:06:43,685 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:06:48,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:06:51,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.72s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:06:55,156 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:06:57,154 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 01:06:59,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers []