./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c --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/product-lines/email_spec0_product05.cil.c -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 74a12e124f66b10df64ef68155d31c3be83012aab827a45870f5335a6569b75a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:48:38,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:48:38,983 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:48:38,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:48:38,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:48:39,023 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:48:39,024 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:48:39,024 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:48:39,025 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:48:39,025 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:48:39,026 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:48:39,026 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:48:39,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:48:39,026 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:48:39,027 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:48:39,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:48:39,027 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:48:39,028 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:48:39,029 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:48:39,029 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:48:39,029 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:39,029 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:39,029 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:39,029 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:39,030 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:48:39,030 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:48:39,030 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:48:39,030 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:48:39,030 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:39,031 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:48:39,031 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:48:39,031 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:48:39,031 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:48:39,031 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:48:39,031 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:48:39,031 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:48:39,031 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:48:39,032 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:48:39,032 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:48:39,032 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 -> 74a12e124f66b10df64ef68155d31c3be83012aab827a45870f5335a6569b75a [2025-01-09 03:48:39,325 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:48:39,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:48:39,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:48:39,337 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:48:39,338 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:48:39,339 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2025-01-09 03:48:40,660 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b61c45fc7/3ad9697ea8aa4f5e9940ee147a143a43/FLAG2c98d6ce7 [2025-01-09 03:48:41,016 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:48:41,017 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product05.cil.c [2025-01-09 03:48:41,041 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b61c45fc7/3ad9697ea8aa4f5e9940ee147a143a43/FLAG2c98d6ce7 [2025-01-09 03:48:41,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b61c45fc7/3ad9697ea8aa4f5e9940ee147a143a43 [2025-01-09 03:48:41,064 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:48:41,065 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:48:41,066 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:41,066 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:48:41,072 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:48:41,072 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:41" (1/1) ... [2025-01-09 03:48:41,074 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30f69eeb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:41, skipping insertion in model container [2025-01-09 03:48:41,075 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:48:41" (1/1) ... [2025-01-09 03:48:41,125 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:48:41,331 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/product-lines/email_spec0_product05.cil.c[4289,4302] [2025-01-09 03:48:41,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:41,603 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:48:41,611 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-01-09 03:48:41,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [202] [2025-01-09 03:48:41,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [211] [2025-01-09 03:48:41,613 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [403] [2025-01-09 03:48:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [815] [2025-01-09 03:48:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1181] [2025-01-09 03:48:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1201] [2025-01-09 03:48:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2279] [2025-01-09 03:48:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2435] [2025-01-09 03:48:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2452] [2025-01-09 03:48:41,615 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2515] [2025-01-09 03:48:41,630 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/product-lines/email_spec0_product05.cil.c[4289,4302] [2025-01-09 03:48:41,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:48:41,751 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:48:41,752 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:41 WrapperNode [2025-01-09 03:48:41,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:48:41,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:41,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:48:41,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:48:41,760 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:41" (1/1) ... [2025-01-09 03:48:41,777 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:41" (1/1) ... [2025-01-09 03:48:41,812 INFO L138 Inliner]: procedures = 107, calls = 113, calls flagged for inlining = 37, calls inlined = 30, statements flattened = 584 [2025-01-09 03:48:41,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:48:41,813 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:48:41,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:48:41,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:48:41,819 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:41" (1/1) ... [2025-01-09 03:48:41,819 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:41" (1/1) ... [2025-01-09 03:48:41,823 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:41" (1/1) ... [2025-01-09 03:48:41,842 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 0 writes are split as follows [0, 0]. [2025-01-09 03:48:41,845 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:41" (1/1) ... [2025-01-09 03:48:41,846 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:41" (1/1) ... [2025-01-09 03:48:41,858 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:41" (1/1) ... [2025-01-09 03:48:41,860 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:41" (1/1) ... [2025-01-09 03:48:41,864 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:41" (1/1) ... [2025-01-09 03:48:41,867 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:41" (1/1) ... [2025-01-09 03:48:41,869 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:41" (1/1) ... [2025-01-09 03:48:41,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:48:41,873 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:48:41,873 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:48:41,873 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:48:41,874 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:41" (1/1) ... [2025-01-09 03:48:41,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:48:41,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:41,917 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 03:48:41,920 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 03:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:48:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:48:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:48:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:48:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:48:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:48:41,945 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:48:41,945 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:48:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:48:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:48:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:48:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:48:41,946 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:48:41,946 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:48:42,083 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:48:42,085 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:48:42,576 INFO L? ?]: Removed 172 outVars from TransFormulas that were not future-live. [2025-01-09 03:48:42,576 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:48:42,590 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:48:42,590 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:48:42,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:42 BoogieIcfgContainer [2025-01-09 03:48:42,592 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:48:42,594 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:48:42,594 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:48:42,598 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:48:42,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:48:41" (1/3) ... [2025-01-09 03:48:42,598 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3857c872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:42, skipping insertion in model container [2025-01-09 03:48:42,598 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:48:41" (2/3) ... [2025-01-09 03:48:42,599 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3857c872 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:48:42, skipping insertion in model container [2025-01-09 03:48:42,599 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:48:42" (3/3) ... [2025-01-09 03:48:42,600 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product05.cil.c [2025-01-09 03:48:42,613 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:48:42,617 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product05.cil.c that has 8 procedures, 130 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:48:42,685 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:48:42,698 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;@363ed3f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:48:42,698 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:48:42,703 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 109 states have internal predecessors, (158), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2025-01-09 03:48:42,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 03:48:42,713 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:42,714 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:42,714 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:42,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:42,721 INFO L85 PathProgramCache]: Analyzing trace with hash 1930180291, now seen corresponding path program 1 times [2025-01-09 03:48:42,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:42,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480379075] [2025-01-09 03:48:42,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:42,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:42,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:48:42,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:48:42,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:42,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:43,286 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:48:43,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:43,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480379075] [2025-01-09 03:48:43,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480379075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:43,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127154606] [2025-01-09 03:48:43,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:43,289 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:43,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:43,293 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 03:48:43,295 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 03:48:43,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:48:43,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:48:43,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:43,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:43,580 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:48:43,588 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:43,608 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 03:48:43,609 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:43,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127154606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:43,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:43,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:48:43,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157707229] [2025-01-09 03:48:43,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:43,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:48:43,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:43,637 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:48:43,637 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:43,641 INFO L87 Difference]: Start difference. First operand has 130 states, 107 states have (on average 1.4766355140186915) internal successors, (158), 109 states have internal predecessors, (158), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:43,671 INFO L93 Difference]: Finished difference Result 211 states and 293 transitions. [2025-01-09 03:48:43,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:48:43,673 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2025-01-09 03:48:43,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:43,683 INFO L225 Difference]: With dead ends: 211 [2025-01-09 03:48:43,683 INFO L226 Difference]: Without dead ends: 123 [2025-01-09 03:48:43,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 76 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 03:48:43,691 INFO L435 NwaCegarLoop]: 183 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, 183 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 03:48:43,693 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:43,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2025-01-09 03:48:43,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2025-01-09 03:48:43,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 101 states have (on average 1.4653465346534653) internal successors, (148), 102 states have internal predecessors, (148), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 03:48:43,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 175 transitions. [2025-01-09 03:48:43,732 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 175 transitions. Word has length 75 [2025-01-09 03:48:43,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:43,733 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 175 transitions. [2025-01-09 03:48:43,733 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:43,735 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 175 transitions. [2025-01-09 03:48:43,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-01-09 03:48:43,739 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:43,740 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:43,750 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 03:48:43,940 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 03:48:43,941 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:43,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:43,941 INFO L85 PathProgramCache]: Analyzing trace with hash 799734751, now seen corresponding path program 1 times [2025-01-09 03:48:43,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:43,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693921309] [2025-01-09 03:48:43,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:43,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:43,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:48:43,987 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:48:43,987 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:43,987 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:44,212 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-09 03:48:44,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693921309] [2025-01-09 03:48:44,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693921309] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:44,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1081359782] [2025-01-09 03:48:44,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:44,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:44,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:44,217 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 03:48:44,219 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 03:48:44,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 75 statements into 1 equivalence classes. [2025-01-09 03:48:44,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 75 of 75 statements. [2025-01-09 03:48:44,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:44,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:44,482 INFO L256 TraceCheckSpWp]: Trace formula consists of 772 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:48:44,487 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:44,510 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-09 03:48:44,510 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:44,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1081359782] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:44,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:44,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:48:44,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882393784] [2025-01-09 03:48:44,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:44,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:44,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:44,516 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:44,516 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:44,517 INFO L87 Difference]: Start difference. First operand 123 states and 175 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:44,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:44,549 INFO L93 Difference]: Finished difference Result 200 states and 274 transitions. [2025-01-09 03:48:44,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:44,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 75 [2025-01-09 03:48:44,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:44,554 INFO L225 Difference]: With dead ends: 200 [2025-01-09 03:48:44,554 INFO L226 Difference]: Without dead ends: 125 [2025-01-09 03:48:44,555 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:48:44,558 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 1 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:44,558 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 344 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:44,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2025-01-09 03:48:44,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2025-01-09 03:48:44,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 103 states have internal predecessors, (149), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-01-09 03:48:44,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 176 transitions. [2025-01-09 03:48:44,576 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 176 transitions. Word has length 75 [2025-01-09 03:48:44,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:44,576 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 176 transitions. [2025-01-09 03:48:44,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:44,580 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 176 transitions. [2025-01-09 03:48:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-01-09 03:48:44,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:44,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:44,600 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 03:48:44,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:44,782 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:44,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:44,783 INFO L85 PathProgramCache]: Analyzing trace with hash -810963322, now seen corresponding path program 1 times [2025-01-09 03:48:44,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:44,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725922886] [2025-01-09 03:48:44,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:44,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:44,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:48:44,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:48:44,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:44,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:44,974 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:48:44,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725922886] [2025-01-09 03:48:44,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725922886] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:44,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615724234] [2025-01-09 03:48:44,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:44,975 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:44,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:44,979 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 03:48:44,987 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 03:48:45,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-01-09 03:48:45,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-01-09 03:48:45,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:45,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:45,248 INFO L256 TraceCheckSpWp]: Trace formula consists of 782 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:48:45,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:48:45,308 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615724234] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:45,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:45,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:48:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633964224] [2025-01-09 03:48:45,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:45,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:45,310 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:45,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:45,310 INFO L87 Difference]: Start difference. First operand 124 states and 176 transitions. Second operand has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:48:45,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:45,384 INFO L93 Difference]: Finished difference Result 241 states and 345 transitions. [2025-01-09 03:48:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 79 [2025-01-09 03:48:45,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:45,388 INFO L225 Difference]: With dead ends: 241 [2025-01-09 03:48:45,388 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 03:48:45,389 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:48:45,389 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 2 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 657 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:45,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 657 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:45,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 03:48:45,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-09 03:48:45,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 105 states have internal predecessors, (150), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (15), 13 states have call predecessors, (15), 13 states have call successors, (15) [2025-01-09 03:48:45,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 179 transitions. [2025-01-09 03:48:45,399 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 179 transitions. Word has length 79 [2025-01-09 03:48:45,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:45,400 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 179 transitions. [2025-01-09 03:48:45,400 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.25) internal successors, (53), 5 states have internal predecessors, (53), 3 states have call successors, (11), 2 states have call predecessors, (11), 3 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:48:45,400 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 179 transitions. [2025-01-09 03:48:45,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2025-01-09 03:48:45,404 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:45,404 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:45,411 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 03:48:45,605 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:45,605 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:45,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:45,606 INFO L85 PathProgramCache]: Analyzing trace with hash -1719223655, now seen corresponding path program 1 times [2025-01-09 03:48:45,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:45,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660355817] [2025-01-09 03:48:45,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:45,606 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:45,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 80 statements into 1 equivalence classes. [2025-01-09 03:48:45,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 80 of 80 statements. [2025-01-09 03:48:45,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:45,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:45,785 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:48:45,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:45,786 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660355817] [2025-01-09 03:48:45,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660355817] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:45,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:45,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:45,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [982380514] [2025-01-09 03:48:45,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:45,787 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:45,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:45,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:45,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:45,788 INFO L87 Difference]: Start difference. First operand 126 states and 179 transitions. Second operand has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:48:45,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:45,850 INFO L93 Difference]: Finished difference Result 233 states and 333 transitions. [2025-01-09 03:48:45,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:45,853 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 80 [2025-01-09 03:48:45,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:45,855 INFO L225 Difference]: With dead ends: 233 [2025-01-09 03:48:45,855 INFO L226 Difference]: Without dead ends: 126 [2025-01-09 03:48:45,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:48:45,858 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 2 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:45,858 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 661 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:45,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-01-09 03:48:45,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2025-01-09 03:48:45,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.4563106796116505) internal successors, (150), 105 states have internal predecessors, (150), 14 states have call successors, (14), 7 states have call predecessors, (14), 8 states have return successors, (14), 13 states have call predecessors, (14), 13 states have call successors, (14) [2025-01-09 03:48:45,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 178 transitions. [2025-01-09 03:48:45,873 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 178 transitions. Word has length 80 [2025-01-09 03:48:45,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:45,874 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 178 transitions. [2025-01-09 03:48:45,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.0) internal successors, (52), 5 states have internal predecessors, (52), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:48:45,874 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 178 transitions. [2025-01-09 03:48:45,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2025-01-09 03:48:45,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:45,875 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:45,875 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 03:48:45,879 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:45,879 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:45,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1655907394, now seen corresponding path program 2 times [2025-01-09 03:48:45,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:45,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651768479] [2025-01-09 03:48:45,880 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:48:45,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:45,901 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 81 statements into 2 equivalence classes. [2025-01-09 03:48:45,906 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 48 of 81 statements. [2025-01-09 03:48:45,906 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:48:45,906 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:48:45,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:45,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651768479] [2025-01-09 03:48:45,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651768479] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:45,989 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:45,989 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:45,989 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940580005] [2025-01-09 03:48:45,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:45,990 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:45,990 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:45,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:45,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:45,992 INFO L87 Difference]: Start difference. First operand 126 states and 178 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:46,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:46,057 INFO L93 Difference]: Finished difference Result 301 states and 423 transitions. [2025-01-09 03:48:46,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:46,058 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 81 [2025-01-09 03:48:46,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:46,060 INFO L225 Difference]: With dead ends: 301 [2025-01-09 03:48:46,060 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 03:48:46,060 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:46,063 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 141 mSDsluCounter, 490 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:46,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 664 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:46,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 03:48:46,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 232. [2025-01-09 03:48:46,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 192 states have (on average 1.4739583333333333) internal successors, (283), 195 states have internal predecessors, (283), 25 states have call successors, (25), 13 states have call predecessors, (25), 14 states have return successors, (24), 23 states have call predecessors, (24), 23 states have call successors, (24) [2025-01-09 03:48:46,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 332 transitions. [2025-01-09 03:48:46,093 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 332 transitions. Word has length 81 [2025-01-09 03:48:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:46,093 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 332 transitions. [2025-01-09 03:48:46,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:46,093 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 332 transitions. [2025-01-09 03:48:46,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-01-09 03:48:46,099 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:46,099 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:46,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 03:48:46,099 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:46,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:46,100 INFO L85 PathProgramCache]: Analyzing trace with hash -619673107, now seen corresponding path program 1 times [2025-01-09 03:48:46,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:46,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332385251] [2025-01-09 03:48:46,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:46,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:46,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-01-09 03:48:46,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-01-09 03:48:46,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:46,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:46,248 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-01-09 03:48:46,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:46,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [332385251] [2025-01-09 03:48:46,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [332385251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:46,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:46,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:46,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [926492357] [2025-01-09 03:48:46,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:46,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:46,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:46,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:46,251 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:46,251 INFO L87 Difference]: Start difference. First operand 232 states and 332 transitions. Second operand has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:48:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:46,294 INFO L93 Difference]: Finished difference Result 447 states and 644 transitions. [2025-01-09 03:48:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:48:46,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) Word has length 82 [2025-01-09 03:48:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:46,297 INFO L225 Difference]: With dead ends: 447 [2025-01-09 03:48:46,297 INFO L226 Difference]: Without dead ends: 234 [2025-01-09 03:48:46,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 03:48:46,298 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 1 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:46,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 664 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:46,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2025-01-09 03:48:46,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 234. [2025-01-09 03:48:46,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 193 states have (on average 1.471502590673575) internal successors, (284), 197 states have internal predecessors, (284), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-01-09 03:48:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 335 transitions. [2025-01-09 03:48:46,312 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 335 transitions. Word has length 82 [2025-01-09 03:48:46,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:46,312 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 335 transitions. [2025-01-09 03:48:46,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 13.5) internal successors, (54), 5 states have internal predecessors, (54), 3 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:48:46,316 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 335 transitions. [2025-01-09 03:48:46,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-01-09 03:48:46,317 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:46,317 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:46,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:48:46,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:46,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:46,318 INFO L85 PathProgramCache]: Analyzing trace with hash 602271405, now seen corresponding path program 1 times [2025-01-09 03:48:46,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:46,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446940522] [2025-01-09 03:48:46,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:46,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:46,334 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:48:46,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:48:46,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:46,447 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:46,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446940522] [2025-01-09 03:48:46,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446940522] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:46,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84615541] [2025-01-09 03:48:46,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:46,448 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:46,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:46,450 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 03:48:46,452 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 03:48:46,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-01-09 03:48:46,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-01-09 03:48:46,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:46,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:46,686 INFO L256 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:48:46,689 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:46,715 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:48:46,783 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:46,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84615541] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:48:46,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:48:46,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-09 03:48:46,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [787893261] [2025-01-09 03:48:46,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:48:46,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:48:46,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:46,785 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:48:46,785 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:46,786 INFO L87 Difference]: Start difference. First operand 234 states and 335 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:48:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:46,841 INFO L93 Difference]: Finished difference Result 574 states and 854 transitions. [2025-01-09 03:48:46,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 03:48:46,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 83 [2025-01-09 03:48:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:46,846 INFO L225 Difference]: With dead ends: 574 [2025-01-09 03:48:46,846 INFO L226 Difference]: Without dead ends: 422 [2025-01-09 03:48:46,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:46,847 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 228 mSDsluCounter, 633 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 806 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:46,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 806 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:46,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-09 03:48:46,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 382. [2025-01-09 03:48:46,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 341 states have (on average 1.6334310850439884) internal successors, (557), 345 states have internal predecessors, (557), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-01-09 03:48:46,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 608 transitions. [2025-01-09 03:48:46,879 INFO L78 Accepts]: Start accepts. Automaton has 382 states and 608 transitions. Word has length 83 [2025-01-09 03:48:46,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:46,879 INFO L471 AbstractCegarLoop]: Abstraction has 382 states and 608 transitions. [2025-01-09 03:48:46,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 7 states have internal predecessors, (72), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2025-01-09 03:48:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 608 transitions. [2025-01-09 03:48:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-09 03:48:46,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:46,885 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:46,894 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 03:48:47,085 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,SelfDestructingSolverStorable6 [2025-01-09 03:48:47,086 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:47,086 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:47,086 INFO L85 PathProgramCache]: Analyzing trace with hash 192284953, now seen corresponding path program 1 times [2025-01-09 03:48:47,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:47,086 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836817133] [2025-01-09 03:48:47,086 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:47,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:47,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-09 03:48:47,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-09 03:48:47,117 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:47,117 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,154 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:47,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:47,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836817133] [2025-01-09 03:48:47,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836817133] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:47,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:47,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:47,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992007777] [2025-01-09 03:48:47,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:47,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:47,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:47,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:47,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:47,156 INFO L87 Difference]: Start difference. First operand 382 states and 608 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:47,183 INFO L93 Difference]: Finished difference Result 897 states and 1465 transitions. [2025-01-09 03:48:47,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:47,184 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 91 [2025-01-09 03:48:47,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:47,189 INFO L225 Difference]: With dead ends: 897 [2025-01-09 03:48:47,189 INFO L226 Difference]: Without dead ends: 542 [2025-01-09 03:48:47,190 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 03:48:47,190 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 57 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:47,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 345 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:47,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2025-01-09 03:48:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 526. [2025-01-09 03:48:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 485 states have (on average 1.6824742268041237) internal successors, (816), 489 states have internal predecessors, (816), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-01-09 03:48:47,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 867 transitions. [2025-01-09 03:48:47,227 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 867 transitions. Word has length 91 [2025-01-09 03:48:47,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:47,227 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 867 transitions. [2025-01-09 03:48:47,227 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 867 transitions. [2025-01-09 03:48:47,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-09 03:48:47,229 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:47,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:47,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:48:47,229 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:47,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:47,230 INFO L85 PathProgramCache]: Analyzing trace with hash 373394493, now seen corresponding path program 1 times [2025-01-09 03:48:47,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:47,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367744572] [2025-01-09 03:48:47,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:47,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:47,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-09 03:48:47,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-09 03:48:47,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:47,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,301 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:47,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:47,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367744572] [2025-01-09 03:48:47,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367744572] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:47,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:47,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:47,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362839501] [2025-01-09 03:48:47,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:47,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:47,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:47,303 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:47,303 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:47,303 INFO L87 Difference]: Start difference. First operand 526 states and 867 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:47,327 INFO L93 Difference]: Finished difference Result 1263 states and 2123 transitions. [2025-01-09 03:48:47,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:47,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 92 [2025-01-09 03:48:47,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:47,332 INFO L225 Difference]: With dead ends: 1263 [2025-01-09 03:48:47,332 INFO L226 Difference]: Without dead ends: 771 [2025-01-09 03:48:47,333 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 03:48:47,334 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 55 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:47,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:47,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 771 states. [2025-01-09 03:48:47,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 771 to 755. [2025-01-09 03:48:47,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 755 states, 714 states have (on average 1.7100840336134453) internal successors, (1221), 718 states have internal predecessors, (1221), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-01-09 03:48:47,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 755 states to 755 states and 1272 transitions. [2025-01-09 03:48:47,377 INFO L78 Accepts]: Start accepts. Automaton has 755 states and 1272 transitions. Word has length 92 [2025-01-09 03:48:47,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:47,377 INFO L471 AbstractCegarLoop]: Abstraction has 755 states and 1272 transitions. [2025-01-09 03:48:47,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,377 INFO L276 IsEmpty]: Start isEmpty. Operand 755 states and 1272 transitions. [2025-01-09 03:48:47,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-01-09 03:48:47,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:47,383 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:47,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:48:47,383 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:47,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:47,384 INFO L85 PathProgramCache]: Analyzing trace with hash 235269115, now seen corresponding path program 1 times [2025-01-09 03:48:47,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:47,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728701687] [2025-01-09 03:48:47,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:47,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:47,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-01-09 03:48:47,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-01-09 03:48:47,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:47,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,440 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:47,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:47,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728701687] [2025-01-09 03:48:47,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728701687] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:47,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:47,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:47,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442460602] [2025-01-09 03:48:47,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:47,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:47,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:47,441 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:47,441 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:47,441 INFO L87 Difference]: Start difference. First operand 755 states and 1272 transitions. Second operand has 3 states, 3 states have (on average 20.666666666666668) internal successors, (62), 3 states have internal predecessors, (62), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:47,475 INFO L93 Difference]: Finished difference Result 1842 states and 3150 transitions. [2025-01-09 03:48:47,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:47,476 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 93 [2025-01-09 03:48:47,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:47,482 INFO L225 Difference]: With dead ends: 1842 [2025-01-09 03:48:47,482 INFO L226 Difference]: Without dead ends: 1138 [2025-01-09 03:48:47,484 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 03:48:47,484 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 53 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:47,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:47,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states. [2025-01-09 03:48:47,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1122. [2025-01-09 03:48:47,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1122 states, 1081 states have (on average 1.7224791859389454) internal successors, (1862), 1085 states have internal predecessors, (1862), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-01-09 03:48:47,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1122 states to 1122 states and 1913 transitions. [2025-01-09 03:48:47,524 INFO L78 Accepts]: Start accepts. Automaton has 1122 states and 1913 transitions. Word has length 93 [2025-01-09 03:48:47,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:47,524 INFO L471 AbstractCegarLoop]: Abstraction has 1122 states and 1913 transitions. [2025-01-09 03:48:47,525 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,525 INFO L276 IsEmpty]: Start isEmpty. Operand 1122 states and 1913 transitions. [2025-01-09 03:48:47,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-01-09 03:48:47,527 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:47,528 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:47,528 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:48:47,528 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:47,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:47,528 INFO L85 PathProgramCache]: Analyzing trace with hash -629952165, now seen corresponding path program 1 times [2025-01-09 03:48:47,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:47,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048435726] [2025-01-09 03:48:47,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:47,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:47,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-01-09 03:48:47,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-01-09 03:48:47,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:47,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,585 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:47,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:47,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048435726] [2025-01-09 03:48:47,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048435726] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:47,586 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:47,586 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:47,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911615103] [2025-01-09 03:48:47,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:47,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:47,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:47,587 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:47,587 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:47,587 INFO L87 Difference]: Start difference. First operand 1122 states and 1913 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:47,645 INFO L93 Difference]: Finished difference Result 2783 states and 4804 transitions. [2025-01-09 03:48:47,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:47,646 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 94 [2025-01-09 03:48:47,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:47,654 INFO L225 Difference]: With dead ends: 2783 [2025-01-09 03:48:47,654 INFO L226 Difference]: Without dead ends: 1746 [2025-01-09 03:48:47,657 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 03:48:47,657 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 51 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:47,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:47,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1746 states. [2025-01-09 03:48:47,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1746 to 1730. [2025-01-09 03:48:47,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1730 states, 1689 states have (on average 1.7258732978093547) internal successors, (2915), 1693 states have internal predecessors, (2915), 25 states have call successors, (25), 13 states have call predecessors, (25), 15 states have return successors, (26), 23 states have call predecessors, (26), 23 states have call successors, (26) [2025-01-09 03:48:47,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1730 states to 1730 states and 2966 transitions. [2025-01-09 03:48:47,718 INFO L78 Accepts]: Start accepts. Automaton has 1730 states and 2966 transitions. Word has length 94 [2025-01-09 03:48:47,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:47,718 INFO L471 AbstractCegarLoop]: Abstraction has 1730 states and 2966 transitions. [2025-01-09 03:48:47,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,718 INFO L276 IsEmpty]: Start isEmpty. Operand 1730 states and 2966 transitions. [2025-01-09 03:48:47,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 03:48:47,723 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:47,723 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:47,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 03:48:47,724 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:47,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:47,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1645105576, now seen corresponding path program 2 times [2025-01-09 03:48:47,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:47,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142067812] [2025-01-09 03:48:47,724 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:48:47,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:47,750 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 95 statements into 2 equivalence classes. [2025-01-09 03:48:47,757 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 50 of 95 statements. [2025-01-09 03:48:47,757 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 03:48:47,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:47,829 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2025-01-09 03:48:47,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:47,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142067812] [2025-01-09 03:48:47,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142067812] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:47,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:47,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:48:47,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1371951442] [2025-01-09 03:48:47,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:47,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:48:47,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:47,832 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:48:47,832 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:47,832 INFO L87 Difference]: Start difference. First operand 1730 states and 2966 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:47,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:47,926 INFO L93 Difference]: Finished difference Result 3137 states and 5308 transitions. [2025-01-09 03:48:47,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:48:47,928 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 95 [2025-01-09 03:48:47,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:47,944 INFO L225 Difference]: With dead ends: 3137 [2025-01-09 03:48:47,945 INFO L226 Difference]: Without dead ends: 3001 [2025-01-09 03:48:47,947 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:48:47,948 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 138 mSDsluCounter, 487 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:47,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 661 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:47,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3001 states. [2025-01-09 03:48:48,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3001 to 2991. [2025-01-09 03:48:48,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2916 states have (on average 1.7246227709190671) internal successors, (5029), 2922 states have internal predecessors, (5029), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:48,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 5122 transitions. [2025-01-09 03:48:48,083 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 5122 transitions. Word has length 95 [2025-01-09 03:48:48,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:48,084 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 5122 transitions. [2025-01-09 03:48:48,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:48,084 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 5122 transitions. [2025-01-09 03:48:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:48:48,092 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:48,092 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:48:48,093 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:48,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:48,093 INFO L85 PathProgramCache]: Analyzing trace with hash 1457479662, now seen corresponding path program 1 times [2025-01-09 03:48:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575107672] [2025-01-09 03:48:48,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:48,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:48:48,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:48:48,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:48,180 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-01-09 03:48:48,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:48,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575107672] [2025-01-09 03:48:48,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575107672] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:48,181 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:48,181 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:48,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950103371] [2025-01-09 03:48:48,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:48,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:48,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:48,182 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:48,182 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:48,183 INFO L87 Difference]: Start difference. First operand 2991 states and 5122 transitions. Second operand has 3 states, 3 states have (on average 20.0) internal successors, (60), 3 states have internal predecessors, (60), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:48,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:48,251 INFO L93 Difference]: Finished difference Result 5322 states and 9120 transitions. [2025-01-09 03:48:48,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:48,252 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-01-09 03:48:48,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:48,267 INFO L225 Difference]: With dead ends: 5322 [2025-01-09 03:48:48,267 INFO L226 Difference]: Without dead ends: 3023 [2025-01-09 03:48:48,272 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 03:48:48,273 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 56 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:48,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 406 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:48,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3023 states. [2025-01-09 03:48:48,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3023 to 2991. [2025-01-09 03:48:48,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2991 states, 2916 states have (on average 1.7112482853223594) internal successors, (4990), 2922 states have internal predecessors, (4990), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:48,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2991 states to 2991 states and 5083 transitions. [2025-01-09 03:48:48,412 INFO L78 Accepts]: Start accepts. Automaton has 2991 states and 5083 transitions. Word has length 96 [2025-01-09 03:48:48,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:48,412 INFO L471 AbstractCegarLoop]: Abstraction has 2991 states and 5083 transitions. [2025-01-09 03:48:48,413 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:48,413 INFO L276 IsEmpty]: Start isEmpty. Operand 2991 states and 5083 transitions. [2025-01-09 03:48:48,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 03:48:48,422 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:48,422 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:48,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:48:48,423 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:48,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:48,423 INFO L85 PathProgramCache]: Analyzing trace with hash -564799479, now seen corresponding path program 1 times [2025-01-09 03:48:48,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:48,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52366676] [2025-01-09 03:48:48,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:48,450 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 03:48:48,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 03:48:48,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:48,500 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:48,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:48,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52366676] [2025-01-09 03:48:48,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52366676] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:48,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612104402] [2025-01-09 03:48:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:48,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:48,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:48,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:48,501 INFO L87 Difference]: Start difference. First operand 2991 states and 5083 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:48,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:48,602 INFO L93 Difference]: Finished difference Result 7799 states and 13390 transitions. [2025-01-09 03:48:48,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:48,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 96 [2025-01-09 03:48:48,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:48,626 INFO L225 Difference]: With dead ends: 7799 [2025-01-09 03:48:48,626 INFO L226 Difference]: Without dead ends: 4951 [2025-01-09 03:48:48,634 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 03:48:48,634 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 49 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:48,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:48,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4951 states. [2025-01-09 03:48:48,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4951 to 4919. [2025-01-09 03:48:48,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4919 states, 4844 states have (on average 1.7124277456647399) internal successors, (8295), 4850 states have internal predecessors, (8295), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4919 states to 4919 states and 8388 transitions. [2025-01-09 03:48:48,836 INFO L78 Accepts]: Start accepts. Automaton has 4919 states and 8388 transitions. Word has length 96 [2025-01-09 03:48:48,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:48,836 INFO L471 AbstractCegarLoop]: Abstraction has 4919 states and 8388 transitions. [2025-01-09 03:48:48,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:48,836 INFO L276 IsEmpty]: Start isEmpty. Operand 4919 states and 8388 transitions. [2025-01-09 03:48:48,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-01-09 03:48:48,848 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:48,848 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:48,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:48:48,848 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:48,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash 535872493, now seen corresponding path program 1 times [2025-01-09 03:48:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93683911] [2025-01-09 03:48:48,849 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:48,868 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-01-09 03:48:48,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-01-09 03:48:48,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:48,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:48,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:48,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93683911] [2025-01-09 03:48:48,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93683911] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:48,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:48,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199816887] [2025-01-09 03:48:48,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:48,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:48,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:48,912 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:48,913 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:48,913 INFO L87 Difference]: Start difference. First operand 4919 states and 8388 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:49,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:49,041 INFO L93 Difference]: Finished difference Result 12101 states and 21009 transitions. [2025-01-09 03:48:49,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:49,041 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 97 [2025-01-09 03:48:49,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:49,089 INFO L225 Difference]: With dead ends: 12101 [2025-01-09 03:48:49,089 INFO L226 Difference]: Without dead ends: 7936 [2025-01-09 03:48:49,136 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 03:48:49,136 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 47 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:49,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 336 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:49,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7936 states. [2025-01-09 03:48:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7936 to 7904. [2025-01-09 03:48:49,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7904 states, 7829 states have (on average 1.7258909183803806) internal successors, (13512), 7835 states have internal predecessors, (13512), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:49,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7904 states to 7904 states and 13605 transitions. [2025-01-09 03:48:49,419 INFO L78 Accepts]: Start accepts. Automaton has 7904 states and 13605 transitions. Word has length 97 [2025-01-09 03:48:49,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:49,419 INFO L471 AbstractCegarLoop]: Abstraction has 7904 states and 13605 transitions. [2025-01-09 03:48:49,419 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:49,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7904 states and 13605 transitions. [2025-01-09 03:48:49,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 03:48:49,438 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:49,439 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:49,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:48:49,439 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:49,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:49,439 INFO L85 PathProgramCache]: Analyzing trace with hash 18956647, now seen corresponding path program 1 times [2025-01-09 03:48:49,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:49,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587150659] [2025-01-09 03:48:49,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:49,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:49,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 03:48:49,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 03:48:49,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:49,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:49,546 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:49,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:49,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587150659] [2025-01-09 03:48:49,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587150659] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:49,547 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:49,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:49,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25476527] [2025-01-09 03:48:49,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:49,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:49,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:49,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:49,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:49,548 INFO L87 Difference]: Start difference. First operand 7904 states and 13605 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:49,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:49,796 INFO L93 Difference]: Finished difference Result 21184 states and 36744 transitions. [2025-01-09 03:48:49,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:49,797 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 98 [2025-01-09 03:48:49,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:49,850 INFO L225 Difference]: With dead ends: 21184 [2025-01-09 03:48:49,851 INFO L226 Difference]: Without dead ends: 14083 [2025-01-09 03:48:49,862 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 03:48:49,862 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 45 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:49,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:49,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14083 states. [2025-01-09 03:48:50,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14083 to 14051. [2025-01-09 03:48:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14051 states, 13976 states have (on average 1.7101459645105896) internal successors, (23901), 13982 states have internal predecessors, (23901), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14051 states to 14051 states and 23994 transitions. [2025-01-09 03:48:50,416 INFO L78 Accepts]: Start accepts. Automaton has 14051 states and 23994 transitions. Word has length 98 [2025-01-09 03:48:50,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:50,417 INFO L471 AbstractCegarLoop]: Abstraction has 14051 states and 23994 transitions. [2025-01-09 03:48:50,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:50,418 INFO L276 IsEmpty]: Start isEmpty. Operand 14051 states and 23994 transitions. [2025-01-09 03:48:50,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:48:50,446 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:50,446 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:50,446 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:48:50,446 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:50,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:50,447 INFO L85 PathProgramCache]: Analyzing trace with hash -1702006221, now seen corresponding path program 1 times [2025-01-09 03:48:50,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:50,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333822558] [2025-01-09 03:48:50,447 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:50,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:50,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:48:50,475 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:48:50,475 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:50,475 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:50,547 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:48:50,547 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:50,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333822558] [2025-01-09 03:48:50,547 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333822558] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:50,547 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [392462630] [2025-01-09 03:48:50,547 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:50,547 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:50,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:50,550 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 03:48:50,552 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 03:48:50,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:48:50,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:48:50,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:50,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:50,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 820 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:48:50,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:50,869 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-01-09 03:48:50,870 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:50,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [392462630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:50,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:50,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 03:48:50,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658719286] [2025-01-09 03:48:50,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:50,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:50,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:50,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:50,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:50,873 INFO L87 Difference]: Start difference. First operand 14051 states and 23994 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:51,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:51,102 INFO L93 Difference]: Finished difference Result 26557 states and 45508 transitions. [2025-01-09 03:48:51,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:51,104 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2025-01-09 03:48:51,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:51,154 INFO L225 Difference]: With dead ends: 26557 [2025-01-09 03:48:51,155 INFO L226 Difference]: Without dead ends: 14083 [2025-01-09 03:48:51,179 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:51,181 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 55 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:51,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 406 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:51,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14083 states. [2025-01-09 03:48:51,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14083 to 14051. [2025-01-09 03:48:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14051 states, 13976 states have (on average 1.691113337149399) internal successors, (23635), 13982 states have internal predecessors, (23635), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:51,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14051 states to 14051 states and 23728 transitions. [2025-01-09 03:48:51,744 INFO L78 Accepts]: Start accepts. Automaton has 14051 states and 23728 transitions. Word has length 99 [2025-01-09 03:48:51,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:51,744 INFO L471 AbstractCegarLoop]: Abstraction has 14051 states and 23728 transitions. [2025-01-09 03:48:51,744 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:51,744 INFO L276 IsEmpty]: Start isEmpty. Operand 14051 states and 23728 transitions. [2025-01-09 03:48:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2025-01-09 03:48:51,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:51,770 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:51,779 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 03:48:51,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-01-09 03:48:51,972 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:51,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:51,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1286061829, now seen corresponding path program 1 times [2025-01-09 03:48:51,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:51,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417068736] [2025-01-09 03:48:51,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:51,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:51,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 99 statements into 1 equivalence classes. [2025-01-09 03:48:51,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 99 of 99 statements. [2025-01-09 03:48:51,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:51,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:52,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:52,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417068736] [2025-01-09 03:48:52,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417068736] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:52,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:52,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:52,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111994135] [2025-01-09 03:48:52,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:52,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:52,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:52,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:52,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:52,037 INFO L87 Difference]: Start difference. First operand 14051 states and 23728 transitions. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:52,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:52,507 INFO L93 Difference]: Finished difference Result 38650 states and 65589 transitions. [2025-01-09 03:48:52,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:52,508 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 99 [2025-01-09 03:48:52,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:52,603 INFO L225 Difference]: With dead ends: 38650 [2025-01-09 03:48:52,603 INFO L226 Difference]: Without dead ends: 25776 [2025-01-09 03:48:52,632 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 03:48:52,633 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 43 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:52,633 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:52,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25776 states. [2025-01-09 03:48:53,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25776 to 25744. [2025-01-09 03:48:53,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25744 states, 25669 states have (on average 1.6708870622151233) internal successors, (42890), 25675 states have internal predecessors, (42890), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:53,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25744 states to 25744 states and 42983 transitions. [2025-01-09 03:48:53,583 INFO L78 Accepts]: Start accepts. Automaton has 25744 states and 42983 transitions. Word has length 99 [2025-01-09 03:48:53,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:53,584 INFO L471 AbstractCegarLoop]: Abstraction has 25744 states and 42983 transitions. [2025-01-09 03:48:53,584 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), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:53,584 INFO L276 IsEmpty]: Start isEmpty. Operand 25744 states and 42983 transitions. [2025-01-09 03:48:53,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 03:48:53,632 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:53,632 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:53,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:48:53,633 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:53,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:53,633 INFO L85 PathProgramCache]: Analyzing trace with hash 18923589, now seen corresponding path program 1 times [2025-01-09 03:48:53,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:53,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857085236] [2025-01-09 03:48:53,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:53,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:53,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 03:48:53,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 03:48:53,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:53,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:53,718 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:53,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:53,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857085236] [2025-01-09 03:48:53,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [857085236] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:53,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:53,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:53,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489868938] [2025-01-09 03:48:53,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:53,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:53,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:53,720 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:53,720 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:53,720 INFO L87 Difference]: Start difference. First operand 25744 states and 42983 transitions. Second operand has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:54,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:54,499 INFO L93 Difference]: Finished difference Result 72376 states and 121150 transitions. [2025-01-09 03:48:54,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:54,500 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 100 [2025-01-09 03:48:54,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:54,667 INFO L225 Difference]: With dead ends: 72376 [2025-01-09 03:48:54,667 INFO L226 Difference]: Without dead ends: 48264 [2025-01-09 03:48:54,707 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 03:48:54,708 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 41 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:54,708 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:54,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48264 states. [2025-01-09 03:48:55,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48264 to 48232. [2025-01-09 03:48:55,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48232 states, 48157 states have (on average 1.6473202234358453) internal successors, (79330), 48163 states have internal predecessors, (79330), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:55,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48232 states to 48232 states and 79423 transitions. [2025-01-09 03:48:55,979 INFO L78 Accepts]: Start accepts. Automaton has 48232 states and 79423 transitions. Word has length 100 [2025-01-09 03:48:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:55,980 INFO L471 AbstractCegarLoop]: Abstraction has 48232 states and 79423 transitions. [2025-01-09 03:48:55,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.0) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:55,980 INFO L276 IsEmpty]: Start isEmpty. Operand 48232 states and 79423 transitions. [2025-01-09 03:48:56,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:48:56,039 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:56,040 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:56,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:48:56,040 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:56,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:56,040 INFO L85 PathProgramCache]: Analyzing trace with hash 426508505, now seen corresponding path program 1 times [2025-01-09 03:48:56,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:56,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053033411] [2025-01-09 03:48:56,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:56,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:56,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:48:56,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:48:56,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:56,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-09 03:48:56,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053033411] [2025-01-09 03:48:56,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053033411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:48:56,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513580618] [2025-01-09 03:48:56,121 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:56,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:56,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:48:56,123 INFO L229 MonitoredProcess]: Starting monitored process 7 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 03:48:56,125 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:48:56,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:48:56,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:48:56,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:56,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:56,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:48:56,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:48:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:48:56,421 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:48:56,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513580618] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:56,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:48:56,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-09 03:48:56,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9759817] [2025-01-09 03:48:56,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:56,425 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:56,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:56,426 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:56,426 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:56,427 INFO L87 Difference]: Start difference. First operand 48232 states and 79423 transitions. Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:57,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:48:57,220 INFO L93 Difference]: Finished difference Result 94096 states and 155289 transitions. [2025-01-09 03:48:57,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:48:57,221 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2025-01-09 03:48:57,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:48:57,403 INFO L225 Difference]: With dead ends: 94096 [2025-01-09 03:48:57,404 INFO L226 Difference]: Without dead ends: 48264 [2025-01-09 03:48:57,649 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:48:57,650 INFO L435 NwaCegarLoop]: 233 mSDtfsCounter, 54 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:48:57,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 406 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:48:57,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48264 states. [2025-01-09 03:48:58,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48264 to 48232. [2025-01-09 03:48:58,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48232 states, 48157 states have (on average 1.6258072554353469) internal successors, (78294), 48163 states have internal predecessors, (78294), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:48:58,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48232 states to 48232 states and 78387 transitions. [2025-01-09 03:48:58,761 INFO L78 Accepts]: Start accepts. Automaton has 48232 states and 78387 transitions. Word has length 101 [2025-01-09 03:48:58,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:48:58,761 INFO L471 AbstractCegarLoop]: Abstraction has 48232 states and 78387 transitions. [2025-01-09 03:48:58,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:48:58,762 INFO L276 IsEmpty]: Start isEmpty. Operand 48232 states and 78387 transitions. [2025-01-09 03:48:58,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-01-09 03:48:58,807 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:48:58,807 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:48:58,816 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 03:48:59,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:48:59,008 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:48:59,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:48:59,010 INFO L85 PathProgramCache]: Analyzing trace with hash 1226218013, now seen corresponding path program 1 times [2025-01-09 03:48:59,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:48:59,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598720468] [2025-01-09 03:48:59,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:48:59,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:48:59,031 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-01-09 03:48:59,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-01-09 03:48:59,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:48:59,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:48:59,089 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-09 03:48:59,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:48:59,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598720468] [2025-01-09 03:48:59,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598720468] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:48:59,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:48:59,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:48:59,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2919855] [2025-01-09 03:48:59,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:48:59,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:48:59,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:48:59,092 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:48:59,092 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:48:59,092 INFO L87 Difference]: Start difference. First operand 48232 states and 78387 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:49:00,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:00,393 INFO L93 Difference]: Finished difference Result 137845 states and 223996 transitions. [2025-01-09 03:49:00,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:49:00,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 101 [2025-01-09 03:49:00,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:00,685 INFO L225 Difference]: With dead ends: 137845 [2025-01-09 03:49:00,685 INFO L226 Difference]: Without dead ends: 91788 [2025-01-09 03:49:00,764 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 03:49:00,766 INFO L435 NwaCegarLoop]: 174 mSDtfsCounter, 39 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:00,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 344 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:00,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91788 states. [2025-01-09 03:49:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91788 to 91756. [2025-01-09 03:49:02,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91756 states, 91681 states have (on average 1.5980192188130584) internal successors, (146508), 91687 states have internal predecessors, (146508), 47 states have call successors, (47), 25 states have call predecessors, (47), 27 states have return successors, (46), 43 states have call predecessors, (46), 43 states have call successors, (46) [2025-01-09 03:49:02,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91756 states to 91756 states and 146601 transitions. [2025-01-09 03:49:02,775 INFO L78 Accepts]: Start accepts. Automaton has 91756 states and 146601 transitions. Word has length 101 [2025-01-09 03:49:02,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:02,776 INFO L471 AbstractCegarLoop]: Abstraction has 91756 states and 146601 transitions. [2025-01-09 03:49:02,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2025-01-09 03:49:02,776 INFO L276 IsEmpty]: Start isEmpty. Operand 91756 states and 146601 transitions. [2025-01-09 03:49:02,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-01-09 03:49:02,828 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:02,828 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:49:02,829 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:49:02,830 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:02,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash -1066454926, now seen corresponding path program 1 times [2025-01-09 03:49:02,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:02,830 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809306673] [2025-01-09 03:49:02,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:02,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:02,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:49:02,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:49:02,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:02,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:03,305 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-01-09 03:49:03,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:03,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809306673] [2025-01-09 03:49:03,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809306673] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:03,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707554863] [2025-01-09 03:49:03,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:03,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:03,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:03,308 INFO L229 MonitoredProcess]: Starting monitored process 8 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 03:49:03,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:49:03,485 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-01-09 03:49:03,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-01-09 03:49:03,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:03,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:03,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 823 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-01-09 03:49:03,601 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:03,886 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:49:03,887 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:03,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707554863] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:03,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:03,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [12] total 22 [2025-01-09 03:49:03,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392697327] [2025-01-09 03:49:03,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:03,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 03:49:03,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:03,889 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 03:49:03,889 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=411, Unknown=0, NotChecked=0, Total=462 [2025-01-09 03:49:03,889 INFO L87 Difference]: Start difference. First operand 91756 states and 146601 transitions. Second operand has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 03:49:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:05,559 INFO L93 Difference]: Finished difference Result 92379 states and 147422 transitions. [2025-01-09 03:49:05,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:49:05,562 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) Word has length 102 [2025-01-09 03:49:05,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:05,891 INFO L225 Difference]: With dead ends: 92379 [2025-01-09 03:49:05,891 INFO L226 Difference]: Without dead ends: 92101 [2025-01-09 03:49:05,917 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2025-01-09 03:49:05,918 INFO L435 NwaCegarLoop]: 192 mSDtfsCounter, 364 mSDsluCounter, 1542 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 1734 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:05,918 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 1734 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:49:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92101 states. [2025-01-09 03:49:07,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92101 to 92056. [2025-01-09 03:49:07,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92056 states, 91921 states have (on average 1.5972411092133463) internal successors, (146820), 91931 states have internal predecessors, (146820), 75 states have call successors, (75), 45 states have call predecessors, (75), 59 states have return successors, (98), 79 states have call predecessors, (98), 67 states have call successors, (98) [2025-01-09 03:49:08,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92056 states to 92056 states and 146993 transitions. [2025-01-09 03:49:08,148 INFO L78 Accepts]: Start accepts. Automaton has 92056 states and 146993 transitions. Word has length 102 [2025-01-09 03:49:08,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:08,149 INFO L471 AbstractCegarLoop]: Abstraction has 92056 states and 146993 transitions. [2025-01-09 03:49:08,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 5 states have call successors, (11), 5 states have call predecessors, (11), 6 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 03:49:08,149 INFO L276 IsEmpty]: Start isEmpty. Operand 92056 states and 146993 transitions. [2025-01-09 03:49:08,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:49:08,215 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:08,216 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:49:08,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-01-09 03:49:08,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:08,420 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:08,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:08,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1638188277, now seen corresponding path program 1 times [2025-01-09 03:49:08,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:08,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230738519] [2025-01-09 03:49:08,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:08,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:08,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:49:08,447 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:49:08,447 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:08,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:08,631 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 03:49:08,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:08,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230738519] [2025-01-09 03:49:08,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230738519] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:08,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:49:08,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-01-09 03:49:08,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [665910987] [2025-01-09 03:49:08,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:08,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 03:49:08,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:08,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 03:49:08,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:49:08,633 INFO L87 Difference]: Start difference. First operand 92056 states and 146993 transitions. Second operand has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 03:49:09,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:09,768 INFO L93 Difference]: Finished difference Result 92810 states and 147993 transitions. [2025-01-09 03:49:09,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:49:09,769 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) Word has length 103 [2025-01-09 03:49:09,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:09,965 INFO L225 Difference]: With dead ends: 92810 [2025-01-09 03:49:09,965 INFO L226 Difference]: Without dead ends: 92071 [2025-01-09 03:49:09,981 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2025-01-09 03:49:09,981 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 52 mSDsluCounter, 1314 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 1480 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:09,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 1480 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:49:10,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92071 states. [2025-01-09 03:49:11,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92071 to 92042. [2025-01-09 03:49:11,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92042 states, 91906 states have (on average 1.5971318521097644) internal successors, (146786), 91915 states have internal predecessors, (146786), 83 states have call successors, (83), 44 states have call predecessors, (83), 52 states have return successors, (103), 82 states have call predecessors, (103), 76 states have call successors, (103) [2025-01-09 03:49:11,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92042 states to 92042 states and 146972 transitions. [2025-01-09 03:49:11,877 INFO L78 Accepts]: Start accepts. Automaton has 92042 states and 146972 transitions. Word has length 103 [2025-01-09 03:49:11,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:11,878 INFO L471 AbstractCegarLoop]: Abstraction has 92042 states and 146972 transitions. [2025-01-09 03:49:11,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 7.875) internal successors, (63), 9 states have internal predecessors, (63), 6 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 5 states have call successors, (9) [2025-01-09 03:49:11,878 INFO L276 IsEmpty]: Start isEmpty. Operand 92042 states and 146972 transitions. [2025-01-09 03:49:11,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-09 03:49:11,971 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:11,971 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:49:11,971 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-09 03:49:11,971 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:11,972 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:11,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1387473294, now seen corresponding path program 1 times [2025-01-09 03:49:11,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:11,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142738997] [2025-01-09 03:49:11,972 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:11,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:11,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:49:11,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:49:11,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:11,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:12,090 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-01-09 03:49:12,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:12,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142738997] [2025-01-09 03:49:12,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142738997] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:12,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852354279] [2025-01-09 03:49:12,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:12,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:12,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:12,094 INFO L229 MonitoredProcess]: Starting monitored process 9 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 03:49:12,097 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-09 03:49:12,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-09 03:49:12,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-09 03:49:12,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:12,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:12,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 846 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-09 03:49:12,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-01-09 03:49:12,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:12,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852354279] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:12,690 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:12,690 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 9 [2025-01-09 03:49:12,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834399972] [2025-01-09 03:49:12,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:12,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 03:49:12,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:12,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 03:49:12,692 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:12,692 INFO L87 Difference]: Start difference. First operand 92042 states and 146972 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:49:13,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:13,211 INFO L93 Difference]: Finished difference Result 92056 states and 146985 transitions. [2025-01-09 03:49:13,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 03:49:13,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 107 [2025-01-09 03:49:13,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:13,615 INFO L225 Difference]: With dead ends: 92056 [2025-01-09 03:49:13,615 INFO L226 Difference]: Without dead ends: 46950 [2025-01-09 03:49:13,654 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 106 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-01-09 03:49:13,655 INFO L435 NwaCegarLoop]: 175 mSDtfsCounter, 138 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 363 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 03:49:13,655 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 363 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:13,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46950 states. [2025-01-09 03:49:14,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46950 to 46946. [2025-01-09 03:49:14,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46946 states, 46884 states have (on average 1.571730227796263) internal successors, (73689), 46888 states have internal predecessors, (73689), 37 states have call successors, (37), 21 states have call predecessors, (37), 24 states have return successors, (43), 36 states have call predecessors, (43), 34 states have call successors, (43) [2025-01-09 03:49:14,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46946 states to 46946 states and 73769 transitions. [2025-01-09 03:49:14,559 INFO L78 Accepts]: Start accepts. Automaton has 46946 states and 73769 transitions. Word has length 107 [2025-01-09 03:49:14,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:14,559 INFO L471 AbstractCegarLoop]: Abstraction has 46946 states and 73769 transitions. [2025-01-09 03:49:14,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2025-01-09 03:49:14,559 INFO L276 IsEmpty]: Start isEmpty. Operand 46946 states and 73769 transitions. [2025-01-09 03:49:14,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-01-09 03:49:14,621 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:49:14,622 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 03:49:14,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-09 03:49:14,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:14,823 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:49:14,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:49:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash -886145979, now seen corresponding path program 1 times [2025-01-09 03:49:14,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:49:14,824 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037765824] [2025-01-09 03:49:14,824 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:14,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:49:14,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:49:14,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:49:14,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:14,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:14,963 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-01-09 03:49:14,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:49:14,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037765824] [2025-01-09 03:49:14,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037765824] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:49:14,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [675178576] [2025-01-09 03:49:14,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:49:14,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:49:14,966 INFO L229 MonitoredProcess]: Starting monitored process 10 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 03:49:14,969 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-09 03:49:15,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-01-09 03:49:15,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-01-09 03:49:15,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:49:15,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:49:15,252 INFO L256 TraceCheckSpWp]: Trace formula consists of 848 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 03:49:15,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:49:15,299 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-01-09 03:49:15,299 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:49:15,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [675178576] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:49:15,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:49:15,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 9 [2025-01-09 03:49:15,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815048006] [2025-01-09 03:49:15,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:49:15,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:49:15,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:49:15,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:49:15,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:15,301 INFO L87 Difference]: Start difference. First operand 46946 states and 73769 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 03:49:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:49:15,990 INFO L93 Difference]: Finished difference Result 46946 states and 73769 transitions. [2025-01-09 03:49:15,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:49:15,991 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) Word has length 109 [2025-01-09 03:49:15,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:49:16,000 INFO L225 Difference]: With dead ends: 46946 [2025-01-09 03:49:16,000 INFO L226 Difference]: Without dead ends: 0 [2025-01-09 03:49:16,027 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2025-01-09 03:49:16,028 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:49:16,029 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 673 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:49:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-09 03:49:16,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-09 03:49:16,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:49:16,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-09 03:49:16,036 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 109 [2025-01-09 03:49:16,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:49:16,036 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-09 03:49:16,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (9), 2 states have call predecessors, (9), 1 states have call successors, (9) [2025-01-09 03:49:16,036 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-09 03:49:16,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-09 03:49:16,040 INFO L782 garLoopResultBuilder]: Registering result SAFE for location outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 03:49:16,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-01-09 03:49:16,241 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:49:16,243 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:49:16,245 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.