./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 20:38:41,773 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 20:38:41,851 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 20:38:41,856 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 20:38:41,857 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 20:38:41,888 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 20:38:41,888 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 20:38:41,889 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 20:38:41,889 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 20:38:41,890 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 20:38:41,890 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 20:38:41,890 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 20:38:41,891 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 20:38:41,891 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 20:38:41,892 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 20:38:41,894 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 20:38:41,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 20:38:41,897 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 20:38:41,897 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 20:38:41,898 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 20:38:41,898 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 20:38:41,898 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 20:38:41,899 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 20:38:41,899 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 20:38:41,899 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 20:38:41,899 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 20:38:41,900 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 20:38:41,900 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 20:38:41,900 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 20:38:41,901 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 20:38:41,901 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 20:38:41,901 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 20:38:41,901 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:38:41,902 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 20:38:41,907 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 20:38:41,907 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 20:38:41,908 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 20:38:41,908 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 20:38:41,908 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 20:38:41,919 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 20:38:41,919 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 20:38:41,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 20:38:41,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f43e7267ed715243a41104ad5703ed473575064952f167333067630dfd5e9da [2024-11-11 20:38:42,177 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 20:38:42,204 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 20:38:42,208 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 20:38:42,209 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 20:38:42,209 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 20:38:42,211 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2024-11-11 20:38:43,760 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 20:38:44,049 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 20:38:44,049 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c [2024-11-11 20:38:44,070 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205df7ab9/b0de37d45b154e4a9022af94ece74cb6/FLAG3597f79e0 [2024-11-11 20:38:44,089 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/205df7ab9/b0de37d45b154e4a9022af94ece74cb6 [2024-11-11 20:38:44,091 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 20:38:44,093 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 20:38:44,094 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 20:38:44,094 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 20:38:44,100 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 20:38:44,101 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,102 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6edc832 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44, skipping insertion in model container [2024-11-11 20:38:44,102 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,169 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 20:38:44,683 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2024-11-11 20:38:44,701 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:38:44,722 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 20:38:44,732 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"scenario.i","") [48] [2024-11-11 20:38:44,734 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"featureselect.i","") [269] [2024-11-11 20:38:44,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Test.i","") [318] [2024-11-11 20:38:44,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"ClientLib.i","") [598] [2024-11-11 20:38:44,735 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Client.i","") [1671] [2024-11-11 20:38:44,736 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"EmailLib.i","") [1906] [2024-11-11 20:38:44,736 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Util.i","") [2312] [2024-11-11 20:38:44,736 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"libacc.i","") [2329] [2024-11-11 20:38:44,736 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"wsllib_check.i","") [2695] [2024-11-11 20:38:44,737 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"Email.i","") [2704] [2024-11-11 20:38:44,737 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring preprocessor pragma C: #pragma merger(0,"AddressBookEncrypt_spec.i","") [2808] [2024-11-11 20:38:44,820 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/product-lines/email_spec1_product12.cil.c[58861,58874] [2024-11-11 20:38:44,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 20:38:44,862 INFO L204 MainTranslator]: Completed translation [2024-11-11 20:38:44,862 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44 WrapperNode [2024-11-11 20:38:44,863 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 20:38:44,864 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 20:38:44,864 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 20:38:44,864 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 20:38:44,870 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,904 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,947 INFO L138 Inliner]: procedures = 122, calls = 174, calls flagged for inlining = 50, calls inlined = 40, statements flattened = 826 [2024-11-11 20:38:44,948 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 20:38:44,949 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 20:38:44,949 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 20:38:44,949 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 20:38:44,959 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,960 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,964 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,993 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]. [2024-11-11 20:38:44,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:44,993 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:45,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:45,014 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:45,018 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:45,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:45,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 20:38:45,034 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 20:38:45,034 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 20:38:45,034 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 20:38:45,035 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (1/1) ... [2024-11-11 20:38:45,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 20:38:45,052 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:45,074 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-11 20:38:45,079 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-11 20:38:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailEncryptionKey [2024-11-11 20:38:45,136 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailEncryptionKey [2024-11-11 20:38:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailEncryptionKey [2024-11-11 20:38:45,136 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailEncryptionKey [2024-11-11 20:38:45,136 INFO L130 BoogieDeclarations]: Found specification of procedure getEmailTo [2024-11-11 20:38:45,137 INFO L138 BoogieDeclarations]: Found implementation of procedure getEmailTo [2024-11-11 20:38:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailFrom [2024-11-11 20:38:45,137 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailFrom [2024-11-11 20:38:45,137 INFO L130 BoogieDeclarations]: Found specification of procedure createClientKeyringEntry [2024-11-11 20:38:45,138 INFO L138 BoogieDeclarations]: Found implementation of procedure createClientKeyringEntry [2024-11-11 20:38:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure setEmailIsEncrypted [2024-11-11 20:38:45,138 INFO L138 BoogieDeclarations]: Found implementation of procedure setEmailIsEncrypted [2024-11-11 20:38:45,138 INFO L130 BoogieDeclarations]: Found specification of procedure chuckKeyAdd [2024-11-11 20:38:45,138 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckKeyAdd [2024-11-11 20:38:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure setClientId [2024-11-11 20:38:45,139 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientId [2024-11-11 20:38:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 20:38:45,139 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringUser [2024-11-11 20:38:45,140 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringUser [2024-11-11 20:38:45,140 INFO L130 BoogieDeclarations]: Found specification of procedure setClientKeyringPublicKey [2024-11-11 20:38:45,142 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientKeyringPublicKey [2024-11-11 20:38:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure outgoing [2024-11-11 20:38:45,142 INFO L138 BoogieDeclarations]: Found implementation of procedure outgoing [2024-11-11 20:38:45,142 INFO L130 BoogieDeclarations]: Found specification of procedure sendEmail [2024-11-11 20:38:45,143 INFO L138 BoogieDeclarations]: Found implementation of procedure sendEmail [2024-11-11 20:38:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure isEncrypted [2024-11-11 20:38:45,143 INFO L138 BoogieDeclarations]: Found implementation of procedure isEncrypted [2024-11-11 20:38:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure setClientPrivateKey [2024-11-11 20:38:45,143 INFO L138 BoogieDeclarations]: Found implementation of procedure setClientPrivateKey [2024-11-11 20:38:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 20:38:45,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 20:38:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-11 20:38:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-11 20:38:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure generateKeyPair [2024-11-11 20:38:45,144 INFO L138 BoogieDeclarations]: Found implementation of procedure generateKeyPair [2024-11-11 20:38:45,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 20:38:45,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 20:38:45,381 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 20:38:45,383 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 20:38:46,158 INFO L? ?]: Removed 336 outVars from TransFormulas that were not future-live. [2024-11-11 20:38:46,158 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 20:38:46,183 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 20:38:46,185 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-11 20:38:46,185 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:38:46 BoogieIcfgContainer [2024-11-11 20:38:46,185 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 20:38:46,188 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 20:38:46,188 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 20:38:46,191 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 20:38:46,191 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:38:44" (1/3) ... [2024-11-11 20:38:46,192 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a904475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:38:46, skipping insertion in model container [2024-11-11 20:38:46,192 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:38:44" (2/3) ... [2024-11-11 20:38:46,193 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a904475 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:38:46, skipping insertion in model container [2024-11-11 20:38:46,194 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:38:46" (3/3) ... [2024-11-11 20:38:46,195 INFO L112 eAbstractionObserver]: Analyzing ICFG email_spec1_product12.cil.c [2024-11-11 20:38:46,210 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 20:38:46,211 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 20:38:46,290 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 20:38:46,299 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;@4c95fd2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 20:38:46,299 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 20:38:46,307 INFO L276 IsEmpty]: Start isEmpty. Operand has 261 states, 205 states have (on average 1.5560975609756098) internal successors, (319), 209 states have internal predecessors, (319), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) [2024-11-11 20:38:46,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2024-11-11 20:38:46,330 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:46,331 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] [2024-11-11 20:38:46,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:46,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -624496629, now seen corresponding path program 1 times [2024-11-11 20:38:46,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:46,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673584737] [2024-11-11 20:38:46,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:46,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:46,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:47,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:47,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:47,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:47,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:47,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-11 20:38:47,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:38:47,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:38:47,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:38:47,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,123 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:38:47,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:47,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673584737] [2024-11-11 20:38:47,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673584737] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:47,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535317427] [2024-11-11 20:38:47,125 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:47,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:47,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:47,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:47,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-11 20:38:47,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:47,425 INFO L256 TraceCheckSpWp]: Trace formula consists of 871 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-11 20:38:47,431 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:47,448 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:38:47,448 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:47,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1535317427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:47,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:47,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2024-11-11 20:38:47,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195253487] [2024-11-11 20:38:47,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:47,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 20:38:47,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:47,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 20:38:47,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:38:47,485 INFO L87 Difference]: Start difference. First operand has 261 states, 205 states have (on average 1.5560975609756098) internal successors, (319), 209 states have internal predecessors, (319), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (39), 39 states have call predecessors, (39), 39 states have call successors, (39) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:38:47,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:47,546 INFO L93 Difference]: Finished difference Result 373 states and 556 transitions. [2024-11-11 20:38:47,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 20:38:47,548 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 86 [2024-11-11 20:38:47,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:47,560 INFO L225 Difference]: With dead ends: 373 [2024-11-11 20:38:47,561 INFO L226 Difference]: Without dead ends: 254 [2024-11-11 20:38:47,566 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:38:47,571 INFO L435 NwaCegarLoop]: 393 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, 393 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 [2024-11-11 20:38:47,572 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 393 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:47,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-11 20:38:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-11 20:38:47,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 199 states have (on average 1.5477386934673367) internal successors, (308), 202 states have internal predecessors, (308), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 20:38:47,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 385 transitions. [2024-11-11 20:38:47,630 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 385 transitions. Word has length 86 [2024-11-11 20:38:47,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:47,631 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 385 transitions. [2024-11-11 20:38:47,631 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:38:47,632 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 385 transitions. [2024-11-11 20:38:47,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2024-11-11 20:38:47,636 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:47,637 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] [2024-11-11 20:38:47,656 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-11 20:38:47,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-11 20:38:47,838 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:47,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:47,839 INFO L85 PathProgramCache]: Analyzing trace with hash 434501306, now seen corresponding path program 1 times [2024-11-11 20:38:47,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:47,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500864516] [2024-11-11 20:38:47,839 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:47,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:48,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:48,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:48,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-11 20:38:48,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:38:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:38:48,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:38:48,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,159 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-11 20:38:48,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:48,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500864516] [2024-11-11 20:38:48,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500864516] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:48,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1734298901] [2024-11-11 20:38:48,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:48,161 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:48,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:48,163 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:48,164 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-11 20:38:48,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 872 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-11 20:38:48,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:38:48,446 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:48,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1734298901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:48,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:48,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:38:48,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242740885] [2024-11-11 20:38:48,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:48,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:38:48,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:48,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:38:48,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:38:48,449 INFO L87 Difference]: Start difference. First operand 254 states and 385 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:38:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:48,520 INFO L93 Difference]: Finished difference Result 363 states and 537 transitions. [2024-11-11 20:38:48,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:38:48,521 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 87 [2024-11-11 20:38:48,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:48,525 INFO L225 Difference]: With dead ends: 363 [2024-11-11 20:38:48,527 INFO L226 Difference]: Without dead ends: 257 [2024-11-11 20:38:48,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:38:48,532 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1 mSDsluCounter, 381 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 764 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 [2024-11-11 20:38:48,532 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 764 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:48,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2024-11-11 20:38:48,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 256. [2024-11-11 20:38:48,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 201 states have (on average 1.5422885572139304) internal successors, (310), 204 states have internal predecessors, (310), 39 states have call successors, (39), 15 states have call predecessors, (39), 15 states have return successors, (38), 38 states have call predecessors, (38), 38 states have call successors, (38) [2024-11-11 20:38:48,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 387 transitions. [2024-11-11 20:38:48,557 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 387 transitions. Word has length 87 [2024-11-11 20:38:48,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:48,558 INFO L471 AbstractCegarLoop]: Abstraction has 256 states and 387 transitions. [2024-11-11 20:38:48,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:38:48,559 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 387 transitions. [2024-11-11 20:38:48,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-11 20:38:48,564 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:48,564 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:48,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-11 20:38:48,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2024-11-11 20:38:48,765 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:48,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:48,766 INFO L85 PathProgramCache]: Analyzing trace with hash -2121837743, now seen corresponding path program 1 times [2024-11-11 20:38:48,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:48,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104895640] [2024-11-11 20:38:48,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:48,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:48,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:48,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:48,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:48,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-11 20:38:48,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-11 20:38:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:38:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:38:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,003 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:38:49,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104895640] [2024-11-11 20:38:49,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104895640] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:49,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535374595] [2024-11-11 20:38:49,004 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:49,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:49,006 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:49,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-11 20:38:49,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,271 INFO L256 TraceCheckSpWp]: Trace formula consists of 884 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:38:49,274 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:49,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-11-11 20:38:49,294 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:49,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535374595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:49,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:49,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2024-11-11 20:38:49,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455895747] [2024-11-11 20:38:49,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:49,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 20:38:49,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:49,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 20:38:49,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:38:49,299 INFO L87 Difference]: Start difference. First operand 256 states and 387 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:38:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:49,332 INFO L93 Difference]: Finished difference Result 537 states and 825 transitions. [2024-11-11 20:38:49,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 20:38:49,333 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 93 [2024-11-11 20:38:49,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:49,341 INFO L225 Difference]: With dead ends: 537 [2024-11-11 20:38:49,341 INFO L226 Difference]: Without dead ends: 308 [2024-11-11 20:38:49,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-11 20:38:49,343 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 99 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 731 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 [2024-11-11 20:38:49,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 731 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:49,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2024-11-11 20:38:49,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 300. [2024-11-11 20:38:49,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 234 states have (on average 1.5555555555555556) internal successors, (364), 237 states have internal predecessors, (364), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (49), 49 states have call predecessors, (49), 49 states have call successors, (49) [2024-11-11 20:38:49,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 463 transitions. [2024-11-11 20:38:49,382 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 463 transitions. Word has length 93 [2024-11-11 20:38:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:49,382 INFO L471 AbstractCegarLoop]: Abstraction has 300 states and 463 transitions. [2024-11-11 20:38:49,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:38:49,384 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 463 transitions. [2024-11-11 20:38:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-11-11 20:38:49,386 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:49,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:49,405 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-11 20:38:49,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:49,591 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:49,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:49,592 INFO L85 PathProgramCache]: Analyzing trace with hash -2132692778, now seen corresponding path program 1 times [2024-11-11 20:38:49,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:49,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [953688904] [2024-11-11 20:38:49,592 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:49,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:49,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:49,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:49,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:49,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-11 20:38:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-11-11 20:38:49,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-11-11 20:38:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-11 20:38:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-11 20:38:49,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:38:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:38:49,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:49,836 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:38:49,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:49,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [953688904] [2024-11-11 20:38:49,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [953688904] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:49,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166147970] [2024-11-11 20:38:49,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:49,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:49,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:49,840 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:49,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-11 20:38:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-11 20:38:50,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:50,199 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:38:50,200 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:50,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166147970] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:50,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:50,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2024-11-11 20:38:50,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748192612] [2024-11-11 20:38:50,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:50,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:38:50,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:50,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:38:50,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:38:50,208 INFO L87 Difference]: Start difference. First operand 300 states and 463 transitions. Second operand has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:50,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:50,266 INFO L93 Difference]: Finished difference Result 591 states and 916 transitions. [2024-11-11 20:38:50,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:38:50,267 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 94 [2024-11-11 20:38:50,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:50,272 INFO L225 Difference]: With dead ends: 591 [2024-11-11 20:38:50,272 INFO L226 Difference]: Without dead ends: 302 [2024-11-11 20:38:50,274 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:38:50,275 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 2 mSDsluCounter, 1120 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1497 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 [2024-11-11 20:38:50,279 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1497 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 20:38:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-11-11 20:38:50,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2024-11-11 20:38:50,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 235 states have (on average 1.553191489361702) internal successors, (365), 239 states have internal predecessors, (365), 50 states have call successors, (50), 15 states have call predecessors, (50), 16 states have return successors, (51), 49 states have call predecessors, (51), 49 states have call successors, (51) [2024-11-11 20:38:50,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 466 transitions. [2024-11-11 20:38:50,302 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 466 transitions. Word has length 94 [2024-11-11 20:38:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:50,302 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 466 transitions. [2024-11-11 20:38:50,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 16.25) internal successors, (65), 5 states have internal predecessors, (65), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 466 transitions. [2024-11-11 20:38:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-11 20:38:50,304 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:50,305 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 20:38:50,325 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-11 20:38:50,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:50,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:50,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:50,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1205446056, now seen corresponding path program 1 times [2024-11-11 20:38:50,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:50,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199298157] [2024-11-11 20:38:50,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:50,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:50,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:50,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:38:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-11 20:38:50,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-11 20:38:50,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-11 20:38:50,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:38:50,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:38:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:38:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:50,743 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:38:50,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:50,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199298157] [2024-11-11 20:38:50,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199298157] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:50,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [464069108] [2024-11-11 20:38:50,746 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:50,746 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:50,746 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:50,748 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:50,749 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-11 20:38:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 890 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-11 20:38:51,047 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:51,114 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-11 20:38:51,114 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-11 20:38:51,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [464069108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:51,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-11 20:38:51,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 14 [2024-11-11 20:38:51,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [674166539] [2024-11-11 20:38:51,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:51,117 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-11 20:38:51,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:51,117 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-11 20:38:51,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:38:51,119 INFO L87 Difference]: Start difference. First operand 302 states and 466 transitions. Second operand has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:51,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:51,211 INFO L93 Difference]: Finished difference Result 593 states and 921 transitions. [2024-11-11 20:38:51,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-11 20:38:51,213 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) Word has length 95 [2024-11-11 20:38:51,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:51,217 INFO L225 Difference]: With dead ends: 593 [2024-11-11 20:38:51,217 INFO L226 Difference]: Without dead ends: 304 [2024-11-11 20:38:51,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:38:51,220 INFO L435 NwaCegarLoop]: 375 mSDtfsCounter, 2 mSDsluCounter, 1108 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 1483 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.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:51,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 1483 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-11 20:38:51,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2024-11-11 20:38:51,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 304. [2024-11-11 20:38:51,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 241 states have internal predecessors, (366), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2024-11-11 20:38:51,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 472 transitions. [2024-11-11 20:38:51,241 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 472 transitions. Word has length 95 [2024-11-11 20:38:51,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:51,241 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 472 transitions. [2024-11-11 20:38:51,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.4) internal successors, (67), 5 states have internal predecessors, (67), 3 states have call successors, (12), 2 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:51,242 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 472 transitions. [2024-11-11 20:38:51,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2024-11-11 20:38:51,243 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:51,244 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] [2024-11-11 20:38:51,262 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-11 20:38:51,444 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:51,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:51,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:51,445 INFO L85 PathProgramCache]: Analyzing trace with hash 658475617, now seen corresponding path program 1 times [2024-11-11 20:38:51,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:51,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517160126] [2024-11-11 20:38:51,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:51,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:51,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,600 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:51,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:38:51,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:38:51,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-11 20:38:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-11 20:38:51,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:38:51,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:38:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:38:51,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:51,669 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:38:51,669 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:51,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517160126] [2024-11-11 20:38:51,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517160126] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:51,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:51,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:38:51,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831655152] [2024-11-11 20:38:51,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:51,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:38:51,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:51,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:38:51,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:38:51,673 INFO L87 Difference]: Start difference. First operand 304 states and 472 transitions. Second operand has 8 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:52,878 INFO L93 Difference]: Finished difference Result 637 states and 995 transitions. [2024-11-11 20:38:52,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:38:52,878 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 96 [2024-11-11 20:38:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:52,882 INFO L225 Difference]: With dead ends: 637 [2024-11-11 20:38:52,882 INFO L226 Difference]: Without dead ends: 356 [2024-11-11 20:38:52,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:38:52,884 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 569 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1441 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:52,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 926 Invalid, 1604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:38:52,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2024-11-11 20:38:52,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 304. [2024-11-11 20:38:52,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 304 states, 236 states have (on average 1.5508474576271187) internal successors, (366), 241 states have internal predecessors, (366), 50 states have call successors, (50), 15 states have call predecessors, (50), 17 states have return successors, (55), 49 states have call predecessors, (55), 49 states have call successors, (55) [2024-11-11 20:38:52,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 304 states to 304 states and 471 transitions. [2024-11-11 20:38:52,913 INFO L78 Accepts]: Start accepts. Automaton has 304 states and 471 transitions. Word has length 96 [2024-11-11 20:38:52,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:52,913 INFO L471 AbstractCegarLoop]: Abstraction has 304 states and 471 transitions. [2024-11-11 20:38:52,914 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:52,914 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 471 transitions. [2024-11-11 20:38:52,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-11 20:38:52,916 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:52,916 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] [2024-11-11 20:38:52,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-11 20:38:52,916 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:52,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:52,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1219216955, now seen corresponding path program 2 times [2024-11-11 20:38:52,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:52,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277463075] [2024-11-11 20:38:52,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:52,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:52,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:53,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:53,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:53,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:38:53,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:38:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-11 20:38:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-11 20:38:53,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:38:53,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:38:53,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-11 20:38:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:53,088 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2024-11-11 20:38:53,089 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:53,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277463075] [2024-11-11 20:38:53,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277463075] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:53,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:53,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-11 20:38:53,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935255776] [2024-11-11 20:38:53,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:53,090 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-11 20:38:53,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:53,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-11 20:38:53,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-11 20:38:53,091 INFO L87 Difference]: Start difference. First operand 304 states and 471 transitions. Second operand has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:54,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:54,251 INFO L93 Difference]: Finished difference Result 639 states and 998 transitions. [2024-11-11 20:38:54,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-11 20:38:54,252 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 97 [2024-11-11 20:38:54,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:54,257 INFO L225 Difference]: With dead ends: 639 [2024-11-11 20:38:54,258 INFO L226 Difference]: Without dead ends: 358 [2024-11-11 20:38:54,259 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:38:54,260 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 566 mSDsluCounter, 757 mSDsCounter, 0 mSdLazyCounter, 1448 mSolverCounterSat, 163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 1611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 163 IncrementalHoareTripleChecker+Valid, 1448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:54,260 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 926 Invalid, 1611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [163 Valid, 1448 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:38:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-11 20:38:54,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 306. [2024-11-11 20:38:54,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 243 states have internal predecessors, (367), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (57), 49 states have call predecessors, (57), 49 states have call successors, (57) [2024-11-11 20:38:54,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 474 transitions. [2024-11-11 20:38:54,292 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 474 transitions. Word has length 97 [2024-11-11 20:38:54,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:54,293 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 474 transitions. [2024-11-11 20:38:54,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 9.142857142857142) internal successors, (64), 5 states have internal predecessors, (64), 3 states have call successors, (12), 5 states have call predecessors, (12), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2024-11-11 20:38:54,293 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 474 transitions. [2024-11-11 20:38:54,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-11 20:38:54,295 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:54,295 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] [2024-11-11 20:38:54,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-11 20:38:54,295 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:54,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:54,296 INFO L85 PathProgramCache]: Analyzing trace with hash 252552444, now seen corresponding path program 1 times [2024-11-11 20:38:54,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:54,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565232054] [2024-11-11 20:38:54,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:54,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:54,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:54,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:54,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:38:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:38:54,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:38:54,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-11 20:38:54,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:38:54,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:38:54,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-11 20:38:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:54,495 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:38:54,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:54,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565232054] [2024-11-11 20:38:54,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565232054] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:54,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:54,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:38:54,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79163817] [2024-11-11 20:38:54,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:54,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:38:54,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:54,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:38:54,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:38:54,498 INFO L87 Difference]: Start difference. First operand 306 states and 474 transitions. Second operand has 11 states, 10 states have (on average 6.8) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-11 20:38:56,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:56,145 INFO L93 Difference]: Finished difference Result 637 states and 993 transitions. [2024-11-11 20:38:56,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:38:56,145 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 98 [2024-11-11 20:38:56,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:56,148 INFO L225 Difference]: With dead ends: 637 [2024-11-11 20:38:56,148 INFO L226 Difference]: Without dead ends: 358 [2024-11-11 20:38:56,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:38:56,150 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 569 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 1329 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:56,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 1329 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:38:56,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2024-11-11 20:38:56,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 306. [2024-11-11 20:38:56,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 237 states have (on average 1.5485232067510548) internal successors, (367), 243 states have internal predecessors, (367), 50 states have call successors, (50), 15 states have call predecessors, (50), 18 states have return successors, (56), 49 states have call predecessors, (56), 49 states have call successors, (56) [2024-11-11 20:38:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 473 transitions. [2024-11-11 20:38:56,174 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 473 transitions. Word has length 98 [2024-11-11 20:38:56,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:56,175 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 473 transitions. [2024-11-11 20:38:56,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.8) internal successors, (68), 8 states have internal predecessors, (68), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-11 20:38:56,175 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 473 transitions. [2024-11-11 20:38:56,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-11 20:38:56,177 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:56,177 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] [2024-11-11 20:38:56,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-11 20:38:56,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:56,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:56,178 INFO L85 PathProgramCache]: Analyzing trace with hash -320628967, now seen corresponding path program 2 times [2024-11-11 20:38:56,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:56,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917799992] [2024-11-11 20:38:56,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:56,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:56,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:56,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:56,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:38:56,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:38:56,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:38:56,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-11 20:38:56,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:38:56,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:38:56,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,390 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:38:56,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:56,392 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-11 20:38:56,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:56,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917799992] [2024-11-11 20:38:56,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917799992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:38:56,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:38:56,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:38:56,393 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000511304] [2024-11-11 20:38:56,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:38:56,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:38:56,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:56,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:38:56,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:38:56,395 INFO L87 Difference]: Start difference. First operand 306 states and 473 transitions. Second operand has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-11 20:38:58,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:58,032 INFO L93 Difference]: Finished difference Result 639 states and 999 transitions. [2024-11-11 20:38:58,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 20:38:58,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 99 [2024-11-11 20:38:58,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:58,036 INFO L225 Difference]: With dead ends: 639 [2024-11-11 20:38:58,036 INFO L226 Difference]: Without dead ends: 360 [2024-11-11 20:38:58,037 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2024-11-11 20:38:58,038 INFO L435 NwaCegarLoop]: 168 mSDtfsCounter, 566 mSDsluCounter, 1162 mSDsCounter, 0 mSdLazyCounter, 2477 mSolverCounterSat, 166 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1330 SdHoareTripleChecker+Invalid, 2643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 166 IncrementalHoareTripleChecker+Valid, 2477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:58,038 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [567 Valid, 1330 Invalid, 2643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [166 Valid, 2477 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-11 20:38:58,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2024-11-11 20:38:58,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 308. [2024-11-11 20:38:58,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 238 states have (on average 1.546218487394958) internal successors, (368), 245 states have internal predecessors, (368), 50 states have call successors, (50), 15 states have call predecessors, (50), 19 states have return successors, (61), 49 states have call predecessors, (61), 49 states have call successors, (61) [2024-11-11 20:38:58,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 479 transitions. [2024-11-11 20:38:58,065 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 479 transitions. Word has length 99 [2024-11-11 20:38:58,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:58,066 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 479 transitions. [2024-11-11 20:38:58,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.9) internal successors, (69), 8 states have internal predecessors, (69), 4 states have call successors, (12), 5 states have call predecessors, (12), 3 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-11 20:38:58,066 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 479 transitions. [2024-11-11 20:38:58,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-11 20:38:58,068 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:58,068 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] [2024-11-11 20:38:58,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-11 20:38:58,068 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:38:58,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:38:58,069 INFO L85 PathProgramCache]: Analyzing trace with hash -807696649, now seen corresponding path program 1 times [2024-11-11 20:38:58,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:38:58,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187332512] [2024-11-11 20:38:58,069 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:58,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:38:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:38:58,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:38:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:38:58,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:38:58,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:38:58,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:38:58,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-11 20:38:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:38:58,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:38:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:38:58,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:38:58,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:38:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187332512] [2024-11-11 20:38:58,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187332512] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 20:38:58,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1708222131] [2024-11-11 20:38:58,237 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:38:58,238 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:38:58,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 20:38:58,239 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-11 20:38:58,241 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-11 20:38:58,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:38:58,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-11 20:38:58,523 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 20:38:58,567 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:38:58,567 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 20:38:58,655 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:38:58,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1708222131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 20:38:58,655 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 20:38:58,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 10 [2024-11-11 20:38:58,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379869196] [2024-11-11 20:38:58,656 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 20:38:58,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-11 20:38:58,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:38:58,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-11 20:38:58,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:38:58,658 INFO L87 Difference]: Start difference. First operand 308 states and 479 transitions. Second operand has 10 states, 10 states have (on average 9.1) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:38:59,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:38:59,884 INFO L93 Difference]: Finished difference Result 793 states and 1297 transitions. [2024-11-11 20:38:59,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-11 20:38:59,885 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 100 [2024-11-11 20:38:59,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:38:59,890 INFO L225 Difference]: With dead ends: 793 [2024-11-11 20:38:59,890 INFO L226 Difference]: Without dead ends: 687 [2024-11-11 20:38:59,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:38:59,892 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 940 mSDsluCounter, 901 mSDsCounter, 0 mSdLazyCounter, 1260 mSolverCounterSat, 279 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1127 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 279 IncrementalHoareTripleChecker+Valid, 1260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-11 20:38:59,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [985 Valid, 1127 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [279 Valid, 1260 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-11 20:38:59,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2024-11-11 20:38:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 611. [2024-11-11 20:38:59,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 611 states, 477 states have (on average 1.6058700209643606) internal successors, (766), 484 states have internal predecessors, (766), 114 states have call successors, (114), 15 states have call predecessors, (114), 19 states have return successors, (135), 113 states have call predecessors, (135), 113 states have call successors, (135) [2024-11-11 20:38:59,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 611 states to 611 states and 1015 transitions. [2024-11-11 20:38:59,927 INFO L78 Accepts]: Start accepts. Automaton has 611 states and 1015 transitions. Word has length 100 [2024-11-11 20:38:59,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:38:59,928 INFO L471 AbstractCegarLoop]: Abstraction has 611 states and 1015 transitions. [2024-11-11 20:38:59,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.1) internal successors, (91), 7 states have internal predecessors, (91), 2 states have call successors, (24), 5 states have call predecessors, (24), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2024-11-11 20:38:59,928 INFO L276 IsEmpty]: Start isEmpty. Operand 611 states and 1015 transitions. [2024-11-11 20:38:59,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-11 20:38:59,932 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:38:59,932 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] [2024-11-11 20:38:59,951 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-11 20:39:00,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 20:39:00,133 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:00,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:00,134 INFO L85 PathProgramCache]: Analyzing trace with hash -699793798, now seen corresponding path program 1 times [2024-11-11 20:39:00,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:00,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371405968] [2024-11-11 20:39:00,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:00,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:00,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:00,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:00,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:00,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:00,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:00,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-11 20:39:00,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-11 20:39:00,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2024-11-11 20:39:00,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:39:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:00,271 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:00,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:00,272 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371405968] [2024-11-11 20:39:00,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371405968] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:00,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:00,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:00,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980600246] [2024-11-11 20:39:00,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:00,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:00,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:00,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:00,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:00,273 INFO L87 Difference]: Start difference. First operand 611 states and 1015 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:01,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:01,135 INFO L93 Difference]: Finished difference Result 1514 states and 2576 transitions. [2024-11-11 20:39:01,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:01,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 106 [2024-11-11 20:39:01,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:01,144 INFO L225 Difference]: With dead ends: 1514 [2024-11-11 20:39:01,144 INFO L226 Difference]: Without dead ends: 971 [2024-11-11 20:39:01,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:01,148 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 662 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 820 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 820 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:01,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 699 Invalid, 1022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 820 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:39:01,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2024-11-11 20:39:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 911. [2024-11-11 20:39:01,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 713 states have (on average 1.614305750350631) internal successors, (1151), 720 states have internal predecessors, (1151), 178 states have call successors, (178), 15 states have call predecessors, (178), 19 states have return successors, (209), 177 states have call predecessors, (209), 177 states have call successors, (209) [2024-11-11 20:39:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1538 transitions. [2024-11-11 20:39:01,198 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1538 transitions. Word has length 106 [2024-11-11 20:39:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:01,199 INFO L471 AbstractCegarLoop]: Abstraction has 911 states and 1538 transitions. [2024-11-11 20:39:01,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:01,200 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1538 transitions. [2024-11-11 20:39:01,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-11 20:39:01,205 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:01,205 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] [2024-11-11 20:39:01,205 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-11 20:39:01,205 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:01,206 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:01,206 INFO L85 PathProgramCache]: Analyzing trace with hash 1925218256, now seen corresponding path program 1 times [2024-11-11 20:39:01,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:01,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34607488] [2024-11-11 20:39:01,206 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:01,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:01,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:01,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:01,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-11 20:39:01,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-11 20:39:01,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-11 20:39:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:39:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:01,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34607488] [2024-11-11 20:39:01,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34607488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:01,294 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:01,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:01,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [269182229] [2024-11-11 20:39:01,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:01,294 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:01,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:01,295 INFO L87 Difference]: Start difference. First operand 911 states and 1538 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:02,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:02,184 INFO L93 Difference]: Finished difference Result 2229 states and 3821 transitions. [2024-11-11 20:39:02,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:02,184 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 107 [2024-11-11 20:39:02,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:02,192 INFO L225 Difference]: With dead ends: 2229 [2024-11-11 20:39:02,193 INFO L226 Difference]: Without dead ends: 1439 [2024-11-11 20:39:02,196 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:02,197 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 660 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 790 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 790 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:02,197 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 648 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 790 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:39:02,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1439 states. [2024-11-11 20:39:02,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1439 to 1379. [2024-11-11 20:39:02,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1379 states, 1086 states have (on average 1.6187845303867403) internal successors, (1758), 1093 states have internal predecessors, (1758), 273 states have call successors, (273), 15 states have call predecessors, (273), 19 states have return successors, (304), 272 states have call predecessors, (304), 272 states have call successors, (304) [2024-11-11 20:39:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1379 states to 1379 states and 2335 transitions. [2024-11-11 20:39:02,257 INFO L78 Accepts]: Start accepts. Automaton has 1379 states and 2335 transitions. Word has length 107 [2024-11-11 20:39:02,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:02,257 INFO L471 AbstractCegarLoop]: Abstraction has 1379 states and 2335 transitions. [2024-11-11 20:39:02,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 3 states have internal predecessors, (72), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:02,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1379 states and 2335 transitions. [2024-11-11 20:39:02,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-11-11 20:39:02,264 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:02,264 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] [2024-11-11 20:39:02,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-11 20:39:02,265 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:02,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:02,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1161467032, now seen corresponding path program 1 times [2024-11-11 20:39:02,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:02,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642424967] [2024-11-11 20:39:02,265 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:02,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:02,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:02,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:02,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:02,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:02,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-11 20:39:02,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-11-11 20:39:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-11 20:39:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:39:02,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:02,372 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:02,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:02,373 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [642424967] [2024-11-11 20:39:02,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [642424967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:02,373 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:02,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:02,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011103628] [2024-11-11 20:39:02,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:02,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:02,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:02,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:02,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:02,376 INFO L87 Difference]: Start difference. First operand 1379 states and 2335 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:03,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:03,282 INFO L93 Difference]: Finished difference Result 3276 states and 5662 transitions. [2024-11-11 20:39:03,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:03,282 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 108 [2024-11-11 20:39:03,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:03,295 INFO L225 Difference]: With dead ends: 3276 [2024-11-11 20:39:03,295 INFO L226 Difference]: Without dead ends: 2143 [2024-11-11 20:39:03,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:03,302 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 658 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:03,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 647 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:39:03,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2143 states. [2024-11-11 20:39:03,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2143 to 2083. [2024-11-11 20:39:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2083 states, 1667 states have (on average 1.6226754649070185) internal successors, (2705), 1674 states have internal predecessors, (2705), 396 states have call successors, (396), 15 states have call predecessors, (396), 19 states have return successors, (443), 395 states have call predecessors, (443), 395 states have call successors, (443) [2024-11-11 20:39:03,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2083 states to 2083 states and 3544 transitions. [2024-11-11 20:39:03,406 INFO L78 Accepts]: Start accepts. Automaton has 2083 states and 3544 transitions. Word has length 108 [2024-11-11 20:39:03,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:03,406 INFO L471 AbstractCegarLoop]: Abstraction has 2083 states and 3544 transitions. [2024-11-11 20:39:03,406 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 3 states have internal predecessors, (73), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:03,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2083 states and 3544 transitions. [2024-11-11 20:39:03,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-11 20:39:03,414 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:03,414 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] [2024-11-11 20:39:03,414 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-11 20:39:03,414 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:03,415 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:03,415 INFO L85 PathProgramCache]: Analyzing trace with hash -1105028913, now seen corresponding path program 1 times [2024-11-11 20:39:03,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:03,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745730722] [2024-11-11 20:39:03,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:03,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:03,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:03,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:03,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:03,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,499 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-11 20:39:03,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-11 20:39:03,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,503 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-11 20:39:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:39:03,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:03,506 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:03,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:03,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745730722] [2024-11-11 20:39:03,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745730722] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:03,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:03,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:03,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [620251369] [2024-11-11 20:39:03,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:03,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:03,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:03,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:03,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:03,509 INFO L87 Difference]: Start difference. First operand 2083 states and 3544 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:04,535 INFO L93 Difference]: Finished difference Result 4895 states and 8516 transitions. [2024-11-11 20:39:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:04,536 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 109 [2024-11-11 20:39:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:04,556 INFO L225 Difference]: With dead ends: 4895 [2024-11-11 20:39:04,556 INFO L226 Difference]: Without dead ends: 3262 [2024-11-11 20:39:04,564 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:04,565 INFO L435 NwaCegarLoop]: 169 mSDtfsCounter, 656 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 788 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 646 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 788 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:04,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 646 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 788 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:39:04,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3262 states. [2024-11-11 20:39:04,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3262 to 3202. [2024-11-11 20:39:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3202 states, 2607 states have (on average 1.624856156501726) internal successors, (4236), 2614 states have internal predecessors, (4236), 575 states have call successors, (575), 15 states have call predecessors, (575), 19 states have return successors, (648), 574 states have call predecessors, (648), 574 states have call successors, (648) [2024-11-11 20:39:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3202 states to 3202 states and 5459 transitions. [2024-11-11 20:39:04,716 INFO L78 Accepts]: Start accepts. Automaton has 3202 states and 5459 transitions. Word has length 109 [2024-11-11 20:39:04,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:04,717 INFO L471 AbstractCegarLoop]: Abstraction has 3202 states and 5459 transitions. [2024-11-11 20:39:04,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 3 states have internal predecessors, (74), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 3202 states and 5459 transitions. [2024-11-11 20:39:04,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-11-11 20:39:04,726 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:04,727 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] [2024-11-11 20:39:04,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-11 20:39:04,727 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:04,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:04,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1327662884, now seen corresponding path program 1 times [2024-11-11 20:39:04,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:04,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1704537384] [2024-11-11 20:39:04,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:04,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:04,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:04,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,802 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:04,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-11 20:39:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-11 20:39:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-11 20:39:04,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:39:04,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:04,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:04,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:04,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1704537384] [2024-11-11 20:39:04,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1704537384] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:04,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:04,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:04,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133283486] [2024-11-11 20:39:04,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:04,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:04,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:04,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:04,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:04,828 INFO L87 Difference]: Start difference. First operand 3202 states and 5459 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:05,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:05,757 INFO L93 Difference]: Finished difference Result 7813 states and 13615 transitions. [2024-11-11 20:39:05,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:05,758 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 110 [2024-11-11 20:39:05,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:05,793 INFO L225 Difference]: With dead ends: 7813 [2024-11-11 20:39:05,793 INFO L226 Difference]: Without dead ends: 5293 [2024-11-11 20:39:05,806 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:05,807 INFO L435 NwaCegarLoop]: 182 mSDtfsCounter, 654 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 1020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:05,808 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 677 Invalid, 1020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-11 20:39:05,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2024-11-11 20:39:06,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5233. [2024-11-11 20:39:06,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5233 states, 4262 states have (on average 1.616142656030033) internal successors, (6888), 4269 states have internal predecessors, (6888), 951 states have call successors, (951), 15 states have call predecessors, (951), 19 states have return successors, (1068), 950 states have call predecessors, (1068), 950 states have call successors, (1068) [2024-11-11 20:39:06,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5233 states to 5233 states and 8907 transitions. [2024-11-11 20:39:06,100 INFO L78 Accepts]: Start accepts. Automaton has 5233 states and 8907 transitions. Word has length 110 [2024-11-11 20:39:06,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:06,101 INFO L471 AbstractCegarLoop]: Abstraction has 5233 states and 8907 transitions. [2024-11-11 20:39:06,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 3 states have internal predecessors, (75), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 5233 states and 8907 transitions. [2024-11-11 20:39:06,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-11 20:39:06,113 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:06,114 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] [2024-11-11 20:39:06,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-11 20:39:06,114 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:06,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:06,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1675034485, now seen corresponding path program 1 times [2024-11-11 20:39:06,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:06,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603785521] [2024-11-11 20:39:06,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:06,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:06,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:06,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:06,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:06,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:06,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:06,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-11 20:39:06,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-11 20:39:06,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-11 20:39:06,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-11 20:39:06,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:06,211 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:06,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:06,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603785521] [2024-11-11 20:39:06,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603785521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:06,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:06,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:06,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75031883] [2024-11-11 20:39:06,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:06,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:06,213 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:06,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:06,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:06,213 INFO L87 Difference]: Start difference. First operand 5233 states and 8907 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:07,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:07,138 INFO L93 Difference]: Finished difference Result 12955 states and 22524 transitions. [2024-11-11 20:39:07,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:07,139 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 111 [2024-11-11 20:39:07,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:07,214 INFO L225 Difference]: With dead ends: 12955 [2024-11-11 20:39:07,214 INFO L226 Difference]: Without dead ends: 8781 [2024-11-11 20:39:07,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:07,235 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 652 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:07,235 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 648 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:39:07,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8781 states. [2024-11-11 20:39:07,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8781 to 8721. [2024-11-11 20:39:07,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8721 states, 7144 states have (on average 1.6128219484882418) internal successors, (11522), 7151 states have internal predecessors, (11522), 1557 states have call successors, (1557), 15 states have call predecessors, (1557), 19 states have return successors, (1752), 1556 states have call predecessors, (1752), 1556 states have call successors, (1752) [2024-11-11 20:39:07,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8721 states to 8721 states and 14831 transitions. [2024-11-11 20:39:07,747 INFO L78 Accepts]: Start accepts. Automaton has 8721 states and 14831 transitions. Word has length 111 [2024-11-11 20:39:07,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:07,747 INFO L471 AbstractCegarLoop]: Abstraction has 8721 states and 14831 transitions. [2024-11-11 20:39:07,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:07,748 INFO L276 IsEmpty]: Start isEmpty. Operand 8721 states and 14831 transitions. [2024-11-11 20:39:07,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-11 20:39:07,765 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:07,765 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] [2024-11-11 20:39:07,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-11 20:39:07,765 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:07,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:07,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1253521690, now seen corresponding path program 1 times [2024-11-11 20:39:07,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:07,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1510099194] [2024-11-11 20:39:07,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:07,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:07,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:07,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:07,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:07,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:07,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-11 20:39:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-11 20:39:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-11 20:39:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-11 20:39:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:07,877 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:07,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:07,877 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1510099194] [2024-11-11 20:39:07,877 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1510099194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:07,878 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:07,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560757123] [2024-11-11 20:39:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:07,879 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:07,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:07,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:07,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:07,880 INFO L87 Difference]: Start difference. First operand 8721 states and 14831 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:08,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:08,879 INFO L93 Difference]: Finished difference Result 22614 states and 39230 transitions. [2024-11-11 20:39:08,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:08,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 112 [2024-11-11 20:39:08,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:08,961 INFO L225 Difference]: With dead ends: 22614 [2024-11-11 20:39:08,961 INFO L226 Difference]: Without dead ends: 15374 [2024-11-11 20:39:08,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:08,995 INFO L435 NwaCegarLoop]: 188 mSDtfsCounter, 650 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 1016 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 205 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:08,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 702 Invalid, 1016 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [205 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-11 20:39:09,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15374 states. [2024-11-11 20:39:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15374 to 15314. [2024-11-11 20:39:09,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15314 states, 12534 states have (on average 1.6026807084729535) internal successors, (20088), 12541 states have internal predecessors, (20088), 2760 states have call successors, (2760), 15 states have call predecessors, (2760), 19 states have return successors, (3099), 2759 states have call predecessors, (3099), 2759 states have call successors, (3099) [2024-11-11 20:39:09,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15314 states to 15314 states and 25947 transitions. [2024-11-11 20:39:09,771 INFO L78 Accepts]: Start accepts. Automaton has 15314 states and 25947 transitions. Word has length 112 [2024-11-11 20:39:09,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:09,774 INFO L471 AbstractCegarLoop]: Abstraction has 15314 states and 25947 transitions. [2024-11-11 20:39:09,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:09,775 INFO L276 IsEmpty]: Start isEmpty. Operand 15314 states and 25947 transitions. [2024-11-11 20:39:09,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-11-11 20:39:09,798 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:09,798 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] [2024-11-11 20:39:09,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-11 20:39:09,798 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:09,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:09,799 INFO L85 PathProgramCache]: Analyzing trace with hash -208311830, now seen corresponding path program 1 times [2024-11-11 20:39:09,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:09,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243262749] [2024-11-11 20:39:09,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:09,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:09,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,870 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:09,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:09,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:09,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:09,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-11-11 20:39:09,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-11-11 20:39:09,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-11 20:39:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-11 20:39:09,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:09,910 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:09,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:09,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [243262749] [2024-11-11 20:39:09,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [243262749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:09,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:09,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:09,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657976587] [2024-11-11 20:39:09,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:09,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:09,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:09,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:09,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:09,913 INFO L87 Difference]: Start difference. First operand 15314 states and 25947 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:11,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:11,265 INFO L93 Difference]: Finished difference Result 40570 states and 70213 transitions. [2024-11-11 20:39:11,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:11,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 113 [2024-11-11 20:39:11,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:11,490 INFO L225 Difference]: With dead ends: 40570 [2024-11-11 20:39:11,490 INFO L226 Difference]: Without dead ends: 27344 [2024-11-11 20:39:11,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:11,526 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 648 mSDsluCounter, 478 mSDsCounter, 0 mSdLazyCounter, 795 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 795 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:11,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 648 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 795 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-11 20:39:11,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27344 states. [2024-11-11 20:39:12,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27344 to 27284. [2024-11-11 20:39:12,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27284 states, 22465 states have (on average 1.5978633429779656) internal successors, (35896), 22472 states have internal predecessors, (35896), 4799 states have call successors, (4799), 15 states have call predecessors, (4799), 19 states have return successors, (5412), 4798 states have call predecessors, (5412), 4798 states have call successors, (5412) [2024-11-11 20:39:12,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27284 states to 27284 states and 46107 transitions. [2024-11-11 20:39:12,702 INFO L78 Accepts]: Start accepts. Automaton has 27284 states and 46107 transitions. Word has length 113 [2024-11-11 20:39:12,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:12,703 INFO L471 AbstractCegarLoop]: Abstraction has 27284 states and 46107 transitions. [2024-11-11 20:39:12,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 3 states have internal predecessors, (78), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:12,703 INFO L276 IsEmpty]: Start isEmpty. Operand 27284 states and 46107 transitions. [2024-11-11 20:39:12,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-11-11 20:39:12,729 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:12,729 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] [2024-11-11 20:39:12,729 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-11 20:39:12,729 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:12,730 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:12,730 INFO L85 PathProgramCache]: Analyzing trace with hash 1420893432, now seen corresponding path program 1 times [2024-11-11 20:39:12,730 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:12,730 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498665376] [2024-11-11 20:39:12,730 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:12,731 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:12,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:12,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:12,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:12,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:12,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:12,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:12,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:12,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-11 20:39:13,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-11 20:39:13,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-11 20:39:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-11 20:39:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:13,010 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:13,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:13,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498665376] [2024-11-11 20:39:13,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498665376] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:13,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:13,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:13,012 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781443982] [2024-11-11 20:39:13,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:13,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:13,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:13,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:13,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:13,014 INFO L87 Difference]: Start difference. First operand 27284 states and 46107 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:15,122 INFO L93 Difference]: Finished difference Result 74357 states and 127812 transitions. [2024-11-11 20:39:15,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:15,123 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 114 [2024-11-11 20:39:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:15,425 INFO L225 Difference]: With dead ends: 74357 [2024-11-11 20:39:15,426 INFO L226 Difference]: Without dead ends: 49893 [2024-11-11 20:39:15,519 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:15,520 INFO L435 NwaCegarLoop]: 172 mSDtfsCounter, 646 mSDsluCounter, 484 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 999 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:15,520 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 656 Invalid, 999 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-11 20:39:15,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49893 states. [2024-11-11 20:39:17,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49893 to 49833. [2024-11-11 20:39:17,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49833 states, 41299 states have (on average 1.5917334560158842) internal successors, (65737), 41306 states have internal predecessors, (65737), 8514 states have call successors, (8514), 15 states have call predecessors, (8514), 19 states have return successors, (9659), 8513 states have call predecessors, (9659), 8513 states have call successors, (9659) [2024-11-11 20:39:17,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49833 states to 49833 states and 83910 transitions. [2024-11-11 20:39:17,980 INFO L78 Accepts]: Start accepts. Automaton has 49833 states and 83910 transitions. Word has length 114 [2024-11-11 20:39:17,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:17,981 INFO L471 AbstractCegarLoop]: Abstraction has 49833 states and 83910 transitions. [2024-11-11 20:39:17,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 3 states have internal predecessors, (79), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:17,981 INFO L276 IsEmpty]: Start isEmpty. Operand 49833 states and 83910 transitions. [2024-11-11 20:39:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-11 20:39:18,006 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:18,006 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] [2024-11-11 20:39:18,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-11 20:39:18,006 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:18,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:18,006 INFO L85 PathProgramCache]: Analyzing trace with hash 1196910922, now seen corresponding path program 1 times [2024-11-11 20:39:18,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:18,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725354422] [2024-11-11 20:39:18,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:18,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:18,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:18,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:18,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-11 20:39:18,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-11 20:39:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-11 20:39:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-11 20:39:18,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:18,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:18,093 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725354422] [2024-11-11 20:39:18,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725354422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:18,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:18,094 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-11 20:39:18,094 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306551313] [2024-11-11 20:39:18,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:18,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-11 20:39:18,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:18,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-11 20:39:18,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-11 20:39:18,095 INFO L87 Difference]: Start difference. First operand 49833 states and 83910 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:20,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:20,769 INFO L93 Difference]: Finished difference Result 92843 states and 159943 transitions. [2024-11-11 20:39:20,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-11 20:39:20,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 115 [2024-11-11 20:39:20,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:21,246 INFO L225 Difference]: With dead ends: 92843 [2024-11-11 20:39:21,246 INFO L226 Difference]: Without dead ends: 92737 [2024-11-11 20:39:21,305 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-11 20:39:21,306 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 641 mSDsluCounter, 500 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 201 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 655 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 1001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 201 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:21,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [655 Valid, 679 Invalid, 1001 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [201 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-11 20:39:21,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92737 states. [2024-11-11 20:39:24,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92737 to 92677. [2024-11-11 20:39:24,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92677 states, 77344 states have (on average 1.584130637153496) internal successors, (122523), 77351 states have internal predecessors, (122523), 15313 states have call successors, (15313), 15 states have call predecessors, (15313), 19 states have return successors, (17504), 15312 states have call predecessors, (17504), 15312 states have call successors, (17504) [2024-11-11 20:39:24,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92677 states to 92677 states and 155340 transitions. [2024-11-11 20:39:24,892 INFO L78 Accepts]: Start accepts. Automaton has 92677 states and 155340 transitions. Word has length 115 [2024-11-11 20:39:24,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:24,893 INFO L471 AbstractCegarLoop]: Abstraction has 92677 states and 155340 transitions. [2024-11-11 20:39:24,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (12), 5 states have call predecessors, (12), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2024-11-11 20:39:24,893 INFO L276 IsEmpty]: Start isEmpty. Operand 92677 states and 155340 transitions. [2024-11-11 20:39:24,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-11 20:39:24,914 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:24,914 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] [2024-11-11 20:39:24,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-11 20:39:24,915 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:24,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:24,916 INFO L85 PathProgramCache]: Analyzing trace with hash -216688615, now seen corresponding path program 1 times [2024-11-11 20:39:24,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:24,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063759866] [2024-11-11 20:39:24,916 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:24,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:25,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:25,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:25,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:39:25,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:39:25,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-11 20:39:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-11-11 20:39:25,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:25,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:25,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:25,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063759866] [2024-11-11 20:39:25,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063759866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:25,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:25,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-11 20:39:25,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1839574622] [2024-11-11 20:39:25,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:25,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-11 20:39:25,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:25,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-11 20:39:25,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2024-11-11 20:39:25,732 INFO L87 Difference]: Start difference. First operand 92677 states and 155340 transitions. Second operand has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 20:39:32,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:32,717 INFO L93 Difference]: Finished difference Result 184815 states and 321750 transitions. [2024-11-11 20:39:32,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-11 20:39:32,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) Word has length 116 [2024-11-11 20:39:32,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:33,641 INFO L225 Difference]: With dead ends: 184815 [2024-11-11 20:39:33,641 INFO L226 Difference]: Without dead ends: 184717 [2024-11-11 20:39:33,713 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=417, Invalid=1389, Unknown=0, NotChecked=0, Total=1806 [2024-11-11 20:39:33,714 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 2375 mSDsluCounter, 1928 mSDsCounter, 0 mSdLazyCounter, 4084 mSolverCounterSat, 624 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 2154 SdHoareTripleChecker+Invalid, 4708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 624 IncrementalHoareTripleChecker+Valid, 4084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:33,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 2154 Invalid, 4708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [624 Valid, 4084 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-11 20:39:33,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184717 states. [2024-11-11 20:39:39,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184717 to 184539. [2024-11-11 20:39:40,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184539 states, 154086 states have (on average 1.5850888464883246) internal successors, (244240), 153988 states have internal predecessors, (244240), 30409 states have call successors, (30409), 38 states have call predecessors, (30409), 43 states have return successors, (38058), 30518 states have call predecessors, (38058), 30406 states have call successors, (38058) [2024-11-11 20:39:40,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184539 states to 184539 states and 312707 transitions. [2024-11-11 20:39:40,951 INFO L78 Accepts]: Start accepts. Automaton has 184539 states and 312707 transitions. Word has length 116 [2024-11-11 20:39:40,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 20:39:40,951 INFO L471 AbstractCegarLoop]: Abstraction has 184539 states and 312707 transitions. [2024-11-11 20:39:40,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.785714285714286) internal successors, (81), 9 states have internal predecessors, (81), 5 states have call successors, (12), 6 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 5 states have call successors, (10) [2024-11-11 20:39:40,952 INFO L276 IsEmpty]: Start isEmpty. Operand 184539 states and 312707 transitions. [2024-11-11 20:39:40,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-11 20:39:40,990 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 20:39:40,990 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] [2024-11-11 20:39:40,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-11 20:39:40,990 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION === [outgoingErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 20:39:40,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 20:39:40,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1982536604, now seen corresponding path program 1 times [2024-11-11 20:39:40,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 20:39:40,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277059044] [2024-11-11 20:39:40,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 20:39:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 20:39:41,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-11 20:39:41,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-11 20:39:41,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-11 20:39:41,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-11 20:39:41,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-11 20:39:41,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-11 20:39:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-11 20:39:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-11 20:39:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-11 20:39:41,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-11 20:39:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 20:39:41,209 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-11 20:39:41,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 20:39:41,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277059044] [2024-11-11 20:39:41,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277059044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 20:39:41,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 20:39:41,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-11 20:39:41,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270282426] [2024-11-11 20:39:41,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 20:39:41,211 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-11 20:39:41,211 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 20:39:41,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-11 20:39:41,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2024-11-11 20:39:41,212 INFO L87 Difference]: Start difference. First operand 184539 states and 312707 transitions. Second operand has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) [2024-11-11 20:39:47,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 20:39:47,936 INFO L93 Difference]: Finished difference Result 185232 states and 320226 transitions. [2024-11-11 20:39:47,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-11 20:39:47,936 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.454545454545454) internal successors, (82), 6 states have internal predecessors, (82), 4 states have call successors, (12), 6 states have call predecessors, (12), 1 states have return successors, (10), 4 states have call predecessors, (10), 4 states have call successors, (10) Word has length 117 [2024-11-11 20:39:47,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 20:39:48,930 INFO L225 Difference]: With dead ends: 185232 [2024-11-11 20:39:48,930 INFO L226 Difference]: Without dead ends: 184769 [2024-11-11 20:39:49,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=337, Unknown=0, NotChecked=0, Total=462 [2024-11-11 20:39:49,011 INFO L435 NwaCegarLoop]: 161 mSDtfsCounter, 1153 mSDsluCounter, 1005 mSDsCounter, 0 mSdLazyCounter, 2094 mSolverCounterSat, 299 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1168 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 2393 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 299 IncrementalHoareTripleChecker+Valid, 2094 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-11 20:39:49,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1168 Valid, 1166 Invalid, 2393 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [299 Valid, 2094 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-11 20:39:49,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184769 states.