./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product27.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_product27.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 1c4d0e54eab5e94cf1a4af64165a2546f1c45e063bd8600195a743522777000c --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:23:23,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:23:23,935 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:23:23,941 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:23:23,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:23:23,958 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:23:23,959 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:23:23,959 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:23:23,959 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:23:23,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:23:23,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:23:23,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:23:23,961 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:23:23,961 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:23:23,961 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:23:23,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:23:23,961 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:23:23,961 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:23:23,961 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:23:23,962 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:23:23,962 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:23:23,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:23,963 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:23:23,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:23:23,963 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:23:23,963 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:23:23,963 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:23:23,963 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:23:23,963 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:23:23,964 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:23:23,964 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:23:23,964 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:23:23,964 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 -> 1c4d0e54eab5e94cf1a4af64165a2546f1c45e063bd8600195a743522777000c [2025-03-03 14:23:24,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:23:24,168 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:23:24,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:23:24,170 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:23:24,170 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:23:24,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product27.cil.c [2025-03-03 14:23:25,267 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8bfb96e/a87b553bc7514f888cea5539b8142eeb/FLAGb6f4a128c [2025-03-03 14:23:25,576 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:23:25,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product27.cil.c [2025-03-03 14:23:25,592 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8bfb96e/a87b553bc7514f888cea5539b8142eeb/FLAGb6f4a128c [2025-03-03 14:23:25,603 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f8bfb96e/a87b553bc7514f888cea5539b8142eeb [2025-03-03 14:23:25,605 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:23:25,607 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:23:25,608 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:25,608 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:23:25,611 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:23:25,611 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:25" (1/1) ... [2025-03-03 14:23:25,612 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@344e6249 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:25, skipping insertion in model container [2025-03-03 14:23:25,612 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:25" (1/1) ... [2025-03-03 14:23:25,659 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:23:26,011 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_product27.cil.c[40661,40674] [2025-03-03 14:23:26,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:26,058 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:23:26,064 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [48] [2025-03-03 14:23:26,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [167] [2025-03-03 14:23:26,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [184] [2025-03-03 14:23:26,065 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [550] [2025-03-03 14:23:26,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [612] [2025-03-03 14:23:26,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [650] [2025-03-03 14:23:26,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1054] [2025-03-03 14:23:26,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1435] [2025-03-03 14:23:26,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1756] [2025-03-03 14:23:26,066 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1978] [2025-03-03 14:23:26,067 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [1987] [2025-03-03 14:23:26,130 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_product27.cil.c[40661,40674] [2025-03-03 14:23:26,149 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:26,169 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:23:26,170 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26 WrapperNode [2025-03-03 14:23:26,170 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:26,170 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:26,170 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:23:26,170 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:23:26,174 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,194 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,227 INFO L138 Inliner]: procedures = 134, calls = 215, calls flagged for inlining = 63, calls inlined = 60, statements flattened = 1100 [2025-03-03 14:23:26,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:26,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:23:26,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:23:26,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:23:26,235 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,235 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,240 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,255 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-03 14:23:26,256 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,256 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,276 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,279 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,286 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,289 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,295 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:23:26,296 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:23:26,296 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:23:26,296 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:23:26,297 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (1/1) ... [2025-03-03 14:23:26,303 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:26,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:26,323 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-03 14:23:26,329 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-03 14:23:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookSize [2025-03-03 14:23:26,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookSize [2025-03-03 14:23:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookAddress [2025-03-03 14:23:26,344 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookAddress [2025-03-03 14:23:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:23:26,344 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:23:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:23:26,345 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing__wrappee__AutoResponder [2025-03-03 14:23:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:23:26,345 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:23:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:23:26,346 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:23:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:23:26,346 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:23:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:23:26,346 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:23:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:23:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:23:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:23:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:23:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure queue [2025-03-03 14:23:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure queue [2025-03-03 14:23:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:23:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:23:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:23:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:23:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:23:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-03-03 14:23:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-03-03 14:23:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure setClientAddressBookSize [2025-03-03 14:23:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientAddressBookSize [2025-03-03 14:23:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:23:26,348 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:23:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-03-03 14:23:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:23:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:23:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-03-03 14:23:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:23:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:23:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:23:26,349 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:23:26,349 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:23:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:23:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:23:26,350 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:23:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure getClientAddressBookAddress [2025-03-03 14:23:26,350 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientAddressBookAddress [2025-03-03 14:23:26,350 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:23:26,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:23:26,535 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:23:26,536 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:23:26,626 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2589-1: getClientPrivateKey_#res#1 := getClientPrivateKey_~retValue_acc~35#1; [2025-03-03 14:23:26,636 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L961: #res := ~retValue_acc~17; [2025-03-03 14:23:26,648 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1314: #res := ~retValue_acc~24; [2025-03-03 14:23:26,674 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2681: #res#1 := ~retValue_acc~37#1; [2025-03-03 14:23:26,674 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2636-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~36#1; [2025-03-03 14:23:26,704 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2905: #res := ~retValue_acc~40; [2025-03-03 14:23:26,712 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L164-1: createEmail_#res#1 := createEmail_~retValue_acc~2#1; [2025-03-03 14:23:26,723 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2133: #res := ~retValue_acc~29; [2025-03-03 14:23:26,755 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L998: #res := ~retValue_acc~18; [2025-03-03 14:23:26,786 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L772: #res := ~retValue_acc~12; [2025-03-03 14:23:26,840 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2459: #res := ~retValue_acc~33; [2025-03-03 14:23:26,983 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1035-1: isVerified_#res#1 := isVerified_~retValue_acc~19#1; [2025-03-03 14:23:26,984 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2977-1: getClientForwardReceiver_#res#1 := getClientForwardReceiver_~retValue_acc~41#1; [2025-03-03 14:23:26,984 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L698-1: getEmailId_#res#1 := getEmailId_~retValue_acc~10#1; [2025-03-03 14:23:26,984 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2542-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~34#1; [2025-03-03 14:23:26,984 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L3024-1: getClientId_#res#1 := getClientId_~retValue_acc~42#1; [2025-03-03 14:23:27,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2744-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~38#1; [2025-03-03 14:23:27,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L647-1: valid_product_#res#1 := valid_product_~retValue_acc~8#1; [2025-03-03 14:23:27,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1280-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~22#1; [2025-03-03 14:23:27,170 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2851-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~39#1; [2025-03-03 14:23:27,171 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1271-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~21#1; [2025-03-03 14:23:27,171 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1289-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~23#1; [2025-03-03 14:23:27,175 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L735: #res := ~retValue_acc~11; [2025-03-03 14:23:27,177 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L140: #res := ~retValue_acc~0; [2025-03-03 14:23:27,312 INFO L? ?]: Removed 564 outVars from TransFormulas that were not future-live. [2025-03-03 14:23:27,312 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:23:27,328 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:23:27,330 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:23:27,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:27 BoogieIcfgContainer [2025-03-03 14:23:27,331 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:23:27,332 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:23:27,333 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:23:27,335 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:23:27,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:23:25" (1/3) ... [2025-03-03 14:23:27,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f52e0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:27, skipping insertion in model container [2025-03-03 14:23:27,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:26" (2/3) ... [2025-03-03 14:23:27,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3f52e0b8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:23:27, skipping insertion in model container [2025-03-03 14:23:27,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:23:27" (3/3) ... [2025-03-03 14:23:27,337 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product27.cil.c [2025-03-03 14:23:27,347 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:23:27,351 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product27.cil.c that has 26 procedures, 419 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:23:27,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:23:27,431 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;@108972e9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:23:27,432 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:23:27,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 419 states, 326 states have (on average 1.5521472392638036) internal successors, (506), 331 states have internal predecessors, (506), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2025-03-03 14:23:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-03-03 14:23:27,451 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:27,451 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:27,452 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:27,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:27,455 INFO L85 PathProgramCache]: Analyzing trace with hash 694590417, now seen corresponding path program 1 times [2025-03-03 14:23:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:27,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673415154] [2025-03-03 14:23:27,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:27,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:27,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:23:27,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:23:27,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:27,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:28,002 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:28,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:28,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673415154] [2025-03-03 14:23:28,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673415154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:28,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987563414] [2025-03-03 14:23:28,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:28,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:28,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:28,007 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-03 14:23:28,009 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-03 14:23:28,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-03-03 14:23:28,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-03-03 14:23:28,327 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:28,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:28,331 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:23:28,336 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:28,349 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:23:28,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:28,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987563414] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:28,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:28,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:23:28,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276576576] [2025-03-03 14:23:28,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:28,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:23:28,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:28,368 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:23:28,369 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:28,373 INFO L87 Difference]: Start difference. First operand has 419 states, 326 states have (on average 1.5521472392638036) internal successors, (506), 331 states have internal predecessors, (506), 66 states have call successors, (66), 25 states have call predecessors, (66), 25 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:28,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:28,422 INFO L93 Difference]: Finished difference Result 640 states and 960 transitions. [2025-03-03 14:23:28,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:23:28,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 131 [2025-03-03 14:23:28,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:28,436 INFO L225 Difference]: With dead ends: 640 [2025-03-03 14:23:28,436 INFO L226 Difference]: Without dead ends: 411 [2025-03-03 14:23:28,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 132 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-03 14:23:28,443 INFO L435 NwaCegarLoop]: 633 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:28,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 633 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:28,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-03-03 14:23:28,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 411. [2025-03-03 14:23:28,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 320 states have (on average 1.55) internal successors, (496), 323 states have internal predecessors, (496), 66 states have call successors, (66), 25 states have call predecessors, (66), 24 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 14:23:28,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 625 transitions. [2025-03-03 14:23:28,508 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 625 transitions. Word has length 131 [2025-03-03 14:23:28,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:28,510 INFO L471 AbstractCegarLoop]: Abstraction has 411 states and 625 transitions. [2025-03-03 14:23:28,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:28,511 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 625 transitions. [2025-03-03 14:23:28,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:23:28,516 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:28,517 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:28,525 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-03 14:23:28,717 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-03 14:23:28,718 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:28,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:28,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1718800664, now seen corresponding path program 1 times [2025-03-03 14:23:28,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:28,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242173154] [2025-03-03 14:23:28,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:28,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:28,743 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:23:28,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:23:28,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:28,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:29,005 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:23:29,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:29,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242173154] [2025-03-03 14:23:29,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242173154] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:29,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685918444] [2025-03-03 14:23:29,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:29,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:29,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:29,009 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-03 14:23:29,011 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-03 14:23:29,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:23:29,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:23:29,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:29,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:29,297 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:23:29,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-03 14:23:29,323 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:29,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685918444] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:29,323 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:29,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:29,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444702443] [2025-03-03 14:23:29,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:29,324 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:29,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:29,325 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:29,325 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:29,325 INFO L87 Difference]: Start difference. First operand 411 states and 625 transitions. Second operand has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:29,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:29,364 INFO L93 Difference]: Finished difference Result 628 states and 934 transitions. [2025-03-03 14:23:29,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:29,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 132 [2025-03-03 14:23:29,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:29,372 INFO L225 Difference]: With dead ends: 628 [2025-03-03 14:23:29,372 INFO L226 Difference]: Without dead ends: 413 [2025-03-03 14:23:29,373 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 132 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-03 14:23:29,378 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 0 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1246 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:29,378 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1246 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:29,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-03-03 14:23:29,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-03-03 14:23:29,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 322 states have (on average 1.546583850931677) internal successors, (498), 325 states have internal predecessors, (498), 66 states have call successors, (66), 25 states have call predecessors, (66), 24 states have return successors, (63), 62 states have call predecessors, (63), 63 states have call successors, (63) [2025-03-03 14:23:29,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 627 transitions. [2025-03-03 14:23:29,405 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 627 transitions. Word has length 132 [2025-03-03 14:23:29,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:29,405 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 627 transitions. [2025-03-03 14:23:29,405 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.333333333333332) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2025-03-03 14:23:29,405 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 627 transitions. [2025-03-03 14:23:29,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:23:29,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:29,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:29,415 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 14:23:29,612 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-03 14:23:29,612 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:29,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:29,613 INFO L85 PathProgramCache]: Analyzing trace with hash 266585385, now seen corresponding path program 1 times [2025-03-03 14:23:29,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:29,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412166209] [2025-03-03 14:23:29,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:29,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:29,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:23:29,646 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:23:29,646 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:29,646 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:29,832 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:23:29,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:29,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412166209] [2025-03-03 14:23:29,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412166209] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:29,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1148219435] [2025-03-03 14:23:29,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:29,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:29,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:29,837 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-03 14:23:29,838 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-03 14:23:29,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:23:30,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:23:30,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:30,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:30,105 INFO L256 TraceCheckSpWp]: Trace formula consists of 1119 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:30,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:30,134 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:23:30,134 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:30,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1148219435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:30,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:30,136 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:23:30,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121060077] [2025-03-03 14:23:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:30,138 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:30,138 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:30,139 INFO L87 Difference]: Start difference. First operand 413 states and 627 transitions. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-03 14:23:30,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:30,189 INFO L93 Difference]: Finished difference Result 878 states and 1353 transitions. [2025-03-03 14:23:30,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:30,190 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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 121 [2025-03-03 14:23:30,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:30,193 INFO L225 Difference]: With dead ends: 878 [2025-03-03 14:23:30,196 INFO L226 Difference]: Without dead ends: 492 [2025-03-03 14:23:30,197 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 121 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-03 14:23:30,198 INFO L435 NwaCegarLoop]: 642 mSDtfsCounter, 142 mSDsluCounter, 579 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 1221 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-03 14:23:30,199 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 1221 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:30,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-03 14:23:30,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 484. [2025-03-03 14:23:30,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 379 states have (on average 1.567282321899736) internal successors, (594), 382 states have internal predecessors, (594), 80 states have call successors, (80), 25 states have call predecessors, (80), 24 states have return successors, (77), 76 states have call predecessors, (77), 77 states have call successors, (77) [2025-03-03 14:23:30,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 751 transitions. [2025-03-03 14:23:30,229 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 751 transitions. Word has length 121 [2025-03-03 14:23:30,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:30,230 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 751 transitions. [2025-03-03 14:23:30,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 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-03 14:23:30,230 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 751 transitions. [2025-03-03 14:23:30,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-03 14:23:30,234 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:30,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 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] [2025-03-03 14:23:30,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:30,434 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-03 14:23:30,435 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:30,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:30,436 INFO L85 PathProgramCache]: Analyzing trace with hash -796697990, now seen corresponding path program 1 times [2025-03-03 14:23:30,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:30,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328471941] [2025-03-03 14:23:30,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:30,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:30,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:23:30,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:23:30,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:30,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:30,619 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-03-03 14:23:30,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:30,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328471941] [2025-03-03 14:23:30,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328471941] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:30,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555727662] [2025-03-03 14:23:30,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:30,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:30,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:30,622 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-03 14:23:30,624 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-03 14:23:30,767 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-03 14:23:30,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-03 14:23:30,869 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:30,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:30,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1124 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:23:30,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:30,926 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:23:30,927 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:30,928 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555727662] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:30,928 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:30,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:23:30,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719903775] [2025-03-03 14:23:30,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:30,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:30,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:30,929 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:30,929 INFO L87 Difference]: Start difference. First operand 484 states and 751 transitions. Second operand has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (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-03 14:23:30,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:30,995 INFO L93 Difference]: Finished difference Result 959 states and 1492 transitions. [2025-03-03 14:23:30,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:30,996 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (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 122 [2025-03-03 14:23:30,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:30,999 INFO L225 Difference]: With dead ends: 959 [2025-03-03 14:23:30,999 INFO L226 Difference]: Without dead ends: 486 [2025-03-03 14:23:31,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 120 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-03 14:23:31,001 INFO L435 NwaCegarLoop]: 617 mSDtfsCounter, 2 mSDsluCounter, 1840 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2457 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-03 14:23:31,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2457 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:31,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2025-03-03 14:23:31,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 486. [2025-03-03 14:23:31,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 380 states have (on average 1.5657894736842106) internal successors, (595), 384 states have internal predecessors, (595), 80 states have call successors, (80), 25 states have call predecessors, (80), 25 states have return successors, (79), 76 states have call predecessors, (79), 77 states have call successors, (79) [2025-03-03 14:23:31,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 754 transitions. [2025-03-03 14:23:31,020 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 754 transitions. Word has length 122 [2025-03-03 14:23:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:31,020 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 754 transitions. [2025-03-03 14:23:31,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 20.75) internal successors, (83), 5 states have internal predecessors, (83), 3 states have call successors, (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-03 14:23:31,020 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 754 transitions. [2025-03-03 14:23:31,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-03 14:23:31,022 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:31,023 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:23:31,030 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 14:23:31,223 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-03 14:23:31,223 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:31,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:31,224 INFO L85 PathProgramCache]: Analyzing trace with hash 722631696, now seen corresponding path program 1 times [2025-03-03 14:23:31,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:31,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276392722] [2025-03-03 14:23:31,224 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:31,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:31,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:23:31,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:23:31,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:31,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-03 14:23:31,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:31,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276392722] [2025-03-03 14:23:31,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276392722] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [765828551] [2025-03-03 14:23:31,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:31,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:31,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:31,380 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-03 14:23:31,381 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-03 14:23:31,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-03 14:23:31,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-03 14:23:31,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:31,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:31,625 INFO L256 TraceCheckSpWp]: Trace formula consists of 1125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:23:31,628 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:31,670 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-03 14:23:31,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:23:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [765828551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:31,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:23:31,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:23:31,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189442459] [2025-03-03 14:23:31,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:31,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:31,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:31,672 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:31,673 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:31,674 INFO L87 Difference]: Start difference. First operand 486 states and 754 transitions. Second operand has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:23:31,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:31,729 INFO L93 Difference]: Finished difference Result 961 states and 1497 transitions. [2025-03-03 14:23:31,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:31,730 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 123 [2025-03-03 14:23:31,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:31,733 INFO L225 Difference]: With dead ends: 961 [2025-03-03 14:23:31,733 INFO L226 Difference]: Without dead ends: 488 [2025-03-03 14:23:31,734 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 121 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-03 14:23:31,735 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 2 mSDsluCounter, 1828 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2443 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-03 14:23:31,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2443 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:31,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-03 14:23:31,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-03 14:23:31,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 386 states have internal predecessors, (596), 80 states have call successors, (80), 25 states have call predecessors, (80), 26 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2025-03-03 14:23:31,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 760 transitions. [2025-03-03 14:23:31,756 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 760 transitions. Word has length 123 [2025-03-03 14:23:31,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:31,756 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 760 transitions. [2025-03-03 14:23:31,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.0) internal successors, (85), 5 states have internal predecessors, (85), 3 states have call successors, (18), 2 states have call predecessors, (18), 3 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:23:31,756 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 760 transitions. [2025-03-03 14:23:31,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-03 14:23:31,759 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:31,760 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, 1] [2025-03-03 14:23:31,767 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-03 14:23:31,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:31,961 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:31,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:31,961 INFO L85 PathProgramCache]: Analyzing trace with hash -85976195, now seen corresponding path program 1 times [2025-03-03 14:23:31,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:31,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564756435] [2025-03-03 14:23:31,961 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:31,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:31,980 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-03 14:23:32,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-03 14:23:32,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:32,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:32,103 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:23:32,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:32,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564756435] [2025-03-03 14:23:32,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564756435] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:32,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:32,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:32,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683550015] [2025-03-03 14:23:32,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:32,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:32,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:32,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:32,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:32,105 INFO L87 Difference]: Start difference. First operand 488 states and 760 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-03 14:23:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:32,145 INFO L93 Difference]: Finished difference Result 953 states and 1488 transitions. [2025-03-03 14:23:32,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:32,145 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 143 [2025-03-03 14:23:32,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:32,148 INFO L225 Difference]: With dead ends: 953 [2025-03-03 14:23:32,148 INFO L226 Difference]: Without dead ends: 488 [2025-03-03 14:23:32,150 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-03 14:23:32,150 INFO L435 NwaCegarLoop]: 618 mSDtfsCounter, 2 mSDsluCounter, 1843 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2461 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-03 14:23:32,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2461 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:32,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-03 14:23:32,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-03 14:23:32,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 386 states have internal predecessors, (596), 80 states have call successors, (80), 25 states have call predecessors, (80), 26 states have return successors, (83), 76 states have call predecessors, (83), 77 states have call successors, (83) [2025-03-03 14:23:32,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 759 transitions. [2025-03-03 14:23:32,171 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 759 transitions. Word has length 143 [2025-03-03 14:23:32,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:32,172 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 759 transitions. [2025-03-03 14:23:32,172 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-03 14:23:32,172 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 759 transitions. [2025-03-03 14:23:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:23:32,174 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:32,174 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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-03 14:23:32,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:23:32,175 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:32,175 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash -436362359, now seen corresponding path program 2 times [2025-03-03 14:23:32,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:32,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939438048] [2025-03-03 14:23:32,176 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:23:32,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:32,197 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 144 statements into 2 equivalence classes. [2025-03-03 14:23:32,208 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:23:32,209 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:23:32,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:32,305 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-03-03 14:23:32,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:32,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939438048] [2025-03-03 14:23:32,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939438048] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:32,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:32,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:32,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230327011] [2025-03-03 14:23:32,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:32,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:32,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:32,307 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:32,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:32,307 INFO L87 Difference]: Start difference. First operand 488 states and 759 transitions. Second operand has 5 states, 5 states have (on average 17.6) 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), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:32,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:32,355 INFO L93 Difference]: Finished difference Result 951 states and 1483 transitions. [2025-03-03 14:23:32,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:32,356 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 17.6) 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), 3 states have call predecessors, (17), 3 states have call successors, (17) Word has length 144 [2025-03-03 14:23:32,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:32,359 INFO L225 Difference]: With dead ends: 951 [2025-03-03 14:23:32,359 INFO L226 Difference]: Without dead ends: 488 [2025-03-03 14:23:32,361 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-03 14:23:32,361 INFO L435 NwaCegarLoop]: 616 mSDtfsCounter, 2 mSDsluCounter, 1831 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:32,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 2447 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:32,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2025-03-03 14:23:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 488. [2025-03-03 14:23:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 488 states, 381 states have (on average 1.5643044619422573) internal successors, (596), 386 states have internal predecessors, (596), 80 states have call successors, (80), 25 states have call predecessors, (80), 26 states have return successors, (82), 76 states have call predecessors, (82), 77 states have call successors, (82) [2025-03-03 14:23:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 758 transitions. [2025-03-03 14:23:32,376 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 758 transitions. Word has length 144 [2025-03-03 14:23:32,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:32,377 INFO L471 AbstractCegarLoop]: Abstraction has 488 states and 758 transitions. [2025-03-03 14:23:32,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 17.6) 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), 3 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:23:32,377 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 758 transitions. [2025-03-03 14:23:32,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-03-03 14:23:32,379 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:32,379 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:23:32,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:23:32,380 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:32,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:32,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1568718878, now seen corresponding path program 1 times [2025-03-03 14:23:32,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:32,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [423323151] [2025-03-03 14:23:32,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:32,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:32,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-03-03 14:23:32,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-03-03 14:23:32,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:32,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:32,504 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 14:23:32,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:32,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [423323151] [2025-03-03 14:23:32,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [423323151] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:32,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:32,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:23:32,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305509484] [2025-03-03 14:23:32,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:32,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:23:32,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:32,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:23:32,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:23:32,506 INFO L87 Difference]: Start difference. First operand 488 states and 758 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), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:23:32,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:32,546 INFO L93 Difference]: Finished difference Result 955 states and 1489 transitions. [2025-03-03 14:23:32,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:23:32,547 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), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) Word has length 126 [2025-03-03 14:23:32,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:32,550 INFO L225 Difference]: With dead ends: 955 [2025-03-03 14:23:32,550 INFO L226 Difference]: Without dead ends: 490 [2025-03-03 14:23:32,552 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-03 14:23:32,552 INFO L435 NwaCegarLoop]: 619 mSDtfsCounter, 1 mSDsluCounter, 1845 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2464 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-03 14:23:32,552 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2464 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:32,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2025-03-03 14:23:32,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 490. [2025-03-03 14:23:32,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 382 states have (on average 1.5628272251308901) internal successors, (597), 388 states have internal predecessors, (597), 80 states have call successors, (80), 25 states have call predecessors, (80), 27 states have return successors, (84), 76 states have call predecessors, (84), 77 states have call successors, (84) [2025-03-03 14:23:32,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 761 transitions. [2025-03-03 14:23:32,571 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 761 transitions. Word has length 126 [2025-03-03 14:23:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:32,571 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 761 transitions. [2025-03-03 14:23:32,571 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), 2 states have return successors, (14), 2 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:23:32,571 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 761 transitions. [2025-03-03 14:23:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-03-03 14:23:32,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:32,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 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, 1, 1] [2025-03-03 14:23:32,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:23:32,574 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:32,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:32,574 INFO L85 PathProgramCache]: Analyzing trace with hash -173174348, now seen corresponding path program 1 times [2025-03-03 14:23:32,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:32,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369841526] [2025-03-03 14:23:32,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:32,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:32,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-03-03 14:23:32,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-03-03 14:23:32,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:32,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:32,705 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:23:32,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:32,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369841526] [2025-03-03 14:23:32,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369841526] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:32,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:32,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:23:32,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020566778] [2025-03-03 14:23:32,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:32,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:23:32,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:32,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:23:32,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:23:32,706 INFO L87 Difference]: Start difference. First operand 490 states and 761 transitions. Second operand has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:23:32,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:32,832 INFO L93 Difference]: Finished difference Result 960 states and 1498 transitions. [2025-03-03 14:23:32,833 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:23:32,833 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) Word has length 146 [2025-03-03 14:23:32,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:32,836 INFO L225 Difference]: With dead ends: 960 [2025-03-03 14:23:32,836 INFO L226 Difference]: Without dead ends: 495 [2025-03-03 14:23:32,837 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-03 14:23:32,838 INFO L435 NwaCegarLoop]: 611 mSDtfsCounter, 5 mSDsluCounter, 3637 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 4248 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:32,838 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 4248 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:23:32,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2025-03-03 14:23:32,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 495. [2025-03-03 14:23:32,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 495 states, 386 states have (on average 1.5595854922279793) internal successors, (602), 392 states have internal predecessors, (602), 80 states have call successors, (80), 26 states have call predecessors, (80), 28 states have return successors, (89), 76 states have call predecessors, (89), 77 states have call successors, (89) [2025-03-03 14:23:32,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 771 transitions. [2025-03-03 14:23:32,857 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 771 transitions. Word has length 146 [2025-03-03 14:23:32,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:32,858 INFO L471 AbstractCegarLoop]: Abstraction has 495 states and 771 transitions. [2025-03-03 14:23:32,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 13.428571428571429) internal successors, (94), 8 states have internal predecessors, (94), 4 states have call successors, (21), 2 states have call predecessors, (21), 3 states have return successors, (17), 3 states have call predecessors, (17), 4 states have call successors, (17) [2025-03-03 14:23:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 771 transitions. [2025-03-03 14:23:32,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2025-03-03 14:23:32,860 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:32,860 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, 1, 1, 1, 1, 1] [2025-03-03 14:23:32,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:23:32,861 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:32,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:32,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1878304701, now seen corresponding path program 1 times [2025-03-03 14:23:32,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:32,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387264145] [2025-03-03 14:23:32,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:32,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:32,879 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:23:32,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:23:32,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:32,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:33,006 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-03 14:23:33,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387264145] [2025-03-03 14:23:33,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [387264145] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:23:33,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314119052] [2025-03-03 14:23:33,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:33,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:33,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:33,009 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:23:33,010 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-03 14:23:33,183 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 147 statements into 1 equivalence classes. [2025-03-03 14:23:33,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 147 of 147 statements. [2025-03-03 14:23:33,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:33,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:33,287 INFO L256 TraceCheckSpWp]: Trace formula consists of 1208 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:23:33,289 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:23:33,322 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:23:33,322 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:23:33,429 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2025-03-03 14:23:33,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314119052] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:23:33,429 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:23:33,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-03-03 14:23:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468764489] [2025-03-03 14:23:33,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:23:33,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:23:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:33,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:23:33,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:23:33,431 INFO L87 Difference]: Start difference. First operand 495 states and 771 transitions. Second operand has 11 states, 10 states have (on average 14.9) internal successors, (149), 11 states have internal predecessors, (149), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 14:23:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:34,027 INFO L93 Difference]: Finished difference Result 1422 states and 2308 transitions. [2025-03-03 14:23:34,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-03 14:23:34,027 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 14.9) internal successors, (149), 11 states have internal predecessors, (149), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) Word has length 147 [2025-03-03 14:23:34,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:34,032 INFO L225 Difference]: With dead ends: 1422 [2025-03-03 14:23:34,033 INFO L226 Difference]: Without dead ends: 959 [2025-03-03 14:23:34,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 312 GetRequests, 291 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-03 14:23:34,035 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 1332 mSDsluCounter, 4378 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1332 SdHoareTripleChecker+Valid, 5003 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:34,035 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1332 Valid, 5003 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:23:34,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 959 states. [2025-03-03 14:23:34,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 959 to 935. [2025-03-03 14:23:34,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 747 states have (on average 1.6131191432396252) internal successors, (1205), 752 states have internal predecessors, (1205), 159 states have call successors, (159), 27 states have call predecessors, (159), 28 states have return successors, (178), 155 states have call predecessors, (178), 156 states have call successors, (178) [2025-03-03 14:23:34,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1542 transitions. [2025-03-03 14:23:34,069 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1542 transitions. Word has length 147 [2025-03-03 14:23:34,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:34,070 INFO L471 AbstractCegarLoop]: Abstraction has 935 states and 1542 transitions. [2025-03-03 14:23:34,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 14.9) internal successors, (149), 11 states have internal predecessors, (149), 4 states have call successors, (36), 2 states have call predecessors, (36), 3 states have return successors, (32), 3 states have call predecessors, (32), 4 states have call successors, (32) [2025-03-03 14:23:34,070 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1542 transitions. [2025-03-03 14:23:34,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-03-03 14:23:34,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:34,074 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-03 14:23:34,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 14:23:34,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:23:34,275 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:34,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:34,276 INFO L85 PathProgramCache]: Analyzing trace with hash -504828995, now seen corresponding path program 1 times [2025-03-03 14:23:34,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:34,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755101236] [2025-03-03 14:23:34,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:34,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:34,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-03-03 14:23:34,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-03-03 14:23:34,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,301 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,328 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-03 14:23:34,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:34,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755101236] [2025-03-03 14:23:34,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755101236] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:34,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:34,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:34,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347486084] [2025-03-03 14:23:34,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:34,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:34,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:34,330 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:34,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:34,330 INFO L87 Difference]: Start difference. First operand 935 states and 1542 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-03 14:23:34,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:34,372 INFO L93 Difference]: Finished difference Result 2207 states and 3698 transitions. [2025-03-03 14:23:34,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:34,372 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-03 14:23:34,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:34,380 INFO L225 Difference]: With dead ends: 2207 [2025-03-03 14:23:34,380 INFO L226 Difference]: Without dead ends: 1353 [2025-03-03 14:23:34,383 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-03 14:23:34,384 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 139 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 1244 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-03 14:23:34,384 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 1244 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:34,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1353 states. [2025-03-03 14:23:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1353 to 1345. [2025-03-03 14:23:34,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1345 states, 1078 states have (on average 1.6326530612244898) internal successors, (1760), 1083 states have internal predecessors, (1760), 238 states have call successors, (238), 27 states have call predecessors, (238), 28 states have return successors, (267), 234 states have call predecessors, (267), 235 states have call successors, (267) [2025-03-03 14:23:34,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1345 states to 1345 states and 2265 transitions. [2025-03-03 14:23:34,436 INFO L78 Accepts]: Start accepts. Automaton has 1345 states and 2265 transitions. Word has length 150 [2025-03-03 14:23:34,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:34,436 INFO L471 AbstractCegarLoop]: Abstraction has 1345 states and 2265 transitions. [2025-03-03 14:23:34,436 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-03 14:23:34,436 INFO L276 IsEmpty]: Start isEmpty. Operand 1345 states and 2265 transitions. [2025-03-03 14:23:34,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-03-03 14:23:34,443 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:34,443 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-03 14:23:34,443 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:23:34,443 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:34,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:34,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1590665186, now seen corresponding path program 1 times [2025-03-03 14:23:34,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:34,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236363956] [2025-03-03 14:23:34,444 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:34,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:34,481 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-03-03 14:23:34,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-03-03 14:23:34,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,526 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-03 14:23:34,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:34,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236363956] [2025-03-03 14:23:34,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236363956] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:34,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:34,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:34,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683338193] [2025-03-03 14:23:34,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:34,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:34,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:34,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:34,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:34,528 INFO L87 Difference]: Start difference. First operand 1345 states and 2265 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-03 14:23:34,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:34,592 INFO L93 Difference]: Finished difference Result 3235 states and 5484 transitions. [2025-03-03 14:23:34,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:34,594 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-03 14:23:34,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:34,605 INFO L225 Difference]: With dead ends: 3235 [2025-03-03 14:23:34,605 INFO L226 Difference]: Without dead ends: 2022 [2025-03-03 14:23:34,610 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-03 14:23:34,611 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 137 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1240 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-03 14:23:34,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 1240 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:34,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2022 states. [2025-03-03 14:23:34,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2022 to 2014. [2025-03-03 14:23:34,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2014 states, 1628 states have (on average 1.6425061425061425) internal successors, (2674), 1633 states have internal predecessors, (2674), 357 states have call successors, (357), 27 states have call predecessors, (357), 28 states have return successors, (386), 353 states have call predecessors, (386), 354 states have call successors, (386) [2025-03-03 14:23:34,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2014 states to 2014 states and 3417 transitions. [2025-03-03 14:23:34,698 INFO L78 Accepts]: Start accepts. Automaton has 2014 states and 3417 transitions. Word has length 132 [2025-03-03 14:23:34,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:34,699 INFO L471 AbstractCegarLoop]: Abstraction has 2014 states and 3417 transitions. [2025-03-03 14:23:34,700 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-03 14:23:34,700 INFO L276 IsEmpty]: Start isEmpty. Operand 2014 states and 3417 transitions. [2025-03-03 14:23:34,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-03-03 14:23:34,709 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:34,709 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-03 14:23:34,710 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 14:23:34,710 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:34,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:34,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1683275055, now seen corresponding path program 1 times [2025-03-03 14:23:34,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:34,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902345625] [2025-03-03 14:23:34,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:34,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:34,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-03-03 14:23:34,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-03-03 14:23:34,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:34,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:34,764 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-03 14:23:34,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:34,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902345625] [2025-03-03 14:23:34,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902345625] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:34,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:34,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:34,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823351907] [2025-03-03 14:23:34,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:34,766 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:34,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:34,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:34,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:34,767 INFO L87 Difference]: Start difference. First operand 2014 states and 3417 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-03 14:23:34,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:34,839 INFO L93 Difference]: Finished difference Result 4802 states and 8211 transitions. [2025-03-03 14:23:34,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:34,840 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-03 14:23:34,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:34,855 INFO L225 Difference]: With dead ends: 4802 [2025-03-03 14:23:34,855 INFO L226 Difference]: Without dead ends: 3052 [2025-03-03 14:23:34,861 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-03 14:23:34,861 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 135 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 1237 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-03 14:23:34,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 1237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:34,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3052 states. [2025-03-03 14:23:34,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3052 to 3044. [2025-03-03 14:23:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3044 states, 2496 states have (on average 1.6502403846153846) internal successors, (4119), 2501 states have internal predecessors, (4119), 519 states have call successors, (519), 27 states have call predecessors, (519), 28 states have return successors, (564), 515 states have call predecessors, (564), 516 states have call successors, (564) [2025-03-03 14:23:35,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3044 states to 3044 states and 5202 transitions. [2025-03-03 14:23:35,020 INFO L78 Accepts]: Start accepts. Automaton has 3044 states and 5202 transitions. Word has length 133 [2025-03-03 14:23:35,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:35,021 INFO L471 AbstractCegarLoop]: Abstraction has 3044 states and 5202 transitions. [2025-03-03 14:23:35,021 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-03 14:23:35,021 INFO L276 IsEmpty]: Start isEmpty. Operand 3044 states and 5202 transitions. [2025-03-03 14:23:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2025-03-03 14:23:35,037 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:35,037 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-03 14:23:35,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:23:35,037 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:35,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:35,038 INFO L85 PathProgramCache]: Analyzing trace with hash -495428470, now seen corresponding path program 1 times [2025-03-03 14:23:35,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:35,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763434611] [2025-03-03 14:23:35,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:35,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:35,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 153 statements into 1 equivalence classes. [2025-03-03 14:23:35,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 153 of 153 statements. [2025-03-03 14:23:35,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:35,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:35,112 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-03 14:23:35,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:35,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763434611] [2025-03-03 14:23:35,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763434611] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:35,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:35,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:35,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261901403] [2025-03-03 14:23:35,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:35,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:35,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:35,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:35,113 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:35,114 INFO L87 Difference]: Start difference. First operand 3044 states and 5202 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-03 14:23:35,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:35,229 INFO L93 Difference]: Finished difference Result 7285 states and 12538 transitions. [2025-03-03 14:23:35,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:35,229 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-03 14:23:35,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:35,255 INFO L225 Difference]: With dead ends: 7285 [2025-03-03 14:23:35,255 INFO L226 Difference]: Without dead ends: 4720 [2025-03-03 14:23:35,265 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-03 14:23:35,266 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 133 mSDsluCounter, 614 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1237 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-03 14:23:35,266 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1237 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:35,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4720 states. [2025-03-03 14:23:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4720 to 4712. [2025-03-03 14:23:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4712 states, 3919 states have (on average 1.6557795355958154) internal successors, (6489), 3924 states have internal predecessors, (6489), 764 states have call successors, (764), 27 states have call predecessors, (764), 28 states have return successors, (835), 760 states have call predecessors, (835), 761 states have call successors, (835) [2025-03-03 14:23:35,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 8088 transitions. [2025-03-03 14:23:35,495 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 8088 transitions. Word has length 153 [2025-03-03 14:23:35,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:35,495 INFO L471 AbstractCegarLoop]: Abstraction has 4712 states and 8088 transitions. [2025-03-03 14:23:35,496 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-03 14:23:35,496 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 8088 transitions. [2025-03-03 14:23:35,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2025-03-03 14:23:35,513 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:35,514 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-03 14:23:35,514 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 14:23:35,514 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:35,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:35,514 INFO L85 PathProgramCache]: Analyzing trace with hash -191424161, now seen corresponding path program 1 times [2025-03-03 14:23:35,515 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:35,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784485965] [2025-03-03 14:23:35,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:35,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:35,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 154 statements into 1 equivalence classes. [2025-03-03 14:23:35,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 154 of 154 statements. [2025-03-03 14:23:35,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:35,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:35,567 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-03 14:23:35,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:35,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784485965] [2025-03-03 14:23:35,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [784485965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:35,567 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:35,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:35,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733107602] [2025-03-03 14:23:35,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:35,568 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:35,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:35,568 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:35,568 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:35,569 INFO L87 Difference]: Start difference. First operand 4712 states and 8088 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-03 14:23:35,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:35,705 INFO L93 Difference]: Finished difference Result 11430 states and 19759 transitions. [2025-03-03 14:23:35,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:35,706 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-03 14:23:35,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:35,748 INFO L225 Difference]: With dead ends: 11430 [2025-03-03 14:23:35,748 INFO L226 Difference]: Without dead ends: 7524 [2025-03-03 14:23:35,764 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:35,765 INFO L435 NwaCegarLoop]: 634 mSDtfsCounter, 131 mSDsluCounter, 612 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 1246 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-03 14:23:35,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 1246 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2025-03-03 14:23:36,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 7516. [2025-03-03 14:23:36,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7516 states, 6230 states have (on average 1.6547351524879614) internal successors, (10309), 6235 states have internal predecessors, (10309), 1257 states have call successors, (1257), 27 states have call predecessors, (1257), 28 states have return successors, (1372), 1253 states have call predecessors, (1372), 1254 states have call successors, (1372) [2025-03-03 14:23:36,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7516 states to 7516 states and 12938 transitions. [2025-03-03 14:23:36,085 INFO L78 Accepts]: Start accepts. Automaton has 7516 states and 12938 transitions. Word has length 154 [2025-03-03 14:23:36,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:36,086 INFO L471 AbstractCegarLoop]: Abstraction has 7516 states and 12938 transitions. [2025-03-03 14:23:36,086 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-03 14:23:36,086 INFO L276 IsEmpty]: Start isEmpty. Operand 7516 states and 12938 transitions. [2025-03-03 14:23:36,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-03-03 14:23:36,110 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:36,110 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-03 14:23:36,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 14:23:36,110 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:36,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:36,111 INFO L85 PathProgramCache]: Analyzing trace with hash 663154852, now seen corresponding path program 1 times [2025-03-03 14:23:36,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:36,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978206691] [2025-03-03 14:23:36,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:36,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:36,127 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-03-03 14:23:36,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-03-03 14:23:36,133 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:36,133 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:36,158 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-03 14:23:36,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:36,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978206691] [2025-03-03 14:23:36,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978206691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:36,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:36,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:36,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618966597] [2025-03-03 14:23:36,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:36,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:36,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:36,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:36,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:36,160 INFO L87 Difference]: Start difference. First operand 7516 states and 12938 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-03 14:23:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:36,409 INFO L93 Difference]: Finished difference Result 18940 states and 32819 transitions. [2025-03-03 14:23:36,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:36,409 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-03 14:23:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:36,473 INFO L225 Difference]: With dead ends: 18940 [2025-03-03 14:23:36,473 INFO L226 Difference]: Without dead ends: 12626 [2025-03-03 14:23:36,499 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-03 14:23:36,500 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 129 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 1242 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-03 14:23:36,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 1242 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:36,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12626 states. [2025-03-03 14:23:37,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12626 to 12618. [2025-03-03 14:23:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12618 states, 10510 states have (on average 1.6555661274976212) internal successors, (17400), 10515 states have internal predecessors, (17400), 2079 states have call successors, (2079), 27 states have call predecessors, (2079), 28 states have return successors, (2272), 2075 states have call predecessors, (2272), 2076 states have call successors, (2272) [2025-03-03 14:23:37,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12618 states to 12618 states and 21751 transitions. [2025-03-03 14:23:37,124 INFO L78 Accepts]: Start accepts. Automaton has 12618 states and 21751 transitions. Word has length 136 [2025-03-03 14:23:37,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:37,124 INFO L471 AbstractCegarLoop]: Abstraction has 12618 states and 21751 transitions. [2025-03-03 14:23:37,125 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-03 14:23:37,125 INFO L276 IsEmpty]: Start isEmpty. Operand 12618 states and 21751 transitions. [2025-03-03 14:23:37,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-03 14:23:37,161 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:37,161 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] [2025-03-03 14:23:37,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 14:23:37,162 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1528755072, now seen corresponding path program 1 times [2025-03-03 14:23:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370087572] [2025-03-03 14:23:37,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:37,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-03 14:23:37,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-03 14:23:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:37,229 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-03 14:23:37,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:37,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370087572] [2025-03-03 14:23:37,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370087572] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:37,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:37,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:37,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389940876] [2025-03-03 14:23:37,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:37,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:37,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:37,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:37,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:37,232 INFO L87 Difference]: Start difference. First operand 12618 states and 21751 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (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-03 14:23:37,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:37,633 INFO L93 Difference]: Finished difference Result 30221 states and 52036 transitions. [2025-03-03 14:23:37,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:37,633 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (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 156 [2025-03-03 14:23:37,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:37,708 INFO L225 Difference]: With dead ends: 30221 [2025-03-03 14:23:37,708 INFO L226 Difference]: Without dead ends: 19802 [2025-03-03 14:23:37,743 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-03 14:23:37,744 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 127 mSDsluCounter, 589 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 1214 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-03 14:23:37,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 1214 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:37,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19802 states. [2025-03-03 14:23:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19802 to 19794. [2025-03-03 14:23:38,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19794 states, 16483 states have (on average 1.6325304859552265) internal successors, (26909), 16488 states have internal predecessors, (26909), 3282 states have call successors, (3282), 27 states have call predecessors, (3282), 28 states have return successors, (3619), 3278 states have call predecessors, (3619), 3279 states have call successors, (3619) [2025-03-03 14:23:38,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19794 states to 19794 states and 33810 transitions. [2025-03-03 14:23:38,472 INFO L78 Accepts]: Start accepts. Automaton has 19794 states and 33810 transitions. Word has length 156 [2025-03-03 14:23:38,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:38,472 INFO L471 AbstractCegarLoop]: Abstraction has 19794 states and 33810 transitions. [2025-03-03 14:23:38,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 2 states have call successors, (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-03 14:23:38,472 INFO L276 IsEmpty]: Start isEmpty. Operand 19794 states and 33810 transitions. [2025-03-03 14:23:38,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2025-03-03 14:23:38,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:38,503 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] [2025-03-03 14:23:38,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 14:23:38,504 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:38,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:38,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1593625723, now seen corresponding path program 1 times [2025-03-03 14:23:38,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:38,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467375377] [2025-03-03 14:23:38,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:38,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:38,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 138 statements into 1 equivalence classes. [2025-03-03 14:23:38,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 138 of 138 statements. [2025-03-03 14:23:38,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:38,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:38,563 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-03 14:23:38,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:38,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467375377] [2025-03-03 14:23:38,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467375377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:38,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:38,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:38,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978949256] [2025-03-03 14:23:38,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:38,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:38,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:38,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:38,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:38,564 INFO L87 Difference]: Start difference. First operand 19794 states and 33810 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, (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-03 14:23:39,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:39,357 INFO L93 Difference]: Finished difference Result 52268 states and 89635 transitions. [2025-03-03 14:23:39,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:39,357 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, (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 138 [2025-03-03 14:23:39,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:39,514 INFO L225 Difference]: With dead ends: 52268 [2025-03-03 14:23:39,514 INFO L226 Difference]: Without dead ends: 35342 [2025-03-03 14:23:39,571 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-03 14:23:39,572 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 125 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 1240 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-03 14:23:39,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 1240 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:39,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35342 states. [2025-03-03 14:23:40,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35342 to 35334. [2025-03-03 14:23:40,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35334 states, 29573 states have (on average 1.6300341527744902) internal successors, (48205), 29578 states have internal predecessors, (48205), 5732 states have call successors, (5732), 27 states have call predecessors, (5732), 28 states have return successors, (6343), 5728 states have call predecessors, (6343), 5729 states have call successors, (6343) [2025-03-03 14:23:40,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35334 states to 35334 states and 60280 transitions. [2025-03-03 14:23:40,895 INFO L78 Accepts]: Start accepts. Automaton has 35334 states and 60280 transitions. Word has length 138 [2025-03-03 14:23:40,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:40,895 INFO L471 AbstractCegarLoop]: Abstraction has 35334 states and 60280 transitions. [2025-03-03 14:23:40,896 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, (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-03 14:23:40,896 INFO L276 IsEmpty]: Start isEmpty. Operand 35334 states and 60280 transitions. [2025-03-03 14:23:40,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2025-03-03 14:23:40,929 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:40,929 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] [2025-03-03 14:23:40,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 14:23:40,929 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:40,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:40,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1626718036, now seen corresponding path program 1 times [2025-03-03 14:23:40,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:40,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983053647] [2025-03-03 14:23:40,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:40,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:40,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 139 statements into 1 equivalence classes. [2025-03-03 14:23:40,953 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 139 of 139 statements. [2025-03-03 14:23:40,953 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:40,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:40,982 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-03 14:23:40,983 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:40,983 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983053647] [2025-03-03 14:23:40,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1983053647] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:40,983 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:40,983 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:40,983 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261744438] [2025-03-03 14:23:40,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:40,983 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:40,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:40,984 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:40,984 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:40,984 INFO L87 Difference]: Start difference. First operand 35334 states and 60280 transitions. Second operand has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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-03 14:23:42,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:42,025 INFO L93 Difference]: Finished difference Result 96335 states and 164882 transitions. [2025-03-03 14:23:42,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:42,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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 139 [2025-03-03 14:23:42,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:42,299 INFO L225 Difference]: With dead ends: 96335 [2025-03-03 14:23:42,299 INFO L226 Difference]: Without dead ends: 64816 [2025-03-03 14:23:42,592 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-03 14:23:42,592 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 123 mSDsluCounter, 617 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 1242 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-03 14:23:42,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 1242 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:42,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64816 states. [2025-03-03 14:23:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64816 to 64808. [2025-03-03 14:23:44,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64808 states, 54534 states have (on average 1.6264165474749697) internal successors, (88695), 54539 states have internal predecessors, (88695), 10245 states have call successors, (10245), 27 states have call predecessors, (10245), 28 states have return successors, (11388), 10241 states have call predecessors, (11388), 10242 states have call successors, (11388) [2025-03-03 14:23:45,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64808 states to 64808 states and 110328 transitions. [2025-03-03 14:23:45,143 INFO L78 Accepts]: Start accepts. Automaton has 64808 states and 110328 transitions. Word has length 139 [2025-03-03 14:23:45,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:45,143 INFO L471 AbstractCegarLoop]: Abstraction has 64808 states and 110328 transitions. [2025-03-03 14:23:45,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.333333333333332) internal successors, (94), 3 states have internal predecessors, (94), 2 states have call successors, (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-03 14:23:45,144 INFO L276 IsEmpty]: Start isEmpty. Operand 64808 states and 110328 transitions. [2025-03-03 14:23:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2025-03-03 14:23:45,195 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:45,196 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-03 14:23:45,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 14:23:45,196 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:45,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:45,196 INFO L85 PathProgramCache]: Analyzing trace with hash -378228986, now seen corresponding path program 1 times [2025-03-03 14:23:45,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:45,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1243176239] [2025-03-03 14:23:45,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:45,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:45,217 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 140 statements into 1 equivalence classes. [2025-03-03 14:23:45,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 140 of 140 statements. [2025-03-03 14:23:45,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:45,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:45,261 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-03 14:23:45,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:45,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1243176239] [2025-03-03 14:23:45,262 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1243176239] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:45,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:45,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 14:23:45,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943364480] [2025-03-03 14:23:45,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:45,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:23:45,263 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:45,263 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:23:45,263 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 14:23:45,263 INFO L87 Difference]: Start difference. First operand 64808 states and 110328 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (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-03 14:23:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:47,411 INFO L93 Difference]: Finished difference Result 121486 states and 207236 transitions. [2025-03-03 14:23:47,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:23:47,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (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 140 [2025-03-03 14:23:47,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:47,918 INFO L225 Difference]: With dead ends: 121486 [2025-03-03 14:23:47,918 INFO L226 Difference]: Without dead ends: 121271 [2025-03-03 14:23:47,987 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-03 14:23:47,989 INFO L435 NwaCegarLoop]: 625 mSDtfsCounter, 118 mSDsluCounter, 621 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1246 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-03 14:23:47,989 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1246 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:23:48,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121271 states. [2025-03-03 14:23:51,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121271 to 121263. [2025-03-03 14:23:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121263 states, 102621 states have (on average 1.6216368969314272) internal successors, (166414), 102626 states have internal predecessors, (166414), 18613 states have call successors, (18613), 27 states have call predecessors, (18613), 28 states have return successors, (20802), 18609 states have call predecessors, (20802), 18610 states have call successors, (20802) [2025-03-03 14:23:53,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121263 states to 121263 states and 205829 transitions. [2025-03-03 14:23:53,072 INFO L78 Accepts]: Start accepts. Automaton has 121263 states and 205829 transitions. Word has length 140 [2025-03-03 14:23:53,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:23:53,072 INFO L471 AbstractCegarLoop]: Abstraction has 121263 states and 205829 transitions. [2025-03-03 14:23:53,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 2 states have call successors, (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-03 14:23:53,072 INFO L276 IsEmpty]: Start isEmpty. Operand 121263 states and 205829 transitions. [2025-03-03 14:23:53,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-03-03 14:23:53,121 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:23:53,121 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, 1] [2025-03-03 14:23:53,122 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 14:23:53,122 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:23:53,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:23:53,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1559277813, now seen corresponding path program 1 times [2025-03-03 14:23:53,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:23:53,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443492557] [2025-03-03 14:23:53,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:23:53,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:23:53,137 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-03-03 14:23:53,144 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-03-03 14:23:53,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:23:53,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:23:53,273 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-03 14:23:53,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:23:53,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443492557] [2025-03-03 14:23:53,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443492557] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:23:53,273 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:23:53,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-03 14:23:53,273 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718029900] [2025-03-03 14:23:53,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:23:53,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 14:23:53,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:23:53,274 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 14:23:53,274 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:23:53,275 INFO L87 Difference]: Start difference. First operand 121263 states and 205829 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 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-03 14:23:55,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:23:55,611 INFO L93 Difference]: Finished difference Result 121946 states and 206823 transitions. [2025-03-03 14:23:55,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:23:55,613 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 5 states have internal predecessors, (96), 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 141 [2025-03-03 14:23:55,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:23:56,052 INFO L225 Difference]: With dead ends: 121946 [2025-03-03 14:23:56,052 INFO L226 Difference]: Without dead ends: 121739 [2025-03-03 14:23:56,106 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-03 14:23:56,107 INFO L435 NwaCegarLoop]: 895 mSDtfsCounter, 925 mSDsluCounter, 2827 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 931 SdHoareTripleChecker+Valid, 3722 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:23:56,107 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [931 Valid, 3722 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:23:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121739 states.