./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec4_product18.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_spec4_product18.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 bf462270e0c7c70d13b1dd17e19a66c26542ea365ec57459489c94e9a63941a0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:23:56,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:23:56,943 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:56,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:23:56,948 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:23:56,972 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:23:56,972 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:23:56,972 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:23:56,972 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:23:56,973 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:23:56,973 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:23:56,973 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:23:56,973 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:23:56,974 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:56,974 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:23:56,974 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:23:56,975 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:23:56,975 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:23:56,975 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 -> bf462270e0c7c70d13b1dd17e19a66c26542ea365ec57459489c94e9a63941a0 [2025-03-03 14:23:57,204 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:23:57,211 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:23:57,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:23:57,214 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:23:57,214 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:23:57,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec4_product18.cil.c [2025-03-03 14:23:58,382 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e80d6f5f/424673a6bfcd4d1b998d7719a2507162/FLAG417acb123 [2025-03-03 14:23:58,637 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:23:58,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec4_product18.cil.c [2025-03-03 14:23:58,650 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e80d6f5f/424673a6bfcd4d1b998d7719a2507162/FLAG417acb123 [2025-03-03 14:23:58,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6e80d6f5f/424673a6bfcd4d1b998d7719a2507162 [2025-03-03 14:23:58,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:23:58,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:23:58,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:58,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:23:58,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:23:58,945 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:58" (1/1) ... [2025-03-03 14:23:58,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@507f0eb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:58, skipping insertion in model container [2025-03-03 14:23:58,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:23:58" (1/1) ... [2025-03-03 14:23:58,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:23:59,396 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_spec4_product18.cil.c[61907,61920] [2025-03-03 14:23:59,402 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:59,416 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:23:59,423 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [48] [2025-03-03 14:23:59,424 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1128] [2025-03-03 14:23:59,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1540] [2025-03-03 14:23:59,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [1847] [2025-03-03 14:23:59,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [1946] [2025-03-03 14:23:59,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2162] [2025-03-03 14:23:59,425 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [2528] [2025-03-03 14:23:59,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignForward_spec.i","") [2563] [2025-03-03 14:23:59,426 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [2591] [2025-03-03 14:23:59,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2877] [2025-03-03 14:23:59,427 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2886] [2025-03-03 14:23:59,518 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_spec4_product18.cil.c[61907,61920] [2025-03-03 14:23:59,519 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:23:59,545 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:23:59,546 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:59 WrapperNode [2025-03-03 14:23:59,546 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:23:59,546 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:59,546 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:23:59,547 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:23:59,551 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:59" (1/1) ... [2025-03-03 14:23:59,571 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:59" (1/1) ... [2025-03-03 14:23:59,607 INFO L138 Inliner]: procedures = 127, calls = 185, calls flagged for inlining = 58, calls inlined = 49, statements flattened = 892 [2025-03-03 14:23:59,607 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:23:59,608 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:23:59,608 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:23:59,608 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:23:59,616 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:59" (1/1) ... [2025-03-03 14:23:59,616 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:59" (1/1) ... [2025-03-03 14:23:59,620 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:59" (1/1) ... [2025-03-03 14:23:59,634 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:59,635 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:59" (1/1) ... [2025-03-03 14:23:59,635 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:59" (1/1) ... [2025-03-03 14:23:59,644 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:59" (1/1) ... [2025-03-03 14:23:59,646 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:59" (1/1) ... [2025-03-03 14:23:59,647 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:59" (1/1) ... [2025-03-03 14:23:59,649 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:59" (1/1) ... [2025-03-03 14:23:59,652 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:23:59,652 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:23:59,652 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:23:59,653 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:23:59,653 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:59" (1/1) ... [2025-03-03 14:23:59,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:23:59,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:23:59,683 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:59,685 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:59,701 INFO L130 BoogieDeclarations]: Found specification of procedure getClientPrivateKey [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getClientPrivateKey [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-03-03 14:23:59,702 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-03-03 14:23:59,702 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-03-03 14:23:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-03-03 14:23:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-03-03 14:23:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-03-03 14:23:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-03-03 14:23:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-03-03 14:23:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-03-03 14:23:59,703 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:23:59,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:23:59,855 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:23:59,858 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:23:59,890 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1484: #res := ~retValue_acc~26; [2025-03-03 14:24:00,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L986-1: findPublicKey_#res#1 := findPublicKey_~retValue_acc~14#1; [2025-03-03 14:24:00,062 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L623-1: getClientAutoResponse_#res#1 := getClientAutoResponse_~retValue_acc~8#1; [2025-03-03 14:24:00,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2780-1: isKeyPairValid_#res#1 := isKeyPairValid_~retValue_acc~41#1; [2025-03-03 14:24:00,063 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1105-1: getClientId_#res#1 := getClientId_~retValue_acc~16#1; [2025-03-03 14:24:00,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1447: #res := ~retValue_acc~25; [2025-03-03 14:24:00,109 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1258: #res := ~retValue_acc~20; [2025-03-03 14:24:00,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L762: #res#1 := ~retValue_acc~11#1; [2025-03-03 14:24:00,143 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L717-1: getClientKeyringSize_#res#1 := getClientKeyringSize_~retValue_acc~10#1; [2025-03-03 14:24:00,155 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L670: #res := ~retValue_acc~9; [2025-03-03 14:24:00,183 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1943-1: createEmail_#res#1 := createEmail_~retValue_acc~31#1; [2025-03-03 14:24:00,406 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2737-1: is_queue_empty_#res#1 := is_queue_empty_~retValue_acc~38#1; [2025-03-03 14:24:00,407 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2746-1: get_queued_client_#res#1 := get_queued_client_~retValue_acc~39#1; [2025-03-03 14:24:00,407 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2755-1: get_queued_email_#res#1 := get_queued_email_~retValue_acc~40#1; [2025-03-03 14:24:00,407 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L932-1: getClientKeyringPublicKey_#res#1 := getClientKeyringPublicKey_~retValue_acc~13#1; [2025-03-03 14:24:00,407 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L825-1: getClientKeyringUser_#res#1 := getClientKeyringUser_~retValue_acc~12#1; [2025-03-03 14:24:00,407 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L2560-1: valid_product_#res#1 := valid_product_~retValue_acc~36#1; [2025-03-03 14:24:00,413 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1221: #res := ~retValue_acc~19; [2025-03-03 14:24:00,415 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1919: #res := ~retValue_acc~29; [2025-03-03 14:24:00,506 INFO L? ?]: Removed 394 outVars from TransFormulas that were not future-live. [2025-03-03 14:24:00,507 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:24:00,520 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:24:00,521 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:24:00,522 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:00 BoogieIcfgContainer [2025-03-03 14:24:00,522 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:24:00,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:24:00,524 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:24:00,527 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:24:00,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:23:58" (1/3) ... [2025-03-03 14:24:00,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc9b92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:00, skipping insertion in model container [2025-03-03 14:24:00,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:23:59" (2/3) ... [2025-03-03 14:24:00,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4bc9b92c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:24:00, skipping insertion in model container [2025-03-03 14:24:00,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:24:00" (3/3) ... [2025-03-03 14:24:00,528 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec4_product18.cil.c [2025-03-03 14:24:00,540 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:24:00,544 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec4_product18.cil.c that has 18 procedures, 290 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 14:24:00,599 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:24:00,609 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;@729b99ae, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:24:00,610 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:24:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand has 290 states, 231 states have (on average 1.5411255411255411) internal successors, (356), 233 states have internal predecessors, (356), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2025-03-03 14:24:00,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-03-03 14:24:00,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:00,630 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:00,631 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:00,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:00,635 INFO L85 PathProgramCache]: Analyzing trace with hash -317044519, now seen corresponding path program 1 times [2025-03-03 14:24:00,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:00,641 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [178747400] [2025-03-03 14:24:00,643 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:00,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:00,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:24:00,786 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:24:00,786 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:00,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:01,179 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:24:01,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:01,179 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [178747400] [2025-03-03 14:24:01,181 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [178747400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:01,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1841902515] [2025-03-03 14:24:01,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:01,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:01,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:01,183 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:24:01,185 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:24:01,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-03-03 14:24:01,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-03-03 14:24:01,420 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:01,420 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:01,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 928 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 14:24:01,430 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:01,441 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:01,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:01,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1841902515] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:01,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:01,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-03-03 14:24:01,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21691777] [2025-03-03 14:24:01,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:01,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 14:24:01,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:01,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 14:24:01,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:01,462 INFO L87 Difference]: Start difference. First operand has 290 states, 231 states have (on average 1.5411255411255411) internal successors, (356), 233 states have internal predecessors, (356), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:01,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:01,490 INFO L93 Difference]: Finished difference Result 427 states and 628 transitions. [2025-03-03 14:24:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 14:24:01,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 92 [2025-03-03 14:24:01,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:01,498 INFO L225 Difference]: With dead ends: 427 [2025-03-03 14:24:01,498 INFO L226 Difference]: Without dead ends: 283 [2025-03-03 14:24:01,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 93 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:24:01,504 INFO L435 NwaCegarLoop]: 433 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, 433 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:24:01,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:01,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2025-03-03 14:24:01,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2025-03-03 14:24:01,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 225 states have (on average 1.5377777777777777) internal successors, (346), 226 states have internal predecessors, (346), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 14:24:01,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 425 transitions. [2025-03-03 14:24:01,553 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 425 transitions. Word has length 92 [2025-03-03 14:24:01,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:01,554 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 425 transitions. [2025-03-03 14:24:01,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:01,555 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 425 transitions. [2025-03-03 14:24:01,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-03 14:24:01,557 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:01,558 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:01,565 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:24:01,758 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:24:01,758 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:01,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:01,759 INFO L85 PathProgramCache]: Analyzing trace with hash -549163380, now seen corresponding path program 1 times [2025-03-03 14:24:01,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:01,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268920174] [2025-03-03 14:24:01,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:01,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:01,779 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:24:01,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:24:01,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:01,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:01,949 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2025-03-03 14:24:01,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268920174] [2025-03-03 14:24:01,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268920174] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:01,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229127878] [2025-03-03 14:24:01,950 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:01,950 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:01,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:01,952 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:24:01,954 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:24:02,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-03 14:24:02,139 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-03 14:24:02,140 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:02,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:02,143 INFO L256 TraceCheckSpWp]: Trace formula consists of 929 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 14:24:02,146 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:02,162 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:02,162 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:02,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229127878] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:02,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:02,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:02,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513737811] [2025-03-03 14:24:02,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:02,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:02,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:02,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:02,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:02,168 INFO L87 Difference]: Start difference. First operand 283 states and 425 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:02,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:02,199 INFO L93 Difference]: Finished difference Result 416 states and 609 transitions. [2025-03-03 14:24:02,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:02,199 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 93 [2025-03-03 14:24:02,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:02,201 INFO L225 Difference]: With dead ends: 416 [2025-03-03 14:24:02,201 INFO L226 Difference]: Without dead ends: 285 [2025-03-03 14:24:02,202 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 93 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:24:02,203 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 0 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 846 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:24:02,203 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 846 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:02,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2025-03-03 14:24:02,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2025-03-03 14:24:02,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 227 states have (on average 1.5330396475770924) internal successors, (348), 228 states have internal predecessors, (348), 40 states have call successors, (40), 17 states have call predecessors, (40), 17 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2025-03-03 14:24:02,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 427 transitions. [2025-03-03 14:24:02,220 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 427 transitions. Word has length 93 [2025-03-03 14:24:02,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:02,220 INFO L471 AbstractCegarLoop]: Abstraction has 285 states and 427 transitions. [2025-03-03 14:24:02,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:02,220 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 427 transitions. [2025-03-03 14:24:02,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2025-03-03 14:24:02,223 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:02,223 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:02,230 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:24:02,423 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:24:02,424 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:02,424 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:02,424 INFO L85 PathProgramCache]: Analyzing trace with hash -1713291206, now seen corresponding path program 1 times [2025-03-03 14:24:02,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:02,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152301502] [2025-03-03 14:24:02,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:02,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:24:02,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:24:02,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:02,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:02,608 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:02,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:02,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152301502] [2025-03-03 14:24:02,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [152301502] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:02,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526786994] [2025-03-03 14:24:02,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:02,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:02,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:02,613 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:24:02,615 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:24:02,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-03-03 14:24:02,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-03-03 14:24:02,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:02,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:02,811 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:02,815 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:02,828 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-03 14:24:02,828 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:02,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [526786994] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:02,828 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:02,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:02,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [136306703] [2025-03-03 14:24:02,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:02,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:02,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:02,829 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:02,829 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:02,830 INFO L87 Difference]: Start difference. First operand 285 states and 427 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:02,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:02,861 INFO L93 Difference]: Finished difference Result 599 states and 912 transitions. [2025-03-03 14:24:02,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:02,864 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 101 [2025-03-03 14:24:02,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:02,867 INFO L225 Difference]: With dead ends: 599 [2025-03-03 14:24:02,870 INFO L226 Difference]: Without dead ends: 341 [2025-03-03 14:24:02,872 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 101 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:24:02,873 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 107 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 818 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:24:02,873 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 818 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2025-03-03 14:24:02,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 333. [2025-03-03 14:24:02,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 264 states have (on average 1.5492424242424243) internal successors, (409), 265 states have internal predecessors, (409), 51 states have call successors, (51), 17 states have call predecessors, (51), 17 states have return successors, (50), 50 states have call predecessors, (50), 50 states have call successors, (50) [2025-03-03 14:24:02,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 510 transitions. [2025-03-03 14:24:02,907 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 510 transitions. Word has length 101 [2025-03-03 14:24:02,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:02,907 INFO L471 AbstractCegarLoop]: Abstraction has 333 states and 510 transitions. [2025-03-03 14:24:02,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:02,907 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 510 transitions. [2025-03-03 14:24:02,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-03 14:24:02,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:02,909 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:02,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-03 14:24:03,110 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:24:03,110 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:03,111 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:03,111 INFO L85 PathProgramCache]: Analyzing trace with hash 296044833, now seen corresponding path program 1 times [2025-03-03 14:24:03,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:03,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447156267] [2025-03-03 14:24:03,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:03,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:03,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:24:03,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:24:03,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:03,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:03,290 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:03,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:03,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447156267] [2025-03-03 14:24:03,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447156267] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:03,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846577282] [2025-03-03 14:24:03,291 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:03,291 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:03,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:03,293 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:24:03,295 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:24:03,404 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-03 14:24:03,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-03 14:24:03,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:03,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:03,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 959 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:24:03,499 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:03,550 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:24:03,551 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:03,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846577282] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:03,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:03,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:03,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767318129] [2025-03-03 14:24:03,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:03,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:03,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:03,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:03,553 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:03,553 INFO L87 Difference]: Start difference. First operand 333 states and 510 transitions. Second operand has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:03,612 INFO L93 Difference]: Finished difference Result 657 states and 1010 transitions. [2025-03-03 14:24:03,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:03,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 102 [2025-03-03 14:24:03,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:03,616 INFO L225 Difference]: With dead ends: 657 [2025-03-03 14:24:03,616 INFO L226 Difference]: Without dead ends: 335 [2025-03-03 14:24:03,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 100 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:24:03,621 INFO L435 NwaCegarLoop]: 417 mSDtfsCounter, 2 mSDsluCounter, 1240 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1657 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:24:03,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1657 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:03,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2025-03-03 14:24:03,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2025-03-03 14:24:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 265 states have (on average 1.5471698113207548) internal successors, (410), 267 states have internal predecessors, (410), 51 states have call successors, (51), 17 states have call predecessors, (51), 18 states have return successors, (52), 50 states have call predecessors, (52), 50 states have call successors, (52) [2025-03-03 14:24:03,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 513 transitions. [2025-03-03 14:24:03,643 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 513 transitions. Word has length 102 [2025-03-03 14:24:03,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:03,643 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 513 transitions. [2025-03-03 14:24:03,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.5) internal successors, (66), 5 states have internal predecessors, (66), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:03,643 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 513 transitions. [2025-03-03 14:24:03,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-03 14:24:03,645 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:03,645 INFO L218 NwaCegarLoop]: trace histogram [3, 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] [2025-03-03 14:24:03,652 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-03 14:24:03,845 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:24:03,846 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:03,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:03,846 INFO L85 PathProgramCache]: Analyzing trace with hash 783780336, now seen corresponding path program 1 times [2025-03-03 14:24:03,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:03,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236890615] [2025-03-03 14:24:03,847 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:03,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:03,861 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:24:03,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:24:03,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:03,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:03,987 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:24:03,987 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:03,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236890615] [2025-03-03 14:24:03,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236890615] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:03,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104555072] [2025-03-03 14:24:03,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:03,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:03,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:03,991 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:24:03,992 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:24:04,104 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-03-03 14:24:04,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-03-03 14:24:04,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:04,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:04,194 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:04,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:04,238 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:24:04,239 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:04,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104555072] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:04,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:04,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-03-03 14:24:04,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479883858] [2025-03-03 14:24:04,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:04,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:04,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:04,241 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:04,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:24:04,241 INFO L87 Difference]: Start difference. First operand 335 states and 513 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:04,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:04,312 INFO L93 Difference]: Finished difference Result 659 states and 1015 transitions. [2025-03-03 14:24:04,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:04,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 103 [2025-03-03 14:24:04,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:04,315 INFO L225 Difference]: With dead ends: 659 [2025-03-03 14:24:04,315 INFO L226 Difference]: Without dead ends: 337 [2025-03-03 14:24:04,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 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:24:04,316 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 2 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1643 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:24:04,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1643 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:04,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-03 14:24:04,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-03 14:24:04,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.5451127819548873) internal successors, (411), 269 states have internal predecessors, (411), 51 states have call successors, (51), 17 states have call predecessors, (51), 19 states have return successors, (57), 50 states have call predecessors, (57), 50 states have call successors, (57) [2025-03-03 14:24:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 519 transitions. [2025-03-03 14:24:04,340 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 519 transitions. Word has length 103 [2025-03-03 14:24:04,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:04,340 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 519 transitions. [2025-03-03 14:24:04,340 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:04,340 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 519 transitions. [2025-03-03 14:24:04,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-03 14:24:04,344 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:04,344 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:04,352 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:24:04,544 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:24:04,545 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:04,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:04,546 INFO L85 PathProgramCache]: Analyzing trace with hash 712834968, now seen corresponding path program 1 times [2025-03-03 14:24:04,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:04,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120217887] [2025-03-03 14:24:04,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:04,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-03 14:24:04,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-03 14:24:04,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:04,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:04,684 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:04,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:04,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120217887] [2025-03-03 14:24:04,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120217887] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:04,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:04,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:04,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771208823] [2025-03-03 14:24:04,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:04,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:04,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:04,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:04,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:04,686 INFO L87 Difference]: Start difference. First operand 337 states and 519 transitions. Second operand has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:04,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:04,733 INFO L93 Difference]: Finished difference Result 651 states and 1006 transitions. [2025-03-03 14:24:04,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:04,733 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 104 [2025-03-03 14:24:04,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:04,736 INFO L225 Difference]: With dead ends: 651 [2025-03-03 14:24:04,737 INFO L226 Difference]: Without dead ends: 337 [2025-03-03 14:24:04,738 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:24:04,739 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 2 mSDsluCounter, 1243 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1661 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:24:04,739 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1661 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:04,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2025-03-03 14:24:04,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2025-03-03 14:24:04,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 266 states have (on average 1.5451127819548873) internal successors, (411), 269 states have internal predecessors, (411), 51 states have call successors, (51), 17 states have call predecessors, (51), 19 states have return successors, (56), 50 states have call predecessors, (56), 50 states have call successors, (56) [2025-03-03 14:24:04,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 518 transitions. [2025-03-03 14:24:04,756 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 518 transitions. Word has length 104 [2025-03-03 14:24:04,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:04,756 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 518 transitions. [2025-03-03 14:24:04,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.0) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:04,756 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 518 transitions. [2025-03-03 14:24:04,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:24:04,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:04,760 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:04,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 14:24:04,760 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:04,760 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:04,760 INFO L85 PathProgramCache]: Analyzing trace with hash -660408891, now seen corresponding path program 2 times [2025-03-03 14:24:04,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:04,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331734783] [2025-03-03 14:24:04,761 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:24:04,761 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:04,775 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 105 statements into 2 equivalence classes. [2025-03-03 14:24:04,780 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 46 of 105 statements. [2025-03-03 14:24:04,781 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:24:04,781 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:04,908 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:04,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:04,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331734783] [2025-03-03 14:24:04,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331734783] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:04,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:04,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:04,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419666326] [2025-03-03 14:24:04,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:04,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:04,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:04,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:04,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:04,909 INFO L87 Difference]: Start difference. First operand 337 states and 518 transitions. Second operand has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:05,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:05,213 INFO L93 Difference]: Finished difference Result 684 states and 1059 transitions. [2025-03-03 14:24:05,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:24:05,214 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 105 [2025-03-03 14:24:05,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:05,217 INFO L225 Difference]: With dead ends: 684 [2025-03-03 14:24:05,218 INFO L226 Difference]: Without dead ends: 680 [2025-03-03 14:24:05,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:24:05,219 INFO L435 NwaCegarLoop]: 439 mSDtfsCounter, 708 mSDsluCounter, 2074 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 709 SdHoareTripleChecker+Valid, 2513 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:05,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [709 Valid, 2513 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:24:05,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2025-03-03 14:24:05,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 669. [2025-03-03 14:24:05,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 669 states, 530 states have (on average 1.5509433962264152) internal successors, (822), 533 states have internal predecessors, (822), 100 states have call successors, (100), 35 states have call predecessors, (100), 38 states have return successors, (114), 100 states have call predecessors, (114), 98 states have call successors, (114) [2025-03-03 14:24:05,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 669 states and 1036 transitions. [2025-03-03 14:24:05,262 INFO L78 Accepts]: Start accepts. Automaton has 669 states and 1036 transitions. Word has length 105 [2025-03-03 14:24:05,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:05,263 INFO L471 AbstractCegarLoop]: Abstraction has 669 states and 1036 transitions. [2025-03-03 14:24:05,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.25) internal successors, (66), 7 states have internal predecessors, (66), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:05,264 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 1036 transitions. [2025-03-03 14:24:05,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 14:24:05,266 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:05,267 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:05,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 14:24:05,267 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:05,267 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:05,267 INFO L85 PathProgramCache]: Analyzing trace with hash 692039794, now seen corresponding path program 1 times [2025-03-03 14:24:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:05,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552798059] [2025-03-03 14:24:05,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:05,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:05,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 14:24:05,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 14:24:05,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:05,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:05,377 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:24:05,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:05,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552798059] [2025-03-03 14:24:05,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552798059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:05,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:05,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:24:05,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481635293] [2025-03-03 14:24:05,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:05,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:05,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:05,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:05,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:24:05,379 INFO L87 Difference]: Start difference. First operand 669 states and 1036 transitions. Second operand has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:05,424 INFO L93 Difference]: Finished difference Result 1307 states and 2032 transitions. [2025-03-03 14:24:05,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:05,425 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) Word has length 106 [2025-03-03 14:24:05,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:05,429 INFO L225 Difference]: With dead ends: 1307 [2025-03-03 14:24:05,429 INFO L226 Difference]: Without dead ends: 673 [2025-03-03 14:24:05,431 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:24:05,431 INFO L435 NwaCegarLoop]: 419 mSDtfsCounter, 1 mSDsluCounter, 1245 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1664 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:24:05,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1664 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:05,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2025-03-03 14:24:05,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 673. [2025-03-03 14:24:05,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 673 states, 532 states have (on average 1.5488721804511278) internal successors, (824), 537 states have internal predecessors, (824), 100 states have call successors, (100), 35 states have call predecessors, (100), 40 states have return successors, (117), 100 states have call predecessors, (117), 98 states have call successors, (117) [2025-03-03 14:24:05,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 1041 transitions. [2025-03-03 14:24:05,484 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 1041 transitions. Word has length 106 [2025-03-03 14:24:05,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:05,484 INFO L471 AbstractCegarLoop]: Abstraction has 673 states and 1041 transitions. [2025-03-03 14:24:05,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.75) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:05,484 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 1041 transitions. [2025-03-03 14:24:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-03 14:24:05,488 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:05,488 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] [2025-03-03 14:24:05,488 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 14:24:05,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:05,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:05,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1000924958, now seen corresponding path program 1 times [2025-03-03 14:24:05,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:05,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814818155] [2025-03-03 14:24:05,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:05,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:05,504 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-03 14:24:05,509 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-03 14:24:05,510 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:05,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:05,610 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 14:24:05,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:05,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814818155] [2025-03-03 14:24:05,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814818155] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:05,611 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:05,611 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:05,611 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449756634] [2025-03-03 14:24:05,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:05,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:05,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:05,612 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:05,612 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:05,612 INFO L87 Difference]: Start difference. First operand 673 states and 1041 transitions. Second operand has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:24:05,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:05,743 INFO L93 Difference]: Finished difference Result 1305 states and 2024 transitions. [2025-03-03 14:24:05,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:24:05,744 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) Word has length 107 [2025-03-03 14:24:05,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:05,748 INFO L225 Difference]: With dead ends: 1305 [2025-03-03 14:24:05,748 INFO L226 Difference]: Without dead ends: 677 [2025-03-03 14:24:05,750 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:24:05,751 INFO L435 NwaCegarLoop]: 409 mSDtfsCounter, 7 mSDsluCounter, 2425 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 2834 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:05,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 2834 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:05,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 677 states. [2025-03-03 14:24:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 677 to 675. [2025-03-03 14:24:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 534 states have (on average 1.546816479400749) internal successors, (826), 538 states have internal predecessors, (826), 100 states have call successors, (100), 36 states have call predecessors, (100), 40 states have return successors, (115), 100 states have call predecessors, (115), 98 states have call successors, (115) [2025-03-03 14:24:05,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 1041 transitions. [2025-03-03 14:24:05,781 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 1041 transitions. Word has length 107 [2025-03-03 14:24:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:05,782 INFO L471 AbstractCegarLoop]: Abstraction has 675 states and 1041 transitions. [2025-03-03 14:24:05,782 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 10.142857142857142) internal successors, (71), 8 states have internal predecessors, (71), 4 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:24:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 1041 transitions. [2025-03-03 14:24:05,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:24:05,785 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:05,785 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 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] [2025-03-03 14:24:05,785 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 14:24:05,785 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:05,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:05,786 INFO L85 PathProgramCache]: Analyzing trace with hash -1257649147, now seen corresponding path program 1 times [2025-03-03 14:24:05,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:05,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783871594] [2025-03-03 14:24:05,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:05,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:05,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:24:05,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:24:05,803 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:05,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:05,873 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:24:05,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783871594] [2025-03-03 14:24:05,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783871594] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:05,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114151257] [2025-03-03 14:24:05,873 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:05,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:05,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:05,875 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:24:05,877 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:24:05,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-03 14:24:06,068 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-03 14:24:06,069 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:06,069 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:06,072 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:06,074 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:06,099 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 14:24:06,099 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:06,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1114151257] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:06,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:06,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:06,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739945921] [2025-03-03 14:24:06,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:06,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:06,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:06,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:06,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:06,101 INFO L87 Difference]: Start difference. First operand 675 states and 1041 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:06,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:06,151 INFO L93 Difference]: Finished difference Result 1019 states and 1571 transitions. [2025-03-03 14:24:06,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:06,152 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-03-03 14:24:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:06,156 INFO L225 Difference]: With dead ends: 1019 [2025-03-03 14:24:06,156 INFO L226 Difference]: Without dead ends: 681 [2025-03-03 14:24:06,157 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 106 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:24:06,157 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 1 mSDsluCounter, 1236 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1654 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:06,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1654 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:06,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2025-03-03 14:24:06,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 677. [2025-03-03 14:24:06,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 535 states have (on average 1.5457943925233646) internal successors, (827), 540 states have internal predecessors, (827), 100 states have call successors, (100), 36 states have call predecessors, (100), 41 states have return successors, (118), 100 states have call predecessors, (118), 98 states have call successors, (118) [2025-03-03 14:24:06,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 1045 transitions. [2025-03-03 14:24:06,181 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 1045 transitions. Word has length 108 [2025-03-03 14:24:06,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:06,181 INFO L471 AbstractCegarLoop]: Abstraction has 677 states and 1045 transitions. [2025-03-03 14:24:06,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:06,182 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 1045 transitions. [2025-03-03 14:24:06,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-03 14:24:06,184 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:06,184 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:06,191 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:06,385 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:24:06,385 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:06,386 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:06,386 INFO L85 PathProgramCache]: Analyzing trace with hash 1082660604, now seen corresponding path program 2 times [2025-03-03 14:24:06,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:06,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774205274] [2025-03-03 14:24:06,386 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:24:06,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:06,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-03-03 14:24:06,407 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 49 of 108 statements. [2025-03-03 14:24:06,407 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-03 14:24:06,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:06,520 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:06,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:06,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774205274] [2025-03-03 14:24:06,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774205274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:06,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:24:06,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-03 14:24:06,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822135879] [2025-03-03 14:24:06,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:06,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:24:06,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:06,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:24:06,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:06,523 INFO L87 Difference]: Start difference. First operand 677 states and 1045 transitions. Second operand has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:06,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:06,798 INFO L93 Difference]: Finished difference Result 1367 states and 2126 transitions. [2025-03-03 14:24:06,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 14:24:06,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) Word has length 108 [2025-03-03 14:24:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:06,805 INFO L225 Difference]: With dead ends: 1367 [2025-03-03 14:24:06,806 INFO L226 Difference]: Without dead ends: 1361 [2025-03-03 14:24:06,807 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2025-03-03 14:24:06,808 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 697 mSDsluCounter, 2058 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 698 SdHoareTripleChecker+Valid, 2496 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:06,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [698 Valid, 2496 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:24:06,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1361 states. [2025-03-03 14:24:06,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1361 to 1343. [2025-03-03 14:24:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1064 states have (on average 1.5488721804511278) internal successors, (1648), 1074 states have internal predecessors, (1648), 194 states have call successors, (194), 72 states have call predecessors, (194), 84 states have return successors, (250), 196 states have call predecessors, (250), 190 states have call successors, (250) [2025-03-03 14:24:06,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2092 transitions. [2025-03-03 14:24:06,871 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2092 transitions. Word has length 108 [2025-03-03 14:24:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:06,871 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2092 transitions. [2025-03-03 14:24:06,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.75) internal successors, (70), 7 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2092 transitions. [2025-03-03 14:24:06,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-03 14:24:06,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:06,876 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:06,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 14:24:06,876 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:06,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:06,877 INFO L85 PathProgramCache]: Analyzing trace with hash 2047584511, now seen corresponding path program 1 times [2025-03-03 14:24:06,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:06,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123287027] [2025-03-03 14:24:06,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:06,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:06,892 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:24:06,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:24:06,900 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:06,900 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:24:06,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:06,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123287027] [2025-03-03 14:24:06,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2123287027] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:06,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174334279] [2025-03-03 14:24:06,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:06,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:06,981 INFO L229 MonitoredProcess]: Starting monitored process 8 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:24:06,982 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 14:24:07,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-03 14:24:07,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-03 14:24:07,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:07,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:07,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 963 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:24:07,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:07,237 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:24:07,237 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:07,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174334279] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:07,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:07,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-03-03 14:24:07,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159878541] [2025-03-03 14:24:07,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:07,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:24:07,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:07,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:24:07,238 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:07,239 INFO L87 Difference]: Start difference. First operand 1343 states and 2092 transitions. Second operand has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:07,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:07,332 INFO L93 Difference]: Finished difference Result 2617 states and 4090 transitions. [2025-03-03 14:24:07,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:24:07,333 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) Word has length 109 [2025-03-03 14:24:07,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:07,341 INFO L225 Difference]: With dead ends: 2617 [2025-03-03 14:24:07,341 INFO L226 Difference]: Without dead ends: 1347 [2025-03-03 14:24:07,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:24:07,345 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 1 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1643 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:07,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1643 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:07,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1347 states. [2025-03-03 14:24:07,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1347 to 1343. [2025-03-03 14:24:07,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1343 states, 1064 states have (on average 1.5488721804511278) internal successors, (1648), 1074 states have internal predecessors, (1648), 194 states have call successors, (194), 72 states have call predecessors, (194), 84 states have return successors, (246), 196 states have call predecessors, (246), 190 states have call successors, (246) [2025-03-03 14:24:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1343 states to 1343 states and 2088 transitions. [2025-03-03 14:24:07,400 INFO L78 Accepts]: Start accepts. Automaton has 1343 states and 2088 transitions. Word has length 109 [2025-03-03 14:24:07,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:07,400 INFO L471 AbstractCegarLoop]: Abstraction has 1343 states and 2088 transitions. [2025-03-03 14:24:07,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.6) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (14), 2 states have call predecessors, (14), 3 states have return successors, (12), 3 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:24:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 1343 states and 2088 transitions. [2025-03-03 14:24:07,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-03-03 14:24:07,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:07,405 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:07,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:07,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:07,606 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:07,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:07,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1514599790, now seen corresponding path program 1 times [2025-03-03 14:24:07,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:07,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599376224] [2025-03-03 14:24:07,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:07,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:07,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:24:07,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:24:07,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:07,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:07,695 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-03 14:24:07,695 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599376224] [2025-03-03 14:24:07,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599376224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:07,695 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1233038018] [2025-03-03 14:24:07,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:07,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:07,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:07,698 INFO L229 MonitoredProcess]: Starting monitored process 9 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:24:07,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 14:24:07,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-03-03 14:24:07,918 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-03-03 14:24:07,918 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:07,918 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:07,922 INFO L256 TraceCheckSpWp]: Trace formula consists of 964 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:07,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:07,946 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:24:07,946 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:24:08,014 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:24:08,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1233038018] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:24:08,015 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:24:08,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2025-03-03 14:24:08,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669838589] [2025-03-03 14:24:08,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:24:08,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:24:08,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:08,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:24:08,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:24:08,016 INFO L87 Difference]: Start difference. First operand 1343 states and 2088 transitions. Second operand has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:24:08,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:08,201 INFO L93 Difference]: Finished difference Result 3399 states and 5473 transitions. [2025-03-03 14:24:08,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 14:24:08,202 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 110 [2025-03-03 14:24:08,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:08,214 INFO L225 Difference]: With dead ends: 3399 [2025-03-03 14:24:08,214 INFO L226 Difference]: Without dead ends: 2457 [2025-03-03 14:24:08,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 216 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:24:08,218 INFO L435 NwaCegarLoop]: 454 mSDtfsCounter, 499 mSDsluCounter, 2100 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 545 SdHoareTripleChecker+Valid, 2554 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:24:08,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [545 Valid, 2554 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:24:08,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2457 states. [2025-03-03 14:24:08,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2457 to 2371. [2025-03-03 14:24:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2371 states, 1896 states have (on average 1.604957805907173) internal successors, (3043), 1894 states have internal predecessors, (3043), 394 states have call successors, (394), 70 states have call predecessors, (394), 80 states have return successors, (506), 406 states have call predecessors, (506), 390 states have call successors, (506) [2025-03-03 14:24:08,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2371 states to 2371 states and 3943 transitions. [2025-03-03 14:24:08,299 INFO L78 Accepts]: Start accepts. Automaton has 2371 states and 3943 transitions. Word has length 110 [2025-03-03 14:24:08,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:08,299 INFO L471 AbstractCegarLoop]: Abstraction has 2371 states and 3943 transitions. [2025-03-03 14:24:08,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 12.555555555555555) internal successors, (113), 9 states have internal predecessors, (113), 3 states have call successors, (26), 2 states have call predecessors, (26), 3 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-03-03 14:24:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 2371 states and 3943 transitions. [2025-03-03 14:24:08,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-03-03 14:24:08,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:08,308 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:08,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:08,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 14:24:08,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:08,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:08,513 INFO L85 PathProgramCache]: Analyzing trace with hash 123139254, now seen corresponding path program 1 times [2025-03-03 14:24:08,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:08,513 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112997256] [2025-03-03 14:24:08,513 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:08,513 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:08,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:24:08,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:24:08,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:08,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:08,616 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:08,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:08,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112997256] [2025-03-03 14:24:08,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112997256] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:08,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1395926813] [2025-03-03 14:24:08,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:08,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:08,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:08,619 INFO L229 MonitoredProcess]: Starting monitored process 10 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:24:08,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:24:08,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-03-03 14:24:08,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-03-03 14:24:08,817 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:08,817 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:08,820 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:08,822 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:08,834 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:08,834 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:08,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1395926813] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:08,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:08,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:08,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2066224992] [2025-03-03 14:24:08,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:08,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:08,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:08,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:08,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:08,836 INFO L87 Difference]: Start difference. First operand 2371 states and 3943 transitions. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:08,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:08,907 INFO L93 Difference]: Finished difference Result 5605 states and 9457 transitions. [2025-03-03 14:24:08,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:08,907 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 113 [2025-03-03 14:24:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:08,924 INFO L225 Difference]: With dead ends: 5605 [2025-03-03 14:24:08,924 INFO L226 Difference]: Without dead ends: 3373 [2025-03-03 14:24:08,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 113 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:24:08,933 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 105 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 847 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:24:08,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 847 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:08,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3373 states. [2025-03-03 14:24:09,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3373 to 3341. [2025-03-03 14:24:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3341 states, 2660 states have (on average 1.6131578947368421) internal successors, (4291), 2646 states have internal predecessors, (4291), 600 states have call successors, (600), 70 states have call predecessors, (600), 80 states have return successors, (780), 624 states have call predecessors, (780), 596 states have call successors, (780) [2025-03-03 14:24:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3341 states to 3341 states and 5671 transitions. [2025-03-03 14:24:09,079 INFO L78 Accepts]: Start accepts. Automaton has 3341 states and 5671 transitions. Word has length 113 [2025-03-03 14:24:09,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:09,080 INFO L471 AbstractCegarLoop]: Abstraction has 3341 states and 5671 transitions. [2025-03-03 14:24:09,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:09,080 INFO L276 IsEmpty]: Start isEmpty. Operand 3341 states and 5671 transitions. [2025-03-03 14:24:09,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-03 14:24:09,092 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:09,093 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:09,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:09,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 14:24:09,294 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:09,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:09,294 INFO L85 PathProgramCache]: Analyzing trace with hash -1517902270, now seen corresponding path program 1 times [2025-03-03 14:24:09,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:09,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676273832] [2025-03-03 14:24:09,294 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:09,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:09,306 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:24:09,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:24:09,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:09,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:09,362 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:09,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676273832] [2025-03-03 14:24:09,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676273832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:09,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [676496816] [2025-03-03 14:24:09,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:09,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:09,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:09,365 INFO L229 MonitoredProcess]: Starting monitored process 11 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:24:09,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:24:09,502 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-03 14:24:09,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-03 14:24:09,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:09,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:09,583 INFO L256 TraceCheckSpWp]: Trace formula consists of 960 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:09,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:09,605 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:09,605 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:09,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [676496816] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:09,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:09,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:09,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197734847] [2025-03-03 14:24:09,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:09,607 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:09,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:09,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:09,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:09,607 INFO L87 Difference]: Start difference. First operand 3341 states and 5671 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:09,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:09,740 INFO L93 Difference]: Finished difference Result 8405 states and 14393 transitions. [2025-03-03 14:24:09,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:09,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 114 [2025-03-03 14:24:09,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:09,768 INFO L225 Difference]: With dead ends: 8405 [2025-03-03 14:24:09,768 INFO L226 Difference]: Without dead ends: 5313 [2025-03-03 14:24:09,781 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 114 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:24:09,782 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 103 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 844 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:24:09,782 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 844 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:09,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5313 states. [2025-03-03 14:24:09,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5313 to 5281. [2025-03-03 14:24:10,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5281 states, 4220 states have (on average 1.6244075829383886) internal successors, (6855), 4206 states have internal predecessors, (6855), 980 states have call successors, (980), 70 states have call predecessors, (980), 80 states have return successors, (1224), 1004 states have call predecessors, (1224), 976 states have call successors, (1224) [2025-03-03 14:24:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5281 states to 5281 states and 9059 transitions. [2025-03-03 14:24:10,029 INFO L78 Accepts]: Start accepts. Automaton has 5281 states and 9059 transitions. Word has length 114 [2025-03-03 14:24:10,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:10,029 INFO L471 AbstractCegarLoop]: Abstraction has 5281 states and 9059 transitions. [2025-03-03 14:24:10,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:10,033 INFO L276 IsEmpty]: Start isEmpty. Operand 5281 states and 9059 transitions. [2025-03-03 14:24:10,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-03-03 14:24:10,055 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:10,055 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:10,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:10,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 14:24:10,260 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:10,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1004134423, now seen corresponding path program 1 times [2025-03-03 14:24:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524337050] [2025-03-03 14:24:10,261 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:10,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:10,271 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:24:10,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:24:10,276 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:10,276 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:10,326 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:10,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:10,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524337050] [2025-03-03 14:24:10,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524337050] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:10,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404750670] [2025-03-03 14:24:10,327 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:10,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:10,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:10,329 INFO L229 MonitoredProcess]: Starting monitored process 12 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:24:10,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:24:10,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-03-03 14:24:10,521 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-03-03 14:24:10,521 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:10,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:10,525 INFO L256 TraceCheckSpWp]: Trace formula consists of 965 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:10,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:10,541 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:10,541 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:10,541 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404750670] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:10,541 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:10,542 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:10,542 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3061506] [2025-03-03 14:24:10,542 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:10,542 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:10,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:10,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:10,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:10,543 INFO L87 Difference]: Start difference. First operand 5281 states and 9059 transitions. Second operand has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:10,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:10,682 INFO L93 Difference]: Finished difference Result 12463 states and 21569 transitions. [2025-03-03 14:24:10,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:10,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 115 [2025-03-03 14:24:10,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:10,717 INFO L225 Difference]: With dead ends: 12463 [2025-03-03 14:24:10,717 INFO L226 Difference]: Without dead ends: 7903 [2025-03-03 14:24:10,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 115 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:24:10,735 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 101 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 839 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:24:10,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 839 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:10,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7903 states. [2025-03-03 14:24:10,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7903 to 7871. [2025-03-03 14:24:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7871 states, 6378 states have (on average 1.6288805268109126) internal successors, (10389), 6346 states have internal predecessors, (10389), 1412 states have call successors, (1412), 70 states have call predecessors, (1412), 80 states have return successors, (1806), 1454 states have call predecessors, (1806), 1408 states have call successors, (1806) [2025-03-03 14:24:11,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7871 states to 7871 states and 13607 transitions. [2025-03-03 14:24:11,036 INFO L78 Accepts]: Start accepts. Automaton has 7871 states and 13607 transitions. Word has length 115 [2025-03-03 14:24:11,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:11,037 INFO L471 AbstractCegarLoop]: Abstraction has 7871 states and 13607 transitions. [2025-03-03 14:24:11,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 7871 states and 13607 transitions. [2025-03-03 14:24:11,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-03 14:24:11,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:11,061 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:11,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:11,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-03 14:24:11,262 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:11,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:11,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1101584063, now seen corresponding path program 1 times [2025-03-03 14:24:11,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:11,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802592104] [2025-03-03 14:24:11,262 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:11,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:11,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:24:11,278 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:24:11,278 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:11,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:11,380 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:11,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802592104] [2025-03-03 14:24:11,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802592104] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:11,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88621531] [2025-03-03 14:24:11,381 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:11,381 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:11,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:11,383 INFO L229 MonitoredProcess]: Starting monitored process 13 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:24:11,385 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 14:24:11,516 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-03 14:24:11,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-03 14:24:11,601 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:11,601 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:11,604 INFO L256 TraceCheckSpWp]: Trace formula consists of 970 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:11,607 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:11,629 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:11,629 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:11,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88621531] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:11,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:11,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:11,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387261203] [2025-03-03 14:24:11,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:11,630 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:11,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:11,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:11,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:11,631 INFO L87 Difference]: Start difference. First operand 7871 states and 13607 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:11,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:11,897 INFO L93 Difference]: Finished difference Result 18661 states and 32559 transitions. [2025-03-03 14:24:11,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:11,897 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 116 [2025-03-03 14:24:11,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:11,957 INFO L225 Difference]: With dead ends: 18661 [2025-03-03 14:24:11,958 INFO L226 Difference]: Without dead ends: 12089 [2025-03-03 14:24:11,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 116 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:24:11,985 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 99 mSDsluCounter, 415 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 839 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:24:11,985 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 839 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:11,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12089 states. [2025-03-03 14:24:12,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12089 to 12057. [2025-03-03 14:24:12,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12057 states, 9924 states have (on average 1.633111648528819) internal successors, (16207), 9868 states have internal predecessors, (16207), 2052 states have call successors, (2052), 70 states have call predecessors, (2052), 80 states have return successors, (2702), 2118 states have call predecessors, (2702), 2048 states have call successors, (2702) [2025-03-03 14:24:12,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12057 states to 12057 states and 20961 transitions. [2025-03-03 14:24:12,516 INFO L78 Accepts]: Start accepts. Automaton has 12057 states and 20961 transitions. Word has length 116 [2025-03-03 14:24:12,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:12,517 INFO L471 AbstractCegarLoop]: Abstraction has 12057 states and 20961 transitions. [2025-03-03 14:24:12,518 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:12,518 INFO L276 IsEmpty]: Start isEmpty. Operand 12057 states and 20961 transitions. [2025-03-03 14:24:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-03-03 14:24:12,544 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:12,544 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:12,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:12,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 14:24:12,745 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:12,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:12,746 INFO L85 PathProgramCache]: Analyzing trace with hash 567625304, now seen corresponding path program 1 times [2025-03-03 14:24:12,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:12,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96894444] [2025-03-03 14:24:12,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:12,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:12,759 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:24:12,763 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:24:12,764 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:12,764 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:12,814 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:12,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96894444] [2025-03-03 14:24:12,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96894444] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:12,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837613117] [2025-03-03 14:24:12,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:12,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:12,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:12,817 INFO L229 MonitoredProcess]: Starting monitored process 14 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:24:12,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 14:24:12,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-03-03 14:24:13,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-03-03 14:24:13,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:13,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:13,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:13,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:13,050 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:13,050 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:13,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837613117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:13,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:13,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:13,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815485867] [2025-03-03 14:24:13,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:13,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:13,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:13,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:13,053 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:13,053 INFO L87 Difference]: Start difference. First operand 12057 states and 20961 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:13,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:13,374 INFO L93 Difference]: Finished difference Result 29985 states and 52509 transitions. [2025-03-03 14:24:13,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:13,374 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 117 [2025-03-03 14:24:13,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:13,455 INFO L225 Difference]: With dead ends: 29985 [2025-03-03 14:24:13,455 INFO L226 Difference]: Without dead ends: 19853 [2025-03-03 14:24:13,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 117 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:24:13,486 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 97 mSDsluCounter, 422 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 860 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:24:13,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 860 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:13,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19853 states. [2025-03-03 14:24:14,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19853 to 19821. [2025-03-03 14:24:14,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19821 states, 16306 states have (on average 1.6273150987366614) internal successors, (26535), 16220 states have internal predecessors, (26535), 3434 states have call successors, (3434), 70 states have call predecessors, (3434), 80 states have return successors, (4542), 3530 states have call predecessors, (4542), 3430 states have call successors, (4542) [2025-03-03 14:24:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19821 states to 19821 states and 34511 transitions. [2025-03-03 14:24:14,378 INFO L78 Accepts]: Start accepts. Automaton has 19821 states and 34511 transitions. Word has length 117 [2025-03-03 14:24:14,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:14,379 INFO L471 AbstractCegarLoop]: Abstraction has 19821 states and 34511 transitions. [2025-03-03 14:24:14,379 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, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:14,379 INFO L276 IsEmpty]: Start isEmpty. Operand 19821 states and 34511 transitions. [2025-03-03 14:24:14,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:24:14,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:14,420 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:14,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:14,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 14:24:14,621 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:14,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1005534464, now seen corresponding path program 1 times [2025-03-03 14:24:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460350877] [2025-03-03 14:24:14,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:14,638 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:24:14,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:24:14,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:14,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:14,711 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:14,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460350877] [2025-03-03 14:24:14,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460350877] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:14,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3840105] [2025-03-03 14:24:14,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:14,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:14,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:14,715 INFO L229 MonitoredProcess]: Starting monitored process 15 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:24:14,716 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 14:24:14,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-03 14:24:14,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:24:14,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:14,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:14,937 INFO L256 TraceCheckSpWp]: Trace formula consists of 980 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:14,939 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:14,960 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:14,961 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:14,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3840105] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:14,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:14,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:14,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148765139] [2025-03-03 14:24:14,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:14,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:14,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:14,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:14,963 INFO L87 Difference]: Start difference. First operand 19821 states and 34511 transitions. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:15,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:15,652 INFO L93 Difference]: Finished difference Result 51189 states and 89505 transitions. [2025-03-03 14:24:15,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:15,653 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 118 [2025-03-03 14:24:15,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:15,768 INFO L225 Difference]: With dead ends: 51189 [2025-03-03 14:24:15,768 INFO L226 Difference]: Without dead ends: 34297 [2025-03-03 14:24:15,798 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 118 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:24:15,799 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 95 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 842 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:24:15,799 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [110 Valid, 842 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34297 states. [2025-03-03 14:24:16,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34297 to 34265. [2025-03-03 14:24:16,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34265 states, 28326 states have (on average 1.6261738332274236) internal successors, (46063), 28240 states have internal predecessors, (46063), 5858 states have call successors, (5858), 70 states have call predecessors, (5858), 80 states have return successors, (7566), 5954 states have call predecessors, (7566), 5854 states have call successors, (7566) [2025-03-03 14:24:16,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34265 states to 34265 states and 59487 transitions. [2025-03-03 14:24:16,767 INFO L78 Accepts]: Start accepts. Automaton has 34265 states and 59487 transitions. Word has length 118 [2025-03-03 14:24:16,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:16,767 INFO L471 AbstractCegarLoop]: Abstraction has 34265 states and 59487 transitions. [2025-03-03 14:24:16,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:16,767 INFO L276 IsEmpty]: Start isEmpty. Operand 34265 states and 59487 transitions. [2025-03-03 14:24:16,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:24:16,806 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:16,806 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-03 14:24:16,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:17,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:17,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:17,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:17,008 INFO L85 PathProgramCache]: Analyzing trace with hash -849876743, now seen corresponding path program 1 times [2025-03-03 14:24:17,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:17,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146648651] [2025-03-03 14:24:17,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:17,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:17,019 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:24:17,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:24:17,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:17,024 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:17,080 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:17,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:17,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146648651] [2025-03-03 14:24:17,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1146648651] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:17,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [766665635] [2025-03-03 14:24:17,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:17,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:17,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:17,083 INFO L229 MonitoredProcess]: Starting monitored process 16 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:24:17,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 14:24:17,211 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-03 14:24:17,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:24:17,287 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:17,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:17,291 INFO L256 TraceCheckSpWp]: Trace formula consists of 985 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:17,293 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:17,321 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [766665635] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:17,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:17,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761873368] [2025-03-03 14:24:17,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:17,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:17,323 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:17,323 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:17,323 INFO L87 Difference]: Start difference. First operand 34265 states and 59487 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:18,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:18,780 INFO L93 Difference]: Finished difference Result 90381 states and 157677 transitions. [2025-03-03 14:24:18,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:18,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 119 [2025-03-03 14:24:18,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:19,084 INFO L225 Difference]: With dead ends: 90381 [2025-03-03 14:24:19,085 INFO L226 Difference]: Without dead ends: 60761 [2025-03-03 14:24:19,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:19,190 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 93 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 857 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:24:19,191 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 857 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:19,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60761 states. [2025-03-03 14:24:20,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60761 to 60729. [2025-03-03 14:24:21,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60729 states, 50128 states have (on average 1.617598946696457) internal successors, (81087), 50006 states have internal predecessors, (81087), 10520 states have call successors, (10520), 70 states have call predecessors, (10520), 80 states have return successors, (13604), 10652 states have call predecessors, (13604), 10516 states have call successors, (13604) [2025-03-03 14:24:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60729 states to 60729 states and 105211 transitions. [2025-03-03 14:24:21,183 INFO L78 Accepts]: Start accepts. Automaton has 60729 states and 105211 transitions. Word has length 119 [2025-03-03 14:24:21,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:21,184 INFO L471 AbstractCegarLoop]: Abstraction has 60729 states and 105211 transitions. [2025-03-03 14:24:21,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:21,184 INFO L276 IsEmpty]: Start isEmpty. Operand 60729 states and 105211 transitions. [2025-03-03 14:24:21,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 14:24:21,239 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:21,239 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:21,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:21,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:21,440 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:21,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:21,441 INFO L85 PathProgramCache]: Analyzing trace with hash -815757313, now seen corresponding path program 1 times [2025-03-03 14:24:21,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:21,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122004317] [2025-03-03 14:24:21,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:21,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:21,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:24:21,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:24:21,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:21,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:21,513 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:21,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122004317] [2025-03-03 14:24:21,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122004317] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:21,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848300739] [2025-03-03 14:24:21,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:21,514 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:21,514 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:21,517 INFO L229 MonitoredProcess]: Starting monitored process 17 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:24:21,520 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 14:24:21,651 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 14:24:21,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 14:24:21,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:21,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:21,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 990 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:21,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:21,754 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:21,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:21,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848300739] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:21,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:21,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:21,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795625832] [2025-03-03 14:24:21,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:21,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:21,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:21,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:21,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:21,757 INFO L87 Difference]: Start difference. First operand 60729 states and 105211 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:24,547 INFO L93 Difference]: Finished difference Result 163777 states and 285275 transitions. [2025-03-03 14:24:24,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:24,547 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2025-03-03 14:24:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:25,173 INFO L225 Difference]: With dead ends: 163777 [2025-03-03 14:24:25,173 INFO L226 Difference]: Without dead ends: 109385 [2025-03-03 14:24:25,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 120 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:24:25,270 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 91 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 842 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:24:25,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 842 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:25,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109385 states. [2025-03-03 14:24:28,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109385 to 109353. [2025-03-03 14:24:28,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109353 states, 90760 states have (on average 1.6139378580872632) internal successors, (146481), 90596 states have internal predecessors, (146481), 18512 states have call successors, (18512), 70 states have call predecessors, (18512), 80 states have return successors, (24262), 18686 states have call predecessors, (24262), 18508 states have call successors, (24262) [2025-03-03 14:24:28,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109353 states to 109353 states and 189255 transitions. [2025-03-03 14:24:29,023 INFO L78 Accepts]: Start accepts. Automaton has 109353 states and 189255 transitions. Word has length 120 [2025-03-03 14:24:29,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:24:29,023 INFO L471 AbstractCegarLoop]: Abstraction has 109353 states and 189255 transitions. [2025-03-03 14:24:29,023 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:29,023 INFO L276 IsEmpty]: Start isEmpty. Operand 109353 states and 189255 transitions. [2025-03-03 14:24:29,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-03-03 14:24:29,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:24:29,088 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:24:29,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 14:24:29,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:29,289 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:24:29,289 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:24:29,289 INFO L85 PathProgramCache]: Analyzing trace with hash 610248826, now seen corresponding path program 1 times [2025-03-03 14:24:29,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:24:29,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146951252] [2025-03-03 14:24:29,290 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:29,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:24:29,300 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:24:29,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:24:29,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:29,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:29,353 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-03 14:24:29,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:24:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146951252] [2025-03-03 14:24:29,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146951252] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:24:29,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945709344] [2025-03-03 14:24:29,354 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:24:29,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:24:29,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:24:29,355 INFO L229 MonitoredProcess]: Starting monitored process 18 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:24:29,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 14:24:29,489 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-03-03 14:24:29,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-03-03 14:24:29,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:24:29,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:24:29,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 995 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-03 14:24:29,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:24:29,591 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-03-03 14:24:29,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 14:24:29,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945709344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:24:29,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 14:24:29,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-03 14:24:29,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701194488] [2025-03-03 14:24:29,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:24:29,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 14:24:29,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:24:29,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 14:24:29,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:24:29,593 INFO L87 Difference]: Start difference. First operand 109353 states and 189255 transitions. Second operand has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2025-03-03 14:24:33,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:24:33,616 INFO L93 Difference]: Finished difference Result 302543 states and 523703 transitions. [2025-03-03 14:24:33,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 14:24:33,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 26.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2025-03-03 14:24:33,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:24:34,401 INFO L225 Difference]: With dead ends: 302543 [2025-03-03 14:24:34,402 INFO L226 Difference]: Without dead ends: 202643 [2025-03-03 14:24:34,624 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:24:34,628 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 89 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 842 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:24:34,628 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 842 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:24:34,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202643 states. [2025-03-03 14:24:40,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202643 to 202611. [2025-03-03 14:24:40,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 202611 states, 169170 states have (on average 1.6082816102145772) internal successors, (272073), 169006 states have internal predecessors, (272073), 33360 states have call successors, (33360), 70 states have call predecessors, (33360), 80 states have return successors, (42302), 33534 states have call predecessors, (42302), 33356 states have call successors, (42302)