./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:48:26,151 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:48:26,210 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 15:48:26,216 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:48:26,217 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:48:26,237 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:48:26,238 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:48:26,238 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:48:26,239 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:48:26,239 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:48:26,239 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:48:26,240 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:48:26,240 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:48:26,240 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:48:26,240 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:48:26,240 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:48:26,240 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:48:26,241 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:48:26,242 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:48:26,242 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:48:26,242 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:48:26,242 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:26,242 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:26,242 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:26,242 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:26,243 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:26,243 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:48:26,243 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:48:26,243 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-jdk21/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 -> b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e [2025-01-09 15:48:26,466 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:48:26,476 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:48:26,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:48:26,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:48:26,483 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:48:26,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2025-01-09 15:48:27,683 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53af0790/b0f44ac244de48aba004cbbd9610ecba/FLAG32393f949 [2025-01-09 15:48:27,915 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:48:27,916 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2025-01-09 15:48:27,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53af0790/b0f44ac244de48aba004cbbd9610ecba/FLAG32393f949 [2025-01-09 15:48:28,245 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f53af0790/b0f44ac244de48aba004cbbd9610ecba [2025-01-09 15:48:28,247 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:48:28,248 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:48:28,249 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:28,249 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:48:28,252 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:48:28,253 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,253 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eef1065 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28, skipping insertion in model container [2025-01-09 15:48:28,253 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,264 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:48:28,341 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2025-01-09 15:48:28,376 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:28,383 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:48:28,390 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2025-01-09 15:48:28,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:48:28,430 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:48:28,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28 WrapperNode [2025-01-09 15:48:28,430 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:48:28,431 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:28,431 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:48:28,431 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:48:28,435 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,444 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,476 INFO L138 Inliner]: procedures = 29, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 606 [2025-01-09 15:48:28,476 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:48:28,476 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:48:28,477 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:48:28,477 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:48:28,483 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,483 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,486 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,511 INFO L175 MemorySlicer]: Split 147 memory accesses to 15 slices as follows [2, 9, 16, 8, 22, 20, 12, 3, 6, 6, 8, 6, 15, 8, 6]. 15 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1]. [2025-01-09 15:48:28,514 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,515 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,539 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,541 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,548 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,551 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,556 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,564 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:48:28,566 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:48:28,566 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:48:28,566 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:48:28,570 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (1/1) ... [2025-01-09 15:48:28,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:48:28,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:28,609 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:48:28,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:48:28,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:48:28,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#0 [2025-01-09 15:48:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#1 [2025-01-09 15:48:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#2 [2025-01-09 15:48:28,629 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#3 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#4 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#5 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#6 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#7 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#8 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#9 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#10 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#11 [2025-01-09 15:48:28,630 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#12 [2025-01-09 15:48:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#13 [2025-01-09 15:48:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure read~real#14 [2025-01-09 15:48:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 15:48:28,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 15:48:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 15:48:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 15:48:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 15:48:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 15:48:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 15:48:28,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#0 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#1 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#2 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#3 [2025-01-09 15:48:28,634 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#4 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#5 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#6 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#7 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#8 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#9 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#10 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#11 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#12 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#13 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure write~real#14 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 15:48:28,635 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 15:48:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 15:48:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 15:48:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 15:48:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 15:48:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 15:48:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 15:48:28,636 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#0 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#1 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#2 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#3 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#4 [2025-01-09 15:48:28,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#5 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#6 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#7 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#8 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#9 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#10 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#11 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#12 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#13 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~real#14 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:48:28,638 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 15:48:28,638 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 15:48:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 15:48:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 15:48:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 15:48:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 15:48:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 15:48:28,639 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 15:48:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 15:48:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 15:48:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 15:48:28,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:48:28,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:48:28,807 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:48:28,809 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:48:29,345 INFO L? ?]: Removed 158 outVars from TransFormulas that were not future-live. [2025-01-09 15:48:29,345 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:48:29,356 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:48:29,356 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:48:29,356 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:29 BoogieIcfgContainer [2025-01-09 15:48:29,357 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:48:29,358 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:48:29,358 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:48:29,363 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:48:29,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:28" (1/3) ... [2025-01-09 15:48:29,363 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ce258e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:29, skipping insertion in model container [2025-01-09 15:48:29,363 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:28" (2/3) ... [2025-01-09 15:48:29,364 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47ce258e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:29, skipping insertion in model container [2025-01-09 15:48:29,364 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:29" (3/3) ... [2025-01-09 15:48:29,365 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-56.i [2025-01-09 15:48:29,374 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:48:29,376 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-56.i that has 2 procedures, 125 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:48:29,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:48:29,430 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;@40bf6097, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:48:29,430 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:48:29,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:48:29,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:29,441 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:29,441 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:29,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:29,445 INFO L85 PathProgramCache]: Analyzing trace with hash 449514435, now seen corresponding path program 1 times [2025-01-09 15:48:29,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:29,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1238952969] [2025-01-09 15:48:29,451 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:29,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:29,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:48:29,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:48:29,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:29,546 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:29,711 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:48:29,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:29,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1238952969] [2025-01-09 15:48:29,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1238952969] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:29,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1222299343] [2025-01-09 15:48:29,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:29,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:29,722 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:48:29,724 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 15:48:29,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:48:29,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:48:29,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:29,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:29,967 INFO L256 TraceCheckSpWp]: Trace formula consists of 638 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:48:29,976 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:29,997 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 36 proven. 0 refuted. 0 times theorem prover too weak. 648 trivial. 0 not checked. [2025-01-09 15:48:29,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:48:29,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1222299343] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:29,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:29,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 15:48:30,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [744157838] [2025-01-09 15:48:30,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:30,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:48:30,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:30,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:48:30,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:48:30,023 INFO L87 Difference]: Start difference. First operand has 125 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:48:30,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:30,072 INFO L93 Difference]: Finished difference Result 244 states and 384 transitions. [2025-01-09 15:48:30,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:48:30,074 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 151 [2025-01-09 15:48:30,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:30,078 INFO L225 Difference]: With dead ends: 244 [2025-01-09 15:48:30,078 INFO L226 Difference]: Without dead ends: 122 [2025-01-09 15:48:30,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 152 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-01-09 15:48:30,082 INFO L435 NwaCegarLoop]: 180 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, 180 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-01-09 15:48:30,082 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:30,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2025-01-09 15:48:30,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2025-01-09 15:48:30,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 101 states have (on average 1.4059405940594059) internal successors, (142), 101 states have internal predecessors, (142), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:30,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 180 transitions. [2025-01-09 15:48:30,117 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 180 transitions. Word has length 151 [2025-01-09 15:48:30,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:30,117 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 180 transitions. [2025-01-09 15:48:30,117 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:48:30,118 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 180 transitions. [2025-01-09 15:48:30,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:48:30,120 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:30,120 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:30,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 15:48:30,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 15:48:30,322 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:30,322 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:30,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1503623345, now seen corresponding path program 1 times [2025-01-09 15:48:30,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:30,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001087338] [2025-01-09 15:48:30,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:30,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:30,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:48:30,410 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:48:30,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:30,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:30,546 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:30,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:30,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001087338] [2025-01-09 15:48:30,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001087338] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:30,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:30,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:48:30,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1459029590] [2025-01-09 15:48:30,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:30,548 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:48:30,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:30,549 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:48:30,549 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:30,552 INFO L87 Difference]: Start difference. First operand 122 states and 180 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:30,577 INFO L93 Difference]: Finished difference Result 242 states and 359 transitions. [2025-01-09 15:48:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:48:30,578 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:48:30,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:30,581 INFO L225 Difference]: With dead ends: 242 [2025-01-09 15:48:30,581 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 15:48:30,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:30,584 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:30,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:30,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 15:48:30,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 15:48:30,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 102 states have (on average 1.4019607843137254) internal successors, (143), 102 states have internal predecessors, (143), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:30,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 181 transitions. [2025-01-09 15:48:30,597 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 181 transitions. Word has length 151 [2025-01-09 15:48:30,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:30,598 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 181 transitions. [2025-01-09 15:48:30,599 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:30,599 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 181 transitions. [2025-01-09 15:48:30,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:48:30,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:30,600 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:30,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 15:48:30,600 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:30,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:30,602 INFO L85 PathProgramCache]: Analyzing trace with hash 685974895, now seen corresponding path program 1 times [2025-01-09 15:48:30,602 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:30,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672365793] [2025-01-09 15:48:30,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:30,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:30,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:48:30,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:48:30,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:30,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:31,603 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:31,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:31,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672365793] [2025-01-09 15:48:31,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672365793] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:31,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:31,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:48:31,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148008643] [2025-01-09 15:48:31,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:31,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:48:31,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:31,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:48:31,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:31,608 INFO L87 Difference]: Start difference. First operand 123 states and 181 transitions. Second operand has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:31,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:31,819 INFO L93 Difference]: Finished difference Result 307 states and 454 transitions. [2025-01-09 15:48:31,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:48:31,820 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:48:31,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:31,822 INFO L225 Difference]: With dead ends: 307 [2025-01-09 15:48:31,822 INFO L226 Difference]: Without dead ends: 187 [2025-01-09 15:48:31,822 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:48:31,823 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 89 mSDsluCounter, 1263 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:31,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 1427 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:31,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2025-01-09 15:48:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 148. [2025-01-09 15:48:31,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 127 states have (on average 1.4330708661417322) internal successors, (182), 127 states have internal predecessors, (182), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:31,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 220 transitions. [2025-01-09 15:48:31,840 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 220 transitions. Word has length 151 [2025-01-09 15:48:31,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:31,841 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 220 transitions. [2025-01-09 15:48:31,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.9) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:31,841 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 220 transitions. [2025-01-09 15:48:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:48:31,845 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:31,846 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:31,846 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 15:48:31,846 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:31,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:31,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1384700493, now seen corresponding path program 1 times [2025-01-09 15:48:31,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:31,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [832953928] [2025-01-09 15:48:31,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:31,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:31,874 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:48:31,896 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:48:31,896 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:31,896 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:31,963 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:31,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:31,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [832953928] [2025-01-09 15:48:31,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [832953928] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:31,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:31,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:48:31,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907904683] [2025-01-09 15:48:31,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:31,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:48:31,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:31,964 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:48:31,964 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:31,965 INFO L87 Difference]: Start difference. First operand 148 states and 220 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:32,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:32,010 INFO L93 Difference]: Finished difference Result 295 states and 441 transitions. [2025-01-09 15:48:32,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:48:32,010 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:48:32,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:32,011 INFO L225 Difference]: With dead ends: 295 [2025-01-09 15:48:32,011 INFO L226 Difference]: Without dead ends: 150 [2025-01-09 15:48:32,012 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:32,012 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 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-01-09 15:48:32,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:32,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-01-09 15:48:32,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2025-01-09 15:48:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 129 states have (on average 1.426356589147287) internal successors, (184), 129 states have internal predecessors, (184), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:32,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 222 transitions. [2025-01-09 15:48:32,024 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 222 transitions. Word has length 152 [2025-01-09 15:48:32,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:32,024 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 222 transitions. [2025-01-09 15:48:32,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 222 transitions. [2025-01-09 15:48:32,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 15:48:32,026 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:32,026 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:32,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 15:48:32,026 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:32,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:32,028 INFO L85 PathProgramCache]: Analyzing trace with hash -711135327, now seen corresponding path program 1 times [2025-01-09 15:48:32,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:32,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077691448] [2025-01-09 15:48:32,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:32,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:32,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 15:48:32,055 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 15:48:32,056 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:32,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:32,104 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:32,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077691448] [2025-01-09 15:48:32,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077691448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:32,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:32,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:48:32,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242937423] [2025-01-09 15:48:32,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:32,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:48:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:32,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:48:32,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:32,106 INFO L87 Difference]: Start difference. First operand 150 states and 222 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:32,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:32,127 INFO L93 Difference]: Finished difference Result 298 states and 443 transitions. [2025-01-09 15:48:32,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:48:32,128 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 152 [2025-01-09 15:48:32,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:32,129 INFO L225 Difference]: With dead ends: 298 [2025-01-09 15:48:32,129 INFO L226 Difference]: Without dead ends: 151 [2025-01-09 15:48:32,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:32,130 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:32,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-01-09 15:48:32,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-01-09 15:48:32,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.4230769230769231) internal successors, (185), 130 states have internal predecessors, (185), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:32,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 223 transitions. [2025-01-09 15:48:32,135 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 223 transitions. Word has length 152 [2025-01-09 15:48:32,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:32,135 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 223 transitions. [2025-01-09 15:48:32,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:32,135 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 223 transitions. [2025-01-09 15:48:32,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:32,136 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:32,136 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:32,136 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 15:48:32,136 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:32,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:32,137 INFO L85 PathProgramCache]: Analyzing trace with hash 862355156, now seen corresponding path program 1 times [2025-01-09 15:48:32,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:32,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26738995] [2025-01-09 15:48:32,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:32,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:32,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:32,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:32,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:32,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:32,328 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:48:32,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26738995] [2025-01-09 15:48:32,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26738995] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:48:32,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472693072] [2025-01-09 15:48:32,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:32,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:32,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:48:32,331 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:48:32,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 15:48:32,508 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:32,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:32,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:32,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:32,586 INFO L256 TraceCheckSpWp]: Trace formula consists of 648 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:48:32,590 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:48:32,617 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:32,618 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:48:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472693072] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:32,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:48:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 8 [2025-01-09 15:48:32,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335392291] [2025-01-09 15:48:32,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:32,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:32,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:32,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:32,620 INFO L87 Difference]: Start difference. First operand 151 states and 223 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:32,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:32,645 INFO L93 Difference]: Finished difference Result 302 states and 447 transitions. [2025-01-09 15:48:32,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:32,645 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:32,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:32,646 INFO L225 Difference]: With dead ends: 302 [2025-01-09 15:48:32,646 INFO L226 Difference]: Without dead ends: 154 [2025-01-09 15:48:32,647 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:32,647 INFO L435 NwaCegarLoop]: 177 mSDtfsCounter, 0 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 691 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:32,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 691 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:32,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-01-09 15:48:32,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2025-01-09 15:48:32,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 133 states have (on average 1.413533834586466) internal successors, (188), 133 states have internal predecessors, (188), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:32,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 226 transitions. [2025-01-09 15:48:32,653 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 226 transitions. Word has length 153 [2025-01-09 15:48:32,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:32,653 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 226 transitions. [2025-01-09 15:48:32,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:32,653 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 226 transitions. [2025-01-09 15:48:32,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:32,667 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:32,668 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:32,679 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 15:48:32,872 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:48:32,872 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:32,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:32,872 INFO L85 PathProgramCache]: Analyzing trace with hash -1256343, now seen corresponding path program 1 times [2025-01-09 15:48:32,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:32,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615662133] [2025-01-09 15:48:32,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:32,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:32,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:32,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:32,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:33,355 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:33,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:33,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615662133] [2025-01-09 15:48:33,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615662133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:33,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:33,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:48:33,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [688881618] [2025-01-09 15:48:33,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:33,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:48:33,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:33,356 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:48:33,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:33,357 INFO L87 Difference]: Start difference. First operand 154 states and 226 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:33,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:33,550 INFO L93 Difference]: Finished difference Result 375 states and 551 transitions. [2025-01-09 15:48:33,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:33,554 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:33,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:33,555 INFO L225 Difference]: With dead ends: 375 [2025-01-09 15:48:33,555 INFO L226 Difference]: Without dead ends: 224 [2025-01-09 15:48:33,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:48:33,556 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 84 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:33,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 896 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:33,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2025-01-09 15:48:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 178. [2025-01-09 15:48:33,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 157 states have (on average 1.4394904458598725) internal successors, (226), 157 states have internal predecessors, (226), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:48:33,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 264 transitions. [2025-01-09 15:48:33,567 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 264 transitions. Word has length 153 [2025-01-09 15:48:33,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:33,567 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 264 transitions. [2025-01-09 15:48:33,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:33,567 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 264 transitions. [2025-01-09 15:48:33,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:33,568 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:33,568 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:33,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 15:48:33,573 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:33,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:33,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1281120021, now seen corresponding path program 1 times [2025-01-09 15:48:33,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:33,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067740401] [2025-01-09 15:48:33,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:33,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:33,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:33,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:33,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:33,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:34,288 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:34,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:34,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067740401] [2025-01-09 15:48:34,289 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067740401] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:34,289 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:34,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:48:34,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031359453] [2025-01-09 15:48:34,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:34,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:48:34,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:34,290 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:48:34,290 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:34,290 INFO L87 Difference]: Start difference. First operand 178 states and 264 transitions. Second operand has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:34,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:34,824 INFO L93 Difference]: Finished difference Result 490 states and 715 transitions. [2025-01-09 15:48:34,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:48:34,825 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 153 [2025-01-09 15:48:34,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:34,826 INFO L225 Difference]: With dead ends: 490 [2025-01-09 15:48:34,826 INFO L226 Difference]: Without dead ends: 315 [2025-01-09 15:48:34,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=57, Invalid=183, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:48:34,827 INFO L435 NwaCegarLoop]: 184 mSDtfsCounter, 681 mSDsluCounter, 793 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 681 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:34,828 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [681 Valid, 977 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:48:34,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2025-01-09 15:48:34,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 260. [2025-01-09 15:48:34,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260 states, 234 states have (on average 1.4401709401709402) internal successors, (337), 235 states have internal predecessors, (337), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:48:34,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 383 transitions. [2025-01-09 15:48:34,838 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 383 transitions. Word has length 153 [2025-01-09 15:48:34,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:34,839 INFO L471 AbstractCegarLoop]: Abstraction has 260 states and 383 transitions. [2025-01-09 15:48:34,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 6.777777777777778) internal successors, (61), 10 states have internal predecessors, (61), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:34,839 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 383 transitions. [2025-01-09 15:48:34,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:34,840 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:34,840 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:34,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 15:48:34,840 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:34,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:34,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1867926035, now seen corresponding path program 1 times [2025-01-09 15:48:34,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:34,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1720175084] [2025-01-09 15:48:34,841 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:34,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:34,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:34,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:34,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:34,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:35,263 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:35,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:35,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1720175084] [2025-01-09 15:48:35,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1720175084] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:35,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:35,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:48:35,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132981489] [2025-01-09 15:48:35,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:35,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:48:35,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:35,265 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:48:35,265 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:35,265 INFO L87 Difference]: Start difference. First operand 260 states and 383 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:35,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:35,467 INFO L93 Difference]: Finished difference Result 556 states and 817 transitions. [2025-01-09 15:48:35,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:35,468 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:35,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:35,471 INFO L225 Difference]: With dead ends: 556 [2025-01-09 15:48:35,471 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 15:48:35,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:48:35,472 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 79 mSDsluCounter, 730 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:35,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 891 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:35,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 15:48:35,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 259. [2025-01-09 15:48:35,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 233 states have (on average 1.4377682403433476) internal successors, (335), 234 states have internal predecessors, (335), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:48:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 381 transitions. [2025-01-09 15:48:35,496 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 381 transitions. Word has length 153 [2025-01-09 15:48:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:35,497 INFO L471 AbstractCegarLoop]: Abstraction has 259 states and 381 transitions. [2025-01-09 15:48:35,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:35,497 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 381 transitions. [2025-01-09 15:48:35,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:35,502 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:35,502 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:35,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 15:48:35,503 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:35,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:35,503 INFO L85 PathProgramCache]: Analyzing trace with hash -736978107, now seen corresponding path program 1 times [2025-01-09 15:48:35,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:35,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305568190] [2025-01-09 15:48:35,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:35,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:35,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:35,536 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:35,536 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:35,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:35,617 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:35,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:35,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305568190] [2025-01-09 15:48:35,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305568190] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:35,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:35,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:35,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622928986] [2025-01-09 15:48:35,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:35,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:35,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:35,618 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:35,618 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:35,618 INFO L87 Difference]: Start difference. First operand 259 states and 381 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:35,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:35,688 INFO L93 Difference]: Finished difference Result 686 states and 1016 transitions. [2025-01-09 15:48:35,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:35,688 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:35,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:35,690 INFO L225 Difference]: With dead ends: 686 [2025-01-09 15:48:35,690 INFO L226 Difference]: Without dead ends: 430 [2025-01-09 15:48:35,690 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-01-09 15:48:35,691 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 78 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 649 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:35,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 649 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:35,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2025-01-09 15:48:35,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 338. [2025-01-09 15:48:35,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 312 states have (on average 1.4711538461538463) internal successors, (459), 313 states have internal predecessors, (459), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:48:35,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 505 transitions. [2025-01-09 15:48:35,704 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 505 transitions. Word has length 153 [2025-01-09 15:48:35,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:35,704 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 505 transitions. [2025-01-09 15:48:35,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:35,704 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 505 transitions. [2025-01-09 15:48:35,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:35,706 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:35,706 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:35,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 15:48:35,706 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:35,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:35,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1453497205, now seen corresponding path program 1 times [2025-01-09 15:48:35,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:35,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102240347] [2025-01-09 15:48:35,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:35,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:35,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:35,750 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:35,750 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:35,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:36,044 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:36,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:36,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102240347] [2025-01-09 15:48:36,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102240347] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:36,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:36,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:48:36,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016447595] [2025-01-09 15:48:36,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:36,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:48:36,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:36,046 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:48:36,046 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:36,046 INFO L87 Difference]: Start difference. First operand 338 states and 505 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:36,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:36,243 INFO L93 Difference]: Finished difference Result 712 states and 1061 transitions. [2025-01-09 15:48:36,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:36,243 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:36,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:36,246 INFO L225 Difference]: With dead ends: 712 [2025-01-09 15:48:36,246 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 15:48:36,247 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:48:36,248 INFO L435 NwaCegarLoop]: 222 mSDtfsCounter, 83 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1167 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:36,248 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1167 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:36,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 15:48:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 338. [2025-01-09 15:48:36,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 312 states have (on average 1.4679487179487178) internal successors, (458), 313 states have internal predecessors, (458), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:48:36,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 504 transitions. [2025-01-09 15:48:36,267 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 504 transitions. Word has length 153 [2025-01-09 15:48:36,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:36,268 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 504 transitions. [2025-01-09 15:48:36,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 7 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 504 transitions. [2025-01-09 15:48:36,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:36,270 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:36,270 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:36,270 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 15:48:36,270 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:36,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash 866691191, now seen corresponding path program 1 times [2025-01-09 15:48:36,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:36,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952691455] [2025-01-09 15:48:36,271 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:36,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:36,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:36,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:36,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:36,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:36,929 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:36,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:36,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952691455] [2025-01-09 15:48:36,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952691455] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:36,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:36,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:48:36,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096131343] [2025-01-09 15:48:36,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:36,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:48:36,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:36,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:48:36,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:36,931 INFO L87 Difference]: Start difference. First operand 338 states and 504 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:37,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:37,272 INFO L93 Difference]: Finished difference Result 712 states and 1059 transitions. [2025-01-09 15:48:37,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:48:37,272 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:37,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:37,275 INFO L225 Difference]: With dead ends: 712 [2025-01-09 15:48:37,275 INFO L226 Difference]: Without dead ends: 377 [2025-01-09 15:48:37,275 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:37,276 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 81 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1291 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:37,276 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1291 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:37,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2025-01-09 15:48:37,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 338. [2025-01-09 15:48:37,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 338 states, 312 states have (on average 1.4647435897435896) internal successors, (457), 313 states have internal predecessors, (457), 23 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 22 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 15:48:37,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 503 transitions. [2025-01-09 15:48:37,292 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 503 transitions. Word has length 153 [2025-01-09 15:48:37,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:37,293 INFO L471 AbstractCegarLoop]: Abstraction has 338 states and 503 transitions. [2025-01-09 15:48:37,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:37,293 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 503 transitions. [2025-01-09 15:48:37,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:37,294 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:37,294 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:37,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 15:48:37,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:37,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:37,295 INFO L85 PathProgramCache]: Analyzing trace with hash -510729433, now seen corresponding path program 1 times [2025-01-09 15:48:37,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:37,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073550205] [2025-01-09 15:48:37,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:37,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:37,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:37,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:37,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:37,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:37,743 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:37,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:37,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073550205] [2025-01-09 15:48:37,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073550205] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:37,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:37,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:48:37,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [644565959] [2025-01-09 15:48:37,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:37,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:48:37,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:37,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:48:37,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:37,744 INFO L87 Difference]: Start difference. First operand 338 states and 503 transitions. Second operand has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:38,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:38,457 INFO L93 Difference]: Finished difference Result 1509 states and 2224 transitions. [2025-01-09 15:48:38,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 15:48:38,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:38,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:38,463 INFO L225 Difference]: With dead ends: 1509 [2025-01-09 15:48:38,464 INFO L226 Difference]: Without dead ends: 1174 [2025-01-09 15:48:38,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=285, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:48:38,465 INFO L435 NwaCegarLoop]: 308 mSDtfsCounter, 669 mSDsluCounter, 1719 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 2027 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:38,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 2027 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:48:38,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2025-01-09 15:48:38,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 691. [2025-01-09 15:48:38,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 691 states, 640 states have (on average 1.46875) internal successors, (940), 642 states have internal predecessors, (940), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:38,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 1032 transitions. [2025-01-09 15:48:38,498 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 1032 transitions. Word has length 153 [2025-01-09 15:48:38,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:38,500 INFO L471 AbstractCegarLoop]: Abstraction has 691 states and 1032 transitions. [2025-01-09 15:48:38,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.1) internal successors, (61), 10 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:38,502 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 1032 transitions. [2025-01-09 15:48:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:38,503 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:38,504 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:38,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 15:48:38,504 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:38,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:38,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1790593111, now seen corresponding path program 1 times [2025-01-09 15:48:38,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:38,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946700313] [2025-01-09 15:48:38,504 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:38,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:38,522 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:38,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:38,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:38,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:38,916 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:38,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:38,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946700313] [2025-01-09 15:48:38,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946700313] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:38,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:38,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 15:48:38,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [70061808] [2025-01-09 15:48:38,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:38,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 15:48:38,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:38,918 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 15:48:38,918 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 15:48:38,918 INFO L87 Difference]: Start difference. First operand 691 states and 1032 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:39,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:39,604 INFO L93 Difference]: Finished difference Result 1875 states and 2767 transitions. [2025-01-09 15:48:39,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:48:39,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:39,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:39,610 INFO L225 Difference]: With dead ends: 1875 [2025-01-09 15:48:39,610 INFO L226 Difference]: Without dead ends: 1187 [2025-01-09 15:48:39,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2025-01-09 15:48:39,612 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 635 mSDsluCounter, 1820 mSDsCounter, 0 mSdLazyCounter, 805 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 635 SdHoareTripleChecker+Valid, 2147 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 805 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:39,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [635 Valid, 2147 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 805 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:48:39,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1187 states. [2025-01-09 15:48:39,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1187 to 692. [2025-01-09 15:48:39,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 692 states, 641 states have (on average 1.469578783151326) internal successors, (942), 643 states have internal predecessors, (942), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:39,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 692 states to 692 states and 1034 transitions. [2025-01-09 15:48:39,645 INFO L78 Accepts]: Start accepts. Automaton has 692 states and 1034 transitions. Word has length 153 [2025-01-09 15:48:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:39,645 INFO L471 AbstractCegarLoop]: Abstraction has 692 states and 1034 transitions. [2025-01-09 15:48:39,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:39,645 INFO L276 IsEmpty]: Start isEmpty. Operand 692 states and 1034 transitions. [2025-01-09 15:48:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:39,647 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:39,647 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:39,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 15:48:39,648 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:39,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:39,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1917568171, now seen corresponding path program 1 times [2025-01-09 15:48:39,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:39,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1070039085] [2025-01-09 15:48:39,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:39,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:39,667 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:39,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:39,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:39,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:40,665 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:40,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:40,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1070039085] [2025-01-09 15:48:40,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1070039085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:40,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:40,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:48:40,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587773839] [2025-01-09 15:48:40,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:40,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:48:40,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:40,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:48:40,667 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=250, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:48:40,667 INFO L87 Difference]: Start difference. First operand 692 states and 1034 transitions. Second operand has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 15:48:42,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:42,172 INFO L93 Difference]: Finished difference Result 1926 states and 2843 transitions. [2025-01-09 15:48:42,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-01-09 15:48:42,173 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) Word has length 153 [2025-01-09 15:48:42,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:42,178 INFO L225 Difference]: With dead ends: 1926 [2025-01-09 15:48:42,178 INFO L226 Difference]: Without dead ends: 1237 [2025-01-09 15:48:42,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=348, Invalid=1292, Unknown=0, NotChecked=0, Total=1640 [2025-01-09 15:48:42,181 INFO L435 NwaCegarLoop]: 379 mSDtfsCounter, 1124 mSDsluCounter, 3722 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1124 SdHoareTripleChecker+Valid, 4101 SdHoareTripleChecker+Invalid, 1757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:42,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1124 Valid, 4101 Invalid, 1757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:48:42,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1237 states. [2025-01-09 15:48:42,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1237 to 711. [2025-01-09 15:48:42,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 660 states have (on average 1.4712121212121212) internal successors, (971), 662 states have internal predecessors, (971), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:42,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 1063 transitions. [2025-01-09 15:48:42,210 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 1063 transitions. Word has length 153 [2025-01-09 15:48:42,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:42,211 INFO L471 AbstractCegarLoop]: Abstraction has 711 states and 1063 transitions. [2025-01-09 15:48:42,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 4.066666666666666) internal successors, (61), 17 states have internal predecessors, (61), 7 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 7 states have call successors, (19) [2025-01-09 15:48:42,211 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 1063 transitions. [2025-01-09 15:48:42,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:42,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:42,213 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:42,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 15:48:42,213 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:42,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:42,214 INFO L85 PathProgramCache]: Analyzing trace with hash 944024115, now seen corresponding path program 1 times [2025-01-09 15:48:42,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:42,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506241638] [2025-01-09 15:48:42,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:42,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:42,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:42,271 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:42,271 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:42,271 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:42,390 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:42,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:42,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506241638] [2025-01-09 15:48:42,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506241638] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:42,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:42,391 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:42,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832101644] [2025-01-09 15:48:42,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:42,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:42,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:42,392 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:42,392 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:42,393 INFO L87 Difference]: Start difference. First operand 711 states and 1063 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:42,517 INFO L93 Difference]: Finished difference Result 1661 states and 2464 transitions. [2025-01-09 15:48:42,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:42,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:42,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:42,521 INFO L225 Difference]: With dead ends: 1661 [2025-01-09 15:48:42,521 INFO L226 Difference]: Without dead ends: 953 [2025-01-09 15:48:42,523 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-01-09 15:48:42,523 INFO L435 NwaCegarLoop]: 237 mSDtfsCounter, 108 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 810 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:42,524 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 810 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:42,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2025-01-09 15:48:42,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 747. [2025-01-09 15:48:42,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 747 states, 696 states have (on average 1.4813218390804597) internal successors, (1031), 698 states have internal predecessors, (1031), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:42,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 1123 transitions. [2025-01-09 15:48:42,553 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 1123 transitions. Word has length 153 [2025-01-09 15:48:42,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:42,553 INFO L471 AbstractCegarLoop]: Abstraction has 747 states and 1123 transitions. [2025-01-09 15:48:42,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 1123 transitions. [2025-01-09 15:48:42,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:42,554 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:42,555 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:42,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 15:48:42,555 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:42,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:42,555 INFO L85 PathProgramCache]: Analyzing trace with hash 1006063729, now seen corresponding path program 1 times [2025-01-09 15:48:42,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:42,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523915064] [2025-01-09 15:48:42,555 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:42,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:42,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:42,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:42,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:42,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:42,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:42,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523915064] [2025-01-09 15:48:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523915064] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:42,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 15:48:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766220510] [2025-01-09 15:48:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:48:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:42,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:48:42,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:48:42,858 INFO L87 Difference]: Start difference. First operand 747 states and 1123 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:43,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:43,040 INFO L93 Difference]: Finished difference Result 1692 states and 2528 transitions. [2025-01-09 15:48:43,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:43,040 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:43,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:43,044 INFO L225 Difference]: With dead ends: 1692 [2025-01-09 15:48:43,044 INFO L226 Difference]: Without dead ends: 948 [2025-01-09 15:48:43,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:43,046 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 95 mSDsluCounter, 775 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 1014 SdHoareTripleChecker+Invalid, 214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:43,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 1014 Invalid, 214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:43,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-01-09 15:48:43,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 826. [2025-01-09 15:48:43,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 826 states, 775 states have (on average 1.481290322580645) internal successors, (1148), 777 states have internal predecessors, (1148), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:43,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 826 states to 826 states and 1240 transitions. [2025-01-09 15:48:43,078 INFO L78 Accepts]: Start accepts. Automaton has 826 states and 1240 transitions. Word has length 153 [2025-01-09 15:48:43,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:43,079 INFO L471 AbstractCegarLoop]: Abstraction has 826 states and 1240 transitions. [2025-01-09 15:48:43,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 6 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:43,079 INFO L276 IsEmpty]: Start isEmpty. Operand 826 states and 1240 transitions. [2025-01-09 15:48:43,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:43,081 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:43,081 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:43,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 15:48:43,082 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:43,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:43,082 INFO L85 PathProgramCache]: Analyzing trace with hash 419257715, now seen corresponding path program 1 times [2025-01-09 15:48:43,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:43,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330586837] [2025-01-09 15:48:43,082 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:43,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:43,097 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:43,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:43,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:43,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:43,637 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:43,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:43,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330586837] [2025-01-09 15:48:43,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330586837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:43,637 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:43,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:48:43,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554795897] [2025-01-09 15:48:43,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:43,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:48:43,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:43,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:48:43,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:48:43,639 INFO L87 Difference]: Start difference. First operand 826 states and 1240 transitions. Second operand has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:48:44,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:44,186 INFO L93 Difference]: Finished difference Result 1731 states and 2592 transitions. [2025-01-09 15:48:44,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 15:48:44,187 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 153 [2025-01-09 15:48:44,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:44,190 INFO L225 Difference]: With dead ends: 1731 [2025-01-09 15:48:44,190 INFO L226 Difference]: Without dead ends: 908 [2025-01-09 15:48:44,192 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:48:44,192 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 383 mSDsluCounter, 1266 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 383 SdHoareTripleChecker+Valid, 1509 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:44,193 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [383 Valid, 1509 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:48:44,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states. [2025-01-09 15:48:44,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 824. [2025-01-09 15:48:44,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 824 states, 773 states have (on average 1.4799482535575679) internal successors, (1144), 775 states have internal predecessors, (1144), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:44,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 824 states to 824 states and 1236 transitions. [2025-01-09 15:48:44,222 INFO L78 Accepts]: Start accepts. Automaton has 824 states and 1236 transitions. Word has length 153 [2025-01-09 15:48:44,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:44,222 INFO L471 AbstractCegarLoop]: Abstraction has 824 states and 1236 transitions. [2025-01-09 15:48:44,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 5.545454545454546) internal successors, (61), 11 states have internal predecessors, (61), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:48:44,222 INFO L276 IsEmpty]: Start isEmpty. Operand 824 states and 1236 transitions. [2025-01-09 15:48:44,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-01-09 15:48:44,224 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:44,224 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:44,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 15:48:44,224 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:44,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:44,224 INFO L85 PathProgramCache]: Analyzing trace with hash -886580711, now seen corresponding path program 1 times [2025-01-09 15:48:44,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:44,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212507456] [2025-01-09 15:48:44,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:44,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:44,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-01-09 15:48:44,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-01-09 15:48:44,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:44,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:44,304 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:44,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:44,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212507456] [2025-01-09 15:48:44,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212507456] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:44,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:44,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:44,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549631799] [2025-01-09 15:48:44,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:44,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:44,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:44,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:44,305 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:44,305 INFO L87 Difference]: Start difference. First operand 824 states and 1236 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:44,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:44,383 INFO L93 Difference]: Finished difference Result 1741 states and 2599 transitions. [2025-01-09 15:48:44,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:44,384 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 153 [2025-01-09 15:48:44,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:44,387 INFO L225 Difference]: With dead ends: 1741 [2025-01-09 15:48:44,387 INFO L226 Difference]: Without dead ends: 920 [2025-01-09 15:48:44,389 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-01-09 15:48:44,389 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 90 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:44,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 807 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:44,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 920 states. [2025-01-09 15:48:44,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 920 to 822. [2025-01-09 15:48:44,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 822 states, 771 states have (on average 1.464332036316472) internal successors, (1129), 773 states have internal predecessors, (1129), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:44,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 822 states to 822 states and 1221 transitions. [2025-01-09 15:48:44,434 INFO L78 Accepts]: Start accepts. Automaton has 822 states and 1221 transitions. Word has length 153 [2025-01-09 15:48:44,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:44,434 INFO L471 AbstractCegarLoop]: Abstraction has 822 states and 1221 transitions. [2025-01-09 15:48:44,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:44,434 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states and 1221 transitions. [2025-01-09 15:48:44,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:48:44,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:44,435 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:44,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 15:48:44,435 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:44,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:44,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1880817715, now seen corresponding path program 1 times [2025-01-09 15:48:44,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:44,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818818291] [2025-01-09 15:48:44,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:44,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:44,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:48:44,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:48:44,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:44,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:44,494 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:44,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:44,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818818291] [2025-01-09 15:48:44,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818818291] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:44,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:44,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:48:44,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387413160] [2025-01-09 15:48:44,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:44,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:48:44,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:44,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:48:44,496 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:44,496 INFO L87 Difference]: Start difference. First operand 822 states and 1221 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:44,540 INFO L93 Difference]: Finished difference Result 1400 states and 2066 transitions. [2025-01-09 15:48:44,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:48:44,540 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:48:44,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:44,542 INFO L225 Difference]: With dead ends: 1400 [2025-01-09 15:48:44,542 INFO L226 Difference]: Without dead ends: 581 [2025-01-09 15:48:44,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:44,546 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:44,546 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 345 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:44,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2025-01-09 15:48:44,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 581. [2025-01-09 15:48:44,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 530 states have (on average 1.4226415094339622) internal successors, (754), 532 states have internal predecessors, (754), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:44,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 846 transitions. [2025-01-09 15:48:44,580 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 846 transitions. Word has length 154 [2025-01-09 15:48:44,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:44,580 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 846 transitions. [2025-01-09 15:48:44,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 846 transitions. [2025-01-09 15:48:44,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-01-09 15:48:44,582 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:44,582 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:44,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 15:48:44,582 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:44,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:44,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1351903693, now seen corresponding path program 1 times [2025-01-09 15:48:44,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:44,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631145870] [2025-01-09 15:48:44,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:44,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:44,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-01-09 15:48:44,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-01-09 15:48:44,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:44,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:44,642 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:44,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:44,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631145870] [2025-01-09 15:48:44,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631145870] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:44,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:44,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:48:44,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452317169] [2025-01-09 15:48:44,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:44,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:48:44,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:44,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:48:44,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:44,644 INFO L87 Difference]: Start difference. First operand 581 states and 846 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:44,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:44,678 INFO L93 Difference]: Finished difference Result 1149 states and 1673 transitions. [2025-01-09 15:48:44,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:48:44,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 154 [2025-01-09 15:48:44,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:44,681 INFO L225 Difference]: With dead ends: 1149 [2025-01-09 15:48:44,681 INFO L226 Difference]: Without dead ends: 571 [2025-01-09 15:48:44,682 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:48:44,683 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 344 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-01-09 15:48:44,683 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 344 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:48:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 571 states. [2025-01-09 15:48:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 571 to 571. [2025-01-09 15:48:44,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 520 states have (on average 1.4153846153846155) internal successors, (736), 522 states have internal predecessors, (736), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:44,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 828 transitions. [2025-01-09 15:48:44,712 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 828 transitions. Word has length 154 [2025-01-09 15:48:44,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:44,712 INFO L471 AbstractCegarLoop]: Abstraction has 571 states and 828 transitions. [2025-01-09 15:48:44,712 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 828 transitions. [2025-01-09 15:48:44,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:44,714 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:44,714 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:44,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 15:48:44,714 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:44,715 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:44,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1433639247, now seen corresponding path program 1 times [2025-01-09 15:48:44,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:44,715 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1079007528] [2025-01-09 15:48:44,715 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:44,715 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:44,730 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:44,762 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:44,762 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:44,762 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:45,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:45,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1079007528] [2025-01-09 15:48:45,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1079007528] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:45,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:45,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2025-01-09 15:48:45,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510712487] [2025-01-09 15:48:45,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:45,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-01-09 15:48:45,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:45,444 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-01-09 15:48:45,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=259, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:48:45,445 INFO L87 Difference]: Start difference. First operand 571 states and 828 transitions. Second operand has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:46,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:46,862 INFO L93 Difference]: Finished difference Result 1431 states and 2057 transitions. [2025-01-09 15:48:46,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-01-09 15:48:46,865 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:48:46,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:46,868 INFO L225 Difference]: With dead ends: 1431 [2025-01-09 15:48:46,868 INFO L226 Difference]: Without dead ends: 863 [2025-01-09 15:48:46,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=355, Invalid=1715, Unknown=0, NotChecked=0, Total=2070 [2025-01-09 15:48:46,871 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 1434 mSDsluCounter, 2476 mSDsCounter, 0 mSdLazyCounter, 1418 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 2690 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 1418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:46,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 2690 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 1418 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 15:48:46,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2025-01-09 15:48:46,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 617. [2025-01-09 15:48:46,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 617 states, 566 states have (on average 1.4098939929328622) internal successors, (798), 568 states have internal predecessors, (798), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:48:46,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 617 states to 617 states and 890 transitions. [2025-01-09 15:48:46,896 INFO L78 Accepts]: Start accepts. Automaton has 617 states and 890 transitions. Word has length 155 [2025-01-09 15:48:46,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:46,897 INFO L471 AbstractCegarLoop]: Abstraction has 617 states and 890 transitions. [2025-01-09 15:48:46,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 3.7058823529411766) internal successors, (63), 18 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:46,897 INFO L276 IsEmpty]: Start isEmpty. Operand 617 states and 890 transitions. [2025-01-09 15:48:46,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:46,898 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:46,898 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:46,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 15:48:46,898 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:46,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:46,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1495678861, now seen corresponding path program 1 times [2025-01-09 15:48:46,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:46,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1456103414] [2025-01-09 15:48:46,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:46,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:46,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:46,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:46,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:46,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:47,723 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:47,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:47,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1456103414] [2025-01-09 15:48:47,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1456103414] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:47,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:47,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2025-01-09 15:48:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555546862] [2025-01-09 15:48:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:47,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 15:48:47,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:47,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 15:48:47,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=316, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:48:47,725 INFO L87 Difference]: Start difference. First operand 617 states and 890 transitions. Second operand has 20 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:48:48,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:48,811 INFO L93 Difference]: Finished difference Result 1493 states and 2129 transitions. [2025-01-09 15:48:48,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-01-09 15:48:48,812 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 155 [2025-01-09 15:48:48,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:48,815 INFO L225 Difference]: With dead ends: 1493 [2025-01-09 15:48:48,815 INFO L226 Difference]: Without dead ends: 879 [2025-01-09 15:48:48,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 211 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 15:48:48,816 INFO L435 NwaCegarLoop]: 235 mSDtfsCounter, 929 mSDsluCounter, 2531 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 929 SdHoareTripleChecker+Valid, 2766 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:48,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [929 Valid, 2766 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 15:48:48,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-01-09 15:48:48,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 673. [2025-01-09 15:48:48,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 614 states have (on average 1.3973941368078175) internal successors, (858), 617 states have internal predecessors, (858), 52 states have call successors, (52), 6 states have call predecessors, (52), 6 states have return successors, (52), 49 states have call predecessors, (52), 52 states have call successors, (52) [2025-01-09 15:48:48,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 962 transitions. [2025-01-09 15:48:48,840 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 962 transitions. Word has length 155 [2025-01-09 15:48:48,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:48,841 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 962 transitions. [2025-01-09 15:48:48,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:48:48,841 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 962 transitions. [2025-01-09 15:48:48,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:48,842 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:48,842 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:48,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 15:48:48,843 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:48,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:48,843 INFO L85 PathProgramCache]: Analyzing trace with hash -1146691345, now seen corresponding path program 1 times [2025-01-09 15:48:48,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:48,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2027909527] [2025-01-09 15:48:48,843 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:48,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:48,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:48,882 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:48,883 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:48,883 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:49,360 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:49,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:49,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2027909527] [2025-01-09 15:48:49,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2027909527] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:49,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:49,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:48:49,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036651064] [2025-01-09 15:48:49,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:49,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:48:49,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:49,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:48:49,362 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:48:49,363 INFO L87 Difference]: Start difference. First operand 673 states and 962 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:49,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:49,758 INFO L93 Difference]: Finished difference Result 1453 states and 2064 transitions. [2025-01-09 15:48:49,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:48:49,759 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:48:49,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:49,761 INFO L225 Difference]: With dead ends: 1453 [2025-01-09 15:48:49,761 INFO L226 Difference]: Without dead ends: 783 [2025-01-09 15:48:49,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:48:49,762 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 93 mSDsluCounter, 2679 mSDsCounter, 0 mSdLazyCounter, 588 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 2909 SdHoareTripleChecker+Invalid, 588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 588 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:49,762 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 2909 Invalid, 588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 588 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:49,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2025-01-09 15:48:49,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 779. [2025-01-09 15:48:49,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 714 states have (on average 1.3837535014005602) internal successors, (988), 719 states have internal predecessors, (988), 56 states have call successors, (56), 8 states have call predecessors, (56), 8 states have return successors, (56), 51 states have call predecessors, (56), 56 states have call successors, (56) [2025-01-09 15:48:49,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1100 transitions. [2025-01-09 15:48:49,790 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1100 transitions. Word has length 155 [2025-01-09 15:48:49,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:49,791 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1100 transitions. [2025-01-09 15:48:49,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:49,791 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1100 transitions. [2025-01-09 15:48:49,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:49,792 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:49,792 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:49,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-09 15:48:49,792 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:49,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:49,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1733497359, now seen corresponding path program 1 times [2025-01-09 15:48:49,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:49,793 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1504600530] [2025-01-09 15:48:49,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:49,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:49,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:49,824 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:49,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:49,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:50,043 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:50,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:50,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1504600530] [2025-01-09 15:48:50,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1504600530] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:50,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:50,043 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:48:50,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2051116362] [2025-01-09 15:48:50,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:50,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:48:50,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:50,044 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:48:50,045 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:50,045 INFO L87 Difference]: Start difference. First operand 779 states and 1100 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:50,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:50,318 INFO L93 Difference]: Finished difference Result 1608 states and 2264 transitions. [2025-01-09 15:48:50,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:50,319 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:48:50,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:50,321 INFO L225 Difference]: With dead ends: 1608 [2025-01-09 15:48:50,321 INFO L226 Difference]: Without dead ends: 782 [2025-01-09 15:48:50,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:48:50,327 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 521 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 655 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:50,327 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 655 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:50,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2025-01-09 15:48:50,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 729. [2025-01-09 15:48:50,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 729 states, 661 states have (on average 1.3721633888048412) internal successors, (907), 666 states have internal predecessors, (907), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:50,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 729 states to 729 states and 1023 transitions. [2025-01-09 15:48:50,357 INFO L78 Accepts]: Start accepts. Automaton has 729 states and 1023 transitions. Word has length 155 [2025-01-09 15:48:50,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:50,357 INFO L471 AbstractCegarLoop]: Abstraction has 729 states and 1023 transitions. [2025-01-09 15:48:50,357 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 729 states and 1023 transitions. [2025-01-09 15:48:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:50,358 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:50,358 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:50,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-09 15:48:50,358 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:50,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:50,359 INFO L85 PathProgramCache]: Analyzing trace with hash -132076401, now seen corresponding path program 1 times [2025-01-09 15:48:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [435370773] [2025-01-09 15:48:50,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:50,374 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:50,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:50,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:50,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:50,595 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:50,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:50,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [435370773] [2025-01-09 15:48:50,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [435370773] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:50,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:50,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:48:50,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031287568] [2025-01-09 15:48:50,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:50,596 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:48:50,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:50,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:48:50,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-01-09 15:48:50,597 INFO L87 Difference]: Start difference. First operand 729 states and 1023 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:50,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:50,732 INFO L93 Difference]: Finished difference Result 1284 states and 1804 transitions. [2025-01-09 15:48:50,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:48:50,733 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:48:50,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:50,737 INFO L225 Difference]: With dead ends: 1284 [2025-01-09 15:48:50,737 INFO L226 Difference]: Without dead ends: 977 [2025-01-09 15:48:50,738 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:48:50,738 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 85 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1036 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:50,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1036 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:50,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 977 states. [2025-01-09 15:48:50,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 977 to 827. [2025-01-09 15:48:50,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 827 states, 759 states have (on average 1.386034255599473) internal successors, (1052), 764 states have internal predecessors, (1052), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:50,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 827 states to 827 states and 1168 transitions. [2025-01-09 15:48:50,771 INFO L78 Accepts]: Start accepts. Automaton has 827 states and 1168 transitions. Word has length 155 [2025-01-09 15:48:50,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:50,771 INFO L471 AbstractCegarLoop]: Abstraction has 827 states and 1168 transitions. [2025-01-09 15:48:50,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 7 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:50,772 INFO L276 IsEmpty]: Start isEmpty. Operand 827 states and 1168 transitions. [2025-01-09 15:48:50,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:50,773 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:50,773 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:50,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-09 15:48:50,774 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:50,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:50,775 INFO L85 PathProgramCache]: Analyzing trace with hash -70036787, now seen corresponding path program 1 times [2025-01-09 15:48:50,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:50,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390101862] [2025-01-09 15:48:50,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:50,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:50,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:50,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:50,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:50,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:51,741 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:51,741 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:51,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390101862] [2025-01-09 15:48:51,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390101862] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:51,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:51,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2025-01-09 15:48:51,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330896749] [2025-01-09 15:48:51,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:51,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-01-09 15:48:51,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:51,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-01-09 15:48:51,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:48:51,744 INFO L87 Difference]: Start difference. First operand 827 states and 1168 transitions. Second operand has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:53,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:53,284 INFO L93 Difference]: Finished difference Result 1938 states and 2725 transitions. [2025-01-09 15:48:53,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:48:53,284 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:48:53,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:53,287 INFO L225 Difference]: With dead ends: 1938 [2025-01-09 15:48:53,287 INFO L226 Difference]: Without dead ends: 1114 [2025-01-09 15:48:53,288 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=904, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 15:48:53,288 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 1149 mSDsluCounter, 3444 mSDsCounter, 0 mSdLazyCounter, 1618 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1149 SdHoareTripleChecker+Valid, 3799 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:53,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1149 Valid, 3799 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1618 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 15:48:53,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1114 states. [2025-01-09 15:48:53,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1114 to 823. [2025-01-09 15:48:53,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 755 states have (on average 1.3880794701986754) internal successors, (1048), 760 states have internal predecessors, (1048), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:53,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1164 transitions. [2025-01-09 15:48:53,319 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1164 transitions. Word has length 155 [2025-01-09 15:48:53,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:53,319 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1164 transitions. [2025-01-09 15:48:53,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 3.5) internal successors, (63), 19 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:53,320 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1164 transitions. [2025-01-09 15:48:53,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:53,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:53,321 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:53,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-09 15:48:53,321 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:53,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:53,321 INFO L85 PathProgramCache]: Analyzing trace with hash 1381571437, now seen corresponding path program 1 times [2025-01-09 15:48:53,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:53,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064792604] [2025-01-09 15:48:53,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:53,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:53,336 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:53,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:53,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:53,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:53,760 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:53,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:53,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064792604] [2025-01-09 15:48:53,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064792604] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:53,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:53,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:48:53,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084514646] [2025-01-09 15:48:53,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:53,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:48:53,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:53,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:48:53,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:48:53,762 INFO L87 Difference]: Start difference. First operand 823 states and 1164 transitions. Second operand has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:54,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:54,126 INFO L93 Difference]: Finished difference Result 1763 states and 2482 transitions. [2025-01-09 15:48:54,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:48:54,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:48:54,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:54,130 INFO L225 Difference]: With dead ends: 1763 [2025-01-09 15:48:54,131 INFO L226 Difference]: Without dead ends: 943 [2025-01-09 15:48:54,132 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=159, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:48:54,132 INFO L435 NwaCegarLoop]: 230 mSDtfsCounter, 393 mSDsluCounter, 855 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 1085 SdHoareTripleChecker+Invalid, 466 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:54,133 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 1085 Invalid, 466 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2025-01-09 15:48:54,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 823. [2025-01-09 15:48:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 755 states have (on average 1.3841059602649006) internal successors, (1045), 760 states have internal predecessors, (1045), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:54,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1161 transitions. [2025-01-09 15:48:54,170 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1161 transitions. Word has length 155 [2025-01-09 15:48:54,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:54,170 INFO L471 AbstractCegarLoop]: Abstraction has 823 states and 1161 transitions. [2025-01-09 15:48:54,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:54,170 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1161 transitions. [2025-01-09 15:48:54,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:54,171 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:54,171 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:54,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-09 15:48:54,171 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:54,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:54,172 INFO L85 PathProgramCache]: Analyzing trace with hash 794765423, now seen corresponding path program 1 times [2025-01-09 15:48:54,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:54,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484727305] [2025-01-09 15:48:54,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:54,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:54,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:54,217 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:54,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:54,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:54,722 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:54,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:54,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484727305] [2025-01-09 15:48:54,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484727305] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:54,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:54,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 15:48:54,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143418535] [2025-01-09 15:48:54,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:54,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:48:54,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:54,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:48:54,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:48:54,724 INFO L87 Difference]: Start difference. First operand 823 states and 1161 transitions. Second operand has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:55,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:55,070 INFO L93 Difference]: Finished difference Result 1714 states and 2410 transitions. [2025-01-09 15:48:55,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 15:48:55,070 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:48:55,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:55,073 INFO L225 Difference]: With dead ends: 1714 [2025-01-09 15:48:55,073 INFO L226 Difference]: Without dead ends: 894 [2025-01-09 15:48:55,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=397, Unknown=0, NotChecked=0, Total=462 [2025-01-09 15:48:55,075 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 82 mSDsluCounter, 2451 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 2693 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:55,075 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 2693 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 485 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-09 15:48:55,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 776. [2025-01-09 15:48:55,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 776 states, 713 states have (on average 1.3870967741935485) internal successors, (989), 717 states have internal predecessors, (989), 54 states have call successors, (54), 8 states have call predecessors, (54), 8 states have return successors, (54), 50 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 15:48:55,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1097 transitions. [2025-01-09 15:48:55,103 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1097 transitions. Word has length 155 [2025-01-09 15:48:55,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:55,103 INFO L471 AbstractCegarLoop]: Abstraction has 776 states and 1097 transitions. [2025-01-09 15:48:55,104 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.2) internal successors, (63), 15 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:55,104 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1097 transitions. [2025-01-09 15:48:55,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:55,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:55,105 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:55,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-09 15:48:55,105 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:55,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:55,105 INFO L85 PathProgramCache]: Analyzing trace with hash -134427281, now seen corresponding path program 1 times [2025-01-09 15:48:55,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:55,105 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764310571] [2025-01-09 15:48:55,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:55,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:55,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:55,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:55,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:55,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:55,494 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:55,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:55,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764310571] [2025-01-09 15:48:55,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764310571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:55,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:55,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:48:55,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501846193] [2025-01-09 15:48:55,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:55,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:48:55,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:55,497 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:48:55,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:48:55,498 INFO L87 Difference]: Start difference. First operand 776 states and 1097 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:55,950 INFO L93 Difference]: Finished difference Result 1786 states and 2521 transitions. [2025-01-09 15:48:55,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:48:55,951 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:48:55,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:55,958 INFO L225 Difference]: With dead ends: 1786 [2025-01-09 15:48:55,958 INFO L226 Difference]: Without dead ends: 1013 [2025-01-09 15:48:55,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:48:55,961 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 102 mSDsluCounter, 2022 mSDsCounter, 0 mSdLazyCounter, 487 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 2254 SdHoareTripleChecker+Invalid, 487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 487 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:55,963 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 2254 Invalid, 487 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 487 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:55,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2025-01-09 15:48:55,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 904. [2025-01-09 15:48:55,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 904 states, 836 states have (on average 1.3935406698564594) internal successors, (1165), 841 states have internal predecessors, (1165), 58 states have call successors, (58), 9 states have call predecessors, (58), 9 states have return successors, (58), 53 states have call predecessors, (58), 58 states have call successors, (58) [2025-01-09 15:48:55,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 904 states to 904 states and 1281 transitions. [2025-01-09 15:48:55,999 INFO L78 Accepts]: Start accepts. Automaton has 904 states and 1281 transitions. Word has length 155 [2025-01-09 15:48:56,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:56,000 INFO L471 AbstractCegarLoop]: Abstraction has 904 states and 1281 transitions. [2025-01-09 15:48:56,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:56,001 INFO L276 IsEmpty]: Start isEmpty. Operand 904 states and 1281 transitions. [2025-01-09 15:48:56,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:56,002 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:56,003 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:56,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2025-01-09 15:48:56,003 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:56,003 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:56,003 INFO L85 PathProgramCache]: Analyzing trace with hash 123738157, now seen corresponding path program 1 times [2025-01-09 15:48:56,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:56,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [414887689] [2025-01-09 15:48:56,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:56,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:56,036 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:56,048 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:56,048 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:56,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:56,389 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:56,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:56,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [414887689] [2025-01-09 15:48:56,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [414887689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:56,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:56,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:48:56,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050122977] [2025-01-09 15:48:56,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:56,390 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:48:56,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:56,391 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:48:56,391 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:56,391 INFO L87 Difference]: Start difference. First operand 904 states and 1281 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:56,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:56,690 INFO L93 Difference]: Finished difference Result 2046 states and 2896 transitions. [2025-01-09 15:48:56,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:56,693 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:48:56,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:56,697 INFO L225 Difference]: With dead ends: 2046 [2025-01-09 15:48:56,697 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 15:48:56,698 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:48:56,698 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 251 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:56,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 963 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:56,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 15:48:56,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1141. [2025-01-09 15:48:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1141 states, 1054 states have (on average 1.3842504743833017) internal successors, (1459), 1062 states have internal predecessors, (1459), 74 states have call successors, (74), 12 states have call predecessors, (74), 12 states have return successors, (74), 66 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 15:48:56,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1141 states to 1141 states and 1607 transitions. [2025-01-09 15:48:56,767 INFO L78 Accepts]: Start accepts. Automaton has 1141 states and 1607 transitions. Word has length 155 [2025-01-09 15:48:56,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:56,768 INFO L471 AbstractCegarLoop]: Abstraction has 1141 states and 1607 transitions. [2025-01-09 15:48:56,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:56,768 INFO L276 IsEmpty]: Start isEmpty. Operand 1141 states and 1607 transitions. [2025-01-09 15:48:56,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:56,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:56,770 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:56,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2025-01-09 15:48:56,770 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:56,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:56,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1145544531, now seen corresponding path program 1 times [2025-01-09 15:48:56,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:56,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378665407] [2025-01-09 15:48:56,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:56,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:56,789 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:56,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:56,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:56,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:56,919 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:56,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:56,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378665407] [2025-01-09 15:48:56,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378665407] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:56,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:56,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:56,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998534479] [2025-01-09 15:48:56,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:56,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:56,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:56,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:56,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:56,921 INFO L87 Difference]: Start difference. First operand 1141 states and 1607 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:57,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:57,029 INFO L93 Difference]: Finished difference Result 2480 states and 3499 transitions. [2025-01-09 15:48:57,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:57,029 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:48:57,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:57,033 INFO L225 Difference]: With dead ends: 2480 [2025-01-09 15:48:57,033 INFO L226 Difference]: Without dead ends: 1342 [2025-01-09 15:48:57,034 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-01-09 15:48:57,035 INFO L435 NwaCegarLoop]: 227 mSDtfsCounter, 68 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 798 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:57,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 798 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:57,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1342 states. [2025-01-09 15:48:57,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1342 to 1191. [2025-01-09 15:48:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1191 states, 1104 states have (on average 1.388586956521739) internal successors, (1533), 1112 states have internal predecessors, (1533), 74 states have call successors, (74), 12 states have call predecessors, (74), 12 states have return successors, (74), 66 states have call predecessors, (74), 74 states have call successors, (74) [2025-01-09 15:48:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1681 transitions. [2025-01-09 15:48:57,078 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1681 transitions. Word has length 155 [2025-01-09 15:48:57,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:57,078 INFO L471 AbstractCegarLoop]: Abstraction has 1191 states and 1681 transitions. [2025-01-09 15:48:57,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:57,079 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1681 transitions. [2025-01-09 15:48:57,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:57,080 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:57,080 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:57,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2025-01-09 15:48:57,080 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:57,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:57,080 INFO L85 PathProgramCache]: Analyzing trace with hash 1788800753, now seen corresponding path program 1 times [2025-01-09 15:48:57,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:57,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038909796] [2025-01-09 15:48:57,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:57,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:57,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:57,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:57,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:57,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:57,501 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:57,502 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:57,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038909796] [2025-01-09 15:48:57,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038909796] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:57,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:57,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 15:48:57,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909854928] [2025-01-09 15:48:57,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:57,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:48:57,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:57,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:48:57,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:48:57,503 INFO L87 Difference]: Start difference. First operand 1191 states and 1681 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:57,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:57,761 INFO L93 Difference]: Finished difference Result 2466 states and 3468 transitions. [2025-01-09 15:48:57,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:48:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 155 [2025-01-09 15:48:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:57,769 INFO L225 Difference]: With dead ends: 2466 [2025-01-09 15:48:57,769 INFO L226 Difference]: Without dead ends: 1278 [2025-01-09 15:48:57,771 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:48:57,771 INFO L435 NwaCegarLoop]: 220 mSDtfsCounter, 395 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 258 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 395 SdHoareTripleChecker+Valid, 901 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 258 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:57,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [395 Valid, 901 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 258 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:48:57,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1278 states. [2025-01-09 15:48:57,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1278 to 1102. [2025-01-09 15:48:57,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1102 states, 1023 states have (on average 1.3890518084066472) internal successors, (1421), 1029 states have internal predecessors, (1421), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:48:57,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 1553 transitions. [2025-01-09 15:48:57,833 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 1553 transitions. Word has length 155 [2025-01-09 15:48:57,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:57,833 INFO L471 AbstractCegarLoop]: Abstraction has 1102 states and 1553 transitions. [2025-01-09 15:48:57,834 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 8 states have internal predecessors, (63), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:48:57,834 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 1553 transitions. [2025-01-09 15:48:57,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:57,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:57,835 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:57,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2025-01-09 15:48:57,835 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:57,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:57,836 INFO L85 PathProgramCache]: Analyzing trace with hash 2046966191, now seen corresponding path program 1 times [2025-01-09 15:48:57,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:57,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672302162] [2025-01-09 15:48:57,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:57,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:57,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:57,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:57,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:57,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:58,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672302162] [2025-01-09 15:48:58,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672302162] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:58,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:58,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:48:58,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874045028] [2025-01-09 15:48:58,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:58,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:48:58,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:58,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:48:58,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:48:58,499 INFO L87 Difference]: Start difference. First operand 1102 states and 1553 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:58,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:58,894 INFO L93 Difference]: Finished difference Result 2354 states and 3306 transitions. [2025-01-09 15:48:58,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:48:58,894 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:48:58,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:58,901 INFO L225 Difference]: With dead ends: 2354 [2025-01-09 15:48:58,901 INFO L226 Difference]: Without dead ends: 1255 [2025-01-09 15:48:58,903 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:48:58,903 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 86 mSDsluCounter, 2163 mSDsCounter, 0 mSdLazyCounter, 563 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 2409 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 563 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:58,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 2409 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 563 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:48:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-09 15:48:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1108. [2025-01-09 15:48:58,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1029 states have (on average 1.3867832847424684) internal successors, (1427), 1035 states have internal predecessors, (1427), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:48:58,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1559 transitions. [2025-01-09 15:48:58,952 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1559 transitions. Word has length 155 [2025-01-09 15:48:58,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:58,952 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1559 transitions. [2025-01-09 15:48:58,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:58,952 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1559 transitions. [2025-01-09 15:48:58,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:58,953 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:58,953 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:58,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2025-01-09 15:48:58,954 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:58,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:58,954 INFO L85 PathProgramCache]: Analyzing trace with hash 1251776113, now seen corresponding path program 1 times [2025-01-09 15:48:58,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:58,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324633583] [2025-01-09 15:48:58,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:58,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:58,968 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:58,976 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:58,976 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:58,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:59,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324633583] [2025-01-09 15:48:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324633583] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:59,090 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:59,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:48:59,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619350259] [2025-01-09 15:48:59,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:59,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:48:59,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:59,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:48:59,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:48:59,091 INFO L87 Difference]: Start difference. First operand 1108 states and 1559 transitions. Second operand has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:59,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:48:59,195 INFO L93 Difference]: Finished difference Result 2250 states and 3164 transitions. [2025-01-09 15:48:59,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:48:59,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:48:59,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:48:59,199 INFO L225 Difference]: With dead ends: 2250 [2025-01-09 15:48:59,199 INFO L226 Difference]: Without dead ends: 1145 [2025-01-09 15:48:59,201 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-01-09 15:48:59,201 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 70 mSDsluCounter, 585 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:48:59,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 821 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:48:59,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2025-01-09 15:48:59,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1108. [2025-01-09 15:48:59,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 1029 states have (on average 1.380952380952381) internal successors, (1421), 1035 states have internal predecessors, (1421), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:48:59,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1553 transitions. [2025-01-09 15:48:59,241 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1553 transitions. Word has length 155 [2025-01-09 15:48:59,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:48:59,241 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1553 transitions. [2025-01-09 15:48:59,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.6) internal successors, (63), 5 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:48:59,241 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1553 transitions. [2025-01-09 15:48:59,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:48:59,242 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:48:59,242 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:48:59,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2025-01-09 15:48:59,243 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:48:59,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:48:59,243 INFO L85 PathProgramCache]: Analyzing trace with hash 240658863, now seen corresponding path program 1 times [2025-01-09 15:48:59,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:48:59,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90836834] [2025-01-09 15:48:59,243 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:48:59,243 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:48:59,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:48:59,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:48:59,269 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:48:59,269 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:48:59,749 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:48:59,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:48:59,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90836834] [2025-01-09 15:48:59,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90836834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:48:59,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:48:59,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:48:59,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724622480] [2025-01-09 15:48:59,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:48:59,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:48:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:48:59,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:48:59,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:48:59,750 INFO L87 Difference]: Start difference. First operand 1108 states and 1553 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:00,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:00,031 INFO L93 Difference]: Finished difference Result 2325 states and 3256 transitions. [2025-01-09 15:49:00,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:49:00,032 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:49:00,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:00,035 INFO L225 Difference]: With dead ends: 2325 [2025-01-09 15:49:00,035 INFO L226 Difference]: Without dead ends: 1220 [2025-01-09 15:49:00,036 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:49:00,037 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 71 mSDsluCounter, 2149 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2388 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:00,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2388 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:00,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1220 states. [2025-01-09 15:49:00,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1220 to 1112. [2025-01-09 15:49:00,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1033 states have (on average 1.3794772507260407) internal successors, (1425), 1039 states have internal predecessors, (1425), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:49:00,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1557 transitions. [2025-01-09 15:49:00,125 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1557 transitions. Word has length 155 [2025-01-09 15:49:00,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:00,125 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1557 transitions. [2025-01-09 15:49:00,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:00,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1557 transitions. [2025-01-09 15:49:00,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2025-01-09 15:49:00,126 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:00,126 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:00,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2025-01-09 15:49:00,126 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:00,127 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:00,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1872914961, now seen corresponding path program 1 times [2025-01-09 15:49:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:00,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006835374] [2025-01-09 15:49:00,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:00,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:00,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 155 statements into 1 equivalence classes. [2025-01-09 15:49:00,156 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 155 of 155 statements. [2025-01-09 15:49:00,156 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:00,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:00,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:00,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006835374] [2025-01-09 15:49:00,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006835374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:00,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:00,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 15:49:00,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308463997] [2025-01-09 15:49:00,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:00,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 15:49:00,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:00,624 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 15:49:00,624 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2025-01-09 15:49:00,624 INFO L87 Difference]: Start difference. First operand 1112 states and 1557 transitions. Second operand has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:00,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:00,949 INFO L93 Difference]: Finished difference Result 2324 states and 3252 transitions. [2025-01-09 15:49:00,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:49:00,949 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 155 [2025-01-09 15:49:00,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:00,955 INFO L225 Difference]: With dead ends: 2324 [2025-01-09 15:49:00,955 INFO L226 Difference]: Without dead ends: 1215 [2025-01-09 15:49:00,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=287, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:49:00,957 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 71 mSDsluCounter, 2298 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 2536 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:00,958 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 2536 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:00,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1215 states. [2025-01-09 15:49:01,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1215 to 1101. [2025-01-09 15:49:01,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1101 states, 1022 states have (on average 1.3806262230919766) internal successors, (1411), 1028 states have internal predecessors, (1411), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:49:01,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1543 transitions. [2025-01-09 15:49:01,017 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1543 transitions. Word has length 155 [2025-01-09 15:49:01,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:01,017 INFO L471 AbstractCegarLoop]: Abstraction has 1101 states and 1543 transitions. [2025-01-09 15:49:01,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.846153846153846) internal successors, (63), 13 states have internal predecessors, (63), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:01,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1543 transitions. [2025-01-09 15:49:01,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:49:01,018 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:01,018 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:01,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2025-01-09 15:49:01,018 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:01,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:01,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1646586211, now seen corresponding path program 1 times [2025-01-09 15:49:01,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:01,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145660119] [2025-01-09 15:49:01,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:01,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:01,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:49:01,039 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:49:01,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:01,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:01,061 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:01,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:01,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145660119] [2025-01-09 15:49:01,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145660119] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:01,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:01,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:49:01,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593113866] [2025-01-09 15:49:01,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:01,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:49:01,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:01,063 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:49:01,063 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:01,063 INFO L87 Difference]: Start difference. First operand 1101 states and 1543 transitions. Second operand has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:01,109 INFO L93 Difference]: Finished difference Result 2210 states and 3105 transitions. [2025-01-09 15:49:01,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:49:01,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-01-09 15:49:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:01,112 INFO L225 Difference]: With dead ends: 2210 [2025-01-09 15:49:01,112 INFO L226 Difference]: Without dead ends: 1112 [2025-01-09 15:49:01,113 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:01,114 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:01,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:01,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2025-01-09 15:49:01,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1112. [2025-01-09 15:49:01,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1112 states, 1033 states have (on average 1.3765730880929332) internal successors, (1422), 1039 states have internal predecessors, (1422), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:49:01,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1112 states to 1112 states and 1554 transitions. [2025-01-09 15:49:01,157 INFO L78 Accepts]: Start accepts. Automaton has 1112 states and 1554 transitions. Word has length 156 [2025-01-09 15:49:01,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:01,157 INFO L471 AbstractCegarLoop]: Abstraction has 1112 states and 1554 transitions. [2025-01-09 15:49:01,157 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.333333333333332) internal successors, (64), 3 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:01,157 INFO L276 IsEmpty]: Start isEmpty. Operand 1112 states and 1554 transitions. [2025-01-09 15:49:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-01-09 15:49:01,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:01,158 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:01,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2025-01-09 15:49:01,159 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:01,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:01,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1904751649, now seen corresponding path program 1 times [2025-01-09 15:49:01,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:01,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782418096] [2025-01-09 15:49:01,159 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:01,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:01,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:49:01,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:49:01,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:01,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:49:01,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782418096] [2025-01-09 15:49:01,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782418096] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:01,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1683362745] [2025-01-09 15:49:01,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:01,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:01,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:01,269 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:49:01,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 15:49:01,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-01-09 15:49:01,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-01-09 15:49:01,534 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:01,534 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:01,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 15:49:01,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:01,583 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:01,583 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:01,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1683362745] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:01,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:01,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [8] total 10 [2025-01-09 15:49:01,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567635773] [2025-01-09 15:49:01,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:01,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 15:49:01,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:01,584 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 15:49:01,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:01,584 INFO L87 Difference]: Start difference. First operand 1112 states and 1554 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:01,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:01,658 INFO L93 Difference]: Finished difference Result 2265 states and 3160 transitions. [2025-01-09 15:49:01,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:01,659 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 156 [2025-01-09 15:49:01,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:01,661 INFO L225 Difference]: With dead ends: 2265 [2025-01-09 15:49:01,661 INFO L226 Difference]: Without dead ends: 1156 [2025-01-09 15:49:01,662 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 156 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:01,663 INFO L435 NwaCegarLoop]: 176 mSDtfsCounter, 0 mSDsluCounter, 683 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:01,664 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 859 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:01,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1156 states. [2025-01-09 15:49:01,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1156 to 1123. [2025-01-09 15:49:01,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1123 states, 1044 states have (on average 1.3726053639846743) internal successors, (1433), 1050 states have internal predecessors, (1433), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:49:01,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1123 states to 1123 states and 1565 transitions. [2025-01-09 15:49:01,704 INFO L78 Accepts]: Start accepts. Automaton has 1123 states and 1565 transitions. Word has length 156 [2025-01-09 15:49:01,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:01,704 INFO L471 AbstractCegarLoop]: Abstraction has 1123 states and 1565 transitions. [2025-01-09 15:49:01,704 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 6 states have internal predecessors, (64), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:01,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1123 states and 1565 transitions. [2025-01-09 15:49:01,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:49:01,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:01,706 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:01,714 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 15:49:01,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:01,906 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:01,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash -783386658, now seen corresponding path program 1 times [2025-01-09 15:49:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276032038] [2025-01-09 15:49:01,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:01,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:49:01,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:49:01,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:01,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:02,051 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:02,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:02,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276032038] [2025-01-09 15:49:02,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276032038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:02,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:02,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:02,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [344220203] [2025-01-09 15:49:02,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:02,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:02,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:02,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:02,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:02,052 INFO L87 Difference]: Start difference. First operand 1123 states and 1565 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:02,199 INFO L93 Difference]: Finished difference Result 3163 states and 4368 transitions. [2025-01-09 15:49:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:02,199 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-01-09 15:49:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:02,203 INFO L225 Difference]: With dead ends: 3163 [2025-01-09 15:49:02,203 INFO L226 Difference]: Without dead ends: 2043 [2025-01-09 15:49:02,204 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-01-09 15:49:02,205 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 153 mSDsluCounter, 448 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 615 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:02,205 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 615 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:02,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2025-01-09 15:49:02,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 1351. [2025-01-09 15:49:02,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 1272 states have (on average 1.3199685534591195) internal successors, (1679), 1278 states have internal predecessors, (1679), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:49:02,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1811 transitions. [2025-01-09 15:49:02,250 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1811 transitions. Word has length 158 [2025-01-09 15:49:02,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:02,250 INFO L471 AbstractCegarLoop]: Abstraction has 1351 states and 1811 transitions. [2025-01-09 15:49:02,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:02,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1811 transitions. [2025-01-09 15:49:02,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:49:02,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:02,252 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:02,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2025-01-09 15:49:02,252 INFO L396 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:02,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:02,252 INFO L85 PathProgramCache]: Analyzing trace with hash 840268931, now seen corresponding path program 1 times [2025-01-09 15:49:02,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:02,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795882198] [2025-01-09 15:49:02,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:02,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:02,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:49:02,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:49:02,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:02,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:02,295 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:02,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:02,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795882198] [2025-01-09 15:49:02,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795882198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:02,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:02,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:49:02,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376820423] [2025-01-09 15:49:02,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:02,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:49:02,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:02,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:49:02,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:02,296 INFO L87 Difference]: Start difference. First operand 1351 states and 1811 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:02,339 INFO L93 Difference]: Finished difference Result 2707 states and 3635 transitions. [2025-01-09 15:49:02,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:49:02,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-01-09 15:49:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:02,343 INFO L225 Difference]: With dead ends: 2707 [2025-01-09 15:49:02,343 INFO L226 Difference]: Without dead ends: 1359 [2025-01-09 15:49:02,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:02,345 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 351 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:02,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 351 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:02,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1359 states. [2025-01-09 15:49:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1359 to 1359. [2025-01-09 15:49:02,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1359 states, 1280 states have (on average 1.31796875) internal successors, (1687), 1286 states have internal predecessors, (1687), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 60 states have call predecessors, (66), 66 states have call successors, (66) [2025-01-09 15:49:02,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1359 states to 1359 states and 1819 transitions. [2025-01-09 15:49:02,391 INFO L78 Accepts]: Start accepts. Automaton has 1359 states and 1819 transitions. Word has length 158 [2025-01-09 15:49:02,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:02,391 INFO L471 AbstractCegarLoop]: Abstraction has 1359 states and 1819 transitions. [2025-01-09 15:49:02,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:02,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1359 states and 1819 transitions. [2025-01-09 15:49:02,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-01-09 15:49:02,392 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:02,392 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:02,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2025-01-09 15:49:02,393 INFO L396 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:02,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:02,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1679691003, now seen corresponding path program 1 times [2025-01-09 15:49:02,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:02,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757458115] [2025-01-09 15:49:02,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:02,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:02,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-01-09 15:49:02,428 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-01-09 15:49:02,429 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:02,429 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:02,718 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:02,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:02,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757458115] [2025-01-09 15:49:02,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757458115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:02,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:02,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-01-09 15:49:02,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847804012] [2025-01-09 15:49:02,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:02,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:02,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:02,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:02,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-01-09 15:49:02,719 INFO L87 Difference]: Start difference. First operand 1359 states and 1819 transitions. Second operand has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:03,075 INFO L93 Difference]: Finished difference Result 2885 states and 3775 transitions. [2025-01-09 15:49:03,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 15:49:03,076 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 158 [2025-01-09 15:49:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:03,081 INFO L225 Difference]: With dead ends: 2885 [2025-01-09 15:49:03,081 INFO L226 Difference]: Without dead ends: 2883 [2025-01-09 15:49:03,082 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:49:03,084 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 293 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:03,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 1261 Invalid, 272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:03,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2883 states. [2025-01-09 15:49:03,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2883 to 2445. [2025-01-09 15:49:03,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2445 states, 2296 states have (on average 1.2870209059233448) internal successors, (2955), 2310 states have internal predecessors, (2955), 124 states have call successors, (124), 24 states have call predecessors, (124), 24 states have return successors, (124), 110 states have call predecessors, (124), 124 states have call successors, (124) [2025-01-09 15:49:03,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2445 states to 2445 states and 3203 transitions. [2025-01-09 15:49:03,223 INFO L78 Accepts]: Start accepts. Automaton has 2445 states and 3203 transitions. Word has length 158 [2025-01-09 15:49:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:03,224 INFO L471 AbstractCegarLoop]: Abstraction has 2445 states and 3203 transitions. [2025-01-09 15:49:03,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.333333333333333) internal successors, (66), 9 states have internal predecessors, (66), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 2445 states and 3203 transitions. [2025-01-09 15:49:03,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2025-01-09 15:49:03,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:03,226 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:03,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2025-01-09 15:49:03,226 INFO L396 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:03,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:03,227 INFO L85 PathProgramCache]: Analyzing trace with hash 42967949, now seen corresponding path program 1 times [2025-01-09 15:49:03,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:03,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1493132220] [2025-01-09 15:49:03,227 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:03,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:03,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 159 statements into 1 equivalence classes. [2025-01-09 15:49:03,276 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 159 of 159 statements. [2025-01-09 15:49:03,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:03,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:03,753 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:03,753 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:03,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1493132220] [2025-01-09 15:49:03,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1493132220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:03,753 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:03,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-01-09 15:49:03,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201181528] [2025-01-09 15:49:03,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:03,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 15:49:03,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:03,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 15:49:03,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:03,755 INFO L87 Difference]: Start difference. First operand 2445 states and 3203 transitions. Second operand has 12 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:49:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:04,312 INFO L93 Difference]: Finished difference Result 5135 states and 6712 transitions. [2025-01-09 15:49:04,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:49:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) Word has length 159 [2025-01-09 15:49:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:04,318 INFO L225 Difference]: With dead ends: 5135 [2025-01-09 15:49:04,319 INFO L226 Difference]: Without dead ends: 2693 [2025-01-09 15:49:04,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=233, Unknown=0, NotChecked=0, Total=306 [2025-01-09 15:49:04,322 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 368 mSDsluCounter, 1100 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:04,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 1342 Invalid, 594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:04,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2693 states. [2025-01-09 15:49:04,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2693 to 2567. [2025-01-09 15:49:04,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2567 states, 2400 states have (on average 1.2804166666666668) internal successors, (3073), 2418 states have internal predecessors, (3073), 136 states have call successors, (136), 30 states have call predecessors, (136), 30 states have return successors, (136), 118 states have call predecessors, (136), 136 states have call successors, (136) [2025-01-09 15:49:04,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3345 transitions. [2025-01-09 15:49:04,439 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3345 transitions. Word has length 159 [2025-01-09 15:49:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:04,440 INFO L471 AbstractCegarLoop]: Abstraction has 2567 states and 3345 transitions. [2025-01-09 15:49:04,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 6 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 5 states have call predecessors, (19), 6 states have call successors, (19) [2025-01-09 15:49:04,441 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3345 transitions. [2025-01-09 15:49:04,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:49:04,442 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:04,442 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:04,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2025-01-09 15:49:04,443 INFO L396 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:04,443 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:04,443 INFO L85 PathProgramCache]: Analyzing trace with hash 2144453609, now seen corresponding path program 1 times [2025-01-09 15:49:04,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:04,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940420715] [2025-01-09 15:49:04,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:04,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:49:04,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:49:04,465 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:04,465 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940420715] [2025-01-09 15:49:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940420715] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608532447] [2025-01-09 15:49:04,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:04,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:04,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:04,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:04,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:04,579 INFO L87 Difference]: Start difference. First operand 2567 states and 3345 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:04,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:04,817 INFO L93 Difference]: Finished difference Result 7395 states and 9597 transitions. [2025-01-09 15:49:04,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:04,817 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-01-09 15:49:04,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:04,824 INFO L225 Difference]: With dead ends: 7395 [2025-01-09 15:49:04,825 INFO L226 Difference]: Without dead ends: 4831 [2025-01-09 15:49:04,827 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:04,827 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 98 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:04,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 898 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:04,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4831 states. [2025-01-09 15:49:05,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4831 to 4825. [2025-01-09 15:49:05,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4512 states have (on average 1.2690602836879432) internal successors, (5726), 4550 states have internal predecessors, (5726), 252 states have call successors, (252), 60 states have call predecessors, (252), 60 states have return successors, (252), 214 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 15:49:05,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6230 transitions. [2025-01-09 15:49:05,038 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6230 transitions. Word has length 160 [2025-01-09 15:49:05,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:05,039 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 6230 transitions. [2025-01-09 15:49:05,039 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:05,039 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6230 transitions. [2025-01-09 15:49:05,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:49:05,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:05,041 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:05,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2025-01-09 15:49:05,042 INFO L396 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:05,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:05,042 INFO L85 PathProgramCache]: Analyzing trace with hash 2000729604, now seen corresponding path program 1 times [2025-01-09 15:49:05,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:05,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119775384] [2025-01-09 15:49:05,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:05,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:05,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:49:05,065 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:49:05,066 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:05,066 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:05,086 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:05,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:05,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119775384] [2025-01-09 15:49:05,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119775384] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:05,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:05,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:49:05,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469494774] [2025-01-09 15:49:05,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:05,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:49:05,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:05,088 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:49:05,088 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:05,088 INFO L87 Difference]: Start difference. First operand 4825 states and 6230 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:05,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:05,313 INFO L93 Difference]: Finished difference Result 9747 states and 12657 transitions. [2025-01-09 15:49:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:49:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-01-09 15:49:05,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:05,330 INFO L225 Difference]: With dead ends: 9747 [2025-01-09 15:49:05,330 INFO L226 Difference]: Without dead ends: 4925 [2025-01-09 15:49:05,334 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:05,335 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 0 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:05,335 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 352 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2025-01-09 15:49:05,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4925. [2025-01-09 15:49:05,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4925 states, 4612 states have (on average 1.2632263660017347) internal successors, (5826), 4650 states have internal predecessors, (5826), 252 states have call successors, (252), 60 states have call predecessors, (252), 60 states have return successors, (252), 214 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 15:49:05,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4925 states to 4925 states and 6330 transitions. [2025-01-09 15:49:05,577 INFO L78 Accepts]: Start accepts. Automaton has 4925 states and 6330 transitions. Word has length 160 [2025-01-09 15:49:05,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:05,577 INFO L471 AbstractCegarLoop]: Abstraction has 4925 states and 6330 transitions. [2025-01-09 15:49:05,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 4925 states and 6330 transitions. [2025-01-09 15:49:05,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:49:05,580 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:05,581 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:05,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2025-01-09 15:49:05,581 INFO L396 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:05,581 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:05,581 INFO L85 PathProgramCache]: Analyzing trace with hash 2141278214, now seen corresponding path program 1 times [2025-01-09 15:49:05,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:05,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739070647] [2025-01-09 15:49:05,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:05,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:05,601 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:49:05,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:49:05,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:05,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:05,764 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:05,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:05,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739070647] [2025-01-09 15:49:05,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739070647] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:05,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:05,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 15:49:05,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383266529] [2025-01-09 15:49:05,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:05,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 15:49:05,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:05,765 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 15:49:05,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 15:49:05,766 INFO L87 Difference]: Start difference. First operand 4925 states and 6330 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:05,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:05,978 INFO L93 Difference]: Finished difference Result 9747 states and 12457 transitions. [2025-01-09 15:49:05,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 15:49:05,979 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-01-09 15:49:05,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:05,989 INFO L225 Difference]: With dead ends: 9747 [2025-01-09 15:49:05,989 INFO L226 Difference]: Without dead ends: 4825 [2025-01-09 15:49:05,996 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-01-09 15:49:05,996 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 1 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:05,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 517 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:05,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4825 states. [2025-01-09 15:49:06,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4825 to 4825. [2025-01-09 15:49:06,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4825 states, 4512 states have (on average 1.2247340425531914) internal successors, (5526), 4550 states have internal predecessors, (5526), 252 states have call successors, (252), 60 states have call predecessors, (252), 60 states have return successors, (252), 214 states have call predecessors, (252), 252 states have call successors, (252) [2025-01-09 15:49:06,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4825 states to 4825 states and 6030 transitions. [2025-01-09 15:49:06,352 INFO L78 Accepts]: Start accepts. Automaton has 4825 states and 6030 transitions. Word has length 160 [2025-01-09 15:49:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:06,353 INFO L471 AbstractCegarLoop]: Abstraction has 4825 states and 6030 transitions. [2025-01-09 15:49:06,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 4825 states and 6030 transitions. [2025-01-09 15:49:06,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-01-09 15:49:06,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:06,361 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:06,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2025-01-09 15:49:06,361 INFO L396 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:06,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:06,361 INFO L85 PathProgramCache]: Analyzing trace with hash -764310293, now seen corresponding path program 1 times [2025-01-09 15:49:06,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:06,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020348079] [2025-01-09 15:49:06,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:06,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:06,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-01-09 15:49:06,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-01-09 15:49:06,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:06,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:06,636 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:06,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:06,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020348079] [2025-01-09 15:49:06,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020348079] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:06,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:06,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:06,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937217029] [2025-01-09 15:49:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:06,639 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:06,639 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:06,639 INFO L87 Difference]: Start difference. First operand 4825 states and 6030 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:07,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:07,074 INFO L93 Difference]: Finished difference Result 10740 states and 13389 transitions. [2025-01-09 15:49:07,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 15:49:07,075 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 160 [2025-01-09 15:49:07,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:07,086 INFO L225 Difference]: With dead ends: 10740 [2025-01-09 15:49:07,086 INFO L226 Difference]: Without dead ends: 5918 [2025-01-09 15:49:07,091 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:07,091 INFO L435 NwaCegarLoop]: 284 mSDtfsCounter, 90 mSDsluCounter, 609 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 893 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:07,092 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 893 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:07,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5918 states. [2025-01-09 15:49:07,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5918 to 5894. [2025-01-09 15:49:07,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 5510 states have (on average 1.217241379310345) internal successors, (6707), 5558 states have internal predecessors, (6707), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 15:49:07,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 7319 transitions. [2025-01-09 15:49:07,484 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 7319 transitions. Word has length 160 [2025-01-09 15:49:07,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:07,485 INFO L471 AbstractCegarLoop]: Abstraction has 5894 states and 7319 transitions. [2025-01-09 15:49:07,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:07,485 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 7319 transitions. [2025-01-09 15:49:07,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:49:07,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:07,488 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:07,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2025-01-09 15:49:07,488 INFO L396 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:07,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:07,488 INFO L85 PathProgramCache]: Analyzing trace with hash -733588566, now seen corresponding path program 1 times [2025-01-09 15:49:07,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:07,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1987417651] [2025-01-09 15:49:07,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:07,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:07,505 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:07,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:07,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:07,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:07,844 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:07,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:07,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1987417651] [2025-01-09 15:49:07,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1987417651] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:07,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:07,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 15:49:07,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105064840] [2025-01-09 15:49:07,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:07,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 15:49:07,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:07,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 15:49:07,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2025-01-09 15:49:07,845 INFO L87 Difference]: Start difference. First operand 5894 states and 7319 transitions. Second operand has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:49:08,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:08,576 INFO L93 Difference]: Finished difference Result 11289 states and 14035 transitions. [2025-01-09 15:49:08,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:49:08,577 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) Word has length 161 [2025-01-09 15:49:08,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:08,585 INFO L225 Difference]: With dead ends: 11289 [2025-01-09 15:49:08,586 INFO L226 Difference]: Without dead ends: 7623 [2025-01-09 15:49:08,590 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=178, Unknown=0, NotChecked=0, Total=240 [2025-01-09 15:49:08,590 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 748 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 927 SdHoareTripleChecker+Invalid, 374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:08,590 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 927 Invalid, 374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:08,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7623 states. [2025-01-09 15:49:08,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7623 to 5894. [2025-01-09 15:49:08,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5894 states, 5510 states have (on average 1.215426497277677) internal successors, (6697), 5558 states have internal predecessors, (6697), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 15:49:08,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5894 states to 5894 states and 7309 transitions. [2025-01-09 15:49:08,882 INFO L78 Accepts]: Start accepts. Automaton has 5894 states and 7309 transitions. Word has length 161 [2025-01-09 15:49:08,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:08,883 INFO L471 AbstractCegarLoop]: Abstraction has 5894 states and 7309 transitions. [2025-01-09 15:49:08,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.666666666666667) internal successors, (69), 10 states have internal predecessors, (69), 4 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 4 states have call successors, (19) [2025-01-09 15:49:08,883 INFO L276 IsEmpty]: Start isEmpty. Operand 5894 states and 7309 transitions. [2025-01-09 15:49:08,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:49:08,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:08,886 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:08,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47 [2025-01-09 15:49:08,886 INFO L396 AbstractCegarLoop]: === Iteration 49 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:08,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:08,886 INFO L85 PathProgramCache]: Analyzing trace with hash -867602072, now seen corresponding path program 1 times [2025-01-09 15:49:08,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:08,887 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [758113080] [2025-01-09 15:49:08,887 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:08,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:08,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:08,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:08,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:08,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:09,287 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:09,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:09,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [758113080] [2025-01-09 15:49:09,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [758113080] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:09,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:09,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:49:09,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895918405] [2025-01-09 15:49:09,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:09,288 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:49:09,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:09,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:49:09,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:09,289 INFO L87 Difference]: Start difference. First operand 5894 states and 7309 transitions. Second operand has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:10,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:10,413 INFO L93 Difference]: Finished difference Result 14008 states and 17376 transitions. [2025-01-09 15:49:10,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-09 15:49:10,413 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-01-09 15:49:10,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:10,423 INFO L225 Difference]: With dead ends: 14008 [2025-01-09 15:49:10,423 INFO L226 Difference]: Without dead ends: 8117 [2025-01-09 15:49:10,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=685, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:49:10,427 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 955 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 920 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 955 SdHoareTripleChecker+Valid, 2144 SdHoareTripleChecker+Invalid, 1014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:10,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [955 Valid, 2144 Invalid, 1014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 920 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 15:49:10,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8117 states. [2025-01-09 15:49:10,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8117 to 6061. [2025-01-09 15:49:10,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6061 states, 5677 states have (on average 1.2184252245904528) internal successors, (6917), 5725 states have internal predecessors, (6917), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 15:49:10,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6061 states to 6061 states and 7529 transitions. [2025-01-09 15:49:10,945 INFO L78 Accepts]: Start accepts. Automaton has 6061 states and 7529 transitions. Word has length 161 [2025-01-09 15:49:10,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:10,945 INFO L471 AbstractCegarLoop]: Abstraction has 6061 states and 7529 transitions. [2025-01-09 15:49:10,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.928571428571429) internal successors, (69), 14 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:10,945 INFO L276 IsEmpty]: Start isEmpty. Operand 6061 states and 7529 transitions. [2025-01-09 15:49:10,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:49:10,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:10,949 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:10,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable48 [2025-01-09 15:49:10,950 INFO L396 AbstractCegarLoop]: === Iteration 50 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:10,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:10,950 INFO L85 PathProgramCache]: Analyzing trace with hash -609436634, now seen corresponding path program 1 times [2025-01-09 15:49:10,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:10,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764695177] [2025-01-09 15:49:10,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:10,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:10,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:10,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:10,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:10,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:11,075 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 12 proven. 42 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:49:11,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764695177] [2025-01-09 15:49:11,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764695177] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:11,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1704580840] [2025-01-09 15:49:11,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:11,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:11,076 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:11,078 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:49:11,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 15:49:11,310 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:11,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:11,362 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:11,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:11,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 666 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 15:49:11,369 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:11,405 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:11,405 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:11,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1704580840] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:11,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:11,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9] total 12 [2025-01-09 15:49:11,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900756937] [2025-01-09 15:49:11,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:11,405 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:11,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:11,406 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:11,406 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:11,406 INFO L87 Difference]: Start difference. First operand 6061 states and 7529 transitions. Second operand has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:11,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:11,696 INFO L93 Difference]: Finished difference Result 12394 states and 15385 transitions. [2025-01-09 15:49:11,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:11,697 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-01-09 15:49:11,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:11,704 INFO L225 Difference]: With dead ends: 12394 [2025-01-09 15:49:11,707 INFO L226 Difference]: Without dead ends: 6336 [2025-01-09 15:49:11,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2025-01-09 15:49:11,717 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 0 mSDsluCounter, 840 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1013 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:11,720 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1013 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:11,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6336 states. [2025-01-09 15:49:12,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6336 to 6116. [2025-01-09 15:49:12,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6116 states, 5732 states have (on average 1.2163293789253316) internal successors, (6972), 5780 states have internal predecessors, (6972), 306 states have call successors, (306), 77 states have call predecessors, (306), 77 states have return successors, (306), 258 states have call predecessors, (306), 306 states have call successors, (306) [2025-01-09 15:49:12,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6116 states to 6116 states and 7584 transitions. [2025-01-09 15:49:12,048 INFO L78 Accepts]: Start accepts. Automaton has 6116 states and 7584 transitions. Word has length 161 [2025-01-09 15:49:12,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:12,048 INFO L471 AbstractCegarLoop]: Abstraction has 6116 states and 7584 transitions. [2025-01-09 15:49:12,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.857142857142858) internal successors, (69), 7 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:12,048 INFO L276 IsEmpty]: Start isEmpty. Operand 6116 states and 7584 transitions. [2025-01-09 15:49:12,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:49:12,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:12,052 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:12,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:12,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2025-01-09 15:49:12,256 INFO L396 AbstractCegarLoop]: === Iteration 51 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:12,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:12,257 INFO L85 PathProgramCache]: Analyzing trace with hash -262606843, now seen corresponding path program 1 times [2025-01-09 15:49:12,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:12,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732139568] [2025-01-09 15:49:12,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:12,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:12,272 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:12,281 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:12,282 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:12,282 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:12,387 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:12,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:12,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732139568] [2025-01-09 15:49:12,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [732139568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:12,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:12,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:12,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888794774] [2025-01-09 15:49:12,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:12,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:12,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:12,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:12,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:12,389 INFO L87 Difference]: Start difference. First operand 6116 states and 7584 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:12,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:12,702 INFO L93 Difference]: Finished difference Result 12241 states and 15172 transitions. [2025-01-09 15:49:12,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:12,702 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-01-09 15:49:12,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:12,710 INFO L225 Difference]: With dead ends: 12241 [2025-01-09 15:49:12,711 INFO L226 Difference]: Without dead ends: 6128 [2025-01-09 15:49:12,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:12,716 INFO L435 NwaCegarLoop]: 180 mSDtfsCounter, 181 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:12,716 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 517 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:12,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6128 states. [2025-01-09 15:49:12,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6128 to 5826. [2025-01-09 15:49:12,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 5511 states have (on average 1.2123026673924877) internal successors, (6681), 5549 states have internal predecessors, (6681), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2025-01-09 15:49:12,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7177 transitions. [2025-01-09 15:49:12,988 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7177 transitions. Word has length 161 [2025-01-09 15:49:12,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:12,988 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 7177 transitions. [2025-01-09 15:49:12,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:12,988 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7177 transitions. [2025-01-09 15:49:12,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:49:12,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:12,995 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:12,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50 [2025-01-09 15:49:12,995 INFO L396 AbstractCegarLoop]: === Iteration 52 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:12,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:12,996 INFO L85 PathProgramCache]: Analyzing trace with hash -655633853, now seen corresponding path program 1 times [2025-01-09 15:49:12,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:12,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830633337] [2025-01-09 15:49:12,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:12,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:13,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:13,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:13,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:13,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:13,148 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:13,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:13,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830633337] [2025-01-09 15:49:13,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830633337] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:13,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:13,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:13,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073441553] [2025-01-09 15:49:13,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:13,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:13,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:13,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:13,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:13,151 INFO L87 Difference]: Start difference. First operand 5826 states and 7177 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:13,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:13,473 INFO L93 Difference]: Finished difference Result 11871 states and 14621 transitions. [2025-01-09 15:49:13,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 161 [2025-01-09 15:49:13,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:13,484 INFO L225 Difference]: With dead ends: 11871 [2025-01-09 15:49:13,484 INFO L226 Difference]: Without dead ends: 6048 [2025-01-09 15:49:13,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-09 15:49:13,497 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 134 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 505 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:13,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 505 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:13,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6048 states. [2025-01-09 15:49:13,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6048 to 5826. [2025-01-09 15:49:13,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5826 states, 5511 states have (on average 1.2104881146797315) internal successors, (6671), 5549 states have internal predecessors, (6671), 248 states have call successors, (248), 66 states have call predecessors, (248), 66 states have return successors, (248), 210 states have call predecessors, (248), 248 states have call successors, (248) [2025-01-09 15:49:13,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5826 states to 5826 states and 7167 transitions. [2025-01-09 15:49:13,813 INFO L78 Accepts]: Start accepts. Automaton has 5826 states and 7167 transitions. Word has length 161 [2025-01-09 15:49:13,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:13,813 INFO L471 AbstractCegarLoop]: Abstraction has 5826 states and 7167 transitions. [2025-01-09 15:49:13,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 5 states have internal predecessors, (69), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:13,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5826 states and 7167 transitions. [2025-01-09 15:49:13,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 15:49:13,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:13,817 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:13,817 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable51 [2025-01-09 15:49:13,817 INFO L396 AbstractCegarLoop]: === Iteration 53 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:13,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:13,817 INFO L85 PathProgramCache]: Analyzing trace with hash -458828952, now seen corresponding path program 1 times [2025-01-09 15:49:13,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:13,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1228827684] [2025-01-09 15:49:13,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:13,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:13,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:13,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:13,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:13,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:14,078 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:49:14,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1228827684] [2025-01-09 15:49:14,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1228827684] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:14,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776949516] [2025-01-09 15:49:14,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:14,079 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:14,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:14,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 15:49:14,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 15:49:14,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 15:49:14,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 15:49:14,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:14,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:14,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 20 conjuncts are in the unsatisfiable core [2025-01-09 15:49:14,420 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:14,679 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 15 treesize of output 1 [2025-01-09 15:49:14,734 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 25 treesize of output 17 [2025-01-09 15:49:14,737 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 13 treesize of output 9 [2025-01-09 15:49:14,764 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 17 treesize of output 9 [2025-01-09 15:49:14,776 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 2 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2025-01-09 15:49:14,776 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:14,957 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 27 treesize of output 23 [2025-01-09 15:49:15,083 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2025-01-09 15:49:15,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776949516] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 15:49:15,083 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 15:49:15,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 15 [2025-01-09 15:49:15,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1617753356] [2025-01-09 15:49:15,083 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 15:49:15,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 15:49:15,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:15,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 15:49:15,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2025-01-09 15:49:15,084 INFO L87 Difference]: Start difference. First operand 5826 states and 7167 transitions. Second operand has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 6 states have call successors, (39) [2025-01-09 15:49:15,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:15,833 INFO L93 Difference]: Finished difference Result 10760 states and 13384 transitions. [2025-01-09 15:49:15,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 15:49:15,834 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 6 states have call successors, (39) Word has length 161 [2025-01-09 15:49:15,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:15,846 INFO L225 Difference]: With dead ends: 10760 [2025-01-09 15:49:15,846 INFO L226 Difference]: Without dead ends: 4937 [2025-01-09 15:49:15,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 316 SyntacticMatches, 4 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=304, Invalid=956, Unknown=0, NotChecked=0, Total=1260 [2025-01-09 15:49:15,853 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 1162 mSDsluCounter, 861 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1162 SdHoareTripleChecker+Valid, 1019 SdHoareTripleChecker+Invalid, 626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:15,853 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1162 Valid, 1019 Invalid, 626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 15:49:15,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4937 states. [2025-01-09 15:49:16,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4937 to 4465. [2025-01-09 15:49:16,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4465 states, 4136 states have (on average 1.1818181818181819) internal successors, (4888), 4174 states have internal predecessors, (4888), 256 states have call successors, (256), 72 states have call predecessors, (256), 72 states have return successors, (256), 218 states have call predecessors, (256), 256 states have call successors, (256) [2025-01-09 15:49:16,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 5400 transitions. [2025-01-09 15:49:16,151 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 5400 transitions. Word has length 161 [2025-01-09 15:49:16,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:16,151 INFO L471 AbstractCegarLoop]: Abstraction has 4465 states and 5400 transitions. [2025-01-09 15:49:16,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 7.615384615384615) internal successors, (99), 15 states have internal predecessors, (99), 6 states have call successors, (39), 3 states have call predecessors, (39), 5 states have return successors, (39), 4 states have call predecessors, (39), 6 states have call successors, (39) [2025-01-09 15:49:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 5400 transitions. [2025-01-09 15:49:16,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 15:49:16,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:16,155 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:16,163 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 15:49:16,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 15:49:16,359 INFO L396 AbstractCegarLoop]: === Iteration 54 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:16,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:16,359 INFO L85 PathProgramCache]: Analyzing trace with hash 822002849, now seen corresponding path program 1 times [2025-01-09 15:49:16,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:16,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637798835] [2025-01-09 15:49:16,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:16,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:16,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:49:16,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:49:16,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:16,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:16,943 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:16,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 15:49:16,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637798835] [2025-01-09 15:49:16,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637798835] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:16,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:16,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-01-09 15:49:16,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495272607] [2025-01-09 15:49:16,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:16,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 15:49:16,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 15:49:16,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 15:49:16,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:16,945 INFO L87 Difference]: Start difference. First operand 4465 states and 5400 transitions. Second operand has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:49:18,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:18,018 INFO L93 Difference]: Finished difference Result 7843 states and 9481 transitions. [2025-01-09 15:49:18,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 15:49:18,018 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) Word has length 163 [2025-01-09 15:49:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:18,027 INFO L225 Difference]: With dead ends: 7843 [2025-01-09 15:49:18,027 INFO L226 Difference]: Without dead ends: 7841 [2025-01-09 15:49:18,028 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=657, Unknown=0, NotChecked=0, Total=812 [2025-01-09 15:49:18,028 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 397 mSDsluCounter, 2501 mSDsCounter, 0 mSdLazyCounter, 661 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 2818 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:18,028 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 2818 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 661 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:49:18,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7841 states. [2025-01-09 15:49:18,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7841 to 6845. [2025-01-09 15:49:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6845 states, 6360 states have (on average 1.1789308176100628) internal successors, (7498), 6418 states have internal predecessors, (7498), 378 states have call successors, (378), 106 states have call predecessors, (378), 106 states have return successors, (378), 320 states have call predecessors, (378), 378 states have call successors, (378) [2025-01-09 15:49:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6845 states to 6845 states and 8254 transitions. [2025-01-09 15:49:18,420 INFO L78 Accepts]: Start accepts. Automaton has 6845 states and 8254 transitions. Word has length 163 [2025-01-09 15:49:18,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:18,420 INFO L471 AbstractCegarLoop]: Abstraction has 6845 states and 8254 transitions. [2025-01-09 15:49:18,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.916666666666667) internal successors, (71), 13 states have internal predecessors, (71), 3 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 3 states have call predecessors, (19), 3 states have call successors, (19) [2025-01-09 15:49:18,420 INFO L276 IsEmpty]: Start isEmpty. Operand 6845 states and 8254 transitions. [2025-01-09 15:49:18,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 15:49:18,424 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:18,424 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:18,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2025-01-09 15:49:18,424 INFO L396 AbstractCegarLoop]: === Iteration 55 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:18,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:18,425 INFO L85 PathProgramCache]: Analyzing trace with hash -1892962172, now seen corresponding path program 1 times [2025-01-09 15:49:18,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 15:49:18,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751455619] [2025-01-09 15:49:18,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:18,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 15:49:18,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:49:18,463 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:49:18,463 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:18,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:49:18,463 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 15:49:18,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 15:49:18,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 15:49:18,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:18,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 15:49:18,592 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 15:49:18,592 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 15:49:18,593 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 15:49:18,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54 [2025-01-09 15:49:18,597 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, 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-01-09 15:49:18,771 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 15:49:18,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 03:49:18 BoogieIcfgContainer [2025-01-09 15:49:18,773 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 15:49:18,774 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 15:49:18,774 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 15:49:18,774 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 15:49:18,774 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:29" (3/4) ... [2025-01-09 15:49:18,776 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 15:49:18,778 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 15:49:18,778 INFO L158 Benchmark]: Toolchain (without parser) took 50530.12ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 114.5MB in the beginning and 691.4MB in the end (delta: -576.9MB). Peak memory consumption was 933.5MB. Max. memory is 16.1GB. [2025-01-09 15:49:18,778 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:49:18,778 INFO L158 Benchmark]: CACSL2BoogieTranslator took 181.64ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 99.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 15:49:18,778 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.93ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 95.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:49:18,778 INFO L158 Benchmark]: Boogie Preprocessor took 88.04ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 90.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 15:49:18,778 INFO L158 Benchmark]: RCFGBuilder took 790.73ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 107.4MB in the end (delta: -17.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-09 15:49:18,778 INFO L158 Benchmark]: TraceAbstraction took 49415.12ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 106.6MB in the beginning and 691.7MB in the end (delta: -585.1MB). Peak memory consumption was 925.2MB. Max. memory is 16.1GB. [2025-01-09 15:49:18,779 INFO L158 Benchmark]: Witness Printer took 4.23ms. Allocated memory is still 1.7GB. Free memory was 691.7MB in the beginning and 691.4MB in the end (delta: 345.2kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 15:49:18,779 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.14ms. Allocated memory is still 201.3MB. Free memory is still 123.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 181.64ms. Allocated memory is still 142.6MB. Free memory was 114.5MB in the beginning and 99.4MB in the end (delta: 15.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.93ms. Allocated memory is still 142.6MB. Free memory was 99.4MB in the beginning and 95.0MB in the end (delta: 4.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 88.04ms. Allocated memory is still 142.6MB. Free memory was 95.0MB in the beginning and 90.0MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 790.73ms. Allocated memory is still 142.6MB. Free memory was 90.0MB in the beginning and 107.4MB in the end (delta: -17.4MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * TraceAbstraction took 49415.12ms. Allocated memory was 142.6MB in the beginning and 1.7GB in the end (delta: 1.5GB). Free memory was 106.6MB in the beginning and 691.7MB in the end (delta: -585.1MB). Peak memory consumption was 925.2MB. Max. memory is 16.1GB. * Witness Printer took 4.23ms. Allocated memory is still 1.7GB. Free memory was 691.7MB in the beginning and 691.4MB in the end (delta: 345.2kB). 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 someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 108, overapproximation of someBinaryDOUBLEComparisonOperation at line 120. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 1; [L22] unsigned char var_1_1 = 1; [L23] unsigned char* var_1_1_Pointer = &(var_1_1); [L24] signed char var_1_3 = 0; [L24] signed char var_1_3 = 0; [L25] signed char* var_1_3_Pointer = &(var_1_3); [L26] unsigned char var_1_5 = 128; [L26] unsigned char var_1_5 = 128; [L27] unsigned char* var_1_5_Pointer = &(var_1_5); [L28] unsigned char var_1_6 = 16; [L28] unsigned char var_1_6 = 16; [L29] unsigned char* var_1_6_Pointer = &(var_1_6); [L30] unsigned char var_1_7 = 2; [L30] unsigned char var_1_7 = 2; [L31] unsigned char* var_1_7_Pointer = &(var_1_7); [L32] unsigned char var_1_8 = 8; [L32] unsigned char var_1_8 = 8; [L33] unsigned char* var_1_8_Pointer = &(var_1_8); [L34] double var_1_9 = 10.5; [L34] double var_1_9 = 10.5; [L35] double* var_1_9_Pointer = &(var_1_9); [L36] unsigned char var_1_10 = 0; [L36] unsigned char var_1_10 = 0; [L37] unsigned char* var_1_10_Pointer = &(var_1_10); [L38] unsigned char var_1_12 = 0; [L38] unsigned char var_1_12 = 0; [L39] unsigned char* var_1_12_Pointer = &(var_1_12); [L40] double var_1_13 = 99.25; [L40] double var_1_13 = 99.25; [L41] double* var_1_13_Pointer = &(var_1_13); [L42] unsigned char var_1_14 = 64; [L42] unsigned char var_1_14 = 64; [L43] unsigned char* var_1_14_Pointer = &(var_1_14); [L44] unsigned char var_1_16 = 0; [L44] unsigned char var_1_16 = 0; [L45] unsigned char* var_1_16_Pointer = &(var_1_16); [L46] unsigned char var_1_17 = 0; [L46] unsigned char var_1_17 = 0; [L47] unsigned char* var_1_17_Pointer = &(var_1_17); [L48] unsigned char var_1_18 = 1; [L48] unsigned char var_1_18 = 1; [L49] unsigned char* var_1_18_Pointer = &(var_1_18); [L50] unsigned char last_1_var_1_14 = 64; VAL [isInitial=0, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L124] isInitial = 1 [L125] FCALL initially() [L127] CALL updateLastVariables() [L117] EXPR \read(var_1_14) [L117] last_1_var_1_14 = var_1_14 [L127] RET updateLastVariables() [L128] CALL updateVariables() [L86] var_1_3 = __VERIFIER_nondet_char() [L87] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L87] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] EXPR \read(var_1_3) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] CALL assume_abort_if_not(var_1_3 <= 16) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L88] RET assume_abort_if_not(var_1_3 <= 16) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L89] var_1_5 = __VERIFIER_nondet_uchar() [L90] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] CALL assume_abort_if_not(var_1_5 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L90] RET assume_abort_if_not(var_1_5 >= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] EXPR \read(var_1_5) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] CALL assume_abort_if_not(var_1_5 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L91] RET assume_abort_if_not(var_1_5 <= 254) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L92] var_1_6 = __VERIFIER_nondet_uchar() [L93] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L93] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] EXPR \read(var_1_6) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L94] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L95] var_1_7 = __VERIFIER_nondet_uchar() [L96] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L96] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] EXPR \read(var_1_7) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L97] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L98] var_1_8 = __VERIFIER_nondet_uchar() [L99] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L99] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] EXPR \read(var_1_8) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] CALL assume_abort_if_not(var_1_8 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L100] RET assume_abort_if_not(var_1_8 <= 64) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L101] var_1_10 = __VERIFIER_nondet_uchar() [L102] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L102] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] EXPR \read(var_1_10) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L103] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L104] var_1_12 = __VERIFIER_nondet_uchar() [L105] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] CALL assume_abort_if_not(var_1_12 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L105] RET assume_abort_if_not(var_1_12 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] EXPR \read(var_1_12) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] CALL assume_abort_if_not(var_1_12 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L106] RET assume_abort_if_not(var_1_12 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L107] var_1_13 = __VERIFIER_nondet_double() [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F [L108] EXPR \read(var_1_13) [L108] EXPR var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] EXPR (var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F ) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L108] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L109] var_1_17 = __VERIFIER_nondet_uchar() [L110] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L110] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] EXPR \read(var_1_17) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] CALL assume_abort_if_not(var_1_17 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L111] RET assume_abort_if_not(var_1_17 <= 0) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L112] var_1_18 = __VERIFIER_nondet_uchar() [L113] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] CALL assume_abort_if_not(var_1_18 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L113] RET assume_abort_if_not(var_1_18 >= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] EXPR \read(var_1_18) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] CALL assume_abort_if_not(var_1_18 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L114] RET assume_abort_if_not(var_1_18 <= 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L128] RET updateVariables() [L129] CALL step() [L54] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] EXPR last_1_var_1_14 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L54] COND TRUE (last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14 [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR \read(*var_1_5_Pointer) [L55] EXPR \read(*var_1_6_Pointer) [L55] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) [L55] EXPR \read(*var_1_6_Pointer) [L55] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) [L55] EXPR \read(*var_1_3_Pointer) [L55] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L55] (*(var_1_1_Pointer)) = (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))) [L59] EXPR \read(*var_1_8_Pointer) [L59] EXPR \read(*var_1_1_Pointer) [L59] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L59] COND FALSE !(((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) [L62] EXPR \read(*var_1_12_Pointer) [L62] (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L62] COND TRUE (*(var_1_12_Pointer)) || (*(var_1_10_Pointer)) [L63] EXPR \read(*var_1_1_Pointer) [L63] EXPR \read(*var_1_8_Pointer) [L63] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] EXPR (*(var_1_8_Pointer)) << (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L63] COND FALSE !((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) [L70] EXPR \read(*var_1_18_Pointer) [L70] (*(var_1_16_Pointer)) = (*(var_1_18_Pointer)) [L75] EXPR \read(*var_1_14_Pointer) [L75] unsigned char stepLocal_1 = (*(var_1_14_Pointer)); [L76] EXPR \read(*var_1_16_Pointer) [L76] unsigned char stepLocal_0 = (*(var_1_16_Pointer)); [L77] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L77] COND TRUE (*(var_1_16_Pointer)) [L78] stepLocal_0 || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, stepLocal_1=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] stepLocal_0 || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L78] COND TRUE stepLocal_0 || (*(var_1_16_Pointer)) [L79] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L79] COND TRUE stepLocal_1 > (*(var_1_6_Pointer)) [L80] EXPR \read(*var_1_13_Pointer) [L80] (*(var_1_9_Pointer)) = (*(var_1_13_Pointer)) [L129] RET step() [L130] CALL, EXPR property() [L120] EXPR \read(*var_1_3_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR last_1_var_1_14 >> (*(var_1_3_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer)))))))) [L120] EXPR \read(*var_1_1_Pointer) [L120] EXPR \read(*var_1_3_Pointer) [L120] EXPR \read(*var_1_5_Pointer) [L120] EXPR \read(*var_1_6_Pointer) [L120] EXPR \read(*var_1_7_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) [L120] EXPR \read(*var_1_6_Pointer) [L120] EXPR (((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) [L120] EXPR \read(*var_1_3_Pointer) [L120] EXPR (((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer)))))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) [L120] EXPR \read(*var_1_16_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1 [L120] EXPR \read(*var_1_16_Pointer) [L120] EXPR (*(var_1_16_Pointer)) || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) || (*(var_1_16_Pointer)) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1 [L120] EXPR \read(*var_1_14_Pointer) [L120] EXPR \read(*var_1_6_Pointer) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1 [L120] EXPR \read(*var_1_9_Pointer) [L120] EXPR \read(*var_1_13_Pointer) [L120] EXPR ((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1 VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR ((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120] EXPR (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L120-L121] return (((((last_1_var_1_14 >> (*(var_1_3_Pointer))) >= last_1_var_1_14) ? ((*(var_1_1_Pointer)) == ((unsigned char) (((((*(var_1_3_Pointer))) < (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer)))))))) ? ((*(var_1_3_Pointer))) : (((*(var_1_5_Pointer)) - (((((*(var_1_6_Pointer))) > ((*(var_1_7_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_7_Pointer))))))))))) : ((*(var_1_1_Pointer)) == ((unsigned char) ((((((*(var_1_6_Pointer))) < ((*(var_1_3_Pointer)))) ? ((*(var_1_6_Pointer))) : ((*(var_1_3_Pointer))))) + ((((((*(var_1_8_Pointer)) + 1)) < ((*(var_1_7_Pointer)))) ? (((*(var_1_8_Pointer)) + 1)) : ((*(var_1_7_Pointer))))))))) && ((*(var_1_16_Pointer)) ? (((*(var_1_16_Pointer)) || (*(var_1_16_Pointer))) ? (((*(var_1_14_Pointer)) > (*(var_1_6_Pointer))) ? ((*(var_1_9_Pointer)) == ((double) (*(var_1_13_Pointer)))) : 1) : 1) : 1)) && ((((*(var_1_8_Pointer)) + (*(var_1_1_Pointer))) >= (*(var_1_7_Pointer))) ? ((*(var_1_14_Pointer)) == ((unsigned char) (*(var_1_6_Pointer)))) : 1)) && (((*(var_1_12_Pointer)) || (*(var_1_10_Pointer))) ? (((*(var_1_1_Pointer)) >= ((*(var_1_8_Pointer)) << (*(var_1_3_Pointer)))) ? (((*(var_1_6_Pointer)) > (*(var_1_7_Pointer))) ? ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer)))) : ((*(var_1_16_Pointer)) == ((unsigned char) 1))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_18_Pointer))))) : ((*(var_1_16_Pointer)) == ((unsigned char) (*(var_1_17_Pointer))))) ; [L130] RET, EXPR property() [L130] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=64, var_1_10={11:0}, var_1_10_Pointer={11:0}, var_1_12={12:0}, var_1_12_Pointer={12:0}, var_1_13={13:0}, var_1_13_Pointer={13:0}, var_1_14={14:0}, var_1_14_Pointer={14:0}, var_1_16={15:0}, var_1_16_Pointer={15:0}, var_1_17={16:0}, var_1_17_Pointer={16:0}, var_1_18={17:0}, var_1_18_Pointer={17:0}, var_1_1={4:0}, var_1_1_Pointer={4:0}, var_1_3={5:0}, var_1_3_Pointer={5:0}, var_1_5={6:0}, var_1_5_Pointer={6:0}, var_1_6={7:0}, var_1_6_Pointer={7:0}, var_1_7={8:0}, var_1_7_Pointer={8:0}, var_1_8={9:0}, var_1_8_Pointer={9:0}, var_1_9={10:0}, var_1_9_Pointer={10:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 125 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.2s, OverallIterations: 55, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 21.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14659 SdHoareTripleChecker+Valid, 11.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 14659 mSDsluCounter, 69399 SdHoareTripleChecker+Invalid, 9.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 57691 mSDsCounter, 1694 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18078 IncrementalHoareTripleChecker+Invalid, 19772 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1694 mSolverCounterUnsat, 11708 mSDtfsCounter, 18078 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1728 GetRequests, 1091 SyntacticMatches, 4 SemanticMatches, 633 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2062 ImplicationChecksByTransitivity, 6.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6845occurred in iteration=54, InterpolantAutomatonStates: 509, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.1s AutomataMinimizationTime, 54 MinimizatonAttempts, 11714 StatesRemovedByMinimization, 43 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 17.6s InterpolantComputationTime, 9346 NumberOfCodeBlocks, 9346 NumberOfCodeBlocksAsserted, 60 NumberOfCheckSat, 9284 ConstructedInterpolants, 0 QuantifiedInterpolants, 31403 SizeOfPredicates, 10 NumberOfNonLiveVariables, 3279 ConjunctsInSsa, 36 ConjunctsInUnsatCore, 60 InterpolantComputations, 53 PerfectInterpolantSequences, 40668/41040 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-01-09 15:49:18,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 15:49:20,842 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 15:49:20,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 15:49:20,924 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 15:49:20,924 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 15:49:20,957 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 15:49:20,957 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 15:49:20,957 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 15:49:20,957 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 15:49:20,957 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 15:49:20,957 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 15:49:20,957 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 15:49:20,958 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 15:49:20,958 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 15:49:20,958 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 15:49:20,958 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 15:49:20,958 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 15:49:20,958 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 15:49:20,958 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 15:49:20,958 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 15:49:20,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 15:49:20,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 15:49:20,959 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 15:49:20,959 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 15:49:20,959 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 15:49:20,959 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 15:49:20,959 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 15:49:20,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 15:49:20,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 15:49:20,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 15:49:20,963 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:20,963 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:20,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 15:49:20,963 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 15:49:20,963 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-jdk21/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 -> b7631e67103b054fabd01a8c7dc28db4ad53089a3ed7fae04e9555b7ae75d07e [2025-01-09 15:49:21,187 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 15:49:21,194 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 15:49:21,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 15:49:21,198 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 15:49:21,198 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 15:49:21,199 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2025-01-09 15:49:22,482 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f4cedbfb/a45f863dd26a4d91b14bc2416c98c15a/FLAGadf29386e [2025-01-09 15:49:22,683 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 15:49:22,684 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i [2025-01-09 15:49:22,690 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f4cedbfb/a45f863dd26a4d91b14bc2416c98c15a/FLAGadf29386e [2025-01-09 15:49:22,704 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3f4cedbfb/a45f863dd26a4d91b14bc2416c98c15a [2025-01-09 15:49:22,706 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 15:49:22,707 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 15:49:22,708 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:22,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 15:49:22,711 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 15:49:22,712 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:22,713 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bdb5e87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22, skipping insertion in model container [2025-01-09 15:49:22,713 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:22,726 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 15:49:22,831 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2025-01-09 15:49:22,882 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:22,894 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 15:49:22,902 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-p_file-56.i[916,929] [2025-01-09 15:49:22,925 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 15:49:22,938 INFO L204 MainTranslator]: Completed translation [2025-01-09 15:49:22,938 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22 WrapperNode [2025-01-09 15:49:22,939 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 15:49:22,939 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:22,939 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 15:49:22,939 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 15:49:22,943 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:22,958 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:22,991 INFO L138 Inliner]: procedures = 30, calls = 191, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 577 [2025-01-09 15:49:22,991 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 15:49:22,992 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 15:49:22,992 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 15:49:22,992 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 15:49:23,006 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,016 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,048 INFO L175 MemorySlicer]: Split 147 memory accesses to 15 slices as follows [2, 9, 16, 8, 22, 20, 12, 3, 6, 6, 8, 6, 15, 8, 6]. 15 percent of accesses are in the largest equivalence class. The 16 initializations are split as follows [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]. The 18 writes are split as follows [0, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 4, 1, 1]. [2025-01-09 15:49:23,049 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,049 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,071 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,075 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,087 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,089 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,093 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 15:49:23,093 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 15:49:23,093 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 15:49:23,094 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 15:49:23,094 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (1/1) ... [2025-01-09 15:49:23,102 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 15:49:23,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 15:49:23,123 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 15:49:23,126 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#2 [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#3 [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#4 [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#5 [2025-01-09 15:49:23,141 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#6 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#7 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#8 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#9 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#10 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#11 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#12 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#13 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#14 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#2 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#3 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#4 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#5 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#6 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#7 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#8 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#9 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#10 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#11 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#12 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#13 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#14 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2025-01-09 15:49:23,142 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#2 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#3 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#4 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#5 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#6 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#7 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#8 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#9 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#10 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#11 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#12 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#13 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#14 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#5 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#6 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#7 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#8 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#9 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#10 [2025-01-09 15:49:23,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#11 [2025-01-09 15:49:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#12 [2025-01-09 15:49:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#13 [2025-01-09 15:49:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#14 [2025-01-09 15:49:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#0 [2025-01-09 15:49:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#1 [2025-01-09 15:49:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#2 [2025-01-09 15:49:23,145 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#3 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#4 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#5 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#6 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#7 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#8 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#9 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#10 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#11 [2025-01-09 15:49:23,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#12 [2025-01-09 15:49:23,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#13 [2025-01-09 15:49:23,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intFLOATTYPE8#14 [2025-01-09 15:49:23,147 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 15:49:23,147 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 15:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 15:49:23,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 15:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2025-01-09 15:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2025-01-09 15:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#2 [2025-01-09 15:49:23,148 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#3 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#4 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#5 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#6 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#7 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#8 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#9 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#10 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#11 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#12 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#13 [2025-01-09 15:49:23,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#14 [2025-01-09 15:49:23,288 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 15:49:23,289 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 15:49:23,720 INFO L? ?]: Removed 148 outVars from TransFormulas that were not future-live. [2025-01-09 15:49:23,720 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 15:49:23,727 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 15:49:23,727 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 15:49:23,728 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:23 BoogieIcfgContainer [2025-01-09 15:49:23,728 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 15:49:23,729 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 15:49:23,729 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 15:49:23,752 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 15:49:23,752 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:49:22" (1/3) ... [2025-01-09 15:49:23,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644ec20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:23, skipping insertion in model container [2025-01-09 15:49:23,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:49:22" (2/3) ... [2025-01-09 15:49:23,753 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@644ec20b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:49:23, skipping insertion in model container [2025-01-09 15:49:23,753 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:49:23" (3/3) ... [2025-01-09 15:49:23,754 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-p_file-56.i [2025-01-09 15:49:23,771 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 15:49:23,772 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_variablewrapping_wrapper-p_file-56.i that has 2 procedures, 117 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 15:49:23,815 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 15:49:23,822 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;@1b8b64a6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 15:49:23,822 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 15:49:23,825 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:49:23,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:49:23,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:23,832 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:23,833 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:23,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:23,836 INFO L85 PathProgramCache]: Analyzing trace with hash 797849460, now seen corresponding path program 1 times [2025-01-09 15:49:23,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:23,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [855872207] [2025-01-09 15:49:23,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:23,844 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-01-09 15:49:23,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:23,846 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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-01-09 15:49:23,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:49:24,017 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:49:24,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:49:24,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:24,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:24,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 15:49:24,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:24,190 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2025-01-09 15:49:24,190 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:24,190 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:24,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [855872207] [2025-01-09 15:49:24,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [855872207] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:24,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:24,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 15:49:24,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685148627] [2025-01-09 15:49:24,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:24,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 15:49:24,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:24,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 15:49:24,224 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 15:49:24,225 INFO L87 Difference]: Start difference. First operand has 117 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:49:24,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:24,257 INFO L93 Difference]: Finished difference Result 228 states and 360 transitions. [2025-01-09 15:49:24,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 15:49:24,266 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 149 [2025-01-09 15:49:24,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:24,270 INFO L225 Difference]: With dead ends: 228 [2025-01-09 15:49:24,270 INFO L226 Difference]: Without dead ends: 114 [2025-01-09 15:49:24,272 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 148 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-01-09 15:49:24,274 INFO L435 NwaCegarLoop]: 168 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, 168 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-01-09 15:49:24,274 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:24,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-01-09 15:49:24,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 114. [2025-01-09 15:49:24,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.3978494623655915) internal successors, (130), 93 states have internal predecessors, (130), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:49:24,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 168 transitions. [2025-01-09 15:49:24,305 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 168 transitions. Word has length 149 [2025-01-09 15:49:24,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:24,306 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 168 transitions. [2025-01-09 15:49:24,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.5) internal successors, (61), 2 states have internal predecessors, (61), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2025-01-09 15:49:24,306 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 168 transitions. [2025-01-09 15:49:24,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:49:24,310 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:24,310 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:24,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:24,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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-01-09 15:49:24,514 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:24,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:24,515 INFO L85 PathProgramCache]: Analyzing trace with hash -1529542686, now seen corresponding path program 1 times [2025-01-09 15:49:24,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:24,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735991010] [2025-01-09 15:49:24,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:24,516 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-01-09 15:49:24,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:24,518 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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-01-09 15:49:24,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:49:24,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:49:24,805 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:49:24,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:24,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:24,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 15:49:24,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:24,837 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:24,837 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:24,838 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:24,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735991010] [2025-01-09 15:49:24,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735991010] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:24,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:24,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 15:49:24,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896109636] [2025-01-09 15:49:24,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:24,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 15:49:24,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:24,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 15:49:24,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:24,840 INFO L87 Difference]: Start difference. First operand 114 states and 168 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:24,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:24,860 INFO L93 Difference]: Finished difference Result 226 states and 335 transitions. [2025-01-09 15:49:24,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 15:49:24,861 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-01-09 15:49:24,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:24,862 INFO L225 Difference]: With dead ends: 226 [2025-01-09 15:49:24,862 INFO L226 Difference]: Without dead ends: 115 [2025-01-09 15:49:24,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 15:49:24,863 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 0 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:24,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 328 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:24,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-01-09 15:49:24,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2025-01-09 15:49:24,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:49:24,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 169 transitions. [2025-01-09 15:49:24,874 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 169 transitions. Word has length 149 [2025-01-09 15:49:24,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:24,875 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 169 transitions. [2025-01-09 15:49:24,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:24,875 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 169 transitions. [2025-01-09 15:49:24,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-01-09 15:49:24,876 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:24,877 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:24,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:49:25,077 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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-01-09 15:49:25,077 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:25,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:25,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1076480868, now seen corresponding path program 1 times [2025-01-09 15:49:25,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:25,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1378027911] [2025-01-09 15:49:25,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:25,079 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-01-09 15:49:25,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:25,082 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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-01-09 15:49:25,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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-01-09 15:49:25,208 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-01-09 15:49:25,344 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-01-09 15:49:25,344 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:25,344 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:25,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 15:49:25,357 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:25,439 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 17 treesize of output 9 [2025-01-09 15:49:26,532 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 19 treesize of output 15 [2025-01-09 15:49:26,606 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 24 treesize of output 16 [2025-01-09 15:49:26,645 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 39 treesize of output 27 [2025-01-09 15:49:26,749 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:49:26,750 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:26,991 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:26,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1378027911] [2025-01-09 15:49:26,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1378027911] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:26,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:26,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [20] total 26 [2025-01-09 15:49:26,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004360037] [2025-01-09 15:49:26,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:26,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:49:26,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:26,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:49:26,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=582, Unknown=0, NotChecked=0, Total=650 [2025-01-09 15:49:26,994 INFO L87 Difference]: Start difference. First operand 115 states and 169 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:27,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:27,212 INFO L93 Difference]: Finished difference Result 285 states and 421 transitions. [2025-01-09 15:49:27,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 15:49:27,213 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 149 [2025-01-09 15:49:27,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:27,214 INFO L225 Difference]: With dead ends: 285 [2025-01-09 15:49:27,214 INFO L226 Difference]: Without dead ends: 173 [2025-01-09 15:49:27,215 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 219 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=86, Invalid=784, Unknown=0, NotChecked=0, Total=870 [2025-01-09 15:49:27,216 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 80 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:27,216 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 1055 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:27,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2025-01-09 15:49:27,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 136. [2025-01-09 15:49:27,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 115 states have (on average 1.4260869565217391) internal successors, (164), 115 states have internal predecessors, (164), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:49:27,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 202 transitions. [2025-01-09 15:49:27,224 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 202 transitions. Word has length 149 [2025-01-09 15:49:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:27,224 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 202 transitions. [2025-01-09 15:49:27,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 8 states have internal predecessors, (57), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:27,224 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 202 transitions. [2025-01-09 15:49:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:49:27,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:27,226 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:27,232 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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)] Ended with exit code 0 [2025-01-09 15:49:27,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/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-01-09 15:49:27,427 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:27,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:27,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1963513189, now seen corresponding path program 1 times [2025-01-09 15:49:27,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:27,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1643103443] [2025-01-09 15:49:27,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:27,432 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-01-09 15:49:27,432 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:27,435 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/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-01-09 15:49:27,436 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Waiting until timeout for monitored process [2025-01-09 15:49:27,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:49:27,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:49:27,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:27,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:27,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 15:49:27,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:27,754 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 17 treesize of output 9 [2025-01-09 15:49:28,695 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 22 treesize of output 14 [2025-01-09 15:49:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 17 proven. 123 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2025-01-09 15:49:28,725 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:28,898 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:28,898 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:28,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1643103443] [2025-01-09 15:49:28,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1643103443] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:28,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:28,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [15] total 19 [2025-01-09 15:49:28,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493208733] [2025-01-09 15:49:28,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:28,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:28,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:28,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:28,900 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=289, Unknown=0, NotChecked=0, Total=342 [2025-01-09 15:49:28,901 INFO L87 Difference]: Start difference. First operand 136 states and 202 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:29,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:29,025 INFO L93 Difference]: Finished difference Result 318 states and 475 transitions. [2025-01-09 15:49:29,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:29,027 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:49:29,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:29,028 INFO L225 Difference]: With dead ends: 318 [2025-01-09 15:49:29,028 INFO L226 Difference]: Without dead ends: 185 [2025-01-09 15:49:29,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 281 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=58, Invalid=322, Unknown=0, NotChecked=0, Total=380 [2025-01-09 15:49:29,030 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 71 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:29,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 653 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 15:49:29,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2025-01-09 15:49:29,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 151. [2025-01-09 15:49:29,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 130 states have (on average 1.4384615384615385) internal successors, (187), 130 states have internal predecessors, (187), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2025-01-09 15:49:29,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 225 transitions. [2025-01-09 15:49:29,045 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 225 transitions. Word has length 150 [2025-01-09 15:49:29,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:29,045 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 225 transitions. [2025-01-09 15:49:29,045 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, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:29,046 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2025-01-09 15:49:29,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 15:49:29,047 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:29,047 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:29,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (5)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:29,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/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-01-09 15:49:29,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:29,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:29,252 INFO L85 PathProgramCache]: Analyzing trace with hash -725091603, now seen corresponding path program 1 times [2025-01-09 15:49:29,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:29,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1374398382] [2025-01-09 15:49:29,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:29,253 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-01-09 15:49:29,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:29,254 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/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-01-09 15:49:29,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Waiting until timeout for monitored process [2025-01-09 15:49:29,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 15:49:29,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 15:49:29,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:29,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:29,484 INFO L256 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-01-09 15:49:29,491 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:29,533 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 17 treesize of output 9 [2025-01-09 15:49:29,727 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 23 treesize of output 15 [2025-01-09 15:49:29,885 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:29,886 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:29,886 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:29,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1374398382] [2025-01-09 15:49:29,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1374398382] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:29,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:29,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 15:49:29,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241794586] [2025-01-09 15:49:29,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:29,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 15:49:29,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:29,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 15:49:29,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-01-09 15:49:29,887 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:31,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:31,564 INFO L93 Difference]: Finished difference Result 588 states and 878 transitions. [2025-01-09 15:49:31,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 15:49:31,565 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 150 [2025-01-09 15:49:31,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:31,568 INFO L225 Difference]: With dead ends: 588 [2025-01-09 15:49:31,568 INFO L226 Difference]: Without dead ends: 440 [2025-01-09 15:49:31,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-01-09 15:49:31,570 INFO L435 NwaCegarLoop]: 329 mSDtfsCounter, 318 mSDsluCounter, 1252 mSDsCounter, 0 mSdLazyCounter, 313 mSolverCounterSat, 78 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 318 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 78 IncrementalHoareTripleChecker+Valid, 313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:31,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [318 Valid, 1581 Invalid, 391 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [78 Valid, 313 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 15:49:31,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2025-01-09 15:49:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 310. [2025-01-09 15:49:31,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 269 states have (on average 1.449814126394052) internal successors, (390), 269 states have internal predecessors, (390), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:31,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 466 transitions. [2025-01-09 15:49:31,600 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 466 transitions. Word has length 150 [2025-01-09 15:49:31,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:31,601 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 466 transitions. [2025-01-09 15:49:31,601 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:31,601 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 466 transitions. [2025-01-09 15:49:31,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:49:31,602 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:31,602 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:31,610 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (6)] Forceful destruction successful, exit code 0 [2025-01-09 15:49:31,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/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-01-09 15:49:31,803 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:31,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:31,804 INFO L85 PathProgramCache]: Analyzing trace with hash 299434793, now seen corresponding path program 1 times [2025-01-09 15:49:31,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:31,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1417200182] [2025-01-09 15:49:31,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:31,808 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-01-09 15:49:31,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:31,810 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/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-01-09 15:49:31,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Waiting until timeout for monitored process [2025-01-09 15:49:31,911 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:49:32,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:49:32,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:32,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:32,024 INFO L256 TraceCheckSpWp]: Trace formula consists of 376 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 15:49:32,027 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:32,048 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:32,048 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 15:49:32,049 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:32,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1417200182] [2025-01-09 15:49:32,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1417200182] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 15:49:32,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 15:49:32,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 15:49:32,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562536319] [2025-01-09 15:49:32,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:32,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 15:49:32,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:32,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 15:49:32,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:32,050 INFO L87 Difference]: Start difference. First operand 310 states and 466 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:32,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:32,089 INFO L93 Difference]: Finished difference Result 623 states and 937 transitions. [2025-01-09 15:49:32,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 15:49:32,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:49:32,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:32,091 INFO L225 Difference]: With dead ends: 623 [2025-01-09 15:49:32,091 INFO L226 Difference]: Without dead ends: 316 [2025-01-09 15:49:32,092 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 15:49:32,092 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 0 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:32,093 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 643 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 15:49:32,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2025-01-09 15:49:32,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 316. [2025-01-09 15:49:32,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 275 states have (on average 1.44) internal successors, (396), 275 states have internal predecessors, (396), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:32,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 472 transitions. [2025-01-09 15:49:32,103 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 472 transitions. Word has length 151 [2025-01-09 15:49:32,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:32,103 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 472 transitions. [2025-01-09 15:49:32,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:32,103 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 472 transitions. [2025-01-09 15:49:32,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:49:32,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:32,104 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:32,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (7)] Ended with exit code 0 [2025-01-09 15:49:32,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/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-01-09 15:49:32,309 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:32,309 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:32,309 INFO L85 PathProgramCache]: Analyzing trace with hash -564176706, now seen corresponding path program 1 times [2025-01-09 15:49:32,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:32,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [176558420] [2025-01-09 15:49:32,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:32,310 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-01-09 15:49:32,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:32,313 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/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-01-09 15:49:32,314 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (8)] Waiting until timeout for monitored process [2025-01-09 15:49:32,421 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:49:32,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:49:32,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:32,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:32,536 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-01-09 15:49:32,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:32,631 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 17 treesize of output 9 [2025-01-09 15:49:35,166 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 42 treesize of output 30 [2025-01-09 15:49:35,169 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 46 treesize of output 34 [2025-01-09 15:49:35,288 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 45 treesize of output 29 [2025-01-09 15:49:35,462 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 15 proven. 353 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2025-01-09 15:49:35,462 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:35,940 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:35,940 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [176558420] [2025-01-09 15:49:35,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [176558420] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:35,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:35,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [28] total 34 [2025-01-09 15:49:35,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452082427] [2025-01-09 15:49:35,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:35,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 15:49:35,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:35,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 15:49:35,945 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1026, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 15:49:35,945 INFO L87 Difference]: Start difference. First operand 316 states and 472 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:36,343 INFO L93 Difference]: Finished difference Result 745 states and 1110 transitions. [2025-01-09 15:49:36,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 15:49:36,347 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:49:36,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:36,350 INFO L225 Difference]: With dead ends: 745 [2025-01-09 15:49:36,350 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 15:49:36,351 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=119, Invalid=1213, Unknown=0, NotChecked=0, Total=1332 [2025-01-09 15:49:36,351 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 203 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 695 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:36,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 695 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 15:49:36,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 15:49:36,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 354. [2025-01-09 15:49:36,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 354 states, 313 states have (on average 1.4568690095846646) internal successors, (456), 313 states have internal predecessors, (456), 38 states have call successors, (38), 2 states have call predecessors, (38), 2 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2025-01-09 15:49:36,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 532 transitions. [2025-01-09 15:49:36,377 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 532 transitions. Word has length 151 [2025-01-09 15:49:36,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:36,377 INFO L471 AbstractCegarLoop]: Abstraction has 354 states and 532 transitions. [2025-01-09 15:49:36,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 7 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:36,378 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 532 transitions. [2025-01-09 15:49:36,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:49:36,380 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:36,380 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:36,389 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (8)] Ended with exit code 0 [2025-01-09 15:49:36,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate-jdk21/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-01-09 15:49:36,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:36,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:36,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1844040384, now seen corresponding path program 1 times [2025-01-09 15:49:36,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:36,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126020080] [2025-01-09 15:49:36,585 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:36,585 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-01-09 15:49:36,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:36,587 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/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-01-09 15:49:36,589 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (9)] Waiting until timeout for monitored process [2025-01-09 15:49:36,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 15:49:36,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 15:49:36,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 15:49:36,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 15:49:36,821 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 15:49:36,841 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 15:49:36,956 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 17 treesize of output 9 [2025-01-09 15:49:40,493 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 27 treesize of output 19 [2025-01-09 15:49:40,586 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 15 treesize of output 11 [2025-01-09 15:49:40,678 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 20 treesize of output 12 [2025-01-09 15:49:40,688 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 18 treesize of output 10 [2025-01-09 15:49:40,953 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 33 treesize of output 21 [2025-01-09 15:49:40,956 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 39 treesize of output 27 [2025-01-09 15:49:41,076 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 14 proven. 514 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-09 15:49:41,076 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 15:49:41,596 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2025-01-09 15:49:41,596 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 15:49:41,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126020080] [2025-01-09 15:49:41,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126020080] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 15:49:41,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 15:49:41,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [35] total 43 [2025-01-09 15:49:41,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635639978] [2025-01-09 15:49:41,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 15:49:41,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 15:49:41,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 15:49:41,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 15:49:41,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1659, Unknown=0, NotChecked=0, Total=1806 [2025-01-09 15:49:41,598 INFO L87 Difference]: Start difference. First operand 354 states and 532 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 15:49:42,226 INFO L93 Difference]: Finished difference Result 811 states and 1186 transitions. [2025-01-09 15:49:42,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-01-09 15:49:42,231 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 151 [2025-01-09 15:49:42,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 15:49:42,243 INFO L225 Difference]: With dead ends: 811 [2025-01-09 15:49:42,243 INFO L226 Difference]: Without dead ends: 641 [2025-01-09 15:49:42,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 260 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=194, Invalid=1968, Unknown=0, NotChecked=0, Total=2162 [2025-01-09 15:49:42,244 INFO L435 NwaCegarLoop]: 164 mSDtfsCounter, 532 mSDsluCounter, 772 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 15:49:42,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 936 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 15:49:42,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 641 states. [2025-01-09 15:49:42,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 641 to 466. [2025-01-09 15:49:42,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 415 states have (on average 1.436144578313253) internal successors, (596), 417 states have internal predecessors, (596), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 44 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 15:49:42,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 688 transitions. [2025-01-09 15:49:42,286 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 688 transitions. Word has length 151 [2025-01-09 15:49:42,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 15:49:42,288 INFO L471 AbstractCegarLoop]: Abstraction has 466 states and 688 transitions. [2025-01-09 15:49:42,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 9 states have internal predecessors, (59), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2025-01-09 15:49:42,288 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 688 transitions. [2025-01-09 15:49:42,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 15:49:42,290 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 15:49:42,290 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 15:49:42,299 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (9)] Ended with exit code 0 [2025-01-09 15:49:42,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-jdk21/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-01-09 15:49:42,491 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 15:49:42,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 15:49:42,491 INFO L85 PathProgramCache]: Analyzing trace with hash 645488578, now seen corresponding path program 1 times [2025-01-09 15:49:42,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 15:49:42,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1897092551] [2025-01-09 15:49:42,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 15:49:42,491 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-01-09 15:49:42,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 15:49:42,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/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-01-09 15:49:42,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 (10)] Waiting until timeout for monitored process [2025-01-09 15:49:42,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes.