./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product23.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_spec3_product23.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 c32d742da56eb7f975371d3819f8188d43c88569b223fcc4a7217dc4d57efe24 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 05:33:01,398 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 05:33:01,447 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 05:33:01,451 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 05:33:01,452 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 05:33:01,471 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 05:33:01,472 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 05:33:01,472 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 05:33:01,472 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 05:33:01,472 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 05:33:01,472 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 05:33:01,472 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 05:33:01,473 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 05:33:01,473 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 05:33:01,473 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 05:33:01,473 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 05:33:01,473 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 05:33:01,473 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 05:33:01,473 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 05:33:01,473 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 05:33:01,473 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 05:33:01,474 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 05:33:01,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:33:01,475 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 05:33:01,475 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 05:33:01,475 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 -> c32d742da56eb7f975371d3819f8188d43c88569b223fcc4a7217dc4d57efe24 [2025-03-08 05:33:01,698 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 05:33:01,707 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 05:33:01,708 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 05:33:01,709 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 05:33:01,709 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 05:33:01,710 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product23.cil.c [2025-03-08 05:33:02,871 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b39d5696/f395ce552ffa45c4af3b74929ad5a4bb/FLAG1c7623777 [2025-03-08 05:33:03,176 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 05:33:03,177 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product23.cil.c [2025-03-08 05:33:03,192 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b39d5696/f395ce552ffa45c4af3b74929ad5a4bb/FLAG1c7623777 [2025-03-08 05:33:03,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b39d5696/f395ce552ffa45c4af3b74929ad5a4bb [2025-03-08 05:33:03,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 05:33:03,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 05:33:03,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 05:33:03,454 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 05:33:03,457 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 05:33:03,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:03,458 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a51f695 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03, skipping insertion in model container [2025-03-08 05:33:03,458 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:03,501 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 05:33:03,738 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_spec3_product23.cil.c[22258,22271] [2025-03-08 05:33:03,879 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:33:03,889 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 05:33:03,894 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [48] [2025-03-08 05:33:03,895 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [380] [2025-03-08 05:33:03,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [599] [2025-03-08 05:33:03,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [965] [2025-03-08 05:33:03,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [974] [2025-03-08 05:33:03,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [1386] [2025-03-08 05:33:03,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [1403] [2025-03-08 05:33:03,896 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1438] [2025-03-08 05:33:03,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [1537] [2025-03-08 05:33:03,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1597] [2025-03-08 05:33:03,897 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1936] [2025-03-08 05:33:03,927 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_spec3_product23.cil.c[22258,22271] [2025-03-08 05:33:03,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 05:33:03,997 INFO L204 MainTranslator]: Completed translation [2025-03-08 05:33:03,998 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03 WrapperNode [2025-03-08 05:33:03,999 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 05:33:03,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 05:33:04,000 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 05:33:04,000 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 05:33:04,004 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:33:03" (1/1) ... [2025-03-08 05:33:04,029 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:33:03" (1/1) ... [2025-03-08 05:33:04,083 INFO L138 Inliner]: procedures = 131, calls = 207, calls flagged for inlining = 58, calls inlined = 51, statements flattened = 953 [2025-03-08 05:33:04,083 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 05:33:04,084 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 05:33:04,084 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 05:33:04,084 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 05:33:04,091 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,091 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,100 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,131 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:33:04,131 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,131 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,150 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,156 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,158 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,160 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,163 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 05:33:04,167 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 05:33:04,167 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 05:33:04,167 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 05:33:04,168 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (1/1) ... [2025-03-08 05:33:04,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 05:33:04,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:04,195 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:33:04,197 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:33:04,217 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-08 05:33:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-08 05:33:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-08 05:33:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-08 05:33:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-08 05:33:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-08 05:33:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:33:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-08 05:33:04,218 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-08 05:33:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-08 05:33:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-08 05:33:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-08 05:33:04,219 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-08 05:33:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-08 05:33:04,220 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-08 05:33:04,222 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-08 05:33:04,222 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-08 05:33:04,222 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-08 05:33:04,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-08 05:33:04,222 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-08 05:33:04,222 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-08 05:33:04,223 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-08 05:33:04,223 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-08 05:33:04,223 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-08 05:33:04,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 05:33:04,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 05:33:04,375 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 05:33:04,377 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 05:33:04,458 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2540-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~35#1; [2025-03-08 05:33:04,465 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1293: #res := ~retValue_acc~12; [2025-03-08 05:33:04,473 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1827: #res := ~retValue_acc~25; [2025-03-08 05:33:04,511 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2587-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-03-08 05:33:04,512 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2632: #res#1 := ~retValue_acc~37#1; [2025-03-08 05:33:04,537 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2856: #res := ~retValue_acc~40; [2025-03-08 05:33:04,549 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1534-1: createEmail_#res#1 := createEmail_~retValue_acc~20#1; [2025-03-08 05:33:04,561 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2084: #res := ~retValue_acc~29; [2025-03-08 05:33:04,592 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1330: #res := ~retValue_acc~13; [2025-03-08 05:33:04,615 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1104: #res := ~retValue_acc~7; [2025-03-08 05:33:04,655 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2410: #res := ~retValue_acc~33; [2025-03-08 05:33:04,731 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2975-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-03-08 05:33:04,731 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2493-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~34#1; [2025-03-08 05:33:04,954 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2695-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-03-08 05:33:04,954 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1793-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~23#1; [2025-03-08 05:33:04,954 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L2802-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-03-08 05:33:04,954 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1435-1: valid_product_#res#1 := valid_product_~retValue_acc~17#1; [2025-03-08 05:33:04,954 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1784-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~22#1; [2025-03-08 05:33:04,955 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1802-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~24#1; [2025-03-08 05:33:04,960 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1067: #res := ~retValue_acc~6; [2025-03-08 05:33:04,962 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1510: #res := ~retValue_acc~18; [2025-03-08 05:33:05,090 INFO L? ?]: Removed 500 outVars from TransFormulas that were not future-live. [2025-03-08 05:33:05,090 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 05:33:05,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 05:33:05,102 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 05:33:05,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:05 BoogieIcfgContainer [2025-03-08 05:33:05,102 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 05:33:05,104 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 05:33:05,104 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 05:33:05,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 05:33:05,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 05:33:03" (1/3) ... [2025-03-08 05:33:05,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b994653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:05, skipping insertion in model container [2025-03-08 05:33:05,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 05:33:03" (2/3) ... [2025-03-08 05:33:05,108 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2b994653 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 05:33:05, skipping insertion in model container [2025-03-08 05:33:05,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 05:33:05" (3/3) ... [2025-03-08 05:33:05,109 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product23.cil.c [2025-03-08 05:33:05,120 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 05:33:05,124 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product23.cil.c that has 25 procedures, 382 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 05:33:05,189 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 05:33:05,200 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;@751ba8d8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 05:33:05,201 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 05:33:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand has 382 states, 298 states have (on average 1.5671140939597314) internal successors, (467), 303 states have internal predecessors, (467), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) [2025-03-08 05:33:05,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-03-08 05:33:05,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:05,216 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:33:05,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1817512535, now seen corresponding path program 1 times [2025-03-08 05:33:05,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:05,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606689896] [2025-03-08 05:33:05,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:05,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:05,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:33:05,393 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:33:05,394 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:05,394 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:05,806 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-08 05:33:05,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:05,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606689896] [2025-03-08 05:33:05,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606689896] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:05,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314386555] [2025-03-08 05:33:05,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:05,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:05,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:05,812 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:33:05,813 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:33:05,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-03-08 05:33:06,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-03-08 05:33:06,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:06,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:06,102 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 05:33:06,108 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:06,129 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:33:06,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:06,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314386555] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:06,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:06,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:33:06,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499417633] [2025-03-08 05:33:06,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:06,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:06,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:06,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:06,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:06,155 INFO L87 Difference]: Start difference. First operand has 382 states, 298 states have (on average 1.5671140939597314) internal successors, (467), 303 states have internal predecessors, (467), 58 states have call successors, (58), 24 states have call predecessors, (58), 24 states have return successors, (58), 56 states have call predecessors, (58), 58 states have call successors, (58) Second operand has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:06,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:06,231 INFO L93 Difference]: Finished difference Result 573 states and 862 transitions. [2025-03-08 05:33:06,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:06,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2025-03-08 05:33:06,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:06,245 INFO L225 Difference]: With dead ends: 573 [2025-03-08 05:33:06,245 INFO L226 Difference]: Without dead ends: 375 [2025-03-08 05:33:06,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 112 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:33:06,253 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 0 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1151 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:33:06,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1151 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-03-08 05:33:06,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 375. [2025-03-08 05:33:06,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 375 states, 293 states have (on average 1.5631399317406143) internal successors, (458), 296 states have internal predecessors, (458), 58 states have call successors, (58), 24 states have call predecessors, (58), 23 states have return successors, (55), 54 states have call predecessors, (55), 55 states have call successors, (55) [2025-03-08 05:33:06,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 571 transitions. [2025-03-08 05:33:06,307 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 571 transitions. Word has length 112 [2025-03-08 05:33:06,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:06,308 INFO L471 AbstractCegarLoop]: Abstraction has 375 states and 571 transitions. [2025-03-08 05:33:06,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.666666666666668) internal successors, (65), 3 states have internal predecessors, (65), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:06,309 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 571 transitions. [2025-03-08 05:33:06,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-08 05:33:06,315 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:06,316 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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:33:06,325 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:33:06,516 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:33:06,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:06,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:06,517 INFO L85 PathProgramCache]: Analyzing trace with hash -880538195, now seen corresponding path program 1 times [2025-03-08 05:33:06,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:06,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606191270] [2025-03-08 05:33:06,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:06,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:06,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:33:06,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:33:06,562 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:06,562 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:06,773 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:33:06,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:06,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606191270] [2025-03-08 05:33:06,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606191270] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:06,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468882087] [2025-03-08 05:33:06,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:06,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:06,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:06,776 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:33:06,778 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:33:06,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-08 05:33:07,011 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-08 05:33:07,012 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:07,012 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:07,016 INFO L256 TraceCheckSpWp]: Trace formula consists of 1117 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:33:07,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:07,032 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-08 05:33:07,032 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:07,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468882087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:07,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:07,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-08 05:33:07,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701753770] [2025-03-08 05:33:07,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:07,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:07,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:07,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:07,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:07,036 INFO L87 Difference]: Start difference. First operand 375 states and 571 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:07,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:07,071 INFO L93 Difference]: Finished difference Result 797 states and 1233 transitions. [2025-03-08 05:33:07,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:07,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 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:33:07,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:07,078 INFO L225 Difference]: With dead ends: 797 [2025-03-08 05:33:07,078 INFO L226 Difference]: Without dead ends: 448 [2025-03-08 05:33:07,079 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:33:07,079 INFO L435 NwaCegarLoop]: 579 mSDtfsCounter, 134 mSDsluCounter, 522 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 1101 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:33:07,079 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 1101 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:07,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-08 05:33:07,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 440. [2025-03-08 05:33:07,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 344 states have (on average 1.5843023255813953) internal successors, (545), 347 states have internal predecessors, (545), 72 states have call successors, (72), 24 states have call predecessors, (72), 23 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-03-08 05:33:07,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 686 transitions. [2025-03-08 05:33:07,115 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 686 transitions. Word has length 119 [2025-03-08 05:33:07,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:07,115 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 686 transitions. [2025-03-08 05:33:07,115 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:07,115 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 686 transitions. [2025-03-08 05:33:07,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-08 05:33:07,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:07,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-08 05:33:07,128 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:33:07,320 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:33:07,320 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:07,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:07,321 INFO L85 PathProgramCache]: Analyzing trace with hash 345639006, now seen corresponding path program 1 times [2025-03-08 05:33:07,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:07,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045638405] [2025-03-08 05:33:07,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:07,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:07,339 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:33:07,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:33:07,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:07,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:33:07,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:07,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045638405] [2025-03-08 05:33:07,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045638405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:07,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077726748] [2025-03-08 05:33:07,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:07,516 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:07,516 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:07,519 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:33:07,520 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:33:07,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-08 05:33:07,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-08 05:33:07,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:07,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:07,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 05:33:07,741 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:07,786 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-03-08 05:33:07,787 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:07,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077726748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:07,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:07,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-08 05:33:07,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53630467] [2025-03-08 05:33:07,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:07,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:07,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:07,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:07,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:07,789 INFO L87 Difference]: Start difference. First operand 440 states and 686 transitions. Second operand has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:33:07,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:07,839 INFO L93 Difference]: Finished difference Result 871 states and 1362 transitions. [2025-03-08 05:33:07,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:07,840 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 120 [2025-03-08 05:33:07,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:07,843 INFO L225 Difference]: With dead ends: 871 [2025-03-08 05:33:07,843 INFO L226 Difference]: Without dead ends: 442 [2025-03-08 05:33:07,844 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 118 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:33:07,844 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 2 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2237 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:33:07,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2237 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:07,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2025-03-08 05:33:07,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 442. [2025-03-08 05:33:07,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 345 states have (on average 1.5826086956521739) internal successors, (546), 349 states have internal predecessors, (546), 72 states have call successors, (72), 24 states have call predecessors, (72), 24 states have return successors, (71), 68 states have call predecessors, (71), 69 states have call successors, (71) [2025-03-08 05:33:07,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 689 transitions. [2025-03-08 05:33:07,866 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 689 transitions. Word has length 120 [2025-03-08 05:33:07,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:07,866 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 689 transitions. [2025-03-08 05:33:07,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.5) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:33:07,866 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 689 transitions. [2025-03-08 05:33:07,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:33:07,869 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:07,869 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:07,878 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:33:08,070 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:33:08,070 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:08,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1352755808, now seen corresponding path program 1 times [2025-03-08 05:33:08,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:08,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [121589479] [2025-03-08 05:33:08,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:08,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:08,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:33:08,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:33:08,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:08,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:08,273 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:33:08,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [121589479] [2025-03-08 05:33:08,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [121589479] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:08,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027220783] [2025-03-08 05:33:08,274 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:08,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:08,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:08,276 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:33:08,278 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:33:08,406 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:33:08,503 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:33:08,503 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:08,503 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:08,508 INFO L256 TraceCheckSpWp]: Trace formula consists of 1201 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 05:33:08,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:08,557 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:33:08,557 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 05:33:08,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027220783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:08,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 05:33:08,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-08 05:33:08,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011793816] [2025-03-08 05:33:08,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:08,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:08,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:08,558 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:08,558 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:33:08,558 INFO L87 Difference]: Start difference. First operand 442 states and 689 transitions. Second operand has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:33:08,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:08,629 INFO L93 Difference]: Finished difference Result 873 states and 1367 transitions. [2025-03-08 05:33:08,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:08,630 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 140 [2025-03-08 05:33:08,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:08,633 INFO L225 Difference]: With dead ends: 873 [2025-03-08 05:33:08,633 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 05:33:08,634 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 138 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:33:08,635 INFO L435 NwaCegarLoop]: 560 mSDtfsCounter, 2 mSDsluCounter, 1663 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2223 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:33:08,635 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2223 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:08,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 05:33:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-08 05:33:08,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 346 states have (on average 1.5809248554913296) internal successors, (547), 351 states have internal predecessors, (547), 72 states have call successors, (72), 24 states have call predecessors, (72), 25 states have return successors, (76), 68 states have call predecessors, (76), 69 states have call successors, (76) [2025-03-08 05:33:08,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 695 transitions. [2025-03-08 05:33:08,666 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 695 transitions. Word has length 140 [2025-03-08 05:33:08,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:08,666 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 695 transitions. [2025-03-08 05:33:08,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.2) internal successors, (91), 5 states have internal predecessors, (91), 3 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:33:08,667 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 695 transitions. [2025-03-08 05:33:08,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-08 05:33:08,669 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:08,669 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:33:08,677 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:33:08,869 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:33:08,869 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:08,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash -149996341, now seen corresponding path program 1 times [2025-03-08 05:33:08,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:08,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066438801] [2025-03-08 05:33:08,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:08,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:08,887 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-08 05:33:08,892 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-08 05:33:08,892 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:08,892 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:09,001 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:33:09,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:09,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066438801] [2025-03-08 05:33:09,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066438801] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:09,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:09,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:33:09,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132328874] [2025-03-08 05:33:09,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:09,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:09,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:09,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:09,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:33:09,004 INFO L87 Difference]: Start difference. First operand 444 states and 695 transitions. Second operand has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:33:09,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:09,046 INFO L93 Difference]: Finished difference Result 865 states and 1358 transitions. [2025-03-08 05:33:09,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:09,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 122 [2025-03-08 05:33:09,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:09,049 INFO L225 Difference]: With dead ends: 865 [2025-03-08 05:33:09,049 INFO L226 Difference]: Without dead ends: 444 [2025-03-08 05:33:09,050 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:33:09,051 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 2 mSDsluCounter, 1678 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2241 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:33:09,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2241 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-03-08 05:33:09,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 444. [2025-03-08 05:33:09,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 444 states, 346 states have (on average 1.5809248554913296) internal successors, (547), 351 states have internal predecessors, (547), 72 states have call successors, (72), 24 states have call predecessors, (72), 25 states have return successors, (75), 68 states have call predecessors, (75), 69 states have call successors, (75) [2025-03-08 05:33:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 694 transitions. [2025-03-08 05:33:09,065 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 694 transitions. Word has length 122 [2025-03-08 05:33:09,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:09,065 INFO L471 AbstractCegarLoop]: Abstraction has 444 states and 694 transitions. [2025-03-08 05:33:09,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.0) internal successors, (80), 5 states have internal predecessors, (80), 3 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:33:09,065 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 694 transitions. [2025-03-08 05:33:09,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2025-03-08 05:33:09,067 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:09,067 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:09,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 05:33:09,067 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:09,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:09,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1632078091, now seen corresponding path program 1 times [2025-03-08 05:33:09,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:09,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024630321] [2025-03-08 05:33:09,068 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:09,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:09,089 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 142 statements into 1 equivalence classes. [2025-03-08 05:33:09,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 142 of 142 statements. [2025-03-08 05:33:09,096 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:09,096 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:09,216 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:33:09,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:09,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024630321] [2025-03-08 05:33:09,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024630321] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:09,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:09,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 05:33:09,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687194707] [2025-03-08 05:33:09,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:09,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 05:33:09,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:09,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 05:33:09,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 05:33:09,219 INFO L87 Difference]: Start difference. First operand 444 states and 694 transitions. Second operand has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:33:09,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:09,258 INFO L93 Difference]: Finished difference Result 867 states and 1361 transitions. [2025-03-08 05:33:09,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 05:33:09,258 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) Word has length 142 [2025-03-08 05:33:09,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:09,261 INFO L225 Difference]: With dead ends: 867 [2025-03-08 05:33:09,262 INFO L226 Difference]: Without dead ends: 446 [2025-03-08 05:33:09,263 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:33:09,264 INFO L435 NwaCegarLoop]: 564 mSDtfsCounter, 1 mSDsluCounter, 1680 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2244 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:33:09,265 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2244 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:09,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-03-08 05:33:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-03-08 05:33:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 347 states have (on average 1.579250720461095) internal successors, (548), 353 states have internal predecessors, (548), 72 states have call successors, (72), 24 states have call predecessors, (72), 26 states have return successors, (77), 68 states have call predecessors, (77), 69 states have call successors, (77) [2025-03-08 05:33:09,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 697 transitions. [2025-03-08 05:33:09,292 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 697 transitions. Word has length 142 [2025-03-08 05:33:09,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:09,293 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 697 transitions. [2025-03-08 05:33:09,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 22.0) internal successors, (88), 5 states have internal predecessors, (88), 3 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-08 05:33:09,293 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 697 transitions. [2025-03-08 05:33:09,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 05:33:09,295 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:09,295 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:33:09,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 05:33:09,296 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:09,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:09,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1979727176, now seen corresponding path program 1 times [2025-03-08 05:33:09,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:09,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [380692495] [2025-03-08 05:33:09,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:09,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:09,318 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 05:33:09,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 05:33:09,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:09,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:09,436 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-08 05:33:09,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:09,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [380692495] [2025-03-08 05:33:09,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [380692495] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:09,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:09,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-08 05:33:09,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715551731] [2025-03-08 05:33:09,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:09,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-08 05:33:09,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:09,439 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-08 05:33:09,439 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-08 05:33:09,440 INFO L87 Difference]: Start difference. First operand 446 states and 697 transitions. Second operand has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:33:09,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:09,548 INFO L93 Difference]: Finished difference Result 869 states and 1360 transitions. [2025-03-08 05:33:09,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 05:33:09,548 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 124 [2025-03-08 05:33:09,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:09,551 INFO L225 Difference]: With dead ends: 869 [2025-03-08 05:33:09,551 INFO L226 Difference]: Without dead ends: 448 [2025-03-08 05:33:09,553 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:33:09,553 INFO L435 NwaCegarLoop]: 554 mSDtfsCounter, 7 mSDsluCounter, 3295 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 3849 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:33:09,553 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 3849 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 05:33:09,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2025-03-08 05:33:09,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 448. [2025-03-08 05:33:09,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 448 states, 349 states have (on average 1.5759312320916905) internal successors, (550), 354 states have internal predecessors, (550), 72 states have call successors, (72), 25 states have call predecessors, (72), 26 states have return successors, (76), 68 states have call predecessors, (76), 69 states have call successors, (76) [2025-03-08 05:33:09,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 698 transitions. [2025-03-08 05:33:09,568 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 698 transitions. Word has length 124 [2025-03-08 05:33:09,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:09,568 INFO L471 AbstractCegarLoop]: Abstraction has 448 states and 698 transitions. [2025-03-08 05:33:09,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 12.142857142857142) internal successors, (85), 8 states have internal predecessors, (85), 4 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:33:09,569 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 698 transitions. [2025-03-08 05:33:09,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-03-08 05:33:09,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:09,570 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33:09,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 05:33:09,571 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:09,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:09,571 INFO L85 PathProgramCache]: Analyzing trace with hash -2076438060, now seen corresponding path program 2 times [2025-03-08 05:33:09,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:09,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691325333] [2025-03-08 05:33:09,571 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 05:33:09,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:09,588 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 125 statements into 2 equivalence classes. [2025-03-08 05:33:09,597 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 125 of 125 statements. [2025-03-08 05:33:09,597 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 05:33:09,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:09,694 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-08 05:33:09,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:09,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691325333] [2025-03-08 05:33:09,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691325333] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:09,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:09,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-08 05:33:09,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717429320] [2025-03-08 05:33:09,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:09,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 05:33:09,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:09,696 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 05:33:09,696 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:33:09,696 INFO L87 Difference]: Start difference. First operand 448 states and 698 transitions. Second operand has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:33:09,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:09,757 INFO L93 Difference]: Finished difference Result 869 states and 1364 transitions. [2025-03-08 05:33:09,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 05:33:09,758 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) Word has length 125 [2025-03-08 05:33:09,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:09,761 INFO L225 Difference]: With dead ends: 869 [2025-03-08 05:33:09,761 INFO L226 Difference]: Without dead ends: 450 [2025-03-08 05:33:09,762 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 05:33:09,763 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 2 mSDsluCounter, 2225 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 2787 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:09,763 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 2787 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:09,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2025-03-08 05:33:09,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 450. [2025-03-08 05:33:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 350 states have (on average 1.5742857142857143) internal successors, (551), 356 states have internal predecessors, (551), 72 states have call successors, (72), 25 states have call predecessors, (72), 27 states have return successors, (81), 68 states have call predecessors, (81), 69 states have call successors, (81) [2025-03-08 05:33:09,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 704 transitions. [2025-03-08 05:33:09,785 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 704 transitions. Word has length 125 [2025-03-08 05:33:09,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:09,785 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 704 transitions. [2025-03-08 05:33:09,785 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 13.833333333333334) internal successors, (83), 7 states have internal predecessors, (83), 4 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (14), 3 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-08 05:33:09,785 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 704 transitions. [2025-03-08 05:33:09,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-08 05:33:09,788 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:09,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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] [2025-03-08 05:33:09,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 05:33:09,788 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:09,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:09,788 INFO L85 PathProgramCache]: Analyzing trace with hash 489981285, now seen corresponding path program 1 times [2025-03-08 05:33:09,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:09,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595339751] [2025-03-08 05:33:09,789 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:09,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:09,814 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:33:09,821 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:33:09,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:09,821 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:09,942 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-03-08 05:33:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595339751] [2025-03-08 05:33:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595339751] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 05:33:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1435791512] [2025-03-08 05:33:09,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:09,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:09,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 05:33:09,944 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:33:09,946 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:33:10,079 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-08 05:33:10,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-08 05:33:10,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:10,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:10,175 INFO L256 TraceCheckSpWp]: Trace formula consists of 1128 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 05:33:10,178 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 05:33:10,214 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:10,217 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 05:33:10,313 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:10,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1435791512] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 05:33:10,314 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 05:33:10,314 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-08 05:33:10,314 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255192799] [2025-03-08 05:33:10,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 05:33:10,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 05:33:10,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:10,315 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 05:33:10,315 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-08 05:33:10,315 INFO L87 Difference]: Start difference. First operand 450 states and 704 transitions. Second operand has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-08 05:33:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:10,894 INFO L93 Difference]: Finished difference Result 1303 states and 2131 transitions. [2025-03-08 05:33:10,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-08 05:33:10,895 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) Word has length 126 [2025-03-08 05:33:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:10,900 INFO L225 Difference]: With dead ends: 1303 [2025-03-08 05:33:10,900 INFO L226 Difference]: Without dead ends: 883 [2025-03-08 05:33:10,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 270 GetRequests, 249 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:33:10,902 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 1227 mSDsluCounter, 3998 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 104 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1227 SdHoareTripleChecker+Valid, 4568 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 104 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:10,902 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1227 Valid, 4568 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [104 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 05:33:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2025-03-08 05:33:10,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 857. [2025-03-08 05:33:10,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 857 states, 678 states have (on average 1.631268436578171) internal successors, (1106), 684 states have internal predecessors, (1106), 151 states have call successors, (151), 25 states have call predecessors, (151), 27 states have return successors, (170), 147 states have call predecessors, (170), 148 states have call successors, (170) [2025-03-08 05:33:10,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 1427 transitions. [2025-03-08 05:33:10,934 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 1427 transitions. Word has length 126 [2025-03-08 05:33:10,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:10,934 INFO L471 AbstractCegarLoop]: Abstraction has 857 states and 1427 transitions. [2025-03-08 05:33:10,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 13.2) internal successors, (132), 11 states have internal predecessors, (132), 4 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (26), 3 states have call predecessors, (26), 4 states have call successors, (26) [2025-03-08 05:33:10,935 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 1427 transitions. [2025-03-08 05:33:10,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-03-08 05:33:10,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:10,939 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:33:10,947 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:33:11,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 05:33:11,140 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:11,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:11,140 INFO L85 PathProgramCache]: Analyzing trace with hash -1920022037, now seen corresponding path program 1 times [2025-03-08 05:33:11,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:11,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939620771] [2025-03-08 05:33:11,140 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:11,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:11,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-03-08 05:33:11,162 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-03-08 05:33:11,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:11,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:11,201 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:11,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:11,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939620771] [2025-03-08 05:33:11,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939620771] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:11,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:11,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:11,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779829211] [2025-03-08 05:33:11,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:11,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:11,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:11,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:11,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:11,203 INFO L87 Difference]: Start difference. First operand 857 states and 1427 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:11,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:11,241 INFO L93 Difference]: Finished difference Result 2024 states and 3427 transitions. [2025-03-08 05:33:11,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:11,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2025-03-08 05:33:11,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:11,249 INFO L225 Difference]: With dead ends: 2024 [2025-03-08 05:33:11,249 INFO L226 Difference]: Without dead ends: 1243 [2025-03-08 05:33:11,252 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:33:11,252 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 131 mSDsluCounter, 558 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1136 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:33:11,252 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1136 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:11,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1243 states. [2025-03-08 05:33:11,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1243 to 1235. [2025-03-08 05:33:11,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1235 states, 977 states have (on average 1.6519959058341862) internal successors, (1614), 983 states have internal predecessors, (1614), 230 states have call successors, (230), 25 states have call predecessors, (230), 27 states have return successors, (259), 226 states have call predecessors, (259), 227 states have call successors, (259) [2025-03-08 05:33:11,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1235 states to 1235 states and 2103 transitions. [2025-03-08 05:33:11,322 INFO L78 Accepts]: Start accepts. Automaton has 1235 states and 2103 transitions. Word has length 130 [2025-03-08 05:33:11,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:11,323 INFO L471 AbstractCegarLoop]: Abstraction has 1235 states and 2103 transitions. [2025-03-08 05:33:11,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:11,323 INFO L276 IsEmpty]: Start isEmpty. Operand 1235 states and 2103 transitions. [2025-03-08 05:33:11,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-08 05:33:11,329 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:11,329 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, 1] [2025-03-08 05:33:11,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 05:33:11,329 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:11,329 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:11,330 INFO L85 PathProgramCache]: Analyzing trace with hash -353814192, now seen corresponding path program 1 times [2025-03-08 05:33:11,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:11,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227780435] [2025-03-08 05:33:11,330 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:11,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:11,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-08 05:33:11,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-08 05:33:11,354 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:11,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:11,388 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:33:11,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:11,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227780435] [2025-03-08 05:33:11,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227780435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:11,389 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:11,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:11,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165854739] [2025-03-08 05:33:11,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:11,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:11,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:11,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:11,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:11,390 INFO L87 Difference]: Start difference. First operand 1235 states and 2103 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:11,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:11,446 INFO L93 Difference]: Finished difference Result 2970 states and 5092 transitions. [2025-03-08 05:33:11,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:11,446 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 150 [2025-03-08 05:33:11,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:11,455 INFO L225 Difference]: With dead ends: 2970 [2025-03-08 05:33:11,455 INFO L226 Difference]: Without dead ends: 1860 [2025-03-08 05:33:11,458 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:33:11,459 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 129 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1132 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:33:11,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:11,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1860 states. [2025-03-08 05:33:11,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1860 to 1852. [2025-03-08 05:33:11,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1475 states have (on average 1.6623728813559322) internal successors, (2452), 1481 states have internal predecessors, (2452), 349 states have call successors, (349), 25 states have call predecessors, (349), 27 states have return successors, (378), 345 states have call predecessors, (378), 346 states have call successors, (378) [2025-03-08 05:33:11,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 3179 transitions. [2025-03-08 05:33:11,536 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 3179 transitions. Word has length 150 [2025-03-08 05:33:11,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:11,536 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 3179 transitions. [2025-03-08 05:33:11,536 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:11,537 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 3179 transitions. [2025-03-08 05:33:11,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-08 05:33:11,568 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:11,568 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:33:11,568 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 05:33:11,568 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:11,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:11,569 INFO L85 PathProgramCache]: Analyzing trace with hash -524627286, now seen corresponding path program 1 times [2025-03-08 05:33:11,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:11,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712703505] [2025-03-08 05:33:11,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:11,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:11,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-08 05:33:11,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-08 05:33:11,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:11,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:11,631 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:11,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:11,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712703505] [2025-03-08 05:33:11,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712703505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:11,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:11,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:11,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151056951] [2025-03-08 05:33:11,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:11,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:11,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:11,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:11,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:11,634 INFO L87 Difference]: Start difference. First operand 1852 states and 3179 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:11,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:11,711 INFO L93 Difference]: Finished difference Result 4404 states and 7623 transitions. [2025-03-08 05:33:11,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:11,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 132 [2025-03-08 05:33:11,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:11,724 INFO L225 Difference]: With dead ends: 4404 [2025-03-08 05:33:11,724 INFO L226 Difference]: Without dead ends: 2805 [2025-03-08 05:33:11,729 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:33:11,730 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 127 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1127 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:33:11,730 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:11,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2805 states. [2025-03-08 05:33:11,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2805 to 2797. [2025-03-08 05:33:11,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2797 states, 2258 states have (on average 1.670947741364039) internal successors, (3773), 2264 states have internal predecessors, (3773), 511 states have call successors, (511), 25 states have call predecessors, (511), 27 states have return successors, (556), 507 states have call predecessors, (556), 508 states have call successors, (556) [2025-03-08 05:33:11,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2797 states to 2797 states and 4840 transitions. [2025-03-08 05:33:11,859 INFO L78 Accepts]: Start accepts. Automaton has 2797 states and 4840 transitions. Word has length 132 [2025-03-08 05:33:11,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:11,861 INFO L471 AbstractCegarLoop]: Abstraction has 2797 states and 4840 transitions. [2025-03-08 05:33:11,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:11,861 INFO L276 IsEmpty]: Start isEmpty. Operand 2797 states and 4840 transitions. [2025-03-08 05:33:11,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-08 05:33:11,873 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:11,873 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:33:11,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 05:33:11,873 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:11,873 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:11,874 INFO L85 PathProgramCache]: Analyzing trace with hash 124209870, now seen corresponding path program 1 times [2025-03-08 05:33:11,874 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:11,874 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137803263] [2025-03-08 05:33:11,874 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:11,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:11,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-08 05:33:11,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-08 05:33:11,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:11,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:11,920 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:11,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:11,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137803263] [2025-03-08 05:33:11,920 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137803263] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:11,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:11,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:11,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742925302] [2025-03-08 05:33:11,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:11,921 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:11,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:11,921 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:11,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:11,921 INFO L87 Difference]: Start difference. First operand 2797 states and 4840 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:12,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:12,030 INFO L93 Difference]: Finished difference Result 6666 states and 11624 transitions. [2025-03-08 05:33:12,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:12,031 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 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:33:12,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:12,084 INFO L225 Difference]: With dead ends: 6666 [2025-03-08 05:33:12,084 INFO L226 Difference]: Without dead ends: 4330 [2025-03-08 05:33:12,090 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:33:12,091 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 125 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1127 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:33:12,091 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1127 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4330 states. [2025-03-08 05:33:12,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4330 to 4322. [2025-03-08 05:33:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4322 states, 3538 states have (on average 1.6772187676653476) internal successors, (5934), 3544 states have internal predecessors, (5934), 756 states have call successors, (756), 25 states have call predecessors, (756), 27 states have return successors, (827), 752 states have call predecessors, (827), 753 states have call successors, (827) [2025-03-08 05:33:12,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4322 states to 4322 states and 7517 transitions. [2025-03-08 05:33:12,335 INFO L78 Accepts]: Start accepts. Automaton has 4322 states and 7517 transitions. Word has length 133 [2025-03-08 05:33:12,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:12,335 INFO L471 AbstractCegarLoop]: Abstraction has 4322 states and 7517 transitions. [2025-03-08 05:33:12,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:12,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4322 states and 7517 transitions. [2025-03-08 05:33:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-08 05:33:12,354 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:12,354 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, 1, 1, 1, 1] [2025-03-08 05:33:12,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 05:33:12,354 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:12,354 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:12,355 INFO L85 PathProgramCache]: Analyzing trace with hash 1919008052, now seen corresponding path program 1 times [2025-03-08 05:33:12,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:12,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111231246] [2025-03-08 05:33:12,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:12,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:12,376 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-08 05:33:12,383 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-08 05:33:12,383 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:12,383 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:12,411 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:33:12,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:12,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111231246] [2025-03-08 05:33:12,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1111231246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:12,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:12,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:12,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239651275] [2025-03-08 05:33:12,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:12,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:12,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:12,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:12,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:12,413 INFO L87 Difference]: Start difference. First operand 4322 states and 7517 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:12,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:12,605 INFO L93 Difference]: Finished difference Result 10704 states and 18720 transitions. [2025-03-08 05:33:12,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:12,606 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 153 [2025-03-08 05:33:12,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:12,642 INFO L225 Difference]: With dead ends: 10704 [2025-03-08 05:33:12,643 INFO L226 Difference]: Without dead ends: 7079 [2025-03-08 05:33:12,656 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:33:12,657 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 123 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1134 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:33:12,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1134 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:12,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7079 states. [2025-03-08 05:33:12,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7079 to 7071. [2025-03-08 05:33:12,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7071 states, 5794 states have (on average 1.6739730755954436) internal successors, (9699), 5800 states have internal predecessors, (9699), 1249 states have call successors, (1249), 25 states have call predecessors, (1249), 27 states have return successors, (1364), 1245 states have call predecessors, (1364), 1246 states have call successors, (1364) [2025-03-08 05:33:12,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7071 states to 7071 states and 12312 transitions. [2025-03-08 05:33:12,997 INFO L78 Accepts]: Start accepts. Automaton has 7071 states and 12312 transitions. Word has length 153 [2025-03-08 05:33:12,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:12,997 INFO L471 AbstractCegarLoop]: Abstraction has 7071 states and 12312 transitions. [2025-03-08 05:33:12,997 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:12,997 INFO L276 IsEmpty]: Start isEmpty. Operand 7071 states and 12312 transitions. [2025-03-08 05:33:13,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-08 05:33:13,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:13,023 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, 1, 1, 1, 1, 1] [2025-03-08 05:33:13,023 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 05:33:13,023 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:13,023 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:13,023 INFO L85 PathProgramCache]: Analyzing trace with hash -1601841906, now seen corresponding path program 1 times [2025-03-08 05:33:13,023 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:13,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781730763] [2025-03-08 05:33:13,024 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:13,024 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:13,039 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-08 05:33:13,045 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-08 05:33:13,045 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:13,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:13,073 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:33:13,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:13,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781730763] [2025-03-08 05:33:13,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781730763] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:13,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:13,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:13,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195252001] [2025-03-08 05:33:13,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:13,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:13,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:13,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:13,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:13,076 INFO L87 Difference]: Start difference. First operand 7071 states and 12312 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:13,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:13,325 INFO L93 Difference]: Finished difference Result 17886 states and 31335 transitions. [2025-03-08 05:33:13,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:13,326 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 154 [2025-03-08 05:33:13,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:13,380 INFO L225 Difference]: With dead ends: 17886 [2025-03-08 05:33:13,380 INFO L226 Difference]: Without dead ends: 11892 [2025-03-08 05:33:13,403 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:33:13,404 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 121 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 1130 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:33:13,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 1130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:13,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11892 states. [2025-03-08 05:33:13,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11892 to 11884. [2025-03-08 05:33:13,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11884 states, 9785 states have (on average 1.6743995912110372) internal successors, (16384), 9791 states have internal predecessors, (16384), 2071 states have call successors, (2071), 25 states have call predecessors, (2071), 27 states have return successors, (2264), 2067 states have call predecessors, (2264), 2068 states have call successors, (2264) [2025-03-08 05:33:14,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11884 states to 11884 states and 20719 transitions. [2025-03-08 05:33:14,062 INFO L78 Accepts]: Start accepts. Automaton has 11884 states and 20719 transitions. Word has length 154 [2025-03-08 05:33:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:14,063 INFO L471 AbstractCegarLoop]: Abstraction has 11884 states and 20719 transitions. [2025-03-08 05:33:14,063 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, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 11884 states and 20719 transitions. [2025-03-08 05:33:14,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-08 05:33:14,103 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:14,103 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:33:14,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 05:33:14,104 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:14,104 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:14,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1605103112, now seen corresponding path program 1 times [2025-03-08 05:33:14,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:14,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850556483] [2025-03-08 05:33:14,105 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:14,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:14,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-08 05:33:14,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-08 05:33:14,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:14,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:14,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:14,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850556483] [2025-03-08 05:33:14,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850556483] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:14,176 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:14,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:14,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721805759] [2025-03-08 05:33:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:14,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:14,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:14,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:14,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:14,177 INFO L87 Difference]: Start difference. First operand 11884 states and 20719 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:14,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:14,582 INFO L93 Difference]: Finished difference Result 28404 states and 49474 transitions. [2025-03-08 05:33:14,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:14,583 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 136 [2025-03-08 05:33:14,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:14,666 INFO L225 Difference]: With dead ends: 28404 [2025-03-08 05:33:14,666 INFO L226 Difference]: Without dead ends: 18542 [2025-03-08 05:33:14,708 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:33:14,709 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 119 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 1102 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:33:14,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 1102 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:14,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18542 states. [2025-03-08 05:33:15,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18542 to 18534. [2025-03-08 05:33:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18534 states, 15232 states have (on average 1.6511948529411764) internal successors, (25151), 15238 states have internal predecessors, (25151), 3274 states have call successors, (3274), 25 states have call predecessors, (3274), 27 states have return successors, (3611), 3270 states have call predecessors, (3611), 3271 states have call successors, (3611) [2025-03-08 05:33:15,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18534 states to 18534 states and 32036 transitions. [2025-03-08 05:33:15,437 INFO L78 Accepts]: Start accepts. Automaton has 18534 states and 32036 transitions. Word has length 136 [2025-03-08 05:33:15,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:15,437 INFO L471 AbstractCegarLoop]: Abstraction has 18534 states and 32036 transitions. [2025-03-08 05:33:15,437 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:15,437 INFO L276 IsEmpty]: Start isEmpty. Operand 18534 states and 32036 transitions. [2025-03-08 05:33:15,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-03-08 05:33:15,470 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:15,470 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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:33:15,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 05:33:15,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:15,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:15,471 INFO L85 PathProgramCache]: Analyzing trace with hash 625430480, now seen corresponding path program 1 times [2025-03-08 05:33:15,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:15,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776296547] [2025-03-08 05:33:15,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:15,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:15,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-03-08 05:33:15,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-03-08 05:33:15,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:15,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:15,518 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:15,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:15,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776296547] [2025-03-08 05:33:15,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776296547] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:15,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:15,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:15,519 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569257677] [2025-03-08 05:33:15,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:15,520 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:15,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:15,520 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:15,520 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:15,520 INFO L87 Difference]: Start difference. First operand 18534 states and 32036 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:16,325 INFO L93 Difference]: Finished difference Result 49001 states and 85017 transitions. [2025-03-08 05:33:16,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:16,325 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 137 [2025-03-08 05:33:16,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:16,473 INFO L225 Difference]: With dead ends: 49001 [2025-03-08 05:33:16,473 INFO L226 Difference]: Without dead ends: 33094 [2025-03-08 05:33:16,526 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:33:16,527 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 117 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1130 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:33:16,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1130 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:16,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33094 states. [2025-03-08 05:33:17,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33094 to 33086. [2025-03-08 05:33:17,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33086 states, 27334 states have (on average 1.6480573644545256) internal successors, (45048), 27340 states have internal predecessors, (45048), 5724 states have call successors, (5724), 25 states have call predecessors, (5724), 27 states have return successors, (6335), 5720 states have call predecessors, (6335), 5721 states have call successors, (6335) [2025-03-08 05:33:17,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33086 states to 33086 states and 57107 transitions. [2025-03-08 05:33:17,769 INFO L78 Accepts]: Start accepts. Automaton has 33086 states and 57107 transitions. Word has length 137 [2025-03-08 05:33:17,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:17,770 INFO L471 AbstractCegarLoop]: Abstraction has 33086 states and 57107 transitions. [2025-03-08 05:33:17,770 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, (18), 2 states have call predecessors, (18), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2025-03-08 05:33:17,770 INFO L276 IsEmpty]: Start isEmpty. Operand 33086 states and 57107 transitions. [2025-03-08 05:33:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-08 05:33:17,810 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:17,810 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:17,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 05:33:17,811 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:17,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -446842282, now seen corresponding path program 1 times [2025-03-08 05:33:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [123256258] [2025-03-08 05:33:17,812 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:17,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 157 statements into 1 equivalence classes. [2025-03-08 05:33:17,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 157 of 157 statements. [2025-03-08 05:33:17,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:17,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:17,870 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:33:17,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:17,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [123256258] [2025-03-08 05:33:17,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [123256258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:17,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:17,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:17,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992182634] [2025-03-08 05:33:17,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:17,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:17,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:17,872 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:17,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:17,872 INFO L87 Difference]: Start difference. First operand 33086 states and 57107 transitions. Second operand has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:18,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:18,944 INFO L93 Difference]: Finished difference Result 90258 states and 156269 transitions. [2025-03-08 05:33:18,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:18,944 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 157 [2025-03-08 05:33:18,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:19,206 INFO L225 Difference]: With dead ends: 90258 [2025-03-08 05:33:19,207 INFO L226 Difference]: Without dead ends: 60669 [2025-03-08 05:33:19,289 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:33:19,290 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 115 mSDsluCounter, 562 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 1132 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:33:19,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 1132 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:19,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60669 states. [2025-03-08 05:33:21,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60669 to 60661. [2025-03-08 05:33:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60661 states, 50396 states have (on average 1.6438010953250257) internal successors, (82841), 50402 states have internal predecessors, (82841), 10237 states have call successors, (10237), 25 states have call predecessors, (10237), 27 states have return successors, (11380), 10233 states have call predecessors, (11380), 10234 states have call successors, (11380) [2025-03-08 05:33:21,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60661 states to 60661 states and 104458 transitions. [2025-03-08 05:33:21,863 INFO L78 Accepts]: Start accepts. Automaton has 60661 states and 104458 transitions. Word has length 157 [2025-03-08 05:33:21,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:21,863 INFO L471 AbstractCegarLoop]: Abstraction has 60661 states and 104458 transitions. [2025-03-08 05:33:21,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.333333333333336) internal successors, (100), 3 states have internal predecessors, (100), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:21,864 INFO L276 IsEmpty]: Start isEmpty. Operand 60661 states and 104458 transitions. [2025-03-08 05:33:21,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-03-08 05:33:21,916 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:21,916 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:21,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 05:33:21,916 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:21,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:21,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1677720428, now seen corresponding path program 1 times [2025-03-08 05:33:21,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:21,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598090812] [2025-03-08 05:33:21,918 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:21,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:21,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-03-08 05:33:21,948 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-03-08 05:33:21,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:21,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:21,989 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:33:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598090812] [2025-03-08 05:33:21,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598090812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:21,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:21,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 05:33:21,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375601658] [2025-03-08 05:33:21,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:21,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 05:33:21,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:21,993 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 05:33:21,993 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 05:33:21,993 INFO L87 Difference]: Start difference. First operand 60661 states and 104458 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:23,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:23,815 INFO L93 Difference]: Finished difference Result 113605 states and 196048 transitions. [2025-03-08 05:33:23,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 05:33:23,816 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 158 [2025-03-08 05:33:23,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:24,323 INFO L225 Difference]: With dead ends: 113605 [2025-03-08 05:33:24,323 INFO L226 Difference]: Without dead ends: 113421 [2025-03-08 05:33:24,400 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:33:24,401 INFO L435 NwaCegarLoop]: 577 mSDtfsCounter, 110 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 1144 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:33:24,401 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 1144 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 05:33:24,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113421 states. [2025-03-08 05:33:28,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113421 to 113413. [2025-03-08 05:33:28,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113413 states, 94780 states have (on average 1.6384047267355983) internal successors, (155288), 94786 states have internal predecessors, (155288), 18605 states have call successors, (18605), 25 states have call predecessors, (18605), 27 states have return successors, (20794), 18601 states have call predecessors, (20794), 18602 states have call successors, (20794) [2025-03-08 05:33:28,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113413 states to 113413 states and 194687 transitions. [2025-03-08 05:33:28,734 INFO L78 Accepts]: Start accepts. Automaton has 113413 states and 194687 transitions. Word has length 158 [2025-03-08 05:33:28,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:28,734 INFO L471 AbstractCegarLoop]: Abstraction has 113413 states and 194687 transitions. [2025-03-08 05:33:28,734 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 3 states have internal predecessors, (101), 2 states have call successors, (21), 2 states have call predecessors, (21), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-08 05:33:28,734 INFO L276 IsEmpty]: Start isEmpty. Operand 113413 states and 194687 transitions. [2025-03-08 05:33:28,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-08 05:33:28,793 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:28,793 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1] [2025-03-08 05:33:28,794 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-08 05:33:28,794 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:28,795 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:28,795 INFO L85 PathProgramCache]: Analyzing trace with hash -631193850, now seen corresponding path program 1 times [2025-03-08 05:33:28,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:28,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828375036] [2025-03-08 05:33:28,795 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:28,795 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:28,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-08 05:33:28,819 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-08 05:33:28,821 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:28,822 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:28,941 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-08 05:33:28,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:28,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828375036] [2025-03-08 05:33:28,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828375036] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:28,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:28,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:33:28,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894509884] [2025-03-08 05:33:28,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:28,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:33:28,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:28,944 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:33:28,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:28,944 INFO L87 Difference]: Start difference. First operand 113413 states and 194687 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:33:31,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 05:33:31,860 INFO L93 Difference]: Finished difference Result 114003 states and 195540 transitions. [2025-03-08 05:33:31,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-08 05:33:31,861 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) Word has length 140 [2025-03-08 05:33:31,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 05:33:32,403 INFO L225 Difference]: With dead ends: 114003 [2025-03-08 05:33:32,404 INFO L226 Difference]: Without dead ends: 113827 [2025-03-08 05:33:32,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-03-08 05:33:32,467 INFO L435 NwaCegarLoop]: 768 mSDtfsCounter, 845 mSDsluCounter, 2449 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 851 SdHoareTripleChecker+Valid, 3217 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 05:33:32,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [851 Valid, 3217 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 05:33:32,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113827 states. [2025-03-08 05:33:35,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113827 to 113816. [2025-03-08 05:33:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113816 states, 95093 states have (on average 1.637901843458509) internal successors, (155753), 95105 states have internal predecessors, (155753), 18659 states have call successors, (18659), 58 states have call predecessors, (18659), 63 states have return successors, (20857), 18652 states have call predecessors, (20857), 18652 states have call successors, (20857) [2025-03-08 05:33:36,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113816 states to 113816 states and 195269 transitions. [2025-03-08 05:33:36,873 INFO L78 Accepts]: Start accepts. Automaton has 113816 states and 195269 transitions. Word has length 140 [2025-03-08 05:33:36,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 05:33:36,873 INFO L471 AbstractCegarLoop]: Abstraction has 113816 states and 195269 transitions. [2025-03-08 05:33:36,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (18), 3 states have call predecessors, (18), 2 states have return successors, (14), 4 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-08 05:33:36,874 INFO L276 IsEmpty]: Start isEmpty. Operand 113816 states and 195269 transitions. [2025-03-08 05:33:36,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 05:33:36,925 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 05:33:36,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 05:33:36,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 05:33:36,926 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 05:33:36,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 05:33:36,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1564949409, now seen corresponding path program 1 times [2025-03-08 05:33:36,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 05:33:36,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117864108] [2025-03-08 05:33:36,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 05:33:36,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 05:33:36,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 05:33:36,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 05:33:36,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 05:33:36,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 05:33:37,036 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:33:37,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 05:33:37,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117864108] [2025-03-08 05:33:37,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1117864108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 05:33:37,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 05:33:37,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 05:33:37,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287420590] [2025-03-08 05:33:37,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 05:33:37,037 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 05:33:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 05:33:37,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 05:33:37,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 05:33:37,038 INFO L87 Difference]: Start difference. First operand 113816 states and 195269 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 5 states have internal predecessors, (103), 2 states have call successors, (21), 3 states have call predecessors, (21), 2 states have return successors, (17), 3 states have call predecessors, (17), 2 states have call successors, (17)