./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec3_product18.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec3_product18.cil.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8d7d2bf487526d6e0729662c61851f9ddffc6ed66e923d4f96f5d4608e690fa4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:52:54,945 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:52:55,013 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:52:55,020 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:52:55,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:52:55,045 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:52:55,046 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:52:55,046 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:52:55,047 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:52:55,047 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:52:55,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:52:55,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:52:55,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:52:55,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:52:55,048 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:52:55,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:52:55,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:52:55,049 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:52:55,049 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:52:55,049 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:52:55,049 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:52:55,049 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:52:55,050 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:55,050 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:55,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:55,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:52:55,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:52:55,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:52:55,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:52:55,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:52:55,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:52:55,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:52:55,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:52:55,052 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 8d7d2bf487526d6e0729662c61851f9ddffc6ed66e923d4f96f5d4608e690fa4 [2025-01-09 03:52:55,348 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:52:55,358 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:52:55,359 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:52:55,361 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:52:55,361 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:52:55,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec3_product18.cil.c [2025-01-09 03:52:56,584 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd2eb46f2/7e581bc2f68f4641b918b20f54ab442c/FLAGe43e80867 [2025-01-09 03:52:56,955 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:52:56,957 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product18.cil.c [2025-01-09 03:52:56,979 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd2eb46f2/7e581bc2f68f4641b918b20f54ab442c/FLAGe43e80867 [2025-01-09 03:52:57,155 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/dd2eb46f2/7e581bc2f68f4641b918b20f54ab442c [2025-01-09 03:52:57,158 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:52:57,159 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:52:57,161 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:57,162 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:52:57,165 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:52:57,166 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,167 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45fedefc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57, skipping insertion in model container [2025-01-09 03:52:57,167 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,220 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:52:57,569 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product18.cil.c[42127,42140] [2025-01-09 03:52:57,658 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:57,674 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:52:57,681 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [48] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [97] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [1177] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [1470] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [1836] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1845] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [2147] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"SignVerify_spec.i","") [2550] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [2608] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2824] [2025-01-09 03:52:57,683 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2921] [2025-01-09 03:52:57,738 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec3_product18.cil.c[42127,42140] [2025-01-09 03:52:57,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:52:57,797 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:52:57,798 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57 WrapperNode [2025-01-09 03:52:57,798 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:52:57,799 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:57,800 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:52:57,800 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:52:57,805 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,856 INFO L138 Inliner]: procedures = 128, calls = 192, calls flagged for inlining = 57, calls inlined = 48, statements flattened = 879 [2025-01-09 03:52:57,856 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:52:57,857 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:52:57,857 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:52:57,857 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:52:57,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,879 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,897 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-01-09 03:52:57,897 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,897 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,907 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,908 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,913 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,916 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,929 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:52:57,930 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:52:57,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:52:57,935 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:52:57,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (1/1) ... [2025-01-09 03:52:57,944 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:52:57,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:57,970 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 03:52:57,973 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 03:52:57,993 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2025-01-09 03:52:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2025-01-09 03:52:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2025-01-09 03:52:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2025-01-09 03:52:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure isReadable [2025-01-09 03:52:57,994 INFO L138 BoogieDeclarations]: Found implementation of procedure isReadable [2025-01-09 03:52:57,994 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2025-01-09 03:52:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2025-01-09 03:52:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailSignKey [2025-01-09 03:52:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailSignKey [2025-01-09 03:52:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2025-01-09 03:52:57,995 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2025-01-09 03:52:57,995 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailFrom [2025-01-09 03:52:57,996 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailFrom [2025-01-09 03:52:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2025-01-09 03:52:57,996 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2025-01-09 03:52:57,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure isSigned [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure isSigned [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure isKeyPairValid [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure isKeyPairValid [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure findPublicKey [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure findPublicKey [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailTo [2025-01-09 03:52:57,997 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailTo [2025-01-09 03:52:57,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:52:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 03:52:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 03:52:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 03:52:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2025-01-09 03:52:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2025-01-09 03:52:57,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:52:57,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:52:58,170 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:52:58,172 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:52:58,880 INFO L? ?]: Removed 393 outVars from TransFormulas that were not future-live. [2025-01-09 03:52:58,880 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:52:58,890 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:52:58,891 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 03:52:58,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:58 BoogieIcfgContainer [2025-01-09 03:52:58,891 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:52:58,892 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:52:58,894 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:52:58,897 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:52:58,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:52:57" (1/3) ... [2025-01-09 03:52:58,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e88b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:58, skipping insertion in model container [2025-01-09 03:52:58,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:52:57" (2/3) ... [2025-01-09 03:52:58,898 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e88b73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:52:58, skipping insertion in model container [2025-01-09 03:52:58,898 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:52:58" (3/3) ... [2025-01-09 03:52:58,899 INFO L128 eAbstractionObserver]: Analyzing ICFG email_spec3_product18.cil.c [2025-01-09 03:52:58,910 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:52:58,912 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG email_spec3_product18.cil.c that has 20 procedures, 305 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 03:52:58,976 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:52:58,987 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;@7b90bdcd, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:52:58,987 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:52:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 305 states, 238 states have (on average 1.5294117647058822) internal successors, (364), 242 states have internal predecessors, (364), 46 states have call successors, (46), 19 states have call predecessors, (46), 19 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 03:52:59,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:52:59,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:52:59,009 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:52:59,009 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:52:59,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:52:59,014 INFO L85 PathProgramCache]: Analyzing trace with hash 481733276, now seen corresponding path program 1 times [2025-01-09 03:52:59,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:52:59,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561453163] [2025-01-09 03:52:59,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:59,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:52:59,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:52:59,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:52:59,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:59,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:59,586 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:52:59,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:52:59,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561453163] [2025-01-09 03:52:59,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561453163] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:52:59,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2104505548] [2025-01-09 03:52:59,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:52:59,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:52:59,589 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:52:59,591 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:52:59,593 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:52:59,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:52:59,876 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:52:59,876 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:52:59,877 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:52:59,881 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 03:52:59,889 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:52:59,907 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:52:59,908 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:52:59,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2104505548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:52:59,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:52:59,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 5 [2025-01-09 03:52:59,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130042494] [2025-01-09 03:52:59,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:52:59,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:52:59,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:52:59,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:52:59,928 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:59,932 INFO L87 Difference]: Start difference. First operand has 305 states, 238 states have (on average 1.5294117647058822) internal successors, (364), 242 states have internal predecessors, (364), 46 states have call successors, (46), 19 states have call predecessors, (46), 19 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) Second operand has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:52:59,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:52:59,969 INFO L93 Difference]: Finished difference Result 456 states and 668 transitions. [2025-01-09 03:52:59,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:52:59,973 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-01-09 03:52:59,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:52:59,980 INFO L225 Difference]: With dead ends: 456 [2025-01-09 03:52:59,981 INFO L226 Difference]: Without dead ends: 297 [2025-01-09 03:52:59,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:52:59,986 INFO L435 NwaCegarLoop]: 451 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, 451 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:52:59,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:52:59,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-01-09 03:53:00,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2025-01-09 03:53:00,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 232 states have (on average 1.5258620689655173) internal successors, (354), 234 states have internal predecessors, (354), 46 states have call successors, (46), 19 states have call predecessors, (46), 18 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 03:53:00,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 443 transitions. [2025-01-09 03:53:00,038 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 443 transitions. Word has length 103 [2025-01-09 03:53:00,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:00,039 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 443 transitions. [2025-01-09 03:53:00,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 29.5) internal successors, (59), 2 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:00,040 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 443 transitions. [2025-01-09 03:53:00,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-09 03:53:00,043 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:00,043 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:00,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:00,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 03:53:00,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:00,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:00,245 INFO L85 PathProgramCache]: Analyzing trace with hash 2089329654, now seen corresponding path program 1 times [2025-01-09 03:53:00,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:00,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425399708] [2025-01-09 03:53:00,245 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:00,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:00,285 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:53:00,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:53:00,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:00,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:00,471 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-09 03:53:00,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:00,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425399708] [2025-01-09 03:53:00,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425399708] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:00,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1630567435] [2025-01-09 03:53:00,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:00,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:00,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:00,475 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:00,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:53:00,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-09 03:53:00,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-09 03:53:00,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:00,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:00,760 INFO L256 TraceCheckSpWp]: Trace formula consists of 1022 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 03:53:00,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:53:00,796 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:00,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1630567435] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:00,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:00,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:53:00,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910807205] [2025-01-09 03:53:00,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:00,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:00,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:00,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:00,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:00,801 INFO L87 Difference]: Start difference. First operand 297 states and 443 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:00,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:00,848 INFO L93 Difference]: Finished difference Result 444 states and 645 transitions. [2025-01-09 03:53:00,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:00,848 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 103 [2025-01-09 03:53:00,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:00,852 INFO L225 Difference]: With dead ends: 444 [2025-01-09 03:53:00,852 INFO L226 Difference]: Without dead ends: 299 [2025-01-09 03:53:00,853 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:00,854 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 1 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:00,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 880 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:00,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2025-01-09 03:53:00,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 298. [2025-01-09 03:53:00,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 233 states have (on average 1.5236051502145922) internal successors, (355), 235 states have internal predecessors, (355), 46 states have call successors, (46), 19 states have call predecessors, (46), 18 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-01-09 03:53:00,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 444 transitions. [2025-01-09 03:53:00,882 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 444 transitions. Word has length 103 [2025-01-09 03:53:00,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:00,882 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 444 transitions. [2025-01-09 03:53:00,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:00,882 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 444 transitions. [2025-01-09 03:53:00,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 03:53:00,885 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:00,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:00,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 03:53:01,087 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:01,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:01,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:01,088 INFO L85 PathProgramCache]: Analyzing trace with hash 620215363, now seen corresponding path program 1 times [2025-01-09 03:53:01,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:01,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422389401] [2025-01-09 03:53:01,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:01,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:01,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:53:01,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:53:01,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:01,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:01,349 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:01,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422389401] [2025-01-09 03:53:01,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422389401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:01,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [239018376] [2025-01-09 03:53:01,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:01,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:01,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:01,355 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:01,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 03:53:01,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 03:53:01,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 03:53:01,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:01,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:01,602 INFO L256 TraceCheckSpWp]: Trace formula consists of 1046 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:01,605 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:01,626 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-09 03:53:01,630 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:01,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [239018376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:01,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 03:53:01,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270712806] [2025-01-09 03:53:01,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:01,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:01,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:01,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:01,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:01,633 INFO L87 Difference]: Start difference. First operand 298 states and 444 transitions. Second operand has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:01,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:01,665 INFO L93 Difference]: Finished difference Result 626 states and 947 transitions. [2025-01-09 03:53:01,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:01,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 111 [2025-01-09 03:53:01,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:01,668 INFO L225 Difference]: With dead ends: 626 [2025-01-09 03:53:01,669 INFO L226 Difference]: Without dead ends: 354 [2025-01-09 03:53:01,670 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:01,671 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 107 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:01,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 849 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:01,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 354 states. [2025-01-09 03:53:01,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 354 to 346. [2025-01-09 03:53:01,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 270 states have (on average 1.5407407407407407) internal successors, (416), 272 states have internal predecessors, (416), 57 states have call successors, (57), 19 states have call predecessors, (57), 18 states have return successors, (54), 54 states have call predecessors, (54), 54 states have call successors, (54) [2025-01-09 03:53:01,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 527 transitions. [2025-01-09 03:53:01,695 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 527 transitions. Word has length 111 [2025-01-09 03:53:01,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:01,695 INFO L471 AbstractCegarLoop]: Abstraction has 346 states and 527 transitions. [2025-01-09 03:53:01,695 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.333333333333332) internal successors, (67), 3 states have internal predecessors, (67), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 527 transitions. [2025-01-09 03:53:01,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-01-09 03:53:01,701 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:01,701 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:01,710 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:01,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:01,907 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:01,907 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:01,907 INFO L85 PathProgramCache]: Analyzing trace with hash -981558803, now seen corresponding path program 1 times [2025-01-09 03:53:01,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:01,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085046508] [2025-01-09 03:53:01,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:01,925 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:53:01,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:53:01,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:01,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:02,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085046508] [2025-01-09 03:53:02,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085046508] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:02,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1987451241] [2025-01-09 03:53:02,065 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:02,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:02,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:02,069 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:02,070 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 03:53:02,199 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-01-09 03:53:02,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-01-09 03:53:02,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:02,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:02,310 INFO L256 TraceCheckSpWp]: Trace formula consists of 1051 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 03:53:02,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:53:02,356 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:02,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1987451241] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:02,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:02,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2025-01-09 03:53:02,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967733738] [2025-01-09 03:53:02,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:02,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:02,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:02,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:02,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:02,357 INFO L87 Difference]: Start difference. First operand 346 states and 527 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:02,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:02,423 INFO L93 Difference]: Finished difference Result 683 states and 1044 transitions. [2025-01-09 03:53:02,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:02,424 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 112 [2025-01-09 03:53:02,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:02,428 INFO L225 Difference]: With dead ends: 683 [2025-01-09 03:53:02,428 INFO L226 Difference]: Without dead ends: 348 [2025-01-09 03:53:02,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:02,431 INFO L435 NwaCegarLoop]: 435 mSDtfsCounter, 2 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1729 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:02,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1729 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:02,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2025-01-09 03:53:02,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 348. [2025-01-09 03:53:02,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 274 states have internal predecessors, (417), 57 states have call successors, (57), 19 states have call predecessors, (57), 19 states have return successors, (56), 54 states have call predecessors, (56), 54 states have call successors, (56) [2025-01-09 03:53:02,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 530 transitions. [2025-01-09 03:53:02,451 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 530 transitions. Word has length 112 [2025-01-09 03:53:02,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:02,451 INFO L471 AbstractCegarLoop]: Abstraction has 348 states and 530 transitions. [2025-01-09 03:53:02,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:02,451 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 530 transitions. [2025-01-09 03:53:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2025-01-09 03:53:02,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:02,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:02,466 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:02,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:02,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:02,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:02,660 INFO L85 PathProgramCache]: Analyzing trace with hash 118984582, now seen corresponding path program 1 times [2025-01-09 03:53:02,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:02,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073191498] [2025-01-09 03:53:02,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:02,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:02,678 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:53:02,685 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:53:02,685 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:02,685 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:53:02,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073191498] [2025-01-09 03:53:02,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073191498] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:02,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [203321548] [2025-01-09 03:53:02,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:02,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:02,837 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:02,840 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:02,851 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 03:53:02,984 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 113 statements into 1 equivalence classes. [2025-01-09 03:53:03,076 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 113 of 113 statements. [2025-01-09 03:53:03,076 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:03,076 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:03,080 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 03:53:03,084 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:03,126 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:53:03,129 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:03,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [203321548] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:03,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:03,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2025-01-09 03:53:03,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208997984] [2025-01-09 03:53:03,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:03,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:03,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:03,130 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:03,131 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:53:03,132 INFO L87 Difference]: Start difference. First operand 348 states and 530 transitions. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:03,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:03,196 INFO L93 Difference]: Finished difference Result 685 states and 1049 transitions. [2025-01-09 03:53:03,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:03,196 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 113 [2025-01-09 03:53:03,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:03,199 INFO L225 Difference]: With dead ends: 685 [2025-01-09 03:53:03,199 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 03:53:03,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 111 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-01-09 03:53:03,203 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 2 mSDsluCounter, 1282 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1715 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-01-09 03:53:03,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1715 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:03,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 03:53:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-01-09 03:53:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 272 states have (on average 1.536764705882353) internal successors, (418), 276 states have internal predecessors, (418), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (61), 54 states have call predecessors, (61), 54 states have call successors, (61) [2025-01-09 03:53:03,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 536 transitions. [2025-01-09 03:53:03,225 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 536 transitions. Word has length 113 [2025-01-09 03:53:03,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:03,226 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 536 transitions. [2025-01-09 03:53:03,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 3 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 536 transitions. [2025-01-09 03:53:03,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-09 03:53:03,228 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:03,228 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:03,236 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 03:53:03,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:03,430 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:03,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash -736384965, now seen corresponding path program 1 times [2025-01-09 03:53:03,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:03,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909241282] [2025-01-09 03:53:03,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-09 03:53:03,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-09 03:53:03,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:03,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:03,563 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:03,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:03,563 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909241282] [2025-01-09 03:53:03,563 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909241282] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:03,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:03,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:03,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274135242] [2025-01-09 03:53:03,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:03,564 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:03,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:03,565 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:03,565 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:03,565 INFO L87 Difference]: Start difference. First operand 350 states and 536 transitions. Second operand has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:03,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:03,606 INFO L93 Difference]: Finished difference Result 677 states and 1040 transitions. [2025-01-09 03:53:03,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:03,606 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 114 [2025-01-09 03:53:03,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:03,608 INFO L225 Difference]: With dead ends: 677 [2025-01-09 03:53:03,610 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 03:53:03,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:03,612 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 2 mSDsluCounter, 1297 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1733 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:03,613 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1733 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:03,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 03:53:03,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-01-09 03:53:03,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 272 states have (on average 1.536764705882353) internal successors, (418), 276 states have internal predecessors, (418), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (60), 54 states have call predecessors, (60), 54 states have call successors, (60) [2025-01-09 03:53:03,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 535 transitions. [2025-01-09 03:53:03,635 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 535 transitions. Word has length 114 [2025-01-09 03:53:03,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:03,635 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 535 transitions. [2025-01-09 03:53:03,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 18.75) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:03,636 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 535 transitions. [2025-01-09 03:53:03,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-09 03:53:03,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:03,638 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:03,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 03:53:03,639 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:03,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1355968630, now seen corresponding path program 2 times [2025-01-09 03:53:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:03,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335876636] [2025-01-09 03:53:03,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 03:53:03,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:03,659 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 115 statements into 2 equivalence classes. [2025-01-09 03:53:03,671 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 115 of 115 statements. [2025-01-09 03:53:03,671 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-09 03:53:03,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:03,754 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:53:03,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:03,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335876636] [2025-01-09 03:53:03,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335876636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:03,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:03,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:03,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777104145] [2025-01-09 03:53:03,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:03,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:03,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:03,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:03,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:03,756 INFO L87 Difference]: Start difference. First operand 350 states and 535 transitions. Second operand has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:03,798 INFO L93 Difference]: Finished difference Result 675 states and 1035 transitions. [2025-01-09 03:53:03,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:03,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) Word has length 115 [2025-01-09 03:53:03,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:03,801 INFO L225 Difference]: With dead ends: 675 [2025-01-09 03:53:03,802 INFO L226 Difference]: Without dead ends: 350 [2025-01-09 03:53:03,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:03,804 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 2 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1719 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:03,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1719 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:03,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2025-01-09 03:53:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 350. [2025-01-09 03:53:03,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 350 states, 272 states have (on average 1.536764705882353) internal successors, (418), 276 states have internal predecessors, (418), 57 states have call successors, (57), 19 states have call predecessors, (57), 20 states have return successors, (59), 54 states have call predecessors, (59), 54 states have call successors, (59) [2025-01-09 03:53:03,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 534 transitions. [2025-01-09 03:53:03,826 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 534 transitions. Word has length 115 [2025-01-09 03:53:03,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:03,826 INFO L471 AbstractCegarLoop]: Abstraction has 350 states and 534 transitions. [2025-01-09 03:53:03,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 15.0) internal successors, (75), 5 states have internal predecessors, (75), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 3 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:03,826 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 534 transitions. [2025-01-09 03:53:03,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-01-09 03:53:03,832 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:03,832 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:03,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 03:53:03,832 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:03,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:03,833 INFO L85 PathProgramCache]: Analyzing trace with hash 517757325, now seen corresponding path program 3 times [2025-01-09 03:53:03,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:03,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113963964] [2025-01-09 03:53:03,833 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-09 03:53:03,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:03,854 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 116 statements into 3 equivalence classes. [2025-01-09 03:53:03,866 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 104 of 116 statements. [2025-01-09 03:53:03,866 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-09 03:53:03,866 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:04,002 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-09 03:53:04,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:04,002 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113963964] [2025-01-09 03:53:04,002 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113963964] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:04,002 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:04,002 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 03:53:04,002 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [452512828] [2025-01-09 03:53:04,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:04,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 03:53:04,003 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:04,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 03:53:04,003 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-01-09 03:53:04,003 INFO L87 Difference]: Start difference. First operand 350 states and 534 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:04,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:04,228 INFO L93 Difference]: Finished difference Result 780 states and 1127 transitions. [2025-01-09 03:53:04,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-09 03:53:04,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) Word has length 116 [2025-01-09 03:53:04,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:04,232 INFO L225 Difference]: With dead ends: 780 [2025-01-09 03:53:04,232 INFO L226 Difference]: Without dead ends: 642 [2025-01-09 03:53:04,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2025-01-09 03:53:04,234 INFO L435 NwaCegarLoop]: 658 mSDtfsCounter, 624 mSDsluCounter, 2006 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:04,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 2664 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 03:53:04,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2025-01-09 03:53:04,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 632. [2025-01-09 03:53:04,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 632 states, 498 states have (on average 1.4939759036144578) internal successors, (744), 505 states have internal predecessors, (744), 87 states have call successors, (87), 41 states have call predecessors, (87), 46 states have return successors, (94), 85 states have call predecessors, (94), 82 states have call successors, (94) [2025-01-09 03:53:04,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 925 transitions. [2025-01-09 03:53:04,259 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 925 transitions. Word has length 116 [2025-01-09 03:53:04,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:04,259 INFO L471 AbstractCegarLoop]: Abstraction has 632 states and 925 transitions. [2025-01-09 03:53:04,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 5 states have internal predecessors, (72), 3 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:04,259 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 925 transitions. [2025-01-09 03:53:04,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2025-01-09 03:53:04,261 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:04,262 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:04,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 03:53:04,262 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:04,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:04,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1149959057, now seen corresponding path program 1 times [2025-01-09 03:53:04,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:04,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159183616] [2025-01-09 03:53:04,263 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:04,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:04,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 117 statements into 1 equivalence classes. [2025-01-09 03:53:04,282 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 117 of 117 statements. [2025-01-09 03:53:04,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:04,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:04,363 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-09 03:53:04,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:04,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159183616] [2025-01-09 03:53:04,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159183616] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:04,363 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:04,363 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 03:53:04,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [6746250] [2025-01-09 03:53:04,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:04,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 03:53:04,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:04,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 03:53:04,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:04,365 INFO L87 Difference]: Start difference. First operand 632 states and 925 transitions. Second operand has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:04,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:04,408 INFO L93 Difference]: Finished difference Result 1243 states and 1823 transitions. [2025-01-09 03:53:04,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 03:53:04,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) Word has length 117 [2025-01-09 03:53:04,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:04,413 INFO L225 Difference]: With dead ends: 1243 [2025-01-09 03:53:04,413 INFO L226 Difference]: Without dead ends: 634 [2025-01-09 03:53:04,415 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 03:53:04,416 INFO L435 NwaCegarLoop]: 437 mSDtfsCounter, 1 mSDsluCounter, 1299 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 1736 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:04,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 1736 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:04,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2025-01-09 03:53:04,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 634. [2025-01-09 03:53:04,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 634 states, 499 states have (on average 1.4929859719438878) internal successors, (745), 507 states have internal predecessors, (745), 87 states have call successors, (87), 41 states have call predecessors, (87), 47 states have return successors, (96), 85 states have call predecessors, (96), 82 states have call successors, (96) [2025-01-09 03:53:04,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 928 transitions. [2025-01-09 03:53:04,439 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 928 transitions. Word has length 117 [2025-01-09 03:53:04,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:04,439 INFO L471 AbstractCegarLoop]: Abstraction has 634 states and 928 transitions. [2025-01-09 03:53:04,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 19.25) internal successors, (77), 5 states have internal predecessors, (77), 3 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (13), 2 states have call predecessors, (13), 3 states have call successors, (13) [2025-01-09 03:53:04,440 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 928 transitions. [2025-01-09 03:53:04,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-01-09 03:53:04,441 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:04,442 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:04,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 03:53:04,442 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:04,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:04,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1217468433, now seen corresponding path program 1 times [2025-01-09 03:53:04,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:04,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010991763] [2025-01-09 03:53:04,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:04,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:04,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-01-09 03:53:04,462 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-01-09 03:53:04,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:04,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:04,578 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-01-09 03:53:04,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:04,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010991763] [2025-01-09 03:53:04,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010991763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:04,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:04,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 03:53:04,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026943101] [2025-01-09 03:53:04,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:04,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 03:53:04,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:04,579 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 03:53:04,579 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:53:04,579 INFO L87 Difference]: Start difference. First operand 634 states and 928 transitions. Second operand has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:53:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:04,694 INFO L93 Difference]: Finished difference Result 1248 states and 1832 transitions. [2025-01-09 03:53:04,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 03:53:04,694 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) Word has length 118 [2025-01-09 03:53:04,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:04,698 INFO L225 Difference]: With dead ends: 1248 [2025-01-09 03:53:04,698 INFO L226 Difference]: Without dead ends: 639 [2025-01-09 03:53:04,701 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-01-09 03:53:04,701 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 5 mSDsluCounter, 2545 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 2974 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:04,701 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 2974 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:04,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2025-01-09 03:53:04,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 639. [2025-01-09 03:53:04,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 639 states, 503 states have (on average 1.4910536779324055) internal successors, (750), 511 states have internal predecessors, (750), 87 states have call successors, (87), 42 states have call predecessors, (87), 48 states have return successors, (101), 85 states have call predecessors, (101), 82 states have call successors, (101) [2025-01-09 03:53:04,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 639 states to 639 states and 938 transitions. [2025-01-09 03:53:04,729 INFO L78 Accepts]: Start accepts. Automaton has 639 states and 938 transitions. Word has length 118 [2025-01-09 03:53:04,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:04,729 INFO L471 AbstractCegarLoop]: Abstraction has 639 states and 938 transitions. [2025-01-09 03:53:04,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 11.714285714285714) internal successors, (82), 8 states have internal predecessors, (82), 4 states have call successors, (16), 2 states have call predecessors, (16), 3 states have return successors, (13), 3 states have call predecessors, (13), 4 states have call successors, (13) [2025-01-09 03:53:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 639 states and 938 transitions. [2025-01-09 03:53:04,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 03:53:04,731 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:04,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:04,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 03:53:04,732 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:04,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:04,732 INFO L85 PathProgramCache]: Analyzing trace with hash 920863789, now seen corresponding path program 1 times [2025-01-09 03:53:04,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:04,732 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [591105840] [2025-01-09 03:53:04,732 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:04,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:04,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:53:04,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:53:04,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:04,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:04,883 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:04,883 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [591105840] [2025-01-09 03:53:04,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [591105840] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:04,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924397272] [2025-01-09 03:53:04,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:04,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:04,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:04,886 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:04,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 03:53:05,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 03:53:05,113 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 03:53:05,113 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:05,113 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:05,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 03:53:05,120 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:05,153 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:53:05,239 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:05,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924397272] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:53:05,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 03:53:05,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2025-01-09 03:53:05,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655396938] [2025-01-09 03:53:05,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 03:53:05,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:53:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:05,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:53:05,240 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:53:05,241 INFO L87 Difference]: Start difference. First operand 639 states and 938 transitions. Second operand has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:53:05,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:05,747 INFO L93 Difference]: Finished difference Result 1631 states and 2479 transitions. [2025-01-09 03:53:05,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 03:53:05,748 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) Word has length 119 [2025-01-09 03:53:05,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:05,756 INFO L225 Difference]: With dead ends: 1631 [2025-01-09 03:53:05,756 INFO L226 Difference]: Without dead ends: 1023 [2025-01-09 03:53:05,760 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=400, Unknown=0, NotChecked=0, Total=506 [2025-01-09 03:53:05,760 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 1073 mSDsluCounter, 2667 mSDsCounter, 0 mSdLazyCounter, 455 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1073 SdHoareTripleChecker+Valid, 3095 SdHoareTripleChecker+Invalid, 558 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:05,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1073 Valid, 3095 Invalid, 558 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 455 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 03:53:05,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1023 states. [2025-01-09 03:53:05,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1023 to 963. [2025-01-09 03:53:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 763 states have (on average 1.54259501965924) internal successors, (1177), 770 states have internal predecessors, (1177), 151 states have call successors, (151), 43 states have call predecessors, (151), 48 states have return successors, (175), 149 states have call predecessors, (175), 146 states have call successors, (175) [2025-01-09 03:53:05,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1503 transitions. [2025-01-09 03:53:05,813 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1503 transitions. Word has length 119 [2025-01-09 03:53:05,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:05,813 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1503 transitions. [2025-01-09 03:53:05,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 12.8) internal successors, (128), 11 states have internal predecessors, (128), 4 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (24), 3 states have call predecessors, (24), 4 states have call successors, (24) [2025-01-09 03:53:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1503 transitions. [2025-01-09 03:53:05,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-09 03:53:05,817 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:05,817 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:05,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-01-09 03:53:06,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-09 03:53:06,018 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1660318004, now seen corresponding path program 1 times [2025-01-09 03:53:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577387761] [2025-01-09 03:53:06,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-09 03:53:06,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-09 03:53:06,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,073 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:06,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577387761] [2025-01-09 03:53:06,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577387761] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:06,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:06,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:06,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602943762] [2025-01-09 03:53:06,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:06,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:06,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:06,076 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:06,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,076 INFO L87 Difference]: Start difference. First operand 963 states and 1503 transitions. Second operand has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:06,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:06,124 INFO L93 Difference]: Finished difference Result 2158 states and 3427 transitions. [2025-01-09 03:53:06,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:06,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 123 [2025-01-09 03:53:06,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:06,131 INFO L225 Difference]: With dead ends: 2158 [2025-01-09 03:53:06,132 INFO L226 Difference]: Without dead ends: 1276 [2025-01-09 03:53:06,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,135 INFO L435 NwaCegarLoop]: 453 mSDtfsCounter, 104 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:06,135 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 885 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:06,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1276 states. [2025-01-09 03:53:06,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1276 to 1256. [2025-01-09 03:53:06,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1256 states, 992 states have (on average 1.5675403225806452) internal successors, (1555), 999 states have internal predecessors, (1555), 215 states have call successors, (215), 43 states have call predecessors, (215), 48 states have return successors, (249), 213 states have call predecessors, (249), 210 states have call successors, (249) [2025-01-09 03:53:06,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1256 states to 1256 states and 2019 transitions. [2025-01-09 03:53:06,217 INFO L78 Accepts]: Start accepts. Automaton has 1256 states and 2019 transitions. Word has length 123 [2025-01-09 03:53:06,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:06,217 INFO L471 AbstractCegarLoop]: Abstraction has 1256 states and 2019 transitions. [2025-01-09 03:53:06,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.0) internal successors, (81), 3 states have internal predecessors, (81), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:06,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1256 states and 2019 transitions. [2025-01-09 03:53:06,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 03:53:06,222 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:06,222 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:06,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 03:53:06,222 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1829547837, now seen corresponding path program 1 times [2025-01-09 03:53:06,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261340152] [2025-01-09 03:53:06,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,241 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-01-09 03:53:06,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-01-09 03:53:06,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261340152] [2025-01-09 03:53:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261340152] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:06,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:06,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:06,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175728991] [2025-01-09 03:53:06,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:06,277 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:06,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:06,277 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:06,277 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,277 INFO L87 Difference]: Start difference. First operand 1256 states and 2019 transitions. Second operand has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:06,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:06,331 INFO L93 Difference]: Finished difference Result 2881 states and 4674 transitions. [2025-01-09 03:53:06,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:06,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 124 [2025-01-09 03:53:06,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:06,341 INFO L225 Difference]: With dead ends: 2881 [2025-01-09 03:53:06,341 INFO L226 Difference]: Without dead ends: 1757 [2025-01-09 03:53:06,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,347 INFO L435 NwaCegarLoop]: 443 mSDtfsCounter, 102 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:06,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 878 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:06,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2025-01-09 03:53:06,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1737. [2025-01-09 03:53:06,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1737 states, 1378 states have (on average 1.5856313497822931) internal successors, (2185), 1385 states have internal predecessors, (2185), 310 states have call successors, (310), 43 states have call predecessors, (310), 48 states have return successors, (344), 308 states have call predecessors, (344), 305 states have call successors, (344) [2025-01-09 03:53:06,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1737 states to 1737 states and 2839 transitions. [2025-01-09 03:53:06,428 INFO L78 Accepts]: Start accepts. Automaton has 1737 states and 2839 transitions. Word has length 124 [2025-01-09 03:53:06,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:06,429 INFO L471 AbstractCegarLoop]: Abstraction has 1737 states and 2839 transitions. [2025-01-09 03:53:06,429 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.333333333333332) internal successors, (82), 3 states have internal predecessors, (82), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:06,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1737 states and 2839 transitions. [2025-01-09 03:53:06,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-09 03:53:06,435 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:06,435 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:06,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 03:53:06,436 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,436 INFO L85 PathProgramCache]: Analyzing trace with hash -175639546, now seen corresponding path program 1 times [2025-01-09 03:53:06,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286395627] [2025-01-09 03:53:06,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-09 03:53:06,460 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-09 03:53:06,460 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,460 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,489 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:06,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286395627] [2025-01-09 03:53:06,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286395627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:06,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:06,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:06,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689029683] [2025-01-09 03:53:06,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:06,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:06,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:06,491 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:06,491 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,491 INFO L87 Difference]: Start difference. First operand 1737 states and 2839 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:06,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:06,565 INFO L93 Difference]: Finished difference Result 3955 states and 6530 transitions. [2025-01-09 03:53:06,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:06,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 125 [2025-01-09 03:53:06,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:06,578 INFO L225 Difference]: With dead ends: 3955 [2025-01-09 03:53:06,578 INFO L226 Difference]: Without dead ends: 2481 [2025-01-09 03:53:06,584 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,585 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 100 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:06,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 873 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:06,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2481 states. [2025-01-09 03:53:06,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2481 to 2461. [2025-01-09 03:53:06,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2461 states, 1979 states have (on average 1.6008084891359273) internal successors, (3168), 1986 states have internal predecessors, (3168), 433 states have call successors, (433), 43 states have call predecessors, (433), 48 states have return successors, (483), 431 states have call predecessors, (483), 428 states have call successors, (483) [2025-01-09 03:53:06,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 4084 transitions. [2025-01-09 03:53:06,724 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 4084 transitions. Word has length 125 [2025-01-09 03:53:06,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:06,724 INFO L471 AbstractCegarLoop]: Abstraction has 2461 states and 4084 transitions. [2025-01-09 03:53:06,724 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:06,724 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 4084 transitions. [2025-01-09 03:53:06,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2025-01-09 03:53:06,732 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:06,732 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:06,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 03:53:06,732 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:06,733 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:06,733 INFO L85 PathProgramCache]: Analyzing trace with hash 454874978, now seen corresponding path program 1 times [2025-01-09 03:53:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:06,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46113017] [2025-01-09 03:53:06,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:06,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 126 statements into 1 equivalence classes. [2025-01-09 03:53:06,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 126 of 126 statements. [2025-01-09 03:53:06,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:06,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:06,777 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:06,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:06,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46113017] [2025-01-09 03:53:06,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46113017] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:06,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:06,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:06,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633989616] [2025-01-09 03:53:06,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:06,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:06,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:06,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:06,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,778 INFO L87 Difference]: Start difference. First operand 2461 states and 4084 transitions. Second operand has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:06,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:06,869 INFO L93 Difference]: Finished difference Result 5618 states and 9407 transitions. [2025-01-09 03:53:06,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:06,869 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 126 [2025-01-09 03:53:06,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:06,887 INFO L225 Difference]: With dead ends: 5618 [2025-01-09 03:53:06,887 INFO L226 Difference]: Without dead ends: 3632 [2025-01-09 03:53:06,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:06,895 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 98 mSDsluCounter, 432 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 873 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:06,895 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 873 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:06,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3632 states. [2025-01-09 03:53:07,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3632 to 3612. [2025-01-09 03:53:07,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3612 states, 2951 states have (on average 1.6119959335818366) internal successors, (4757), 2958 states have internal predecessors, (4757), 612 states have call successors, (612), 43 states have call predecessors, (612), 48 states have return successors, (688), 610 states have call predecessors, (688), 607 states have call successors, (688) [2025-01-09 03:53:07,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 6057 transitions. [2025-01-09 03:53:07,050 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 6057 transitions. Word has length 126 [2025-01-09 03:53:07,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:07,050 INFO L471 AbstractCegarLoop]: Abstraction has 3612 states and 6057 transitions. [2025-01-09 03:53:07,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.0) internal successors, (84), 3 states have internal predecessors, (84), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 6057 transitions. [2025-01-09 03:53:07,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2025-01-09 03:53:07,063 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:07,063 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:07,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 03:53:07,063 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:07,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:07,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1906856982, now seen corresponding path program 1 times [2025-01-09 03:53:07,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:07,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [616556740] [2025-01-09 03:53:07,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:07,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:07,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 127 statements into 1 equivalence classes. [2025-01-09 03:53:07,086 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 127 of 127 statements. [2025-01-09 03:53:07,086 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:07,086 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:07,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:07,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [616556740] [2025-01-09 03:53:07,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [616556740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:07,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:07,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:07,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158602763] [2025-01-09 03:53:07,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:07,115 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:07,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:07,115 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:07,115 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:07,115 INFO L87 Difference]: Start difference. First operand 3612 states and 6057 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:07,297 INFO L93 Difference]: Finished difference Result 8614 states and 14546 transitions. [2025-01-09 03:53:07,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:07,298 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 127 [2025-01-09 03:53:07,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:07,331 INFO L225 Difference]: With dead ends: 8614 [2025-01-09 03:53:07,332 INFO L226 Difference]: Without dead ends: 5718 [2025-01-09 03:53:07,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:07,347 INFO L435 NwaCegarLoop]: 452 mSDtfsCounter, 96 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:07,347 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 890 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:07,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5718 states. [2025-01-09 03:53:07,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5718 to 5698. [2025-01-09 03:53:07,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5698 states, 4661 states have (on average 1.6108131302295645) internal successors, (7508), 4668 states have internal predecessors, (7508), 988 states have call successors, (988), 43 states have call predecessors, (988), 48 states have return successors, (1108), 986 states have call predecessors, (1108), 983 states have call successors, (1108) [2025-01-09 03:53:07,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5698 states to 5698 states and 9604 transitions. [2025-01-09 03:53:07,576 INFO L78 Accepts]: Start accepts. Automaton has 5698 states and 9604 transitions. Word has length 127 [2025-01-09 03:53:07,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:07,576 INFO L471 AbstractCegarLoop]: Abstraction has 5698 states and 9604 transitions. [2025-01-09 03:53:07,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,577 INFO L276 IsEmpty]: Start isEmpty. Operand 5698 states and 9604 transitions. [2025-01-09 03:53:07,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-01-09 03:53:07,631 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:07,631 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:07,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 03:53:07,631 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:07,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:07,631 INFO L85 PathProgramCache]: Analyzing trace with hash -734593154, now seen corresponding path program 1 times [2025-01-09 03:53:07,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:07,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870856483] [2025-01-09 03:53:07,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:07,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:07,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-01-09 03:53:07,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-01-09 03:53:07,651 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:07,651 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:07,678 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:07,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:07,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870856483] [2025-01-09 03:53:07,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870856483] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:07,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:07,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:07,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76731126] [2025-01-09 03:53:07,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:07,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:07,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:07,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:07,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:07,680 INFO L87 Difference]: Start difference. First operand 5698 states and 9604 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:07,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:07,983 INFO L93 Difference]: Finished difference Result 13903 states and 23603 transitions. [2025-01-09 03:53:07,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:07,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 128 [2025-01-09 03:53:07,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:08,027 INFO L225 Difference]: With dead ends: 13903 [2025-01-09 03:53:08,028 INFO L226 Difference]: Without dead ends: 9307 [2025-01-09 03:53:08,051 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:08,051 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 94 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:08,051 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 876 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9307 states. [2025-01-09 03:53:08,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9307 to 9287. [2025-01-09 03:53:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9287 states, 7644 states have (on average 1.6118524332810047) internal successors, (12321), 7651 states have internal predecessors, (12321), 1594 states have call successors, (1594), 43 states have call predecessors, (1594), 48 states have return successors, (1792), 1592 states have call predecessors, (1792), 1589 states have call successors, (1792) [2025-01-09 03:53:08,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9287 states to 9287 states and 15707 transitions. [2025-01-09 03:53:08,435 INFO L78 Accepts]: Start accepts. Automaton has 9287 states and 15707 transitions. Word has length 128 [2025-01-09 03:53:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:08,436 INFO L471 AbstractCegarLoop]: Abstraction has 9287 states and 15707 transitions. [2025-01-09 03:53:08,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:08,437 INFO L276 IsEmpty]: Start isEmpty. Operand 9287 states and 15707 transitions. [2025-01-09 03:53:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-01-09 03:53:08,456 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:08,456 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:08,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 03:53:08,456 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:08,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:08,457 INFO L85 PathProgramCache]: Analyzing trace with hash 643583304, now seen corresponding path program 1 times [2025-01-09 03:53:08,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:08,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625482052] [2025-01-09 03:53:08,457 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:08,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:08,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-01-09 03:53:08,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-01-09 03:53:08,476 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:08,476 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:08,497 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:08,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:08,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625482052] [2025-01-09 03:53:08,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625482052] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:08,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:08,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:08,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808727017] [2025-01-09 03:53:08,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:08,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:08,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:08,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:08,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:08,499 INFO L87 Difference]: Start difference. First operand 9287 states and 15707 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:08,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:08,829 INFO L93 Difference]: Finished difference Result 23849 states and 40525 transitions. [2025-01-09 03:53:08,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:08,829 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 129 [2025-01-09 03:53:08,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:08,884 INFO L225 Difference]: With dead ends: 23849 [2025-01-09 03:53:08,885 INFO L226 Difference]: Without dead ends: 16094 [2025-01-09 03:53:08,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:08,911 INFO L435 NwaCegarLoop]: 457 mSDtfsCounter, 92 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:08,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 897 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16094 states. [2025-01-09 03:53:09,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16094 to 16074. [2025-01-09 03:53:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16074 states, 13228 states have (on average 1.604550952524947) internal successors, (21225), 13235 states have internal predecessors, (21225), 2797 states have call successors, (2797), 43 states have call predecessors, (2797), 48 states have return successors, (3139), 2795 states have call predecessors, (3139), 2792 states have call successors, (3139) [2025-01-09 03:53:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16074 states to 16074 states and 27161 transitions. [2025-01-09 03:53:09,467 INFO L78 Accepts]: Start accepts. Automaton has 16074 states and 27161 transitions. Word has length 129 [2025-01-09 03:53:09,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:09,467 INFO L471 AbstractCegarLoop]: Abstraction has 16074 states and 27161 transitions. [2025-01-09 03:53:09,467 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:09,467 INFO L276 IsEmpty]: Start isEmpty. Operand 16074 states and 27161 transitions. [2025-01-09 03:53:09,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2025-01-09 03:53:09,495 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:09,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:09,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-09 03:53:09,496 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:09,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:09,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1308937853, now seen corresponding path program 1 times [2025-01-09 03:53:09,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:09,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074477699] [2025-01-09 03:53:09,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:09,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:09,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 130 statements into 1 equivalence classes. [2025-01-09 03:53:09,514 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 130 of 130 statements. [2025-01-09 03:53:09,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:09,515 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:09,538 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:09,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:09,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074477699] [2025-01-09 03:53:09,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074477699] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:09,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:09,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:09,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259012140] [2025-01-09 03:53:09,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:09,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:09,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:09,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:09,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:09,539 INFO L87 Difference]: Start difference. First operand 16074 states and 27161 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:10,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:10,317 INFO L93 Difference]: Finished difference Result 42375 states and 71942 transitions. [2025-01-09 03:53:10,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:10,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 130 [2025-01-09 03:53:10,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:10,447 INFO L225 Difference]: With dead ends: 42375 [2025-01-09 03:53:10,447 INFO L226 Difference]: Without dead ends: 28446 [2025-01-09 03:53:10,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:10,500 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 90 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:10,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 876 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:10,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28446 states. [2025-01-09 03:53:11,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28446 to 28426. [2025-01-09 03:53:11,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28426 states, 23541 states have (on average 1.6009940104498535) internal successors, (37689), 23548 states have internal predecessors, (37689), 4836 states have call successors, (4836), 43 states have call predecessors, (4836), 48 states have return successors, (5452), 4834 states have call predecessors, (5452), 4831 states have call successors, (5452) [2025-01-09 03:53:11,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28426 states to 28426 states and 47977 transitions. [2025-01-09 03:53:11,568 INFO L78 Accepts]: Start accepts. Automaton has 28426 states and 47977 transitions. Word has length 130 [2025-01-09 03:53:11,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:11,568 INFO L471 AbstractCegarLoop]: Abstraction has 28426 states and 47977 transitions. [2025-01-09 03:53:11,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:11,569 INFO L276 IsEmpty]: Start isEmpty. Operand 28426 states and 47977 transitions. [2025-01-09 03:53:11,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2025-01-09 03:53:11,599 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:11,599 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:11,599 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 03:53:11,599 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:11,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:11,600 INFO L85 PathProgramCache]: Analyzing trace with hash 593543750, now seen corresponding path program 1 times [2025-01-09 03:53:11,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:11,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169244049] [2025-01-09 03:53:11,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:11,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:11,612 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 131 statements into 1 equivalence classes. [2025-01-09 03:53:11,619 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 131 of 131 statements. [2025-01-09 03:53:11,619 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:11,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:11,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:11,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169244049] [2025-01-09 03:53:11,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169244049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:11,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:11,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:11,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417127535] [2025-01-09 03:53:11,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:11,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:11,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:11,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:11,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:11,647 INFO L87 Difference]: Start difference. First operand 28426 states and 47977 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:12,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:12,747 INFO L93 Difference]: Finished difference Result 77302 states and 130939 transitions. [2025-01-09 03:53:12,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:12,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 131 [2025-01-09 03:53:12,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:12,983 INFO L225 Difference]: With dead ends: 77302 [2025-01-09 03:53:12,983 INFO L226 Difference]: Without dead ends: 51756 [2025-01-09 03:53:13,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:13,061 INFO L435 NwaCegarLoop]: 441 mSDtfsCounter, 88 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:13,061 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [103 Valid, 876 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:13,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51756 states. [2025-01-09 03:53:14,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51756 to 51736. [2025-01-09 03:53:14,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51736 states, 43136 states have (on average 1.5954886869436202) internal successors, (68823), 43143 states have internal predecessors, (68823), 8551 states have call successors, (8551), 43 states have call predecessors, (8551), 48 states have return successors, (9699), 8549 states have call predecessors, (9699), 8546 states have call successors, (9699) [2025-01-09 03:53:15,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51736 states to 51736 states and 87073 transitions. [2025-01-09 03:53:15,053 INFO L78 Accepts]: Start accepts. Automaton has 51736 states and 87073 transitions. Word has length 131 [2025-01-09 03:53:15,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:15,054 INFO L471 AbstractCegarLoop]: Abstraction has 51736 states and 87073 transitions. [2025-01-09 03:53:15,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 51736 states and 87073 transitions. [2025-01-09 03:53:15,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-09 03:53:15,089 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:15,090 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:15,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 03:53:15,090 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:15,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:15,090 INFO L85 PathProgramCache]: Analyzing trace with hash -713114307, now seen corresponding path program 1 times [2025-01-09 03:53:15,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:15,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785144731] [2025-01-09 03:53:15,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:15,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:15,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-09 03:53:15,121 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-09 03:53:15,121 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:15,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:15,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:15,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785144731] [2025-01-09 03:53:15,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785144731] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:15,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:15,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:53:15,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660554564] [2025-01-09 03:53:15,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:15,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:53:15,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:15,159 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:53:15,159 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:15,160 INFO L87 Difference]: Start difference. First operand 51736 states and 87073 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:17,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:17,202 INFO L93 Difference]: Finished difference Result 96554 states and 162781 transitions. [2025-01-09 03:53:17,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:53:17,203 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 132 [2025-01-09 03:53:17,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:17,566 INFO L225 Difference]: With dead ends: 96554 [2025-01-09 03:53:17,566 INFO L226 Difference]: Without dead ends: 96127 [2025-01-09 03:53:17,601 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:53:17,603 INFO L435 NwaCegarLoop]: 450 mSDtfsCounter, 83 mSDsluCounter, 440 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 890 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:17,603 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 890 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:53:17,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96127 states. [2025-01-09 03:53:20,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96127 to 96107. [2025-01-09 03:53:20,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96107 states, 80708 states have (on average 1.5882192595529563) internal successors, (128182), 80715 states have internal predecessors, (128182), 15350 states have call successors, (15350), 43 states have call predecessors, (15350), 48 states have return successors, (17544), 15348 states have call predecessors, (17544), 15345 states have call successors, (17544) [2025-01-09 03:53:20,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96107 states to 96107 states and 161076 transitions. [2025-01-09 03:53:20,972 INFO L78 Accepts]: Start accepts. Automaton has 96107 states and 161076 transitions. Word has length 132 [2025-01-09 03:53:20,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:20,973 INFO L471 AbstractCegarLoop]: Abstraction has 96107 states and 161076 transitions. [2025-01-09 03:53:20,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2025-01-09 03:53:20,973 INFO L276 IsEmpty]: Start isEmpty. Operand 96107 states and 161076 transitions. [2025-01-09 03:53:21,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-01-09 03:53:21,014 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:21,014 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:21,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-09 03:53:21,014 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:21,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:21,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1130431545, now seen corresponding path program 1 times [2025-01-09 03:53:21,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:21,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139244043] [2025-01-09 03:53:21,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:21,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:21,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-01-09 03:53:21,044 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-01-09 03:53:21,044 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:21,044 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:21,279 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-09 03:53:21,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:21,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139244043] [2025-01-09 03:53:21,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139244043] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:21,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:53:21,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-01-09 03:53:21,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052722934] [2025-01-09 03:53:21,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:21,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 03:53:21,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:21,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 03:53:21,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2025-01-09 03:53:21,281 INFO L87 Difference]: Start difference. First operand 96107 states and 161076 transitions. Second operand has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:23,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:23,871 INFO L93 Difference]: Finished difference Result 96595 states and 161760 transitions. [2025-01-09 03:53:23,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-09 03:53:23,874 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) Word has length 133 [2025-01-09 03:53:23,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:24,219 INFO L225 Difference]: With dead ends: 96595 [2025-01-09 03:53:24,219 INFO L226 Difference]: Without dead ends: 96088 [2025-01-09 03:53:24,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2025-01-09 03:53:24,260 INFO L435 NwaCegarLoop]: 433 mSDtfsCounter, 108 mSDsluCounter, 3882 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 4315 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:24,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 4315 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:53:24,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96088 states. [2025-01-09 03:53:26,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96088 to 96080. [2025-01-09 03:53:27,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96080 states, 80686 states have (on average 1.588280494757455) internal successors, (128152), 80693 states have internal predecessors, (128152), 15348 states have call successors, (15348), 42 states have call predecessors, (15348), 45 states have return successors, (17541), 15344 states have call predecessors, (17541), 15344 states have call successors, (17541) [2025-01-09 03:53:27,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96080 states to 96080 states and 161041 transitions. [2025-01-09 03:53:27,398 INFO L78 Accepts]: Start accepts. Automaton has 96080 states and 161041 transitions. Word has length 133 [2025-01-09 03:53:27,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:53:27,399 INFO L471 AbstractCegarLoop]: Abstraction has 96080 states and 161041 transitions. [2025-01-09 03:53:27,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 10.11111111111111) internal successors, (91), 10 states have internal predecessors, (91), 6 states have call successors, (16), 3 states have call predecessors, (16), 2 states have return successors, (13), 4 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:27,399 INFO L276 IsEmpty]: Start isEmpty. Operand 96080 states and 161041 transitions. [2025-01-09 03:53:27,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2025-01-09 03:53:27,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:53:27,452 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:53:27,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-09 03:53:27,452 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting __automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:53:27,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:53:27,453 INFO L85 PathProgramCache]: Analyzing trace with hash -394131487, now seen corresponding path program 1 times [2025-01-09 03:53:27,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:53:27,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448564361] [2025-01-09 03:53:27,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:27,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:53:27,471 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:53:27,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:53:27,482 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:27,482 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:28,241 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-01-09 03:53:28,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:53:28,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448564361] [2025-01-09 03:53:28,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448564361] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 03:53:28,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1610351815] [2025-01-09 03:53:28,242 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:53:28,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:53:28,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:53:28,245 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:53:28,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-09 03:53:28,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 136 statements into 1 equivalence classes. [2025-01-09 03:53:28,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 136 of 136 statements. [2025-01-09 03:53:28,519 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:53:28,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:53:28,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 1120 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-01-09 03:53:28,530 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:53:28,807 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-09 03:53:28,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:53:28,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1610351815] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:53:28,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 03:53:28,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [16] total 27 [2025-01-09 03:53:28,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874693354] [2025-01-09 03:53:28,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:53:28,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 03:53:28,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:53:28,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 03:53:28,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=639, Unknown=0, NotChecked=0, Total=702 [2025-01-09 03:53:28,809 INFO L87 Difference]: Start difference. First operand 96080 states and 161041 transitions. Second operand has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) [2025-01-09 03:53:31,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:53:31,215 INFO L93 Difference]: Finished difference Result 96723 states and 161924 transitions. [2025-01-09 03:53:31,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-01-09 03:53:31,215 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.416666666666666) internal successors, (101), 11 states have internal predecessors, (101), 6 states have call successors, (16), 5 states have call predecessors, (16), 6 states have return successors, (13), 7 states have call predecessors, (13), 5 states have call successors, (13) Word has length 136 [2025-01-09 03:53:31,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:53:31,516 INFO L225 Difference]: With dead ends: 96723 [2025-01-09 03:53:31,516 INFO L226 Difference]: Without dead ends: 96560 [2025-01-09 03:53:31,554 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=1541, Unknown=0, NotChecked=0, Total=1722 [2025-01-09 03:53:31,555 INFO L435 NwaCegarLoop]: 447 mSDtfsCounter, 699 mSDsluCounter, 4081 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 4528 SdHoareTripleChecker+Invalid, 550 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 03:53:31,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 4528 Invalid, 550 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 03:53:31,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96560 states.