./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec0_product22.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec0_product22.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 646f5b113c7a3ad2f4a2522272ad1b8889776081b2b5bc43fffe0e887ddc48f7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:29:37,678 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:29:37,723 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:29:37,727 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:29:37,727 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:29:37,748 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:29:37,749 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:29:37,749 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:29:37,749 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:29:37,749 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:29:37,749 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:29:37,749 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:29:37,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:29:37,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:29:37,749 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:29:37,750 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:29:37,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:29:37,750 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:37,750 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:29:37,751 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 646f5b113c7a3ad2f4a2522272ad1b8889776081b2b5bc43fffe0e887ddc48f7 [2025-03-08 05:29:37,977 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:29:37,984 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:29:37,987 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:29:37,988 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:29:37,988 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:29:37,990 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec0_product22.cil.c [2025-03-08 05:29:39,139 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d840a24/64ee9d703e6e4d658dba6793f435cac9/FLAGfa0694e5e [2025-03-08 05:29:39,454 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:29:39,454 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product22.cil.c [2025-03-08 05:29:39,467 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d840a24/64ee9d703e6e4d658dba6793f435cac9/FLAGfa0694e5e [2025-03-08 05:29:39,478 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/18d840a24/64ee9d703e6e4d658dba6793f435cac9 [2025-03-08 05:29:39,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:29:39,481 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:29:39,481 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:39,481 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:29:39,484 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:29:39,485 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:39,485 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@67474227 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39, skipping insertion in model container [2025-03-08 05:29:39,485 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:39,525 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:29:39,677 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product22.cil.c[4724,4737] [2025-03-08 05:29:39,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:39,890 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:29:39,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [48] [2025-03-08 05:29:39,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [66] [2025-03-08 05:29:39,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [189] [2025-03-08 05:29:39,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [198] [2025-03-08 05:29:39,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [236] [2025-03-08 05:29:39,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [602] [2025-03-08 05:29:39,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1007] [2025-03-08 05:29:39,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1314] [2025-03-08 05:29:39,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"DecryptForward_spec.i","") [1618] [2025-03-08 05:29:39,898 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1637] [2025-03-08 05:29:39,899 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2702] [2025-03-08 05:29:39,909 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec0_product22.cil.c[4724,4737] [2025-03-08 05:29:39,966 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:29:39,988 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:29:39,989 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39 WrapperNode [2025-03-08 05:29:39,989 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:29:39,990 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:39,990 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:29:39,990 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:29:39,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,063 INFO L138 Inliner]: procedures = 128, calls = 189, calls flagged for inlining = 58, calls inlined = 53, statements flattened = 1012 [2025-03-08 05:29:40,063 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:29:40,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:29:40,064 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:29:40,064 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:29:40,072 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,072 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,079 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,101 INFO L175 MemorySlicer]: Split 14 memory accesses to 4 slices as follows [2, 4, 4, 4]. 29 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 4, 4, 4]. The 0 writes are split as follows [0, 0, 0, 0]. [2025-03-08 05:29:40,101 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,101 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,112 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,114 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,116 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,117 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,121 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:29:40,121 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:29:40,121 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:29:40,121 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:29:40,122 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (1/1) ... [2025-03-08 05:29:40,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:29:40,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:40,158 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 05:29:40,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 05:29:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2025-03-08 05:29:40,177 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2025-03-08 05:29:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2025-03-08 05:29:40,177 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2025-03-08 05:29:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-08 05:29:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-08 05:29:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:29:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:29:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:29:40,328 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:29:40,329 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:29:40,576 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2679-1: getClientId_#res#1 := getClientId_~retValue_acc~43#1; [2025-03-08 05:29:40,577 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~42#1; [2025-03-08 05:29:40,578 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2244-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~36#1; [2025-03-08 05:29:40,578 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L651-1: getEmailId_#res#1 := getEmailId_~retValue_acc~11#1; [2025-03-08 05:29:40,578 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~25#1; [2025-03-08 05:29:40,578 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2560-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~41#1; [2025-03-08 05:29:40,578 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2197-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~35#1; [2025-03-08 05:29:40,603 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2336: #res#1 := ~retValue_acc~38#1; [2025-03-08 05:29:40,604 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2291-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~37#1; [2025-03-08 05:29:40,612 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L186-1: createEmail_#res#1 := createEmail_~retValue_acc~4#1; [2025-03-08 05:29:40,625 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L840: #res := ~retValue_acc~16; [2025-03-08 05:29:40,638 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L877: #res := ~retValue_acc~17; [2025-03-08 05:29:40,658 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L725: #res := ~retValue_acc~13; [2025-03-08 05:29:40,881 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2506-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~40#1; [2025-03-08 05:29:40,881 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2399-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~39#1; [2025-03-08 05:29:40,881 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1228-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-08 05:29:40,881 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1237-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-08 05:29:40,881 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1246-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-08 05:29:40,882 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L233-1: valid_product_#res#1 := valid_product_~retValue_acc~6#1; [2025-03-08 05:29:40,886 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L688: #res := ~retValue_acc~12; [2025-03-08 05:29:40,892 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L142-1: isReadable__wrappee__Keys_#res#1 := isReadable__wrappee__Keys_~retValue_acc~1#1; [2025-03-08 05:29:40,893 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L162: #res#1 := ~retValue_acc~2#1; [2025-03-08 05:29:40,982 INFO L? ?]: Removed 430 outVars from TransFormulas that were not future-live. [2025-03-08 05:29:40,982 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:29:40,995 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:29:40,995 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:29:40,995 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:40 BoogieIcfgContainer [2025-03-08 05:29:40,996 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:29:40,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:29:40,997 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:29:41,002 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:29:41,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:29:39" (1/3) ... [2025-03-08 05:29:41,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f432f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:41, skipping insertion in model container [2025-03-08 05:29:41,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:29:39" (2/3) ... [2025-03-08 05:29:41,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32f432f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:29:41, skipping insertion in model container [2025-03-08 05:29:41,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:29:40" (3/3) ... [2025-03-08 05:29:41,005 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec0_product22.cil.c [2025-03-08 05:29:41,016 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:29:41,019 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec0_product22.cil.c that has 20 procedures, 320 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:29:41,076 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:29:41,085 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;@73d90b4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:29:41,086 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:29:41,091 INFO L276 IsEmpty]: Start isEmpty. Operand has 320 states, 249 states have (on average 1.5261044176706828) internal successors, (380), 253 states have internal predecessors, (380), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-08 05:29:41,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:29:41,104 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:41,104 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:41,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:41,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:41,110 INFO L85 PathProgramCache]: Analyzing trace with hash -2097722312, now seen corresponding path program 1 times [2025-03-08 05:29:41,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:41,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1090842710] [2025-03-08 05:29:41,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:41,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:41,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:29:41,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:29:41,284 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:41,284 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:29:41,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1090842710] [2025-03-08 05:29:41,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1090842710] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:41,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [46673438] [2025-03-08 05:29:41,709 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:41,709 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:41,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:41,713 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:41,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 05:29:41,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:29:41,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:29:41,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:41,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:41,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 1055 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:29:41,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:42,004 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:29:42,005 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:42,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [46673438] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:42,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:42,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:42,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853856532] [2025-03-08 05:29:42,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:42,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:42,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:42,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:42,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:42,031 INFO L87 Difference]: Start difference. First operand has 320 states, 249 states have (on average 1.5261044176706828) internal successors, (380), 253 states have internal predecessors, (380), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:42,095 INFO L93 Difference]: Finished difference Result 484 states and 712 transitions. [2025-03-08 05:29:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:42,101 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 119 [2025-03-08 05:29:42,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:42,110 INFO L225 Difference]: With dead ends: 484 [2025-03-08 05:29:42,110 INFO L226 Difference]: Without dead ends: 314 [2025-03-08 05:29:42,114 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 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-03-08 05:29:42,118 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 0 mSDsluCounter, 473 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:42,120 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 949 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:42,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-08 05:29:42,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 314. [2025-03-08 05:29:42,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 314 states, 244 states have (on average 1.5204918032786885) internal successors, (371), 247 states have internal predecessors, (371), 50 states have call successors, (50), 19 states have call predecessors, (50), 19 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2025-03-08 05:29:42,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 470 transitions. [2025-03-08 05:29:42,173 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 470 transitions. Word has length 119 [2025-03-08 05:29:42,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:42,175 INFO L471 AbstractCegarLoop]: Abstraction has 314 states and 470 transitions. [2025-03-08 05:29:42,175 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, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:42,175 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 470 transitions. [2025-03-08 05:29:42,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:29:42,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:42,183 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:42,191 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 05:29:42,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 05:29:42,384 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:42,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:42,385 INFO L85 PathProgramCache]: Analyzing trace with hash 1136588245, now seen corresponding path program 1 times [2025-03-08 05:29:42,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:42,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844136298] [2025-03-08 05:29:42,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:42,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:42,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:29:42,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:29:42,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:42,423 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:42,640 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:29:42,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844136298] [2025-03-08 05:29:42,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [844136298] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:42,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928665038] [2025-03-08 05:29:42,641 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:42,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:42,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:42,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:42,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 05:29:42,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:29:42,950 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:29:42,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:42,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:42,955 INFO L256 TraceCheckSpWp]: Trace formula consists of 1079 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:42,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:42,981 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-08 05:29:42,983 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:42,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928665038] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:42,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:42,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:29:42,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049951595] [2025-03-08 05:29:42,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:42,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:42,985 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:42,985 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:42,986 INFO L87 Difference]: Start difference. First operand 314 states and 470 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:43,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:43,020 INFO L93 Difference]: Finished difference Result 662 states and 1006 transitions. [2025-03-08 05:29:43,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:43,020 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 126 [2025-03-08 05:29:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:43,023 INFO L225 Difference]: With dead ends: 662 [2025-03-08 05:29:43,023 INFO L226 Difference]: Without dead ends: 374 [2025-03-08 05:29:43,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 126 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-03-08 05:29:43,025 INFO L435 NwaCegarLoop]: 483 mSDtfsCounter, 115 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 906 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-03-08 05:29:43,025 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 906 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2025-03-08 05:29:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 366. [2025-03-08 05:29:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 285 states have (on average 1.5403508771929824) internal successors, (439), 288 states have internal predecessors, (439), 61 states have call successors, (61), 19 states have call predecessors, (61), 19 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-03-08 05:29:43,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 560 transitions. [2025-03-08 05:29:43,047 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 560 transitions. Word has length 126 [2025-03-08 05:29:43,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:43,047 INFO L471 AbstractCegarLoop]: Abstraction has 366 states and 560 transitions. [2025-03-08 05:29:43,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 560 transitions. [2025-03-08 05:29:43,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-03-08 05:29:43,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:43,050 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:43,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:43,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2025-03-08 05:29:43,251 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:43,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:43,252 INFO L85 PathProgramCache]: Analyzing trace with hash 930957369, now seen corresponding path program 1 times [2025-03-08 05:29:43,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:43,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057095261] [2025-03-08 05:29:43,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:43,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:43,276 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:29:43,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:29:43,286 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:43,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:43,449 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:29:43,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057095261] [2025-03-08 05:29:43,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057095261] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:43,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1539984562] [2025-03-08 05:29:43,450 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:43,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:43,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:43,454 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:43,456 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 05:29:43,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-03-08 05:29:43,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-03-08 05:29:43,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:43,717 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:43,721 INFO L256 TraceCheckSpWp]: Trace formula consists of 1084 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:29:43,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:43,782 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:43,782 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:43,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1539984562] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:43,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:43,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:29:43,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718785456] [2025-03-08 05:29:43,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:43,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:43,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:43,784 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:43,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:43,784 INFO L87 Difference]: Start difference. First operand 366 states and 560 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:43,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:43,849 INFO L93 Difference]: Finished difference Result 723 states and 1110 transitions. [2025-03-08 05:29:43,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:43,851 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 127 [2025-03-08 05:29:43,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:43,853 INFO L225 Difference]: With dead ends: 723 [2025-03-08 05:29:43,853 INFO L226 Difference]: Without dead ends: 368 [2025-03-08 05:29:43,856 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 125 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-03-08 05:29:43,858 INFO L435 NwaCegarLoop]: 461 mSDtfsCounter, 2 mSDsluCounter, 1372 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1833 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-03-08 05:29:43,859 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1833 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2025-03-08 05:29:43,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2025-03-08 05:29:43,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 286 states have (on average 1.5384615384615385) internal successors, (440), 290 states have internal predecessors, (440), 61 states have call successors, (61), 19 states have call predecessors, (61), 20 states have return successors, (62), 60 states have call predecessors, (62), 60 states have call successors, (62) [2025-03-08 05:29:43,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 563 transitions. [2025-03-08 05:29:43,887 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 563 transitions. Word has length 127 [2025-03-08 05:29:43,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:43,888 INFO L471 AbstractCegarLoop]: Abstraction has 368 states and 563 transitions. [2025-03-08 05:29:43,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:43,888 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 563 transitions. [2025-03-08 05:29:43,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-08 05:29:43,890 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:43,890 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:43,899 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 05:29:44,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:44,091 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:44,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:44,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1159309710, now seen corresponding path program 1 times [2025-03-08 05:29:44,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:44,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891648632] [2025-03-08 05:29:44,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:44,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:44,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:29:44,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:29:44,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:44,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:44,267 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:29:44,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891648632] [2025-03-08 05:29:44,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891648632] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:44,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [224410361] [2025-03-08 05:29:44,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:44,268 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:44,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:44,270 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:44,272 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 05:29:44,405 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-08 05:29:44,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-08 05:29:44,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:44,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:44,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1085 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:29:44,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:44,544 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-08 05:29:44,544 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:29:44,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [224410361] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:44,544 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:29:44,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:29:44,544 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645476675] [2025-03-08 05:29:44,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:44,545 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:44,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:44,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:44,545 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:29:44,546 INFO L87 Difference]: Start difference. First operand 368 states and 563 transitions. Second operand has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:44,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:44,598 INFO L93 Difference]: Finished difference Result 725 states and 1115 transitions. [2025-03-08 05:29:44,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:44,598 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 128 [2025-03-08 05:29:44,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:44,601 INFO L225 Difference]: With dead ends: 725 [2025-03-08 05:29:44,601 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 05:29:44,602 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:29:44,602 INFO L435 NwaCegarLoop]: 459 mSDtfsCounter, 2 mSDsluCounter, 1360 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1819 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:44,602 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1819 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:44,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 05:29:44,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-08 05:29:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 287 states have (on average 1.5365853658536586) internal successors, (441), 292 states have internal predecessors, (441), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (67), 60 states have call predecessors, (67), 60 states have call successors, (67) [2025-03-08 05:29:44,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 569 transitions. [2025-03-08 05:29:44,615 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 569 transitions. Word has length 128 [2025-03-08 05:29:44,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:44,615 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 569 transitions. [2025-03-08 05:29:44,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.4) internal successors, (87), 5 states have internal predecessors, (87), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:44,616 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 569 transitions. [2025-03-08 05:29:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 05:29:44,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:44,617 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:44,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 05:29:44,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:44,818 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:44,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:44,819 INFO L85 PathProgramCache]: Analyzing trace with hash -736418528, now seen corresponding path program 1 times [2025-03-08 05:29:44,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:44,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865591807] [2025-03-08 05:29:44,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:44,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:44,835 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 05:29:44,841 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 05:29:44,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:44,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:44,938 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:29:44,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:44,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865591807] [2025-03-08 05:29:44,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865591807] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:44,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:44,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:44,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425153520] [2025-03-08 05:29:44,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:44,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:44,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:44,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:44,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:44,940 INFO L87 Difference]: Start difference. First operand 370 states and 569 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:44,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:44,974 INFO L93 Difference]: Finished difference Result 717 states and 1106 transitions. [2025-03-08 05:29:44,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:44,975 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 129 [2025-03-08 05:29:44,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:44,978 INFO L225 Difference]: With dead ends: 717 [2025-03-08 05:29:44,978 INFO L226 Difference]: Without dead ends: 370 [2025-03-08 05:29:44,979 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-03-08 05:29:44,981 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 2 mSDsluCounter, 1375 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1837 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-03-08 05:29:44,981 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1837 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:44,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2025-03-08 05:29:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 370. [2025-03-08 05:29:44,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 370 states, 287 states have (on average 1.5365853658536586) internal successors, (441), 292 states have internal predecessors, (441), 61 states have call successors, (61), 19 states have call predecessors, (61), 21 states have return successors, (66), 60 states have call predecessors, (66), 60 states have call successors, (66) [2025-03-08 05:29:44,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 370 states to 370 states and 568 transitions. [2025-03-08 05:29:44,998 INFO L78 Accepts]: Start accepts. Automaton has 370 states and 568 transitions. Word has length 129 [2025-03-08 05:29:44,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:44,998 INFO L471 AbstractCegarLoop]: Abstraction has 370 states and 568 transitions. [2025-03-08 05:29:44,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:44,998 INFO L276 IsEmpty]: Start isEmpty. Operand 370 states and 568 transitions. [2025-03-08 05:29:45,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:29:45,001 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:45,001 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:45,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:29:45,004 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:45,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:45,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1540035013, now seen corresponding path program 2 times [2025-03-08 05:29:45,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:45,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456431902] [2025-03-08 05:29:45,004 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:45,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:45,037 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 130 statements into 2 equivalence classes. [2025-03-08 05:29:45,045 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 69 of 130 statements. [2025-03-08 05:29:45,046 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:45,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:45,110 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:45,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:45,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456431902] [2025-03-08 05:29:45,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456431902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:45,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:45,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656054486] [2025-03-08 05:29:45,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:45,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:45,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:45,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:45,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:45,111 INFO L87 Difference]: Start difference. First operand 370 states and 568 transitions. Second operand has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:45,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:45,168 INFO L93 Difference]: Finished difference Result 865 states and 1314 transitions. [2025-03-08 05:29:45,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 05:29:45,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 130 [2025-03-08 05:29:45,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:45,176 INFO L225 Difference]: With dead ends: 865 [2025-03-08 05:29:45,176 INFO L226 Difference]: Without dead ends: 716 [2025-03-08 05:29:45,177 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-03-08 05:29:45,178 INFO L435 NwaCegarLoop]: 470 mSDtfsCounter, 410 mSDsluCounter, 1367 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 410 SdHoareTripleChecker+Valid, 1837 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-03-08 05:29:45,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [410 Valid, 1837 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:45,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2025-03-08 05:29:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 712. [2025-03-08 05:29:45,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 712 states, 556 states have (on average 1.5485611510791366) internal successors, (861), 564 states have internal predecessors, (861), 116 states have call successors, (116), 37 states have call predecessors, (116), 39 states have return successors, (120), 114 states have call predecessors, (120), 114 states have call successors, (120) [2025-03-08 05:29:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 712 states to 712 states and 1097 transitions. [2025-03-08 05:29:45,218 INFO L78 Accepts]: Start accepts. Automaton has 712 states and 1097 transitions. Word has length 130 [2025-03-08 05:29:45,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:45,219 INFO L471 AbstractCegarLoop]: Abstraction has 712 states and 1097 transitions. [2025-03-08 05:29:45,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 16.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:45,219 INFO L276 IsEmpty]: Start isEmpty. Operand 712 states and 1097 transitions. [2025-03-08 05:29:45,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-08 05:29:45,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:45,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:45,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:29:45,223 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:45,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:45,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1448805614, now seen corresponding path program 1 times [2025-03-08 05:29:45,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:45,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631145870] [2025-03-08 05:29:45,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:45,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:45,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-08 05:29:45,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-08 05:29:45,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:45,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:45,342 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:29:45,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:45,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631145870] [2025-03-08 05:29:45,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631145870] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:45,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:45,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:29:45,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358159593] [2025-03-08 05:29:45,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:45,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:29:45,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:45,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:29:45,344 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:29:45,344 INFO L87 Difference]: Start difference. First operand 712 states and 1097 transitions. Second operand has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:45,391 INFO L93 Difference]: Finished difference Result 1403 states and 2167 transitions. [2025-03-08 05:29:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:29:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 131 [2025-03-08 05:29:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:45,397 INFO L225 Difference]: With dead ends: 1403 [2025-03-08 05:29:45,397 INFO L226 Difference]: Without dead ends: 714 [2025-03-08 05:29:45,399 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-03-08 05:29:45,400 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 1 mSDsluCounter, 1377 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1840 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-03-08 05:29:45,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1840 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:45,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2025-03-08 05:29:45,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 714. [2025-03-08 05:29:45,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 714 states, 557 states have (on average 1.5475763016157988) internal successors, (862), 566 states have internal predecessors, (862), 116 states have call successors, (116), 37 states have call predecessors, (116), 40 states have return successors, (122), 114 states have call predecessors, (122), 114 states have call successors, (122) [2025-03-08 05:29:45,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 714 states to 714 states and 1100 transitions. [2025-03-08 05:29:45,433 INFO L78 Accepts]: Start accepts. Automaton has 714 states and 1100 transitions. Word has length 131 [2025-03-08 05:29:45,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:45,433 INFO L471 AbstractCegarLoop]: Abstraction has 714 states and 1100 transitions. [2025-03-08 05:29:45,434 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 21.25) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:29:45,434 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 1100 transitions. [2025-03-08 05:29:45,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:29:45,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:45,436 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:45,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:29:45,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:45,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:45,438 INFO L85 PathProgramCache]: Analyzing trace with hash 138040102, now seen corresponding path program 1 times [2025-03-08 05:29:45,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:45,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407946039] [2025-03-08 05:29:45,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:45,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:45,456 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:29:45,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:29:45,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:45,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:45,573 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:29:45,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:45,573 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407946039] [2025-03-08 05:29:45,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407946039] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:45,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:45,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:45,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337580414] [2025-03-08 05:29:45,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:45,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:45,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:45,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:45,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:45,574 INFO L87 Difference]: Start difference. First operand 714 states and 1100 transitions. Second operand has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:29:45,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:45,681 INFO L93 Difference]: Finished difference Result 1407 states and 2170 transitions. [2025-03-08 05:29:45,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:29:45,682 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 132 [2025-03-08 05:29:45,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:45,685 INFO L225 Difference]: With dead ends: 1407 [2025-03-08 05:29:45,685 INFO L226 Difference]: Without dead ends: 718 [2025-03-08 05:29:45,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:45,687 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 7 mSDsluCounter, 2689 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3142 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:45,687 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3142 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:45,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 718 states. [2025-03-08 05:29:45,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 718 to 716. [2025-03-08 05:29:45,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 716 states, 559 states have (on average 1.5456171735241502) internal successors, (864), 567 states have internal predecessors, (864), 116 states have call successors, (116), 38 states have call predecessors, (116), 40 states have return successors, (121), 114 states have call predecessors, (121), 114 states have call successors, (121) [2025-03-08 05:29:45,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 716 states to 716 states and 1101 transitions. [2025-03-08 05:29:45,710 INFO L78 Accepts]: Start accepts. Automaton has 716 states and 1101 transitions. Word has length 132 [2025-03-08 05:29:45,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:45,711 INFO L471 AbstractCegarLoop]: Abstraction has 716 states and 1101 transitions. [2025-03-08 05:29:45,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.714285714285714) internal successors, (89), 8 states have internal predecessors, (89), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:29:45,711 INFO L276 IsEmpty]: Start isEmpty. Operand 716 states and 1101 transitions. [2025-03-08 05:29:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:29:45,713 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:45,713 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:45,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:29:45,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:45,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:45,714 INFO L85 PathProgramCache]: Analyzing trace with hash -773801242, now seen corresponding path program 2 times [2025-03-08 05:29:45,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:45,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328929134] [2025-03-08 05:29:45,714 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:29:45,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:45,730 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 133 statements into 2 equivalence classes. [2025-03-08 05:29:45,735 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 72 of 133 statements. [2025-03-08 05:29:45,735 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-08 05:29:45,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-03-08 05:29:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328929134] [2025-03-08 05:29:45,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328929134] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:45,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:29:45,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474798422] [2025-03-08 05:29:45,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:45,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:29:45,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:45,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:29:45,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:29:45,800 INFO L87 Difference]: Start difference. First operand 716 states and 1101 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:45,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:45,864 INFO L93 Difference]: Finished difference Result 1080 states and 1620 transitions. [2025-03-08 05:29:45,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:29:45,865 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 133 [2025-03-08 05:29:45,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:45,869 INFO L225 Difference]: With dead ends: 1080 [2025-03-08 05:29:45,869 INFO L226 Difference]: Without dead ends: 780 [2025-03-08 05:29:45,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:29:45,871 INFO L435 NwaCegarLoop]: 463 mSDtfsCounter, 27 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 2297 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:45,871 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 2297 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:45,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2025-03-08 05:29:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 772. [2025-03-08 05:29:45,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 772 states, 601 states have (on average 1.5374376039933444) internal successors, (924), 611 states have internal predecessors, (924), 130 states have call successors, (130), 38 states have call predecessors, (130), 40 states have return successors, (135), 128 states have call predecessors, (135), 128 states have call successors, (135) [2025-03-08 05:29:45,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 772 states to 772 states and 1189 transitions. [2025-03-08 05:29:45,899 INFO L78 Accepts]: Start accepts. Automaton has 772 states and 1189 transitions. Word has length 133 [2025-03-08 05:29:45,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:45,899 INFO L471 AbstractCegarLoop]: Abstraction has 772 states and 1189 transitions. [2025-03-08 05:29:45,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 6 states have internal predecessors, (83), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:45,899 INFO L276 IsEmpty]: Start isEmpty. Operand 772 states and 1189 transitions. [2025-03-08 05:29:45,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2025-03-08 05:29:45,902 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:45,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:45,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 05:29:45,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:45,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:45,903 INFO L85 PathProgramCache]: Analyzing trace with hash -26519762, now seen corresponding path program 1 times [2025-03-08 05:29:45,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:45,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265636668] [2025-03-08 05:29:45,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:45,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:45,920 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 134 statements into 1 equivalence classes. [2025-03-08 05:29:45,924 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 134 of 134 statements. [2025-03-08 05:29:45,924 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:45,924 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:46,025 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-08 05:29:46,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:46,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265636668] [2025-03-08 05:29:46,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265636668] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:46,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:46,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:29:46,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965363502] [2025-03-08 05:29:46,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:46,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:29:46,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:46,026 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:29:46,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:29:46,026 INFO L87 Difference]: Start difference. First operand 772 states and 1189 transitions. Second operand has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:29:46,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:46,136 INFO L93 Difference]: Finished difference Result 1522 states and 2353 transitions. [2025-03-08 05:29:46,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:29:46,136 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 134 [2025-03-08 05:29:46,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:46,140 INFO L225 Difference]: With dead ends: 1522 [2025-03-08 05:29:46,140 INFO L226 Difference]: Without dead ends: 777 [2025-03-08 05:29:46,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-03-08 05:29:46,142 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 5 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 3156 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:46,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 3156 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:29:46,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 777 states. [2025-03-08 05:29:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 777 to 775. [2025-03-08 05:29:46,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 775 states, 603 states have (on average 1.5356550580431176) internal successors, (926), 614 states have internal predecessors, (926), 130 states have call successors, (130), 38 states have call predecessors, (130), 41 states have return successors, (140), 128 states have call predecessors, (140), 128 states have call successors, (140) [2025-03-08 05:29:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 1196 transitions. [2025-03-08 05:29:46,175 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 1196 transitions. Word has length 134 [2025-03-08 05:29:46,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:46,176 INFO L471 AbstractCegarLoop]: Abstraction has 775 states and 1196 transitions. [2025-03-08 05:29:46,176 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.0) internal successors, (91), 8 states have internal predecessors, (91), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:29:46,176 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 1196 transitions. [2025-03-08 05:29:46,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2025-03-08 05:29:46,179 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:46,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:46,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:29:46,180 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:46,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:46,180 INFO L85 PathProgramCache]: Analyzing trace with hash -1074513679, now seen corresponding path program 1 times [2025-03-08 05:29:46,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:46,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915165399] [2025-03-08 05:29:46,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:46,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:46,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:29:46,203 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:29:46,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:46,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:46,316 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-08 05:29:46,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915165399] [2025-03-08 05:29:46,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915165399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:29:46,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1980712804] [2025-03-08 05:29:46,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:46,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:29:46,318 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:29:46,320 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:29:46,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 05:29:46,478 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 135 statements into 1 equivalence classes. [2025-03-08 05:29:46,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 135 of 135 statements. [2025-03-08 05:29:46,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:46,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:46,572 INFO L256 TraceCheckSpWp]: Trace formula consists of 1092 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:29:46,575 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:29:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:46,619 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:29:46,711 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1980712804] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:29:46,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:29:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:29:46,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426824158] [2025-03-08 05:29:46,712 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:29:46,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:29:46,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:46,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:29:46,713 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:29:46,713 INFO L87 Difference]: Start difference. First operand 775 states and 1196 transitions. Second operand has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-08 05:29:47,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:47,300 INFO L93 Difference]: Finished difference Result 2119 states and 3384 transitions. [2025-03-08 05:29:47,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:29:47,301 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 135 [2025-03-08 05:29:47,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:47,309 INFO L225 Difference]: With dead ends: 2119 [2025-03-08 05:29:47,309 INFO L226 Difference]: Without dead ends: 1375 [2025-03-08 05:29:47,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-03-08 05:29:47,314 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 1224 mSDsluCounter, 3200 mSDsCounter, 0 mSdLazyCounter, 545 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1224 SdHoareTripleChecker+Valid, 3669 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:29:47,314 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1224 Valid, 3669 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 545 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:29:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1375 states. [2025-03-08 05:29:47,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1375 to 1335. [2025-03-08 05:29:47,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1335 states, 1060 states have (on average 1.5820754716981131) internal successors, (1677), 1070 states have internal predecessors, (1677), 233 states have call successors, (233), 39 states have call predecessors, (233), 41 states have return successors, (253), 231 states have call predecessors, (253), 231 states have call successors, (253) [2025-03-08 05:29:47,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1335 states to 1335 states and 2163 transitions. [2025-03-08 05:29:47,371 INFO L78 Accepts]: Start accepts. Automaton has 1335 states and 2163 transitions. Word has length 135 [2025-03-08 05:29:47,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:47,372 INFO L471 AbstractCegarLoop]: Abstraction has 1335 states and 2163 transitions. [2025-03-08 05:29:47,372 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.1) internal successors, (131), 11 states have internal predecessors, (131), 4 states have call successors, (28), 2 states have call predecessors, (28), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-08 05:29:47,372 INFO L276 IsEmpty]: Start isEmpty. Operand 1335 states and 2163 transitions. [2025-03-08 05:29:47,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-08 05:29:47,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:47,378 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:47,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 05:29:47,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 05:29:47,580 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:47,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:47,581 INFO L85 PathProgramCache]: Analyzing trace with hash 887728085, now seen corresponding path program 1 times [2025-03-08 05:29:47,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:47,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110621339] [2025-03-08 05:29:47,581 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:47,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:47,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-08 05:29:47,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-08 05:29:47,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:47,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:47,643 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:47,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:47,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110621339] [2025-03-08 05:29:47,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110621339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:47,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:47,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:47,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248409412] [2025-03-08 05:29:47,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:47,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:47,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:47,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:47,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:47,645 INFO L87 Difference]: Start difference. First operand 1335 states and 2163 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:47,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:47,708 INFO L93 Difference]: Finished difference Result 3118 states and 5124 transitions. [2025-03-08 05:29:47,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:47,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 139 [2025-03-08 05:29:47,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:47,745 INFO L225 Difference]: With dead ends: 3118 [2025-03-08 05:29:47,745 INFO L226 Difference]: Without dead ends: 1862 [2025-03-08 05:29:47,749 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-03-08 05:29:47,749 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 112 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 933 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-03-08 05:29:47,750 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 933 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:47,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1862 states. [2025-03-08 05:29:47,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1862 to 1846. [2025-03-08 05:29:47,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1846 states, 1468 states have (on average 1.6014986376021798) internal successors, (2351), 1478 states have internal predecessors, (2351), 336 states have call successors, (336), 39 states have call predecessors, (336), 41 states have return successors, (366), 334 states have call predecessors, (366), 334 states have call successors, (366) [2025-03-08 05:29:47,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1846 states to 1846 states and 3053 transitions. [2025-03-08 05:29:47,822 INFO L78 Accepts]: Start accepts. Automaton has 1846 states and 3053 transitions. Word has length 139 [2025-03-08 05:29:47,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:47,822 INFO L471 AbstractCegarLoop]: Abstraction has 1846 states and 3053 transitions. [2025-03-08 05:29:47,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:47,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1846 states and 3053 transitions. [2025-03-08 05:29:47,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:29:47,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:47,830 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:47,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:29:47,831 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:47,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:47,831 INFO L85 PathProgramCache]: Analyzing trace with hash 977332054, now seen corresponding path program 1 times [2025-03-08 05:29:47,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:47,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098348237] [2025-03-08 05:29:47,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:47,832 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:47,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:29:47,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:29:47,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:47,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:47,877 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:47,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:47,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098348237] [2025-03-08 05:29:47,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098348237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:47,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:47,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:47,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1653450096] [2025-03-08 05:29:47,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:47,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:47,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:47,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:47,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:47,879 INFO L87 Difference]: Start difference. First operand 1846 states and 3053 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:47,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:47,947 INFO L93 Difference]: Finished difference Result 4416 states and 7354 transitions. [2025-03-08 05:29:47,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:47,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 140 [2025-03-08 05:29:47,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:47,961 INFO L225 Difference]: With dead ends: 4416 [2025-03-08 05:29:47,961 INFO L226 Difference]: Without dead ends: 2698 [2025-03-08 05:29:47,967 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-03-08 05:29:47,968 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 110 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 928 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-03-08 05:29:47,968 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 928 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:47,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2698 states. [2025-03-08 05:29:48,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2698 to 2682. [2025-03-08 05:29:48,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2682 states, 2150 states have (on average 1.6125581395348838) internal successors, (3467), 2160 states have internal predecessors, (3467), 490 states have call successors, (490), 39 states have call predecessors, (490), 41 states have return successors, (520), 488 states have call predecessors, (520), 488 states have call successors, (520) [2025-03-08 05:29:48,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 4477 transitions. [2025-03-08 05:29:48,079 INFO L78 Accepts]: Start accepts. Automaton has 2682 states and 4477 transitions. Word has length 140 [2025-03-08 05:29:48,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:48,079 INFO L471 AbstractCegarLoop]: Abstraction has 2682 states and 4477 transitions. [2025-03-08 05:29:48,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:48,080 INFO L276 IsEmpty]: Start isEmpty. Operand 2682 states and 4477 transitions. [2025-03-08 05:29:48,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-08 05:29:48,093 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:48,093 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:48,093 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:29:48,093 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:48,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:48,094 INFO L85 PathProgramCache]: Analyzing trace with hash 1861808342, now seen corresponding path program 1 times [2025-03-08 05:29:48,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:48,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601936346] [2025-03-08 05:29:48,094 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:48,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:48,132 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-08 05:29:48,137 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-08 05:29:48,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:48,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:48,164 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:48,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:48,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601936346] [2025-03-08 05:29:48,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601936346] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:48,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:48,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:48,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502202679] [2025-03-08 05:29:48,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:48,166 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:48,166 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:48,166 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:48,166 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:48,166 INFO L87 Difference]: Start difference. First operand 2682 states and 4477 transitions. Second operand has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:48,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:48,277 INFO L93 Difference]: Finished difference Result 6425 states and 10805 transitions. [2025-03-08 05:29:48,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:48,278 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 141 [2025-03-08 05:29:48,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:48,300 INFO L225 Difference]: With dead ends: 6425 [2025-03-08 05:29:48,301 INFO L226 Difference]: Without dead ends: 3999 [2025-03-08 05:29:48,311 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-03-08 05:29:48,311 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 108 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 925 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-03-08 05:29:48,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 925 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3999 states. [2025-03-08 05:29:48,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3999 to 3983. [2025-03-08 05:29:48,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3983 states, 3245 states have (on average 1.6231124807395994) internal successors, (5267), 3255 states have internal predecessors, (5267), 696 states have call successors, (696), 39 states have call predecessors, (696), 41 states have return successors, (742), 694 states have call predecessors, (742), 694 states have call successors, (742) [2025-03-08 05:29:48,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3983 states to 3983 states and 6705 transitions. [2025-03-08 05:29:48,511 INFO L78 Accepts]: Start accepts. Automaton has 3983 states and 6705 transitions. Word has length 141 [2025-03-08 05:29:48,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:48,511 INFO L471 AbstractCegarLoop]: Abstraction has 3983 states and 6705 transitions. [2025-03-08 05:29:48,512 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:48,512 INFO L276 IsEmpty]: Start isEmpty. Operand 3983 states and 6705 transitions. [2025-03-08 05:29:48,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:29:48,529 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:48,529 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:48,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:29:48,529 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:48,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:48,530 INFO L85 PathProgramCache]: Analyzing trace with hash -954232651, now seen corresponding path program 1 times [2025-03-08 05:29:48,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:48,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825386563] [2025-03-08 05:29:48,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:48,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:48,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:29:48,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:29:48,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:48,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:48,577 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:48,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:48,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825386563] [2025-03-08 05:29:48,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825386563] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:48,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:48,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:48,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504992627] [2025-03-08 05:29:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:48,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:48,578 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:48,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:48,579 INFO L87 Difference]: Start difference. First operand 3983 states and 6705 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:48,721 INFO L93 Difference]: Finished difference Result 9677 states and 16397 transitions. [2025-03-08 05:29:48,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:48,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 142 [2025-03-08 05:29:48,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:48,752 INFO L225 Difference]: With dead ends: 9677 [2025-03-08 05:29:48,753 INFO L226 Difference]: Without dead ends: 6158 [2025-03-08 05:29:48,767 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-03-08 05:29:48,768 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 106 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 925 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-03-08 05:29:48,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 925 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:48,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6158 states. [2025-03-08 05:29:49,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6158 to 6142. [2025-03-08 05:29:49,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6142 states, 5094 states have (on average 1.631919905771496) internal successors, (8313), 5104 states have internal predecessors, (8313), 1006 states have call successors, (1006), 39 states have call predecessors, (1006), 41 states have return successors, (1078), 1004 states have call predecessors, (1078), 1004 states have call successors, (1078) [2025-03-08 05:29:49,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6142 states to 6142 states and 10397 transitions. [2025-03-08 05:29:49,090 INFO L78 Accepts]: Start accepts. Automaton has 6142 states and 10397 transitions. Word has length 142 [2025-03-08 05:29:49,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:49,090 INFO L471 AbstractCegarLoop]: Abstraction has 6142 states and 10397 transitions. [2025-03-08 05:29:49,090 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:49,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6142 states and 10397 transitions. [2025-03-08 05:29:49,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 05:29:49,115 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:49,115 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:49,115 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:29:49,115 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:49,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:49,116 INFO L85 PathProgramCache]: Analyzing trace with hash -1782154057, now seen corresponding path program 1 times [2025-03-08 05:29:49,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:49,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344567159] [2025-03-08 05:29:49,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:49,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:49,133 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 05:29:49,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 05:29:49,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:49,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:49,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:49,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344567159] [2025-03-08 05:29:49,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344567159] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:49,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:49,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:49,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159350701] [2025-03-08 05:29:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:49,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:49,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:49,169 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:49,169 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:49,169 INFO L87 Difference]: Start difference. First operand 6142 states and 10397 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:49,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:49,364 INFO L93 Difference]: Finished difference Result 14866 states and 25362 transitions. [2025-03-08 05:29:49,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:49,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 143 [2025-03-08 05:29:49,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:49,402 INFO L225 Difference]: With dead ends: 14866 [2025-03-08 05:29:49,402 INFO L226 Difference]: Without dead ends: 9960 [2025-03-08 05:29:49,417 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-03-08 05:29:49,418 INFO L435 NwaCegarLoop]: 481 mSDtfsCounter, 104 mSDsluCounter, 457 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 938 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-03-08 05:29:49,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 938 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:49,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9960 states. [2025-03-08 05:29:49,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9960 to 9944. [2025-03-08 05:29:49,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9944 states, 8194 states have (on average 1.6330241640224554) internal successors, (13381), 8204 states have internal predecessors, (13381), 1708 states have call successors, (1708), 39 states have call predecessors, (1708), 41 states have return successors, (1824), 1706 states have call predecessors, (1824), 1706 states have call successors, (1824) [2025-03-08 05:29:49,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9944 states to 9944 states and 16913 transitions. [2025-03-08 05:29:49,779 INFO L78 Accepts]: Start accepts. Automaton has 9944 states and 16913 transitions. Word has length 143 [2025-03-08 05:29:49,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:49,779 INFO L471 AbstractCegarLoop]: Abstraction has 9944 states and 16913 transitions. [2025-03-08 05:29:49,779 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:49,780 INFO L276 IsEmpty]: Start isEmpty. Operand 9944 states and 16913 transitions. [2025-03-08 05:29:49,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-08 05:29:49,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:49,816 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:49,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:29:49,816 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:49,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:49,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1402438676, now seen corresponding path program 1 times [2025-03-08 05:29:49,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:49,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270522583] [2025-03-08 05:29:49,818 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:49,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:49,833 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 144 statements into 1 equivalence classes. [2025-03-08 05:29:49,839 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 144 of 144 statements. [2025-03-08 05:29:49,841 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:49,841 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:49,868 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:49,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:49,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270522583] [2025-03-08 05:29:49,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270522583] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:49,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:49,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:49,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586306698] [2025-03-08 05:29:49,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:49,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:49,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:49,870 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:49,870 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:49,871 INFO L87 Difference]: Start difference. First operand 9944 states and 16913 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:50,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:50,187 INFO L93 Difference]: Finished difference Result 25366 states and 43386 transitions. [2025-03-08 05:29:50,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:50,188 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 144 [2025-03-08 05:29:50,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:50,245 INFO L225 Difference]: With dead ends: 25366 [2025-03-08 05:29:50,245 INFO L226 Difference]: Without dead ends: 16978 [2025-03-08 05:29:50,273 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-03-08 05:29:50,273 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 102 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 930 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-03-08 05:29:50,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:50,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16978 states. [2025-03-08 05:29:51,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16978 to 16962. [2025-03-08 05:29:51,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16962 states, 14068 states have (on average 1.6318595393801536) internal successors, (22957), 14078 states have internal predecessors, (22957), 2852 states have call successors, (2852), 39 states have call predecessors, (2852), 41 states have return successors, (3046), 2850 states have call predecessors, (3046), 2850 states have call successors, (3046) [2025-03-08 05:29:51,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16962 states to 16962 states and 28855 transitions. [2025-03-08 05:29:51,094 INFO L78 Accepts]: Start accepts. Automaton has 16962 states and 28855 transitions. Word has length 144 [2025-03-08 05:29:51,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:51,094 INFO L471 AbstractCegarLoop]: Abstraction has 16962 states and 28855 transitions. [2025-03-08 05:29:51,095 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:51,095 INFO L276 IsEmpty]: Start isEmpty. Operand 16962 states and 28855 transitions. [2025-03-08 05:29:51,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-03-08 05:29:51,136 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:51,136 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:51,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:29:51,137 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:51,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:51,138 INFO L85 PathProgramCache]: Analyzing trace with hash 2061789816, now seen corresponding path program 1 times [2025-03-08 05:29:51,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:51,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [344795859] [2025-03-08 05:29:51,138 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:51,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:51,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-03-08 05:29:51,158 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-03-08 05:29:51,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:51,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:51,184 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:51,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:51,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [344795859] [2025-03-08 05:29:51,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [344795859] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:51,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:51,185 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:51,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828127537] [2025-03-08 05:29:51,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:51,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:51,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:51,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:51,187 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:51,187 INFO L87 Difference]: Start difference. First operand 16962 states and 28855 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:51,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:51,773 INFO L93 Difference]: Finished difference Result 45289 states and 77301 transitions. [2025-03-08 05:29:51,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:51,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 145 [2025-03-08 05:29:51,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:51,870 INFO L225 Difference]: With dead ends: 45289 [2025-03-08 05:29:51,871 INFO L226 Difference]: Without dead ends: 30502 [2025-03-08 05:29:51,903 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-03-08 05:29:51,904 INFO L435 NwaCegarLoop]: 477 mSDtfsCounter, 100 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 941 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-03-08 05:29:51,904 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 941 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:51,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30502 states. [2025-03-08 05:29:52,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30502 to 30486. [2025-03-08 05:29:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30486 states, 25273 states have (on average 1.62295730621612) internal successors, (41017), 25283 states have internal predecessors, (41017), 5171 states have call successors, (5171), 39 states have call predecessors, (5171), 41 states have return successors, (5509), 5169 states have call predecessors, (5509), 5169 states have call successors, (5509) [2025-03-08 05:29:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30486 states to 30486 states and 51697 transitions. [2025-03-08 05:29:52,845 INFO L78 Accepts]: Start accepts. Automaton has 30486 states and 51697 transitions. Word has length 145 [2025-03-08 05:29:52,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:52,845 INFO L471 AbstractCegarLoop]: Abstraction has 30486 states and 51697 transitions. [2025-03-08 05:29:52,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 3 states have internal predecessors, (96), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:52,845 INFO L276 IsEmpty]: Start isEmpty. Operand 30486 states and 51697 transitions. [2025-03-08 05:29:52,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-08 05:29:52,901 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:52,902 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:52,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:29:52,902 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:52,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:52,902 INFO L85 PathProgramCache]: Analyzing trace with hash 869902323, now seen corresponding path program 1 times [2025-03-08 05:29:52,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:52,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793963300] [2025-03-08 05:29:52,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:52,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:53,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-08 05:29:53,036 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-08 05:29:53,036 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:53,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:53,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:53,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793963300] [2025-03-08 05:29:53,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793963300] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:53,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:53,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:53,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617223567] [2025-03-08 05:29:53,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:53,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:53,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:53,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:53,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:53,074 INFO L87 Difference]: Start difference. First operand 30486 states and 51697 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:54,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:54,479 INFO L93 Difference]: Finished difference Result 82940 states and 141168 transitions. [2025-03-08 05:29:54,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:54,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 146 [2025-03-08 05:29:54,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:54,683 INFO L225 Difference]: With dead ends: 82940 [2025-03-08 05:29:54,683 INFO L226 Difference]: Without dead ends: 55483 [2025-03-08 05:29:54,738 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-03-08 05:29:54,738 INFO L435 NwaCegarLoop]: 467 mSDtfsCounter, 98 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 928 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-03-08 05:29:54,738 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 928 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:54,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55483 states. [2025-03-08 05:29:56,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55483 to 55467. [2025-03-08 05:29:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55467 states, 46269 states have (on average 1.6187512157167867) internal successors, (74898), 46279 states have internal predecessors, (74898), 9156 states have call successors, (9156), 39 states have call predecessors, (9156), 41 states have return successors, (9768), 9154 states have call predecessors, (9768), 9154 states have call successors, (9768) [2025-03-08 05:29:56,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55467 states to 55467 states and 93822 transitions. [2025-03-08 05:29:56,574 INFO L78 Accepts]: Start accepts. Automaton has 55467 states and 93822 transitions. Word has length 146 [2025-03-08 05:29:56,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:29:56,574 INFO L471 AbstractCegarLoop]: Abstraction has 55467 states and 93822 transitions. [2025-03-08 05:29:56,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:56,574 INFO L276 IsEmpty]: Start isEmpty. Operand 55467 states and 93822 transitions. [2025-03-08 05:29:56,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-08 05:29:56,648 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:29:56,648 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:29:56,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:29:56,649 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:29:56,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:29:56,649 INFO L85 PathProgramCache]: Analyzing trace with hash -2107491047, now seen corresponding path program 1 times [2025-03-08 05:29:56,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:29:56,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438568291] [2025-03-08 05:29:56,649 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:29:56,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:29:56,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-08 05:29:56,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-08 05:29:56,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:29:56,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:29:56,699 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:29:56,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:29:56,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438568291] [2025-03-08 05:29:56,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438568291] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:29:56,699 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:29:56,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:29:56,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511584813] [2025-03-08 05:29:56,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:29:56,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:29:56,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:29:56,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:29:56,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:29:56,700 INFO L87 Difference]: Start difference. First operand 55467 states and 93822 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:29:58,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:29:58,735 INFO L93 Difference]: Finished difference Result 154520 states and 262098 transitions. [2025-03-08 05:29:58,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:29:58,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 147 [2025-03-08 05:29:58,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:29:59,132 INFO L225 Difference]: With dead ends: 154520 [2025-03-08 05:29:59,133 INFO L226 Difference]: Without dead ends: 103078 [2025-03-08 05:29:59,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-03-08 05:29:59,272 INFO L435 NwaCegarLoop]: 469 mSDtfsCounter, 96 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 930 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-03-08 05:29:59,272 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 930 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:29:59,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103078 states. [2025-03-08 05:30:02,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103078 to 103062. [2025-03-08 05:30:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103062 states, 86539 states have (on average 1.6129606304671882) internal successors, (139584), 86549 states have internal predecessors, (139584), 16481 states have call successors, (16481), 39 states have call predecessors, (16481), 41 states have return successors, (17625), 16479 states have call predecessors, (17625), 16479 states have call successors, (17625) [2025-03-08 05:30:03,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103062 states to 103062 states and 173690 transitions. [2025-03-08 05:30:03,362 INFO L78 Accepts]: Start accepts. Automaton has 103062 states and 173690 transitions. Word has length 147 [2025-03-08 05:30:03,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:03,362 INFO L471 AbstractCegarLoop]: Abstraction has 103062 states and 173690 transitions. [2025-03-08 05:30:03,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:03,367 INFO L276 IsEmpty]: Start isEmpty. Operand 103062 states and 173690 transitions. [2025-03-08 05:30:03,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-03-08 05:30:03,471 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:03,471 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:03,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:30:03,471 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:03,472 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:03,472 INFO L85 PathProgramCache]: Analyzing trace with hash -1795335374, now seen corresponding path program 1 times [2025-03-08 05:30:03,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:03,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663212822] [2025-03-08 05:30:03,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:03,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:03,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-03-08 05:30:03,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-03-08 05:30:03,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:03,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:03,520 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-08 05:30:03,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:03,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663212822] [2025-03-08 05:30:03,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663212822] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:03,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:30:03,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:30:03,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720819715] [2025-03-08 05:30:03,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:03,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:30:03,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:03,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:30:03,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:30:03,522 INFO L87 Difference]: Start difference. First operand 103062 states and 173690 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:06,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:30:06,722 INFO L93 Difference]: Finished difference Result 193592 states and 326774 transitions. [2025-03-08 05:30:06,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:30:06,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 148 [2025-03-08 05:30:06,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:30:07,585 INFO L225 Difference]: With dead ends: 193592 [2025-03-08 05:30:07,585 INFO L226 Difference]: Without dead ends: 193220 [2025-03-08 05:30:07,646 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-03-08 05:30:07,647 INFO L435 NwaCegarLoop]: 476 mSDtfsCounter, 91 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:30:07,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 942 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:30:07,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193220 states. [2025-03-08 05:30:12,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193220 to 193204. [2025-03-08 05:30:12,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193204 states, 163370 states have (on average 1.6056619942461896) internal successors, (262317), 163380 states have internal predecessors, (262317), 29792 states have call successors, (29792), 39 states have call predecessors, (29792), 41 states have return successors, (31982), 29790 states have call predecessors, (31982), 29790 states have call successors, (31982) [2025-03-08 05:30:13,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193204 states to 193204 states and 324091 transitions. [2025-03-08 05:30:13,404 INFO L78 Accepts]: Start accepts. Automaton has 193204 states and 324091 transitions. Word has length 148 [2025-03-08 05:30:13,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:30:13,404 INFO L471 AbstractCegarLoop]: Abstraction has 193204 states and 324091 transitions. [2025-03-08 05:30:13,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:30:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 193204 states and 324091 transitions. [2025-03-08 05:30:13,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2025-03-08 05:30:13,545 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:30:13,546 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:30:13,546 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 05:30:13,546 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:30:13,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:30:13,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1972449286, now seen corresponding path program 1 times [2025-03-08 05:30:13,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:30:13,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802707961] [2025-03-08 05:30:13,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:13,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:30:13,566 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:30:13,573 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:30:13,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:13,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:13,797 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-08 05:30:13,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:30:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802707961] [2025-03-08 05:30:13,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802707961] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:30:13,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2047312606] [2025-03-08 05:30:13,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:30:13,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:30:13,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:30:13,799 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 05:30:13,802 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 05:30:13,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 149 statements into 1 equivalence classes. [2025-03-08 05:30:14,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 149 of 149 statements. [2025-03-08 05:30:14,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:30:14,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:30:14,049 INFO L256 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-08 05:30:14,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:30:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:30:14,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:30:14,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2047312606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:30:14,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:30:14,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [12] total 22 [2025-03-08 05:30:14,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749842297] [2025-03-08 05:30:14,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:30:14,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 05:30:14,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:30:14,371 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 05:30:14,372 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-03-08 05:30:14,372 INFO L87 Difference]: Start difference. First operand 193204 states and 324091 transitions. Second operand has 12 states, 11 states have (on average 10.272727272727273) internal successors, (113), 9 states have internal predecessors, (113), 5 states have call successors, (16), 5 states have call predecessors, (16), 5 states have return successors, (14), 6 states have call predecessors, (14), 5 states have call successors, (14)